IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v24y2018i1d10.1007_s10732-017-9359-4.html
   My bibliography  Save this article

Dynamic region visit routing problem for vehicles with minimum turning radius

Author

Listed:
  • Douglas G. Macharet

    (Universidade Federal de Minas Gerais)

  • Armando Alves Neto

    (Universidade Federal de Minas Gerais)

  • Vila F. Camara Neto

    (Fundação Centro de Análise, Pesquisa e Inovação Tecnológica)

  • Mario F. M. Campos

    (Universidade Federal de Minas Gerais)

Abstract

In this paper we address the problem of planning optimized routes among dynamically selected target regions for vehicles with a turning radius motion constraint, hereinafter called dynamic Dubins traveling salesman problem with neighborhoods (DDTSPN). Initially, we present a heuristic to solve a simpler version of this problem, called off-line step, where only previously given targets are concerned. We further extend this approach for the more complex case of dynamic scenarios, called on-line step, addressing the inclusion of new targets during the execution of the initial route, whilst minimizing the impact on the total traveled distance. Formal analyzes of our techniques are provided, presenting upper bounds for the total length of the final tour. Results with statistical investigation over a large number of trials in a simulated environment are also provided. Finally, to demonstrate the applicability of our technique in solving the DDTSPN at real-world scenarios, we also report on results of an experiment performed with a real car-like robot.

