New insights and improvements of using paired alternative segments for traffic assignment

作者: Jun Xie , Chi Xie

DOI: 10.1016/J.TRB.2016.08.009

关键词: Identification (information)Algorithmic efficiencyConsistency (database systems)AlgorithmSet (abstract data type)Path (graph theory)Convergence (routing)Mathematical optimizationStructure (category theory)Computer scienceAssignment problem

摘要: Abstract The recent literature observes that the development of advanced algorithms for traffic assignment problem (TAP) heavily relies on proper use some specific topological structures. This paper focuses discussing a particular structure named paired alternative segment (PAS), which consists two path segments sharing same starting and ending nodes but no other common nodes. We first present conditions establish an equivalency relationship between user equilibrium (UE) flows PAS Starting from method by (TAPAS), we then examine utilization PASs TAP explore algorithmic implementation issues, leads to birth improved TAPAS procedure (termed iTAPAS in this paper). Compared original TAPAS, enhances efficiency aspects: (1) more effective identification is used; (2) each set as being associated with only one origin UE-finding process. Some analytical results based new are presented justify convergence iTAPAS. A simplified post-process also achieve proportionality Numerical obtained applying several large networks reveal nearly times faster than achieving highly precise link flow solutions while it practically identical finding stable meet consistency proportionality.

参考文章(31)
Wei T. Tsai, R. Jayakrishnan, Joseph N. Prashker, Subodh Rajadhyaksha, A FASTER PATH-BASED ALGORITHM FOR TRAFFIC ASSIGNMENT Transportation Research Record. ,(1994)
H Bar-Gera, D Boyce, ROUTE FLOW ENTROPY MAXIMIZATION IN ORIGIN-BASED TRAFFIC ASSIGNMENT 14th International Symposium on Transportation and Traffic TheoryTransportation Research Institute. ,(1999)
Srinivas Peeta, Amit Kumar, An Improved Social Pressure Algorithm for Static Deterministic User Equilibrium Traffic Assignment Problem Transportation Research Board 90th Annual MeetingTransportation Research Board. ,(2011)
Amit Kumar, Srinivas Peeta, Yu (Marco) Nie, Update Strategies for Restricted Master Problems for User Equilibrium Traffic Assignment Problem Transportation Research Record. ,vol. 2283, pp. 131- 142 ,(2012) , 10.3141/2283-14
Hillel Bar-Gera, David Boyce, Yu (Marco) Nie, User-equilibrium route flows and the condition of proportionality Transportation Research Part B-methodological. ,vol. 46, pp. 440- 462 ,(2012) , 10.1016/J.TRB.2011.10.010
Masao Fukushima, A modified Frank-Wolfe algorithm for solving the traffic assignment problem Transportation Research Part B-methodological. ,vol. 18, pp. 169- 177 ,(1984) , 10.1016/0191-2615(84)90029-8
Shin-ichi Inoue, Takuya Maruyama, Computational Experience on Advanced Algorithms for User Equilibrium Traffic Assignment Problem and Its Convergence Error Procedia - Social and Behavioral Sciences. ,vol. 43, pp. 445- 456 ,(2012) , 10.1016/J.SBSPRO.2012.04.118
Yu (Marco) Nie, A class of bush-based algorithms for the traffic assignment problem Transportation Research Part B-methodological. ,vol. 44, pp. 73- 89 ,(2010) , 10.1016/J.TRB.2009.06.005
Guido Gentile, None, Local User Cost Equilibrium: a bush-based algorithm for traffic assignment Transportmetrica. ,vol. 10, pp. 15- 54 ,(2014) , 10.1080/18128602.2012.691911