Rights accessRestricted access - publisher's policy
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.
CitationRosas, D.; Castro, J.; Montero, L. Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem. "Computational optimization and applications", Novembre 2009, vol. 44, núm. 2, p. 289-313.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com