IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v27y2019i2d10.1007_s11750-019-00507-3.html
   My bibliography  Save this article

A matheuristic for the Distance-Constrained Close-Enough Arc Routing Problem

Author

Listed:
  • Ángel Corberán

    (Universitat de València)

  • Isaac Plana

    (Universitat de València)

  • Miguel Reula

    (Universitat de València)

  • José M. Sanchis

    (Universidad Politécnica de Valencia)

Abstract

The Close-Enough Arc Routing Problem, also called Generalized Directed Rural Postman Problem, is an arc routing problem with interesting real-life applications, such as routing for meter reading. In this application, a vehicle with a receiver travels through a series of neighborhoods. If the vehicle gets within a certain distance of a meter, the receiver is able to record the gas, water, or electricity consumption. Therefore, the vehicle does not need to traverse every street, but only a few, in order to be close enough to each meter. In this paper we deal with an extension of this problem, the Distance-Constrained Generalized Directed Rural Postman Problem or Distance-Constrained Close Enough Arc Routing Problem, in which a fleet of vehicles is available. The vehicles have to leave from and return to a common vertex, the depot, and the length of their routes must not exceed a maximum distance (or time). For solving this problem we propose a matheuristic that incorporates an effective exact procedure to optimize the routes obtained. Extensive computational experiments have been performed on a set of benchmark instances and the results are compared with those obtained with an exact procedure proposed in the literature.

Suggested Citation

  • Ángel Corberán & Isaac Plana & Miguel Reula & José M. Sanchis, 2019. "A matheuristic for the Distance-Constrained Close-Enough 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. 27(2), pages 312-326, July.
  • Handle: RePEc:spr:topjnl:v:27:y:2019:i:2:d:10.1007_s11750-019-00507-3
    DOI: 10.1007/s11750-019-00507-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11750-019-00507-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11750-019-00507-3?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. Thais Ávila & Ángel Corberán & Isaac Plana & José M. Sanchis, 2016. "A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem," Transportation Science, INFORMS, vol. 50(2), pages 750-761, May.
    2. 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.
    3. Julián Aráoz & Elena Fernández & Carles Franquesa, 2017. "The Generalized 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. 25(3), pages 497-525, October.
    4. Thais Ávila & Ángel Corberán & Isaac Plana & José M. Sanchis, 2017. "Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 339-365, September.
    5. Michel Gendreau & Gilbert Laporte & Frédéric Semet, 1997. "The Covering Tour Problem," Operations Research, INFORMS, vol. 45(4), pages 568-576, 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. Bianchessi, Nicola & Corberán, Ángel & Plana, Isaac & Reula, Miguel & Sanchis, José M., 2022. "The min-max close-enough arc routing problem," European Journal of Operational Research, Elsevier, vol. 300(3), pages 837-851.
    2. Glock, Katharina & Meyer, Anne, 2023. "Spatial coverage in routing and path planning problems," European Journal of Operational Research, Elsevier, vol. 305(1), pages 1-20.
    3. Corberán, Ángel & Plana, Isaac & Reula, Miguel & Sanchis, José M., 2021. "On the Distance-Constrained Close Enough Arc Routing Problem," European Journal of Operational Research, Elsevier, vol. 291(1), pages 32-51.

    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. Corberán, Ángel & Plana, Isaac & Reula, Miguel & Sanchis, José M., 2021. "On the Distance-Constrained Close Enough Arc Routing Problem," European Journal of Operational Research, Elsevier, vol. 291(1), pages 32-51.
    2. Glock, Katharina & Meyer, Anne, 2023. "Spatial coverage in routing and path planning problems," European Journal of Operational Research, Elsevier, vol. 305(1), pages 1-20.
    3. Bianchessi, Nicola & Corberán, Ángel & Plana, Isaac & Reula, Miguel & Sanchis, José M., 2022. "The min-max close-enough arc routing problem," European Journal of Operational Research, Elsevier, vol. 300(3), pages 837-851.
    4. Veenstra, Marjolein & Roodbergen, Kees Jan & Coelho, Leandro C. & Zhu, Stuart X., 2018. "A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands," European Journal of Operational Research, Elsevier, vol. 268(2), pages 703-715.
    5. 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.
    6. Thais Ávila & Ángel Corberán & Isaac Plana & José M. Sanchis, 2017. "Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 339-365, September.
    7. Liwei Zeng & Sunil Chopra & Karen Smilowitz, 2019. "The Covering Path Problem on a Grid," Transportation Science, INFORMS, vol. 53(6), pages 1656-1672, November.
    8. Ivan Contreras & Moayad Tanash & Navneet Vidyarthi, 2017. "Exact and heuristic approaches for the cycle hub location problem," Annals of Operations Research, Springer, vol. 258(2), pages 655-677, November.
    9. Rahma Lahyani & Leandro C. Coelho & Jacques Renaud, 2018. "Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(1), pages 125-157, January.
    10. Glize, Estèle & Roberti, Roberto & Jozefowiez, Nicolas & Ngueveu, Sandra Ulrich, 2020. "Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems," European Journal of Operational Research, Elsevier, vol. 283(3), pages 812-824.
    11. Pop, Petrică C. & Cosma, Ovidiu & Sabo, Cosmin & Sitar, Corina Pop, 2024. "A comprehensive survey on the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 314(3), pages 819-835.
    12. Julián Aráoz & Elena Fernández & Carles Franquesa, 2017. "The Generalized 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. 25(3), pages 497-525, October.
    13. Fischer, Vera & Pacheco Paneque, Meritxell & Legrain, Antoine & Bürgy, Reinhard, 2024. "A capacitated multi-vehicle covering tour problem on a road network and its application to waste collection," European Journal of Operational Research, Elsevier, vol. 315(1), pages 338-353.
    14. Coelho, Leandro C. & Laporte, Gilbert, 2014. "Improved solutions for inventory-routing problems through valid inequalities and input ordering," International Journal of Production Economics, Elsevier, vol. 155(C), pages 391-397.
    15. Christian Artigues & Nicolas Jozefowiez & Boadu M. Sarpong, 2018. "Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 117-142, June.
    16. Keisuke Murakami, 2018. "Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(04), pages 1-22, August.
    17. Leticia Vargas & Nicolas Jozefowiez & Sandra Ulrich Ngueveu, 2017. "A dynamic programming operator for tour location problems applied to the covering tour problem," Journal of Heuristics, Springer, vol. 23(1), pages 53-80, February.
    18. Afshartous, David & Guan, Yongtao & Mehrotra, Anuj, 2009. "US Coast Guard air station location with respect to distress calls: A spatial statistics and optimization based methodology," European Journal of Operational Research, Elsevier, vol. 196(3), pages 1086-1096, August.
    19. Afsaneh Amiri & Majid Salari, 2019. "Time-constrained maximal covering routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 415-468, June.
    20. Moreno Perez, Jose A. & Marcos Moreno-Vega, J. & Rodriguez Martin, Inmaculada, 2003. "Variable neighborhood tabu search and its application to the median cycle problem," European Journal of Operational Research, Elsevier, vol. 151(2), pages 365-378, December.

    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:topjnl:v:27:y:2019:i:2:d:10.1007_s11750-019-00507-3. 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.