具有不完全出行观测值的递归路径选择模型的估计
Estimation of Recursive Route Choice Models with Incomplete Trip Observations
摘要:
本文研究了在出行观测数据不完全的情况下,在观测中存在未连接的链接(或节点)。处理这个问题的直接方法将是棘手的,因为枚举真实网络中未连接的链路(或节点)之间的所有路径通常是不可能的。我们利用期望最大化(EM)的方法,允许处理丢失的数据问题,交替执行两个步骤的采样缺失的部分在观察和解决最大似然估计问题。此外,观察到EM方法将是昂贵的,我们提出了一种新的估计方法的基础上的想法,可以通过求解线性方程组精确计算的选择概率的不连接的链接的意见。我们进一步设计了一个新的算法,称为分解合成(DC),这有助于减少要解决的线性方程组的数量,并加快估计。我们比较了我们提出的算法与一些标准基线使用一个数据集从一个真实的网络,并表明DC算法优于其他方法在恢复丢失的信息的意见。我们的方法与大多数的递归路径选择模型在文献中提出,包括递归logit,嵌套递归logit,或折扣递归模型。
英文摘要:
This work concerns the estimation of recursive route choice models in the situation that the trip observations are incomplete, i.e., there are unconnected links (or nodes) in the observations. A direct approach to handle this issue would be intractable because enumerating all paths between unconnected links (or nodes) in a real network is typically not possible. We exploit an expectation-maximization (EM) method that allows to deal with the missing-data issue by alternatively performing two steps of sampling the missing segments in the observations and solving maximum likelihood estimation problems. Moreover, observing that the EM method would be expensive, we propose a new estimation method based on the idea that the choice probabilities of unconnected link observations can be exactly computed by solving systems of linear equations. We further design a new algorithm, called as decomposition-composition (DC), that helps reduce the number of systems of linear equations to be solved and speed up the estimation. We compare our proposed algorithms with some standard baselines using a dataset from a real network and show that the DC algorithm outperforms the other approaches in recovering missing information in the observations. Our methods work with most of the recursive route choice models proposed in the literature, including the recursive logit, nested recursive logit, or discounted recursive models.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。