IDEAS home Printed from https://ideas.repec.org/a/bjc/journl/v11y2024i7p435-449.html
   My bibliography  Save this article

Survey on Thirty Years of Vehicle Routing Problems: Mathematical Models, Solution Methods, and Real-Life Applications

Author

Listed:
  • D. G. N. D. Jayarathna

    (Department of Scientific Computing, Faculty of Computing, University of Sri Jayewardenepura, Sri Lanka.)

Abstract

In recent years, warehouse management concerns have become a major focus in logistics management research, and they have been widely used in studying transportation and logistics distribution networks. The purpose of this work is to undertake a Carrying out a comprehensive analytical literature survey of past twenty years on Vehicle Routing Problem (VRP). VRP is a well-studied combinatorial optimization problem in operations research and computer science. The VRP can be classified as Capacitated Vehicle Routing Problem (CVRP), Vehicle Routing Problem with Time Windows (VRPTW), Vehicle Routing Problem with Multi-Depot (MDVRP), and their variants. Further discussions have taken place in the fields of VRP classification, summarization of common VRP constraints, and the model method created in recent years. Finally, the future model implications of VRP are being investigated, and it is expected that the Intelligent Vehicle Routing Problem and Intelligent Heuristic Algorithm will be major areas of future research.

Suggested Citation

  • D. G. N. D. Jayarathna, 2024. "Survey on Thirty Years of Vehicle Routing Problems: Mathematical Models, Solution Methods, and Real-Life Applications," International Journal of Research and Scientific Innovation, International Journal of Research and Scientific Innovation (IJRSI), vol. 11(7), pages 435-449, July.
    • Handle: RePEc:bjc:journl:v:11:y:2024:i:7:p:435-449
    as

    Download full text from publisher

    File URL: https://www.rsisinternational.org/journals/ijrsi/digital-library/volume-11-issue-7/435-449.pdf
    Download Restriction: no
    File URL: https://rsisinternational.org/journals/ijrsi/articles/survey-on-thirty-years-of-vehicle-routing-problems-mathematical-models-solution-methods-and-real-life-applications/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Baker, Barrie M. & Sheasby, Janice, 1999. "Extensions to the generalised assignment heuristic for vehicle routing," European Journal of Operational Research, Elsevier, vol. 119(1), pages 147-157, November.
    2. Gilbert Laporte, 2009. "Fifty Years of Vehicle Routing," Transportation Science, INFORMS, vol. 43(4), pages 408-416, November.
    3. Jonathan F. Bard & George Kontoravdis & Gang Yu, 2002. "A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 36(2), pages 250-269, May.
    4. Gilbert Laporte, 2007. "What you should know about the vehicle routing problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(8), pages 811-819, December.
    5. Toth, Paolo & Vigo, Daniele, 1999. "A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls," European Journal of Operational Research, Elsevier, vol. 113(3), pages 528-543, March.
    6. R. Montemanni & L. M. Gambardella & A. E. Rizzoli & A. V. Donati, 2005. "Ant Colony System for a Dynamic Vehicle Routing Problem," Journal of Combinatorial Optimization, Springer, vol. 10(4), pages 327-343, December.
    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. Nicolas Rincon-Garcia & Ben J. Waterson & Tom J. Cherrett, 2018. "Requirements from vehicle routing software: perspectives from literature, developers and the freight industry," Transport Reviews, Taylor & Francis Journals, vol. 38(1), pages 117-138, January.
    2. Mariusz Izdebski & Marianna Jacyna, 2021. "An Efficient Hybrid Algorithm for Energy Expenditure Estimation for Electric Vehicles in Urban Service Enterprises," Energies, MDPI, vol. 14(7), pages 1-23, April.
    3. José Manuel Belenguer & Enrique Benavent & Antonio Martínez & Christian Prins & Caroline Prodhon & Juan G. Villegas, 2016. "A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots," Transportation Science, INFORMS, vol. 50(2), pages 735-749, May.
    4. Mads Jepsen & Simon Spoorendonk & Stefan Ropke, 2013. "A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem," Transportation Science, INFORMS, vol. 47(1), pages 23-37, February.
    5. Schyns, M., 2015. "An ant colony system for responsive dynamic vehicle routing," European Journal of Operational Research, Elsevier, vol. 245(3), pages 704-718.
    6. Gilbert Laporte, 2009. "Fifty Years of Vehicle Routing," Transportation Science, INFORMS, vol. 43(4), pages 408-416, November.
    7. Tan, K.C. & Chew, Y.H. & Lee, L.H., 2006. "A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 172(3), pages 855-885, August.
    8. Alonso Tabares, Diego & Mora-Camino, Felix & Drouin, Antoine, 2021. "A multi-time scale management structure for airport ground handling automation," Journal of Air Transport Management, Elsevier, vol. 90(C).
    9. Ritzinger, Ulrike & Puchinger, Jakob & Rudloff, Christian & Hartl, Richard F., 2022. "Comparison of anticipatory algorithms for a dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 301(2), pages 591-608.
    10. Ioannou, Petros & Giuliano, Genevieve & Dessouky, Maged & Chen, Pengfei & Dexter, Sue, 2020. "Freight Load Balancing and Efficiencies in Alternative Fuel Freight Modes," Institute of Transportation Studies, Working Paper Series qt3ns4b894, Institute of Transportation Studies, UC Davis.
    11. Shijin Wang & Xiaodong Wang & Xin Liu & Jianbo Yu, 2018. "A Bi-Objective Vehicle-Routing Problem with Soft Time Windows and Multiple Depots to Minimize the Total Energy Consumption and Customer Dissatisfaction," Sustainability, MDPI, vol. 10(11), pages 1-21, November.
    12. 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.
    13. Guodong Yu & Yu Yang, 2019. "Dynamic routing with real-time traffic information," Operational Research, Springer, vol. 19(4), pages 1033-1058, December.
    14. Abdulkader, M.M.S. & Gajpal, Yuvraj & ElMekkawy, Tarek Y., 2018. "Vehicle routing problem in omni-channel retailing distribution systems," International Journal of Production Economics, Elsevier, vol. 196(C), pages 43-55.
    15. Ran Liu & Zhibin Jiang, 2019. "A constraint relaxation-based algorithm for the load-dependent vehicle routing problem with time windows," Flexible Services and Manufacturing Journal, Springer, vol. 31(2), pages 331-353, June.
    16. Pureza, Vitória & Morabito, Reinaldo & Reimann, Marc, 2012. "Vehicle routing with multiple deliverymen: Modeling and heuristic approaches for the VRPTW," European Journal of Operational Research, Elsevier, vol. 218(3), pages 636-647.
    17. Ioannou, Petros & Chen, Pengfei, 2023. "Centrally Coordinated Schedules and Routes of Airport Shuttles with LAX Terminals as Application Area," Institute of Transportation Studies, Working Paper Series qt6gg7r6c5, Institute of Transportation Studies, UC Davis.
    18. Tino Henke & M. Grazia Speranza & Gerhard Wäscher, 2019. "A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes," Annals of Operations Research, Springer, vol. 275(2), pages 321-338, April.
    19. Bonet Filella, Guillem & Trivella, Alessio & Corman, Francesco, 2023. "Modeling soft unloading constraints in the multi-drop container loading problem," European Journal of Operational Research, Elsevier, vol. 308(1), pages 336-352.
    20. Lars M. Hvattum & Arne Løkketangen & Gilbert Laporte, 2006. "Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic," Transportation Science, INFORMS, vol. 40(4), pages 421-438, November.

    More about this item

    Statistics

    Access and download statistics

    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:bjc:journl:v:11:y:2024:i:7:p:435-449. 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: Dr. Renu Malsaria (email available below). General contact details of provider: https://rsisinternational.org/journals/ijrsi/ .

    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.