IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v43y1997i3p545-551.html
   My bibliography  Save this article

A comparison of shortest path algorithms in urban traffic assignment

Author

Listed:
  • Salim, V.

Abstract

No abstract is available for this item.

Suggested Citation

  • Salim, V., 1997. "A comparison of shortest path algorithms in urban traffic assignment," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 43(3), pages 545-551.
    • Handle: RePEc:eee:matcom:v:43:y:1997:i:3:p:545-551
    DOI: 10.1016/S0378-4754(97)00043-8
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475497000438
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/S0378-4754(97)00043-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Fred Glover & Darwin D. Klingman & Nancy V. Phillips & Robert F. Schneider, 1985. "New Polynomial Shortest Path Algorithms and Their Computational Attributes," Management Science, INFORMS, vol. 31(9), pages 1106-1128, September.
    2. James J. Divoky & Ming S. Hung, 1990. "Performance of Shortest Path Algorithms in Network Flow Problems," Management Science, INFORMS, vol. 36(6), pages 661-673, June.
    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. Elise D. Miller-Hooks & Hani S. Mahmassani, 2000. "Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks," Transportation Science, INFORMS, vol. 34(2), pages 198-215, May.
    2. William Costa & Britaldo Soares-Filho & Rodrigo Nobrega, 2022. "Can the Brazilian National Logistics Plan Induce Port Competitiveness by Reshaping the Port Service Areas?," Sustainability, MDPI, vol. 14(21), pages 1-18, November.
    3. Hanif D. Sherali & Antoine G. Hobeika & Sasikul Kangwalklai, 2003. "Time-Dependent, Label-Constrained Shortest Path Problems with Applications," Transportation Science, INFORMS, vol. 37(3), pages 278-293, August.

    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:matcom:v:43:y:1997:i:3:p:545-551. 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.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.