IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v40y2006i5p351-367.html
   My bibliography  Save this article

Solving a non-convex combined travel forecasting model by the method of successive averages with constant step sizes

Author

Listed:
  • Bar-Gera, Hillel
  • Boyce, David

Abstract

The method of successive averages is often used in iterative algorithms for solving various mathematical problems, and travel forecasting models in particular. In each iteration of these algorithms the current solution is averaged with an alternative solution generated by the algorithm. If the problem has an equivalent convex optimization formulation with a computable objective function, a line search can be used to determine the weight applied to the alternative solution, referred to as the step size. In the absence of a convex optimization formulation, the typical approach is to set the step size according to a predetermined sequence that is decreasing towards zero, such as 1/k where k is the iteration index. In this paper, we examine the use of a constant step size in the method of successive averages. A theoretical derivation shows that if the alternative solution generated by the algorithm is a linear function of the current solution, then using a constant step size is advantageous and substantially superior to using a sequence of decreasing step sizes. We conjecture that similar results may be expected in nonlinear differentiable problems as well. Numerical results are presented for a travel forecasting model that combines user-equilibrium route choice with an origin-destination-mode (ODM) choice model. The proposed algorithm is based on origin-based assignment, in conjunction with successive averaging of constant step sizes for the differentiable ODM model. The results show that a properly chosen constant step size leads to excellent convergence for both convex and non-convex models. A general strategy for choosing step sizes without a-priori knowledge is presented as well.

