• Home
  1. Home
  2. An efficient method to compute traffic assignment problems with elastic demands
Report
OA Policy
English

An efficient method to compute traffic assignment problems with elastic demands

Contributors

Babonneau, Frédéric; Vial, Jean-Philippe

Collection

  • Cahiers de recherche; 2006.06

Publication date

2006

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

UNIGE affiliation entities

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

Identifiers

  • PID : unige:5744
633views
1262downloads

Technical informations

Creation

15/04/2010 12:19:41

First validation

15/04/2010 12:19:41

Update

14/03/2023 15:26:25

Status update

14/03/2023 15:26:24

Last indexation

29/10/2024 14:22:03
All rights reserved by Archive ouverte UNIGE and the University of Geneva
OpenAIRE Indexed & Validated