A maximum entropy-least squares estimator for elastic origin¨Cdestination trip matrix estimation
详细信息    查看全文
文摘
In transportation subnetwork¨Csupernetwork analysis, it is well known that the origin¨Cdestination (O¨CD) flow table of a subnetwork is not only determined by trip generation and distribution, but also a result from traffic routing and diversion, due to the existence of internal¨Cexternal, external¨Cinternal and external¨Cexternal flows. This result indicates the variable nature of subnetwork O¨CD flows. This paper discusses an elastic O¨CD flow table estimation problem for subnetwork analysis. The underlying assumption is that each cell of the subnetwork O¨CD flow table contains an elastic demand function rather than a fixed demand rate and the demand function can capture all traffic diversion effect under various network changes. We propose a combined maximum entropy-least squares estimator, by which O¨CD flows are distributed over the subnetwork in terms of the maximum entropy principle, while demand function parameters are estimated for achieving the least sum of squared estimation errors. While the estimator is powered by the classic convex combination algorithm, computational difficulties emerge within the algorithm implementation until we incorporate partial optimality conditions and a column generation procedure into the algorithmic framework. Numerical results from applying the combined estimator to a couple of subnetwork examples show that an elastic O¨CD flow table, when used as input for subnetwork flow evaluations, reflects network flow changes significantly better than its fixed counterpart.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700