Bilevel O/D Matrix Adjustment Formulation Using High Convergence Assignment Methods

Chapter
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 262)

Abstract

The Frank-Wolfe algorithm has been for years the most widely used method for solving the traffic assignment problem (TAP). In the last decade there have been new proposals for the resolution of the TAP. It has been shown that these algorithms are feasible for large scale problems with very high convergence, much higher than the achieved by the Frank-Wolfe algorithm. The O/D matrix adjustment problem based upon traffic counts can be formulated as a bilevel optimization problem in which the TAP is the lower level. The convergence of the TAP and the computational cost can be critical because the number of TAPs to be solved during each step of the process is very high. This paper exploits the possibilities offered by new TAP methods in the O/D matrix adjustment problem. Numerical examples on medium-sized networks using the new proposed methods are presented.

Keywords

O/D matrix adjustment Traffic assignment problem Origin based algorithm 

Notes

Acknowledgments

This research was funded in part by both the Spanish Ministry of Science (National Plan Programs TRA2012-36930, FPI BES-2009-025110) and the Spanish Ministry of Public Works (P63/08). One of the authors, L.M. Romero, acknowledges the support of the grant PTQ-11-04952 from the Spanish Ministry of Science through the INNCORPORA-PTQ Programme.

References

  1. 1.
    Bar-Gera, H.: Traffic assignment by paired alternative segments. Transp. Res. 44B, 1022–1046 (2010)CrossRefGoogle Scholar
  2. 2.
    Bar-Gera, H.: Transportation Networks Test Problems. http://www.bgu.ac.il/~bargera/tntp/
  3. 3.
    Bell, M.G.H., Iida, Y.: Transportation Network Analysis. Wiley, Chichester (1997)CrossRefGoogle Scholar
  4. 4.
    Chen, Y.: Bilevel programming problems: analysis, algorithms and applications. PhD Thesis, Publication 984. Centre de Recherche sur les Transports, Université de Montréal, Montréal, Canada (1994)Google Scholar
  5. 5.
    Denault, L.: Étude de deux méthods d’adjustement de matrices origine-destination à partir des flots des véhicules observés (in French). Report CRT-991, Mémoire D’étudiant. Centre de recherche sur les transports (CRT), Université de Montréal, Montréal, Québec, Canada (1994)Google Scholar
  6. 6.
    Dial, R.: A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration. Transp. Res. 40B, 917–936 (2006)CrossRefGoogle Scholar
  7. 7.
    Doblas, J., Benitez, F.G.: An approach to estimating and updating origin–destination matrices based upon traffic counts preserving the prior structure of a survey matrix. Transp. Res. 39B, 565–591 (2005)CrossRefGoogle Scholar
  8. 8.
    Drissi-Kaitouni, O., Lundgren, J.: Bilevel origin–destination matrix estimation using a descent approach. Technical Report lith-matr92-49. Department of Mathematics, Institute of Technology, Linkoping, Sweden (1992)Google Scholar
  9. 9.
    Fisk, C.S.: On combining maximum entropy trip matrix estimation with user optimal assignment. Transp. Res. 22B, 66–79 (1988)MathSciNetGoogle Scholar
  10. 10.
    Florian, M., Constantin, I., Florian, D.: A new look at projected gradient method for equilibrium assignment. Transp. Res. Rec. 2090, 10–16 (2009)CrossRefGoogle Scholar
  11. 11.
    Lundgren, J.T., Peterson, A.: A heuristic for the bilevel origin-destination matrix estimation problem. Transp. Res. 42B, 339–354 (2008)CrossRefGoogle Scholar
  12. 12.
    Spiess, H.: A descent based approach for the OD matrix adjustment problem. Publication 693, Centre de recherche sur les transports, Université de Montréal, Montréal, Canada (1990)Google Scholar
  13. 13.
    Tobin, R.L., Friesz, T.L.: Sensitivity analysis for equilibrium network flows. Transp. Sci. 22, 242–250 (1988)CrossRefMATHMathSciNetGoogle Scholar
  14. 14.
    Yang, H., Sasaki, T., Iida, Y., Asakura, Y.: Estimation of origin-destination matrices from link traffic counts on congested networks. Transp. Res. 26B, 417–434 (1992)CrossRefGoogle Scholar
  15. 15.
    Yang, H.: Heuristic algorithms for the bi-level origin-destination matrix estimation problem. Transp. Res. 29B, 1–12 (1995)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Transportation EngineeringUniversity of SevillaSevillaSpain
  2. 2.Transportation EngineeringAICIASevillaSpain

Personalised recommendations