IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v51y2017i2p755-770.html
   My bibliography  Save this article

The Hierarchical Mixed Rural Postman Problem

Author

Listed:
  • Marco Colombi

    (Department of Information Engineering, University of Brescia, 25123 Brescia, Italy)

  • Ángel Corberán

    (Department of Statistics and Operational Research, University of Valencia, 46100 Burjassot, Valencia, Spain)

  • Renata Mansini

    (Department of Information Engineering, University of Brescia, 25123 Bresica, Italy)

  • Isaac Plana

    (Department of Mathematics for Economics and Business, University of Valencia, 46100 Burjassot, Valencia, Spain)

  • José M. Sanchis

    (Department of Applied Mathematics, Polytechnic University of Valencia, 46100 Burjassot, Valencia, Spain)

Abstract

In this paper, we study a generalization of the Hierarchical Chinese Postman Problem on a mixed graph where only a subset of arcs and edges require a service to be accomplished following a hierarchical order. The problem, called the Hierarchical Mixed Rural Postman Problem, also generalizes the Rural Postman Problem and thus is NP-hard. We propose a new mathematical formulation, and introduce two effective solution algorithms. The first procedure is a matheuristic that is based on the exact solution of a variant of the Mixed Rural Postman Problem for each hierarchy. The second approach is a tabu search algorithm based on different improvement and diversification strategies. Computational results on an extended set of instances show how the proposed solution methods are quite effective and efficient when compared to the solutions of a branch-and-cut algorithm stopped after one hour of computation.

Suggested Citation

  • Marco Colombi & Ángel Corberán & Renata Mansini & Isaac Plana & José M. Sanchis, 2017. "The Hierarchical Mixed Rural Postman Problem," Transportation Science, INFORMS, vol. 51(2), pages 755-770, May.
    • Handle: RePEc:inm:ortrsc:v:51:y:2017:i:2:p:755-770
    DOI: 10.1287/trsc.2016.0686
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/trsc.2016.0686
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2016.0686?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
    ---><---

    References listed on IDEAS

    as
    1. Nathalie Perrier & André Langevin & Ciro-Alberto Amaya, 2008. "Vehicle Routing for Urban Snow Plowing Operations," Transportation Science, INFORMS, vol. 42(1), pages 44-56, February.
    2. Korteweg, Peter & Volgenant, Ton, 2006. "On the Hierarchical Chinese Postman Problem with linear ordered classes," European Journal of Operational Research, Elsevier, vol. 169(1), pages 41-52, February.
    3. Cabral, Edgar Alberto & Gendreau, Michel & Ghiani, Gianpaolo & Laporte, Gilbert, 2004. "Solving the hierarchical Chinese postman problem as a rural postman problem," European Journal of Operational Research, Elsevier, vol. 155(1), pages 44-50, May.
    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. 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.
    2. Colombi, Marco & Corberán, Ángel & Mansini, Renata & Plana, Isaac & Sanchis, José M., 2017. "The directed profitable rural postman problem with incompatibility constraints," European Journal of Operational Research, Elsevier, vol. 261(2), pages 549-562.
    3. Jessica Rodríguez-Pereira & Gilbert Laporte, 2022. "The target visitation arc routing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 60-76, April.
    4. Jianbin Xin & Benyang Yu & Andrea D’Ariano & Heshan Wang & Meng Wang, 2022. "Time-dependent rural postman problem: time-space network formulation and genetic algorithm," Operational Research, Springer, vol. 22(3), pages 2943-2972, 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. Colombi, Marco & Corberán, Ángel & Mansini, Renata & Plana, Isaac & Sanchis, José M., 2017. "The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm," European Journal of Operational Research, Elsevier, vol. 257(1), pages 1-12.
    2. 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.
    3. Jessica Rodríguez-Pereira & Gilbert Laporte, 2022. "The target visitation arc routing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 60-76, April.
    4. Abdullah Rasul & Jaho Seo & Shuoyan Xu & Tae J. Kwon & Justin MacLean & Cody Brown, 2022. "Optimization of Snowplow Routes for Real-World Conditions," Sustainability, MDPI, vol. 14(20), pages 1-17, October.
    5. Merve Kayacı Çodur & Mustafa Yılmaz, 2020. "A time-dependent hierarchical Chinese postman problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 337-366, March.
    6. Sullivan, James L. & Dowds, Jonathan & Novak, David C. & Scott, Darren M. & Ragsdale, Cliff, 2019. "Development and application of an iterative heuristic for roadway snow and ice control," Transportation Research Part A: Policy and Practice, Elsevier, vol. 127(C), pages 18-31.
    7. Oliver Lum & Bruce Golden & Edward Wasil, 2018. "An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 361-370, May.
    8. Nathalie Perrier & André Langevin & Ciro-Alberto Amaya, 2008. "Vehicle Routing for Urban Snow Plowing Operations," Transportation Science, INFORMS, vol. 42(1), pages 44-56, February.
    9. Ohad Eisenhandler & Michal Tzur, 2019. "The Humanitarian Pickup and Distribution Problem," Operations Research, INFORMS, vol. 67(1), pages 10-32, January.
    10. Sophie N. Parragh & Karl F. Doerner, 2018. "Solving routing problems with pairwise synchronization constraints," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(2), pages 443-464, June.
    11. Shah, Nirav & Kumar, Subodha & Bastani, Farokh & Yen, I-Ling, 2012. "Optimization models for assessing the peak capacity utilization of intelligent transportation systems," European Journal of Operational Research, Elsevier, vol. 216(1), pages 239-251.
    12. 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.
    13. Diego Cattaruzza & Nabil Absi & Dominique Feillet & Jesús González-Feliu, 2017. "Vehicle routing problems for city logistics," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 51-79, March.
    14. Melih Çelik & Özlem Ergun & Pınar Keskinocak, 2015. "The Post-Disaster Debris Clearance Problem Under Incomplete Information," Operations Research, INFORMS, vol. 63(1), pages 65-85, February.
    15. Kaj Holmberg, 2019. "The (Over)zealous Snow Remover Problem," Transportation Science, INFORMS, vol. 53(3), pages 867-881, May.
    16. M. Çelik & H. Süral, 2016. "Order picking in a parallel-aisle warehouse with turn penalties," International Journal of Production Research, Taylor & Francis Journals, vol. 54(14), pages 4340-4355, July.
    17. Sayarshad, Hamid R. & Du, Xinpi & Gao, H. Oliver, 2020. "Dynamic post-disaster debris clearance problem with re-positioning of clearance equipment items under partially observable information," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 352-372.
    18. Aakil M. Caunhye & Nazli Yonca Aydin & H. Sebnem Duzgun, 2020. "Robust post-disaster route restoration," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(4), pages 1055-1087, December.
    19. Farzaneh, Mohammad Amin & Rezapour, Shabnam & Baghaian, Atefe & Amini, M. Hadi, 2023. "An integrative framework for coordination of damage assessment, road restoration, and relief distribution in disasters," Omega, Elsevier, vol. 115(C).
    20. Korteweg, Peter & Volgenant, Ton, 2006. "On the Hierarchical Chinese Postman Problem with linear ordered classes," European Journal of Operational Research, Elsevier, vol. 169(1), pages 41-52, February.

    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:inm:ortrsc:v:51:y:2017:i:2:p:755-770. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.