This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Download to citation manager Google Scholar Articles by Babonneau, F. Articles by Vial, J.-P.

An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands

Centro de Modelamiento Matemático, University of Chile, Santiago, Chile
ORDECSYS, CH-1224 Chêne-Bougeries, Switzerland, and University of Geneva, CH-1211 Geneva 4, Switzerland
fbabonneau{at}gmail.com
jean-philippe.vial{at}hec.unige.ch

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.

Key Words: traffic assignment; elastic demand; analytic center cutting plane method
History: Received: July 2006; revised: March 2007; accepted: June 2007.