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

Solving the length constrained K-drones rural postman problem

Author

Listed:
  • Campbell, James F.
  • Corberán, Ángel
  • Plana, Isaac
  • Sanchis, José M.
  • Segura, Paula

Abstract

In this paper we address the Length Constrained K-Drones Rural Postman Problem (LC K-DRPP). This is a continuous optimization problem where a fleet of homogeneous drones have to jointly service (traverse) a set of (curved or straight) lines of a network. Unlike the vehicles in classical arc routing problems, a drone can enter a line through any of its points, service a portion of that line, exit through another of its points, then travel directly to any point on another line, and so on. Moreover, since the range of the drones is restricted, the length of each route is limited by a maximum distance. Some applications for drone arc routing problems include inspection of pipelines, railway or power transmission lines and traffic monitoring.

Suggested Citation

  • Campbell, James F. & Corberán, Ángel & Plana, Isaac & Sanchis, José M. & Segura, Paula, 2021. "Solving the length constrained K-drones rural postman problem," European Journal of Operational Research, Elsevier, vol. 292(1), pages 60-72.
    • Handle: RePEc:eee:ejores:v:292:y:2021:i:1:p:60-72
    DOI: 10.1016/j.ejor.2020.10.035
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221720309115
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2020.10.035?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Taillard, Éric D., 2022. "A linearithmic heuristic for the travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 297(2), pages 442-450.
    2. Zandieh, Fatemeh & Ghannadpour, Seyed Farid & Mazdeh, Mohammad Mahdavi, 2024. "New integrated routing and surveillance model with drones and charging station considerations," European Journal of Operational Research, Elsevier, vol. 313(2), pages 527-547.
    3. Xabier A. Martin & Marc Escoto & Antoni Guerrero & Angel A. Juan, 2024. "Battery Management in Electric Vehicle Routing Problems: A Review," Energies, MDPI, vol. 17(5), pages 1-25, February.
    4. Yi Li & Min Liu & Dandan Jiang, 2022. "Application of Unmanned Aerial Vehicles in Logistics: A Literature Review," Sustainability, MDPI, vol. 14(21), pages 1-18, November.
    5. James Campbell & Ángel Corberán & Isaac Plana & José M. Sanchis & Paula Segura, 2022. "Polyhedral analysis and a new algorithm for the length constrained K–drones rural postman problem," Computational Optimization and Applications, Springer, vol. 83(1), pages 67-109, September.

    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:292:y:2021:i:1:p:60-72. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.