Computational Optimization and Applications

, 44:289

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

Authors

  • Dulce Rosas
    • CENITUniversitat Politècnica de Catalunya
    • Dept. of Statistics and Operations ResearchUniversitat Politècnica de Catalunya
  • Lídia Montero
    • Dept. of Statistics and Operations ResearchUniversitat Politècnica de Catalunya
Article

DOI: 10.1007/s10589-007-9153-6

Cite this article as:
Rosas, D., Castro, J. & Montero, L. Comput Optim Appl (2009) 44: 289. doi:10.1007/s10589-007-9153-6

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 algorithm is solved through the analytic center cutting plane method. Four variants are considered for solving the master problem. The third and fourth ones, which heuristically compute an appropriate initial point, provided the best results. The computational experience reported in the solution of real large-scale diagonal and difficult asymmetric problems—including a subset of the transportation networks of Madrid and Barcelona—show the effectiveness of the approach.

Keywords

Traffic assignment problemVariational inequalitiesSimplicial decompositionAnalytic center cutting plane method

Copyright information

© Springer Science+Business Media, LLC 2007