Sciweavers

Share
TRANSCI
2008

An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands

9 years 9 months ago
An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands
The traffic assignment problem with elastic demands can be formulated as an optimization problem, whose objective is 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 instances with different congestion functions (linear with capacities on the arc and BPR) 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 problem, Elastic demand, ACCPM.
Frédéric Babonneau, Jean-Philippe Vi
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2008
Where TRANSCI
Authors Frédéric Babonneau, Jean-Philippe Vial
Comments (0)
books