DOI: 10.1016/J.TRB.2016.08.009
关键词: Identification (information) 、 Algorithmic efficiency 、 Consistency (database systems) 、 Algorithm 、 Set (abstract data type) 、 Path (graph theory) 、 Convergence (routing) 、 Mathematical optimization 、 Structure (category theory) 、 Computer science 、 Assignment 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.