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

Cyclic flows, Markov process and stochastic traffic assignment

Author

Listed:
  • Akamatsu, Takashi

Abstract

Dial's stochastic assignment algorithm restricts the assignment path set to "efficient path." As a result, it sometimes produces the unrealistic flow pattern that no flow is loaded on some paths where many vehicles are running in reality. To remove the drawback of Dial's algorithm, this paper presents the LOGIT type assignment that does not restrict the assignment paths. We first show the theoretical relation between the proposed model and Sasaki's assignment model through Markov process. This analysis makes it clear that the proposed assignment model can be calculated by some matrix operations. Next, we propose an efficient algorithm that does not require the matrix operation nor path enumeration over a network. The algorithm solves an equivalent program based on the entropy decomposition derived from the Markov property of LOGIT model. Finally, it is shown that the proposed approach can be easily extended to the flow dependent case (i.e. stochastic equilibrium assignment).

Suggested Citation

  • Akamatsu, Takashi, 1996. "Cyclic flows, Markov process and stochastic traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 30(5), pages 369-386, October.
    • Handle: RePEc:eee:transb:v:30:y:1996:i:5:p:369-386
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0191-2615(96)00003-3
    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. Fisk, Caroline, 1980. "Some developments in equilibrium traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 14(3), pages 243-255, September.
    2. 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.
    3. Takayama,Akira, 1985. "Mathematical Economics," Cambridge Books, Cambridge University Press, number 9780521314985, September.
    4. Davis, Gary A., 1994. "Exact local solution of the continuous network design problem via stochastic user equilibrium assignment," Transportation Research Part B: Methodological, Elsevier, vol. 28(1), pages 61-75, February.
    5. Bell, Michael G. H., 1995. "Alternatives to Dial's logit assignment algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 29(4), pages 287-295, August.
    6. Carlos F. Daganzo & Yosef Sheffi, 1977. "On Stochastic Models of Traffic Assignment," Transportation Science, INFORMS, vol. 11(3), pages 253-274, August.
    7. Janson, Bruce N. & Zozaya-Gorostiza, Carlos, 1987. "The problem of cyclic flows in traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 21(4), pages 299-310, August.
    8. Van Vliet, Dirck, 1981. "Selected node-pair analysis in dial's assignment algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 15(1), pages 65-68, February.
    Full references (including those not matched with items on IDEAS)

    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. Hai Yang & Qiang Meng & Michael G. H. Bell, 2001. "Simultaneous Estimation of the Origin-Destination Matrices and Travel-Cost Coefficient for Congested Networks in a Stochastic User Equilibrium," Transportation Science, INFORMS, vol. 35(2), pages 107-123, May.
    2. Clark, Stephen D. & Watling, David P., 2006. "Applications of sensitivity analysis for probit stochastic network equilibrium," European Journal of Operational Research, Elsevier, vol. 175(2), pages 894-911, December.
    3. 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.
    4. 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.
    5. Paolo Delle Site, 2017. "On the Equivalence Between SUE and Fixed-Point States of Day-to-Day Assignment Processes with Serially-Correlated Route Choice," Networks and Spatial Economics, Springer, vol. 17(3), pages 935-962, September.
    6. Honggang Zhang & Zhiyuan Liu & Yicheng Zhang & Weijie Chen & Chenyang Zhang, 2024. "A Distributed Computing Method Integrating Improved Gradient Projection for Solving Stochastic Traffic Equilibrium Problem," Networks and Spatial Economics, Springer, vol. 24(2), pages 361-381, June.
    7. Zhang, Michael & Nie, Yu & Shen, Wei & Lee, Ming S. & Jansuwan, Sarawut & Chootinan, Piya & Pravinvongvuth, Surachet & Chen, Anthony & Recker, Will W., 2008. "Development of A Path Flow Estimator for Inferring Steady-State and Time-Dependent Origin-Destination Trip Matrices," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt3nr033sc, Institute of Transportation Studies, UC Berkeley.
    8. Patriksson, Michael, 2008. "On the applicability and solution of bilevel optimization models in transportation science: A study on the existence, stability and computation of optimal solutions to stochastic mathematical programs," Transportation Research Part B: Methodological, Elsevier, vol. 42(10), pages 843-860, December.
    9. Connors, Richard D. & Sumalee, Agachai & Watling, David P., 2007. "Sensitivity analysis of the variable demand probit stochastic user equilibrium with multiple user-classes," Transportation Research Part B: Methodological, Elsevier, vol. 41(6), pages 593-615, July.
    10. Huang, Hai-Jun & Bell, Michael G. H., 1998. "A study on logit assignment which excludes all cyclic flows," Transportation Research Part B: Methodological, Elsevier, vol. 32(6), pages 401-412, August.
    11. Guido Gentile, 2018. "New Formulations of the Stochastic User Equilibrium with Logit Route Choice as an Extension of the Deterministic Model," Service Science, INFORMS, vol. 52(6), pages 1531-1547, December.
    12. Farahani, Reza Zanjirani & Miandoabchi, Elnaz & Szeto, W.Y. & Rashidi, Hannaneh, 2013. "A review of urban transportation network design problems," European Journal of Operational Research, Elsevier, vol. 229(2), pages 281-302.
    13. Claudia Castaldi & Paolo Delle Site & Francesco Filippi, 2019. "Stochastic user equilibrium in the presence of state dependence," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 535-559, December.
    14. Damberg, Olof & Lundgren, Jan T. & Patriksson, Michael, 1996. "An algorithm for the stochastic user equilibrium problem," Transportation Research Part B: Methodological, Elsevier, vol. 30(2), pages 115-131, April.
    15. Leurent, Fabien M., 1997. "Curbing the computational difficulty of the logit equilibrium assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 31(4), pages 315-326, August.
    16. E. Nikolova & N. E. Stier-Moses, 2014. "A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times," Operations Research, INFORMS, vol. 62(2), pages 366-382, April.
    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. Bell, Michael G. H., 1995. "Stochastic user equilibrium assignment in networks with queues," Transportation Research Part B: Methodological, Elsevier, vol. 29(2), pages 125-137, April.
    19. Hong, Sung-Pil & Kim, Kyung min & Byeon, Geunyeong & Min, Yun-Hong, 2017. "A method to directly derive taste heterogeneity of travellers’ route choice in public transport from observed routes," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 41-52.
    20. Jiayang Li & Zhaoran Wang & Yu Marco Nie, 2023. "Wardrop Equilibrium Can Be Boundedly Rational: A New Behavioral Theory of Route Choice," Papers 2304.02500, arXiv.org, revised Feb 2024.

    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:30:y:1996:i:5:p:369-386. 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.