Suggested Citation

  • Douglas G. Macharet & Armando Alves Neto & Vila F. Camara Neto & Mario F. M. Campos, 2018. "Dynamic region visit routing problem for vehicles with minimum turning radius," Journal of Heuristics, Springer, vol. 24(1), pages 83-109, February.
    • Handle: RePEc:spr:joheur:v:24:y:2018:i:1:d:10.1007_s10732-017-9359-4
    DOI: 10.1007/s10732-017-9359-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-017-9359-4
    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/s10732-017-9359-4?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. Pillac, Victor & Gendreau, Michel & Guéret, Christelle & Medaglia, Andrés L., 2013. "A review of dynamic vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 225(1), pages 1-11.
    2. Dimitris J. Bertsimas & Garrett van Ryzin, 1991. "A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane," Operations Research, INFORMS, vol. 39(4), pages 601-615, August.
    3. Bertsimas, Dimitris & Van Ryzin, Garrett., 1991. "A stochastic and dynamic vehicle routing problem in the Euclidean plane," Working papers 3286-91., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    4. Patrick Jaillet & Michael R. Wagner, 2006. "Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios," Transportation Science, INFORMS, vol. 40(2), pages 200-210, May.
    5. Bertsimas, Dimitris & Chervi, Philippe. & Peterson, Michael., 1991. "Computational approaches to stochastic vehicle routing problems," Working papers 3285-91., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    6. S. Lin & B. W. Kernighan, 1973. "An Effective Heuristic Algorithm for the Traveling-Salesman Problem," Operations Research, INFORMS, vol. 21(2), pages 498-516, April.
    7. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    8. Nicos Christofides, 1972. "Technical Note—Bounds for the Travelling-Salesman Problem," Operations Research, INFORMS, vol. 20(5), pages 1044-1056, October.
    Full references (including those not matched with items on IDEAS)

    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. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    2. TALARICO, Luca & MEISEL, Frank & SÖRENSEN, Kenneth, 2014. "Ambulance routing for disaster response with patient groups," Working Papers 2014005, University of Antwerp, Faculty of Business and Economics.
    3. Qiuping Ni & Yuanxiang Tang, 2023. "A Bibliometric Visualized Analysis and Classification of Vehicle Routing Problem Research," Sustainability, MDPI, vol. 15(9), pages 1-37, April.
    4. Allan Larsen & Oli B. G. Madsen & Marius M. Solomon, 2004. "The A Priori Dynamic Traveling Salesman Problem with Time Windows," Transportation Science, INFORMS, vol. 38(4), pages 459-472, November.
    5. Roberto Tadei & Guido Perboli & Francesca Perfetti, 2017. "The multi-path Traveling Salesman Problem with stochastic travel costs," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 3-23, March.
    6. Xian Cheng & Shaoyi Liao & Zhongsheng Hua, 2017. "A policy of picking up parcels for express courier service in dynamic environments," International Journal of Production Research, Taylor & Francis Journals, vol. 55(9), pages 2470-2488, May.
    7. Marlin W. Ulmer & Dirk C. Mattfeld & Felix Köster, 2018. "Budgeting Time for Dynamic Vehicle Routing with Stochastic Customer Requests," Transportation Science, INFORMS, vol. 52(1), pages 20-37, January.
    8. Pillac, Victor & Gendreau, Michel & Guéret, Christelle & Medaglia, Andrés L., 2013. "A review of dynamic vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 225(1), pages 1-11.
    9. Soumia Ichoua & Michel Gendreau & Jean-Yves Potvin, 2000. "Diversion Issues in Real-Time Vehicle Dispatching," Transportation Science, INFORMS, vol. 34(4), pages 426-438, November.
    10. Maskooki, Alaleh & Deb, Kalyanmoy & Kallio, Markku, 2022. "A customized genetic algorithm for bi-objective routing in a dynamic network," European Journal of Operational Research, Elsevier, vol. 297(2), pages 615-629.
    11. Barrett W. Thomas, 2007. "Waiting Strategies for Anticipating Service Requests from Known Customer Locations," Transportation Science, INFORMS, vol. 41(3), pages 319-331, August.
    12. Nikola Mardešić & Tomislav Erdelić & Tonči Carić & Marko Đurasević, 2023. "Review of Stochastic Dynamic Vehicle Routing in the Evolving Urban Logistics Environment," Mathematics, MDPI, vol. 12(1), pages 1-44, December.
    13. Zhang, Jian & Luo, Kelin & Florio, Alexandre M. & Van Woensel, Tom, 2023. "Solving large-scale dynamic vehicle routing problems with stochastic requests," European Journal of Operational Research, Elsevier, vol. 306(2), pages 596-614.
    14. Marlin W. Ulmer & Justin C. Goodson & Dirk C. Mattfeld & Marco Hennig, 2019. "Offline–Online Approximate Dynamic Programming for Dynamic Vehicle Routing with Stochastic Requests," Service Science, INFORMS, vol. 53(1), pages 185-202, February.
    15. Jian Yang & Patrick Jaillet & Hani Mahmassani, 2004. "Real-Time Multivehicle Truckload Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 38(2), pages 135-148, May.
    16. Sheng Liu & Long He & Zuo-Jun Max Shen, 2021. "On-Time Last-Mile Delivery: Order Assignment with Travel-Time Predictors," Management Science, INFORMS, vol. 67(7), pages 4095-4119, July.
    17. Cui, Shaohua & Yao, Baozhen & Chen, Gang & Zhu, Chao & Yu, Bin, 2020. "The multi-mode mobile charging service based on electric vehicle spatiotemporal distribution," Energy, Elsevier, vol. 198(C).
    18. Junlong Zhang & William Lam & Bi Chen, 2013. "A Stochastic Vehicle Routing Problem with Travel Time Uncertainty: Trade-Off Between Cost and Customer Service," Networks and Spatial Economics, Springer, vol. 13(4), pages 471-496, December.
    19. Alexandra Anderluh & Rune Larsen & Vera C. Hemmelmayr & Pamela C. Nolz, 2020. "Impact of travel time uncertainties on the solution cost of a two-echelon vehicle routing problem with synchronization," Flexible Services and Manufacturing Journal, Springer, vol. 32(4), pages 806-828, December.
    20. Russell W. Bent & Pascal Van Hentenryck, 2004. "Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers," Operations Research, INFORMS, vol. 52(6), pages 977-987, 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:joheur:v:24:y:2018:i:1:d:10.1007_s10732-017-9359-4. 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.