Skip to main content
SpringerLink
Log in

A Matheuristic for Multi-Depot Multi-Trip Vehicle Routing Problems

  • Conference paper
  • First Online:
Metaheuristics (MIC 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13838))

Included in the following conference series:

  • 517 Accesses

Abstract

Starting from a real-life application, in this short paper, we propose the original Multi-Depot Multi-Trip Vehicle Routing Problem with Total Completion Times minimization (MDMT-VRP-TCT). For it, we propose a mathematical formulation as a MILP, design a matheuristic framework to quickly solve it, and experimentally test its performance.

It is worth noting that this problem is original as in the literature its characteristics (i.e., multi-depot, multi-trip and total completion time) can be found separately, but never all together. Moreover, regardless of the application, our solution works in any case in which a multi-depot multi-trip vehicle routing problem must be solved.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3), 209–219 (2006)

    Article  Google Scholar 

  2. Cattaruzza, D., Absi, N., Feillet, D.: Vehicle routing problems with multiple trips. 4OR 14(3), 223–259 (2016). https://doi.org/10.1007/s10288-016-0306-2

    Article  MathSciNet  MATH  Google Scholar 

  3. Méndez-Díaz, I., Zabala, P., Lucena, A.: A new formulation for the traveling deliveryman problem. Discret. Appl. Math. 156(17), 3223–3237 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Nagarajan, V., Ravi, R.: Approximation algorithms for distance constrained vehicle routing problems. Networks 59, 209–214 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  5. Paradiso, R., Roberti, R., Laganà, D., Dullaert, W.: An exact solution framework for multitrip vehicle-routing problems with time windows. Oper. Res. 68(1), 180–198 (2020)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sapienza University of Rome, Rome, Italy

    Tiziana Calamoneri

  2. Missouri University of Science and Technology, Rolla, USA

    Federico Corò

  3. University of Palermo, Palermo, Italy

    Simona Mancini

  4. University of Klagenfurt, Klagenfurt am Wörthersee, Austria

    Simona Mancini

Authors
  1. Tiziana Calamoneri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Federico Corò
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Simona Mancini
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Federico Corò .

Editor information

Editors and Affiliations

  1. University of Udine, Udine, Italy

    Luca Di Gaspero

  2. University of Napoli - Federico II, Napoli, Italy

    Paola Festa

  3. University of Paris Est, Paris, France

    Amir Nakib

  4. University of Catania, Catania, Italy

    Mario Pavone

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Calamoneri, T., Corò, F., Mancini, S. (2023). A Matheuristic for Multi-Depot Multi-Trip Vehicle Routing Problems. In: Di Gaspero, L., Festa, P., Nakib, A., Pavone, M. (eds) Metaheuristics. MIC 2022. Lecture Notes in Computer Science, vol 13838. Springer, Cham. https://doi.org/10.1007/978-3-031-26504-4_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-26504-4_34

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-26503-7

  • Online ISBN: 978-3-031-26504-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation