en
Report
Open access
English

An efficient method to compute traffic assignment problems with elastic demands

Collection
  • Cahiers de recherche; 2006.06
Publication date2006
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 problem
  • Elastic demand
  • ACCPM
Citation (ISO format)
BABONNEAU, Frédéric, VIAL, Jean-Philippe. An efficient method to compute traffic assignment problems with elastic demands. 2006
Main files (1)
Report
accessLevelPublic
Identifiers
  • PID : unige:5744
543views
732downloads

Technical informations

Creation04/15/2010 12:19:41 PM
First validation04/15/2010 12:19:41 PM
Update time03/14/2023 3:26:25 PM
Status update03/14/2023 3:26:24 PM
Last indexation01/15/2024 7:42:44 PM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack