An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands

Frédéric Babonneau () and Jean-Philippe Vial ()
Additional contact information
Frédéric Babonneau: Centro de Modelamiento Matemático, University of Chile, Santiago, Chile
Jean-Philippe Vial: ORDECSYS, CH-1224 Chêne-Bougeries, Switzerland, and University of Geneva, CH-1211 Geneva 4, Switzerland

Transportation Science, 2008, vol. 42, issue 2, 249-260

Abstract: The traffic assignment problem (TAP) with elastic demands can be formulated as an optimization problem, the objective of which is the sum of a congestion function and a disutility function. We propose to use a variant of the analytic center cutting plane method to solve this problem. We test the method on TAP instances with the Bureau of Public Roads congestion function and different demand functions (constant elasticity and linear). The results of the numerical experiments show that it is possible to solve large instances with high accuracy.

Keywords: traffic assignment; elastic demand; analytic center cutting plane method (search for similar items in EconPapers)
Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1070.0208 (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:42:y:2008:i:2:p:249-260

Access Statistics for this article

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