Adaptation of Network Simplex for the Traffic Assignment Problem

Hong Zheng ()
Additional contact information
Hong Zheng: Department of Civil Engineering and Engineering Mechanics, University of Arizona, Tucson, Arizona 85721

Transportation Science, 2015, vol. 49, issue 3, 543-558

Abstract: This paper presents an algorithm for the traffic assignment problem. The algorithm is characterized by the “origin-based” feature, which solves the user equilibrium flow that is restricted to a single-origin network and loops among origins to produce the all-origin to all-destination equilibrium flow. In contrast to most prior traffic assignment problem algorithms, our method maintains a general spanning tree rooted at each origin, where in-tree arcs can be directed either away from or toward the root. Leveraging an optimality condition in the cycle space, the algorithm uses the network simplex method to identify and cancel a set of negative cost cycles. Numerical experiments demonstrate that the algorithm can generate highly precise solutions with fast convergence on large-scale networks.

Keywords: traffic assignment; user equilibrium; network simplex; spanning tree; cycles (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.2014.0574 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:49:y:2015:i:3:p:543-558

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().