IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v157y2008i1p169-18210.1007-s10479-007-0198-9.html
   My bibliography  Save this article

Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks

Author

Listed:
  • Eliécer Gutiérrez
  • Andrés Medaglia

Abstract

In real road networks, the presence of no-left, no-right or no U-turn signs, restricts the movement of vehicles at intersections. These turn prohibitions must be considered when calculating the shortest path between a starting and an ending point in a road network. We propose an extension of Dijkstra’s algorithm to solve the shortest path problem with turn prohibitions. The method uses arc labeling and a network structure with low memory requirements. We compare the proposed method with the dual graph approach in a set of randomly generated networks and Bogotá’s large-scale road network. Our computational experiments show that the performance of the proposed method is better than that of the dual graph approach, both in terms of computing time and memory requirements. We co-developed a Web-based decision support system for computing shortest paths with turn prohibitions that uses the proposed method as the core engine. Copyright Springer Science+Business Media, LLC 2008

Suggested Citation

  • Eliécer Gutiérrez & Andrés Medaglia, 2008. "Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks," Annals of Operations Research, Springer, vol. 157(1), pages 169-182, January.
    • Handle: RePEc:spr:annopr:v:157:y:2008:i:1:p:169-182:10.1007/s10479-007-0198-9
    DOI: 10.1007/s10479-007-0198-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-007-0198-9
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-007-0198-9?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. Enrique Benavent & David Soler, 1999. "The Directed Rural Postman Problem with Turn Penalties," Transportation Science, INFORMS, vol. 33(4), pages 408-418, November.
    2. Añez, J. & De La Barra, T. & Pérez, B., 1996. "Dual graph representation of transport networks," Transportation Research Part B: Methodological, Elsevier, vol. 30(3), pages 209-216, June.
    3. F. Benjamin Zhan & Charles E. Noon, 1998. "Shortest Path Algorithms: An Evaluation Using Real Road Networks," Transportation Science, INFORMS, vol. 32(1), pages 65-73, February.
    4. Villeneuve, Daniel & Desaulniers, Guy, 2005. "The shortest path problem with forbidden paths," European Journal of Operational Research, Elsevier, vol. 165(1), pages 97-107, August.
    5. Yu-Li Chou & H. Edwin Romeijn & Robert L. Smith, 1998. "Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems," INFORMS Journal on Computing, INFORMS, vol. 10(2), pages 163-179, May.
    6. J Clossey & G Laporte & P Soriano, 2001. "Solving arc routing problems with turn penalties," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(4), pages 433-439, April.
    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. Ari, Ibrahim & Aksakalli, Vural & Aydogˇdu, Volkan & Kum, Serdar, 2013. "Optimal ship navigation with safety distance and realistic turn constraints," European Journal of Operational Research, Elsevier, vol. 229(3), pages 707-717.
    2. Maurice Queyranne & Laurence A. Wolsey, 2018. "Optimum turn-restricted paths, nested compatibility, and optimum convex polygons," Journal of Combinatorial Optimization, Springer, vol. 36(1), pages 90-107, July.
    3. Di Puglia Pugliese, Luigi & Guerriero, Francesca, 2013. "Shortest path problem with forbidden paths: The elementary version," European Journal of Operational Research, Elsevier, vol. 227(2), pages 254-267.
    4. Thibaut Vidal, 2017. "Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension," Operations Research, INFORMS, vol. 65(4), pages 992-1010, August.

    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. Cerrone, Carmine & Dussault, Benjamin & Wang, Xingyin & Golden, Bruce & Wasil, Edward, 2019. "A two-stage solution approach for the Directed Rural Postman Problem with Turn Penalties," European Journal of Operational Research, Elsevier, vol. 272(2), pages 754-765.
    2. D Soler & E Martínez & J C Micó, 2008. "A transformation for the mixed general routing problem with turn penalties," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(4), pages 540-547, April.
    3. Ari, Ibrahim & Aksakalli, Vural & Aydogˇdu, Volkan & Kum, Serdar, 2013. "Optimal ship navigation with safety distance and realistic turn constraints," European Journal of Operational Research, Elsevier, vol. 229(3), pages 707-717.
    4. A. Parsakhoo & M. Mostafa, 2015. "Road network analysis for timber transportation from a harvesting site to mills (Case study: Gorgan county - Iran)," Journal of Forest Science, Czech Academy of Agricultural Sciences, vol. 61(12), pages 520-525.
    5. Vidal, Thibaut & Laporte, Gilbert & Matl, Piotr, 2020. "A concise guide to existing and emerging vehicle routing problem variants," European Journal of Operational Research, Elsevier, vol. 286(2), pages 401-416.
    6. Michael Drexl, 2012. "Synchronization in Vehicle Routing---A Survey of VRPs with Multiple Synchronization Constraints," Transportation Science, INFORMS, vol. 46(3), pages 297-316, August.
    7. Kaj Holmberg, 2019. "The (Over)zealous Snow Remover Problem," Transportation Science, INFORMS, vol. 53(3), pages 867-881, May.
    8. Debdatta Sinha Roy & Adriano Masone & Bruce Golden & Edward Wasil, 2021. "Modeling and Solving the Intersection Inspection Rural Postman Problem," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1245-1257, July.
    9. Irnich, Stefan, 2008. "Solution of real-world postman problems," European Journal of Operational Research, Elsevier, vol. 190(1), pages 52-67, October.
    10. Jotshi, Arun & Gong, Qiang & Batta, Rajan, 2009. "Dispatching and routing of emergency vehicles in disaster mitigation using data fusion," Socio-Economic Planning Sciences, Elsevier, vol. 43(1), pages 1-24, March.
    11. Thibaut Vidal, 2017. "Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension," Operations Research, INFORMS, vol. 65(4), pages 992-1010, August.
    12. Almobaideen, Wesam & Krayshan, Rand & Allan, Mamoon & Saadeh, Maha, 2017. "Internet of Things: Geographical Routing based on healthcare centers vicinity for mobile smart tourism destination," Technological Forecasting and Social Change, Elsevier, vol. 123(C), pages 342-350.
    13. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    14. Gutiérrez-Jarpa, Gabriel & Desaulniers, Guy & Laporte, Gilbert & Marianov, Vladimir, 2010. "A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows," European Journal of Operational Research, Elsevier, vol. 206(2), pages 341-349, October.
    15. Ann-Kathrin Rothenbächer & Michael Drexl & Stefan Irnich, 2018. "Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 52(5), pages 1174-1190, October.
    16. Bode, Claudia & Irnich, Stefan, 2014. "The shortest-path problem with resource constraints with (k,2)-loop elimination and its application to the capacitated arc-routing problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 415-426.
    17. Qin, Hu & Moriakin, Anton & Xu, Gangyan & Li, Jiliu, 2024. "The generator distribution problem for base stations during emergency power outage: A branch-and-price-and-cut approach," European Journal of Operational Research, Elsevier, vol. 318(3), pages 752-767.
    18. Elena Fernández & Gilbert Laporte & Jessica Rodríguez-Pereira, 2019. "Exact Solution of Several Families of Location-Arc Routing Problems," Transportation Science, INFORMS, vol. 53(5), pages 1313-1333, September.
    19. Dikas, G. & Minis, I., 2014. "Scheduled paratransit transport systems," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 18-34.
    20. Jiliu Li & Zhixing Luo & Roberto Baldacci & Hu Qin & Zhou Xu, 2023. "A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 31-49, January.

    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:spr:annopr:v:157:y:2008:i:1:p:169-182:10.1007/s10479-007-0198-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.