Suggested Citation

  • Bar-Gera, Hillel & Boyce, David, 2006. "Solving a non-convex combined travel forecasting model by the method of successive averages with constant step sizes," Transportation Research Part B: Methodological, Elsevier, vol. 40(5), pages 351-367, June.
  • Handle: RePEc:eee:transb:v:40:y:2006:i:5:p:351-367
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191-2615(05)00070-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Warren B. Powell & Yosef Sheffi, 1982. "The Convergence of Equilibrium Algorithms with Predetermined Step Sizes," Transportation Science, INFORMS, vol. 16(1), pages 45-55, February.
    2. Bar-Gera, Hillel & Boyce, David, 2003. "Origin-based algorithms for combined travel forecasting models," Transportation Research Part B: Methodological, Elsevier, vol. 37(5), pages 405-422, June.
    3. David Boyce & Hillel Bar–Gera, 2003. "Validation of Multiclass Urban Travel Forecasting Models Combining Origin–Destination, Mode, and Route Choices," Journal of Regional Science, Wiley Blackwell, vol. 43(3), pages 517-540, August.
    4. Hillel Bar-Gera, 2002. "Origin-Based Algorithm for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 36(4), pages 398-417, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhou, Zhong & Chen, Anthony & Wong, S.C., 2009. "Alternative formulations of a combined trip generation, trip distribution, modal split, and trip assignment model," European Journal of Operational Research, Elsevier, vol. 198(1), pages 129-138, October.
    2. Liu, Ronghui & Smith, Mike, 2015. "Route choice and traffic signal control: A study of the stability and instability of a new dynamical model of route choice and traffic signal control," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 123-145.
    3. Xu, Meng & Chen, Anthony & Gao, Ziyou, 2008. "An improved origin-based algorithm for solving the combined distribution and assignment problem," European Journal of Operational Research, Elsevier, vol. 188(2), pages 354-369, July.
    4. Smith, Mike & Mounce, Richard, 2011. "A splitting rate model of traffic re-routeing and traffic control," Transportation Research Part B: Methodological, Elsevier, vol. 45(9), pages 1389-1409.
    5. Chow, Joseph Y.J. & Recker, Will W., 2012. "Inverse optimization with endogenous arrival time constraints to calibrate the household activity pattern problem," Transportation Research Part B: Methodological, Elsevier, vol. 46(3), pages 463-479.
    6. Du, Jie & Wong, S.C. & Shu, Chi-Wang & Zhang, Mengping, 2015. "Reformulating the Hoogendoorn–Bovy predictive dynamic user-optimal model in continuum space with anisotropic condition," Transportation Research Part B: Methodological, Elsevier, vol. 79(C), pages 189-217.
    7. Cantarella, Giulio Erberto & Cartenì, Armando & de Luca, Stefano, 2015. "Stochastic equilibrium assignment with variable demand: Theoretical and implementation issues," European Journal of Operational Research, Elsevier, vol. 241(2), pages 330-347.
    8. Du, Jie & Wong, S.C. & Shu, Chi-Wang & Xiong, Tao & Zhang, Mengping & Choi, Keechoo, 2013. "Revisiting Jiang’s dynamic continuum model for urban cities," Transportation Research Part B: Methodological, Elsevier, vol. 56(C), pages 96-119.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ho, H.W. & Wong, S.C. & Loo, Becky P.Y., 2006. "Combined distribution and assignment model for a continuum traffic equilibrium problem with multiple user classes," Transportation Research Part B: Methodological, Elsevier, vol. 40(8), pages 633-650, September.
    2. Liu, Zhiyuan & Chen, Xinyuan & Hu, Jintao & Wang, Shuaian & Zhang, Kai & Zhang, Honggang, 2023. "An alternating direction method of multipliers for solving user equilibrium problem," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1072-1084.
    3. Taesung Hwang, 2021. "Assignment of Freight Truck Shipment on the U.S. Highway Network," Sustainability, MDPI, vol. 13(11), pages 1-11, June.
    4. Hironori Kato & Yuichiro Kaneko & Masashi Inoue, 2010. "Comparative analysis of transit assignment: evidence from urban railway system in the Tokyo Metropolitan Area," Transportation, Springer, vol. 37(5), pages 775-799, September.
    5. Maria Mitradjieva & Per Olov Lindberg, 2013. "The Stiff Is Moving---Conjugate Direction Frank-Wolfe Methods with Applications to Traffic Assignment ," Transportation Science, INFORMS, vol. 47(2), pages 280-293, May.
    6. Xu, Meng & Chen, Anthony & Gao, Ziyou, 2008. "An improved origin-based algorithm for solving the combined distribution and assignment problem," European Journal of Operational Research, Elsevier, vol. 188(2), pages 354-369, July.
    7. Smith, Mike & Mounce, Richard, 2011. "A splitting rate model of traffic re-routeing and traffic control," Transportation Research Part B: Methodological, Elsevier, vol. 45(9), pages 1389-1409.
    8. Boyce, David, 2007. "Future research on urban transportation network modeling," Regional Science and Urban Economics, Elsevier, vol. 37(4), pages 472-481, July.
    9. David Boyce, 2007. "Forecasting Travel on Congested Urban Transportation Networks: Review and Prospects for Network Equilibrium Models," Networks and Spatial Economics, Springer, vol. 7(2), pages 99-128, June.
    10. Xu, Zhandong & Xie, Jun & Liu, Xiaobo & Nie, Yu (Marco), 2020. "Hyperpath-based algorithms for the transit equilibrium assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    11. Ahipaşaoğlu, Selin Damla & Meskarian, Rudabeh & Magnanti, Thomas L. & Natarajan, Karthik, 2015. "Beyond normality: A cross moment-stochastic user equilibrium model," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 333-354.
    12. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    13. Shen, Wei & Wynter, Laura, 2012. "A new one-level convex optimization approach for estimating origin–destination demand," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1535-1555.
    14. Justin Siegel & Joaquín Cea & José Fernández & Renán Rodriguez & David Boyce, 2006. "Comparisons of Urban Travel Forecasts Prepared with the Sequential Procedure and a Combined Model," Networks and Spatial Economics, Springer, vol. 6(2), pages 135-148, June.
    15. Zhu, Daoli & Marcotte, Patrice, 1995. "Coupling the auxiliary problem principle with descent methods of pseudoconvex programming," European Journal of Operational Research, Elsevier, vol. 83(3), pages 670-685, June.
    16. Castillo, Enrique & Menéndez, José María & Sánchez-Cambronero, Santos, 2008. "Predicting traffic flow using Bayesian networks," Transportation Research Part B: Methodological, Elsevier, vol. 42(5), pages 482-509, June.
    17. Du, Muqing & Tan, Heqing & Chen, Anthony, 2021. "A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models," European Journal of Operational Research, Elsevier, vol. 290(3), pages 982-999.
    18. Andrea Raith & Judith Wang & Matthias Ehrgott & Stuart Mitchell, 2014. "Solving multi-objective traffic assignment," Annals of Operations Research, Springer, vol. 222(1), pages 483-516, November.
    19. Lei Zhang & David Levinson, 2005. "Road Pricing with Autonomous Links," Working Papers 200506, University of Minnesota: Nexus Research Group.
    20. Jiancheng Long & Hai-Jun Huang & Ziyou Gao & W. Y. Szeto, 2013. "An Intersection-Movement-Based Dynamic User Optimal Route Choice Problem," Operations Research, INFORMS, vol. 61(5), pages 1134-1147, October.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:40:y:2006:i:5:p:351-367. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.