To access the full text documents, please follow this link: http://hdl.handle.net/2117/6049

Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
Rosas Díaz, Dulce María; Castro Pérez, Jordi; Montero Mercadé, Lídia
Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa
The purpose of the traffic assignment problem is to obtain a traffic flowpattern given a set of origin-destination travel demands and flow dependent link performance functions of a road network. In the general case, the traffic assignmentproblem can be formulated as a variational inequality, and several algorithms havebeen devised for its efficient solution. In this work we propose a new approach thatcombines two existing procedures: the master problem of a simplicial decompositionalgorithm is solved through the analytic center cutting plane method. Four variantsare considered for solving the master problem. The third and fourth ones, whichheuristically 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.
2012-05-10
Restricted access - publisher's policy
Article
         

Show full item record

Related documents

Other documents of the same author

Torné Santos, Josep Maria; Rosas Díaz, Dulce María; Soriguera Martí, Francesc
Soriguera Martí, Francesc; Rosas Díaz, Dulce María; Abeijón Monjas, David; Thorson Bofarull, Leif; Robusté Antón, Francesc
Nou Castell, Ramon; Guitart Fernández, Jordi; Beltran Querol, Vicenç; Carrera Pérez, David; Montero Mercadé, Lídia; Torres Viñals, Jordi; Ayguadé Parra, Eduard
 

Coordination

 

Supporters