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

Alternatives to Dial's logit assignment algorithm

Author

Listed:
  • Bell, Michael G. H.

Abstract

Two logit assignment methods for transportation networks are proposed as alternatives to Dial's algorithm. While retaining the absence of a need for the enumeration of paths, they dispense with both forward and backward passes. They, therefore, do not require minimum node-to-node cost information beforehand. Both methods admit loops and paths that are otherwise inefficient in the Dial sense, which can arise in practice as a result of driver searching behaviour. The first method considers a finite number of paths and the second method an infinite number of paths in the presence of loops. The absence of any efficiency constraint on the set of feasible paths makes the algorithms attractive for use in stochastic user equilibrium methods or in the approximation of a user equilibrium assignment through stochastic user equilibrium methods. The similarity of the structure of one of the proposed algorithms with that of the Floyd-Warshall shortest path algorithm would allow the two to be combined.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:transb:v:29:y:1995:i:4:p:287-295
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0191-2615(95)00005-X
    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. 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)

    Citations

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


    Cited by:

    1. Akamatsu, Takashi, 1996. "Cyclic flows, Markov process and stochastic traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 30(5), pages 369-386, October.

    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. Wong, S. C., 1999. "On the convergence of Bell's logit assignment formulation," Transportation Research Part B: Methodological, Elsevier, vol. 33(8), pages 609-616, November.
    2. Akamatsu, Takashi, 1996. "Cyclic flows, Markov process and stochastic traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 30(5), pages 369-386, October.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. M Wegener, 1986. "Transport Network Equilibrium and Regional Deconcentration," Environment and Planning A, , vol. 18(4), pages 437-456, April.
    12. Abdullah Alshehri & Mahmoud Owais & Jayadev Gyani & Mishal H. Aljarbou & Saleh Alsulamy, 2023. "Residual Neural Networks for Origin–Destination Trip Matrix Estimation from Traffic Sensor Information," Sustainability, MDPI, vol. 15(13), pages 1-21, June.
    13. Cantarella, G.E. & Pavone, G. & Vitetta, A., 2006. "Heuristics for urban road network design: Lane layout and signal settings," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1682-1695, December.
    14. Massimo Gangi & Giulio E. Cantarella & Antonino Vitetta, 2019. "Solving stochastic frequency-based assignment to transit networks with pre-trip/en-route path choice," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 661-681, December.
    15. Owais, Mahmoud & Moussa, Ghada S. & Hussain, Khaled F., 2019. "Sensor location model for O/D estimation: Multi-criteria meta-heuristics approach," Operations Research Perspectives, Elsevier, vol. 6(C).
    16. Xiyuan Ren & Joseph Y. J. Chow, 2023. "Nonparametric estimation of k-modal taste heterogeneity for group level agent-based mixed logit," Papers 2309.13159, arXiv.org.
    17. Oyama, Yuki & Hato, Eiji, 2019. "Prism-based path set restriction for solving Markovian traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 528-546.
    18. 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.
    19. Castillo, Enrique & Menéndez, José María & Jiménez, Pilar & Rivas, Ana, 2008. "Closed form expressions for choice probabilities in the Weibull case," Transportation Research Part B: Methodological, Elsevier, vol. 42(4), pages 373-380, May.
    20. Vold, Arild, 2005. "Optimal land use and transport planning for the Greater Oslo area," Transportation Research Part A: Policy and Practice, Elsevier, vol. 39(6), pages 548-565, July.

    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:29:y:1995:i:4:p:287-295. 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.