Optimization Online


Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem

Dulce Rosas (dulce***at***eio.upc.es)
Jordi Castro (jcastro***at***eio.upc.es)
Lidia Montero (lmontero***at***eio.upc.es)

Abstract: The purpose of the traffic assignment problem is to obtain a traffic flow pattern given a set of origin-destination travel demands and flow dependent link performance functions of a road network. In the general case, the traffic assignment problem can be formulated as a variational inequality, and several algorithms have been devised for its efficient solution. In this work we propose a new approach that combines two existing procedures: the master problem of a simplicial decomposition framework is solved through the analytic center cutting plane method. Three variants are considered for solving the master problem. The third one, which heuristically computes an appropriate initial point, has shown to outperform alternative solution methods. Some computational experience is reported in the solution of real large-scale problems, including a subset of the transportation networks of Madrid and Barcelona.

Keywords: Traffic assignment problem, variational inequalities, simplicial decomposition, analytic center cutting plane method

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

Category 2: Complementarity and Variational Inequalities

Citation: Report DR2002-04 Statistics and Operations Research Dpt. Universitat Politecnica de Catalunya April 2002

Download: [Compressed Postscript]

Entry Submitted: 05/23/2002
Entry Accepted: 05/23/2002
Entry Last Modified: 05/23/2002

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