Primal Method for Determining the Most Likely Route Flows in Large Road Networks

Hillel Bar-Gera ()
Additional contact information
Hillel Bar-Gera: Department of Industrial Engineering and Management, Ben-Gurion University, P.O.B. 653, Be’er-Sheva 84105, Israel

Transportation Science, 2006, vol. 40, issue 3, 269-286

Abstract: This paper presents a method to identify the set of routes and their flows in a user-equilibrium traffic assignment solution. We present a general consistency condition that is satisfied by any set of minimum-cost routes, and show how it can be used in choosing a set of routes that is likely to be similar to the set of user-equilibrium routes. The proposed consistency condition is also essential for finding the entropy-maximizing route flows solution, which may be regarded as the most likely one. An efficient method for finding the entropy-maximizing solution is presented. Numerical results on several networks, including one of large scale, demonstrate the effectiveness of the proposed method. In most cases the method achieves a duality gap of practically zero in a short computation time.

Keywords: traffic assignment; unique route flows; entropy maximization; consistent routes (search for similar items in EconPapers)
Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (27)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1050.0142 (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:40:y:2006:i:3:p:269-286

Access Statistics for this article

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