Optimization Online


An efficient method to compute traffic assignment problems with elastic demands

Frédéric Babonneau (fbabonneau***at***gmail.com)
Jean-Philippe Vial (Jean-Philippe.Vial***at***hec.unige.ch)

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

Category 1: Applications -- OR and Management Sciences (Transportation )

Category 2: Convex and Nonsmooth Optimization (Convex Optimization )


Download: [PDF]

Entry Submitted: 07/26/2006
Entry Accepted: 07/26/2006
Entry Last Modified: 07/26/2006

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society