IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v272y2019i2p754-765.html
   My bibliography  Save this article

A two-stage solution approach for the Directed Rural Postman Problem with Turn Penalties

Author

Listed:
  • Cerrone, Carmine
  • Dussault, Benjamin
  • Wang, Xingyin
  • Golden, Bruce
  • Wasil, Edward

Abstract

In this paper, we consider the Directed Rural Postman Problem with Turn Penalties (DRPP-TP). A solution is a tour that traverses all required arcs of the graph. The total cost of the tour is the sum of the lengths of the traversed arcs plus the penalties associated with the turns. One solution approach involves transforming the arc routing problem into an equivalent node routing problem. An alternative direct approach (without graph transformation) that involves two stages has been proposed in the literature. In the first part of this paper, we investigate the applicability of the direct approach. We identify several characteristics of the input instance that make this approach effective and present several limitations of this approach. In the second part of this paper, we describe an integer linear program that is combined with a local search algorithm. This combination produces high-quality solutions to the DRPP-TP in a reasonable amount of computing time.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:272:y:2019:i:2:p:754-765
    DOI: 10.1016/j.ejor.2018.07.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722171830609X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2018.07.004?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. Irnich, Stefan, 2008. "Solution of real-world postman problems," European Journal of Operational Research, Elsevier, vol. 190(1), pages 52-67, October.
    2. 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.
    3. Lawrence D. Bodin & Samuel J. Kursh, 1978. "A Computer-Assisted System for the Routing and Scheduling of Street Sweepers," Operations Research, INFORMS, vol. 26(4), pages 525-537, August.
    4. 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.
    5. Ruiz, Ruben & Stutzle, Thomas, 2008. "An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1143-1159, June.
    6. Michael Drexl, 2014. "On the generalized directed rural postman problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 65(8), pages 1143-1154, August.
    7. Enrique Benavent & David Soler, 1999. "The Directed Rural Postman Problem with Turn Penalties," Transportation Science, INFORMS, vol. 33(4), pages 408-418, November.
    8. 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.
    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. 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.

    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. 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.
    2. 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.
    3. Nossack, Jenny & Golden, Bruce & Pesch, Erwin & Zhang, Rui, 2017. "The windy rural postman problem with a time-dependent zigzag option," European Journal of Operational Research, Elsevier, vol. 258(3), pages 1131-1142.
    4. 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.
    5. 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.
    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. 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.
    11. 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.
    12. Xiaoguang Bao & Xinhao Ni, 2024. "Approximation algorithms for two clustered arc routing problems," Journal of Combinatorial Optimization, Springer, vol. 47(5), pages 1-12, July.
    13. 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.
    14. 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.
    15. 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.
    16. Timo Hintsch, 2019. "Large Multiple Neighborhood Search for the Soft-Clustered Vehicle-Routing Problem," Working Papers 1904, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    17. 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.
    18. Pan, Quan-Ke & Gao, Liang & Li, Xin-Yu & Gao, Kai-Zhou, 2017. "Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times," Applied Mathematics and Computation, Elsevier, vol. 303(C), pages 89-112.
    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:eee:ejores:v:272:y:2019:i:2:p:754-765. 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/locate/eor .

    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.