UNIGE document Report
previous document  unige:5744  next document
add to browser collection
Title

An efficient method to compute traffic assignment problems with elastic demands

Authors
Year 2006
Collection Cahiers de recherche; 2006.06
Abstract 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 problemElastic demandACCPM
Full text
Structures
Citation
(ISO format)
BABONNEAU, Frédéric, VIAL, Jean-Philippe. An efficient method to compute traffic assignment problems with elastic demands. 2006 https://archive-ouverte.unige.ch/unige:5744

240 hits

530 downloads

Update

Deposited on : 2010-04-15

Export document
Format :
Citation style :