IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v14y2022i18p11639-d916674.html
   My bibliography  Save this article

Mathematical Model for the Generalized VRP Model

Author

Listed:
  • Anita Agárdi

    (Institute of Informatics, University of Miskolc, 3515 Miskolc, Hungary)

  • László Kovács

    (Institute of Informatics, University of Miskolc, 3515 Miskolc, Hungary)

  • Tamás Bányai

    (Institute of Logistics, University of Miskolc, 3515 Miskolc, Hungary)

Abstract

The Vehicle Routing Problem (VRP) is a highly investigated logistics problem. VRP can model in-plant and out-plant material handling or a whole supply chain. The first Vehicle Routing Problem article was published in 1959 by Dantzig and Ramser, and many varieties of VRP have appeared since then. Transport systems are becoming more and more customized these days, so it is necessary to develop a general system that covers many transport tasks. Based on the literature, several components of VRP have appeared, but the development of an integrated system with all components has not yet been completed by the researchers. An integrated system can be useful because it is easy to configure; many transportation tasks can be easily modeled with its help. Our purpose is to present a generalized VRP model and show, in the form of case studies, how many transport tasks the system can model by including (omitting) each component. In this article, a generalized system is introduced, which covers the main VRP types that have appeared over the years. In the introduction, the basic Vehicle Routing Problem is presented, where the most important Vehicle Routing Problem components published so far are also detailed. The paper also gives the mathematical model of the generalization of the Vehicle Routing Problem and some case studies of the model are presented.

Suggested Citation

  • Anita Agárdi & László Kovács & Tamás Bányai, 2022. "Mathematical Model for the Generalized VRP Model," Sustainability, MDPI, vol. 14(18), pages 1-22, September.
    • Handle: RePEc:gam:jsusta:v:14:y:2022:i:18:p:11639-:d:916674
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/14/18/11639/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/14/18/11639/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. J. Schulze & T. Fahle, 1999. "A parallel algorithm for the vehicle routing problem with time window constraints," Annals of Operations Research, Springer, vol. 86(0), pages 585-607, January.
    2. Nagy, Gabor & Salhi, Said, 2005. "Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries," European Journal of Operational Research, Elsevier, vol. 162(1), pages 126-141, April.
    3. Soysal, Mehmet & Bloemhof-Ruwaard, Jacqueline M. & Bektaş, Tolga, 2015. "The time-dependent two-echelon capacitated vehicle routing problem with environmental considerations," International Journal of Production Economics, Elsevier, vol. 164(C), pages 366-378.
    4. Talarico, Luca & Sörensen, Kenneth & Springael, Johan, 2015. "Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 244(2), pages 457-470.
    5. Dondo, Rodolfo & Cerda, Jaime, 2007. "A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1478-1507, February.
    6. Archetti, Claudia & Savelsbergh, Martin & Speranza, M. Grazia, 2016. "The Vehicle Routing Problem with Occasional Drivers," European Journal of Operational Research, Elsevier, vol. 254(2), pages 472-480.
    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. Kangye Tan & Weihua Liu & Fang Xu & Chunsheng Li, 2023. "Optimization Model and Algorithm of Logistics Vehicle Routing Problem under Major Emergency," Mathematics, MDPI, vol. 11(5), pages 1-18, March.

    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. Vidal, Thibaut & Laporte, Gilbert & Matl, Piotr, 2020. "A concise guide to existing and emerging vehicle routing problem variants," European Journal of Operational Research, Elsevier, vol. 286(2), pages 401-416.
    2. Liu, Dan & Yan, Pengyu & Pu, Ziyuan & Wang, Yinhai & Kaisar, Evangelos I., 2021. "Hybrid artificial immune algorithm for optimizing a Van-Robot E-grocery delivery system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 154(C).
    3. Ozgur Kabadurmus & Mehmet S. Erdogan, 2023. "A green vehicle routing problem with multi-depot, multi-tour, heterogeneous fleet and split deliveries: a mathematical model and heuristic approach," Journal of Combinatorial Optimization, Springer, vol. 45(3), pages 1-29, April.
    4. Yu, Vincent F. & Jodiawan, Panca & Hou, Ming-Lu & Gunawan, Aldy, 2021. "Design of a two-echelon freight distribution system in last-mile logistics considering covering locations and occasional drivers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 154(C).
    5. Margaretha Gansterer & Richard F. Hartl & Philipp E. H. Salzmann, 2018. "Exact solutions for the collaborative pickup and delivery problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(2), pages 357-371, June.
    6. Babagolzadeh, Mahla & Zhang, Yahua & Abbasi, Babak & Shrestha, Anup & Zhang, Anming, 2022. "Promoting Australian regional airports with subsidy schemes: Optimised downstream logistics using vehicle routing problem," Transport Policy, Elsevier, vol. 128(C), pages 38-51.
    7. Riharsono Prastyantoro & Heru Purboyo Hidayat Putro & Gatot Yudoko & Puspita Dirgahayani, 2022. "E-Commerce Parcel Distribution in Urban Areas with Sustainable Performance Indicators," Sustainability, MDPI, vol. 14(23), pages 1-23, December.
    8. Ermagun, Alireza & Stathopoulos, Amanda, 2018. "To bid or not to bid: An empirical study of the supply determinants of crowd-shipping," Transportation Research Part A: Policy and Practice, Elsevier, vol. 116(C), pages 468-483.
    9. Qi, Mingyao & Lin, Wei-Hua & Li, Nan & Miao, Lixin, 2012. "A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 248-257.
    10. Zhu, Stuart X. & Ursavas, Evrim, 2018. "Design and analysis of a satellite network with direct delivery in the pharmaceutical industry," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 190-207.
    11. Yue Lu & Maoxiang Lang & Xueqiao Yu & Shiqi Li, 2019. "A Sustainable Multimodal Transport System: The Two-Echelon Location-Routing Problem with Consolidation in the Euro–China Expressway," Sustainability, MDPI, vol. 11(19), pages 1-25, October.
    12. Pandelis, D.G. & Karamatsoukis, C.C. & Kyriakidis, E.G., 2013. "Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery," European Journal of Operational Research, Elsevier, vol. 231(3), pages 577-586.
    13. Derigs, U. & Kaiser, R., 2007. "Applying the attribute based hill climber heuristic to the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 177(2), pages 719-732, March.
    14. Sana Jawarneh & Salwani Abdullah, 2015. "Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows," PLOS ONE, Public Library of Science, vol. 10(7), pages 1-23, July.
    15. Imai, Akio & Nishimura, Etsuko & Current, John, 2007. "A Lagrangian relaxation-based heuristic for the vehicle routing with full container load," European Journal of Operational Research, Elsevier, vol. 176(1), pages 87-105, January.
    16. Bektaş, Tolga, 2012. "Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing," European Journal of Operational Research, Elsevier, vol. 216(1), pages 83-93.
    17. Suzuki, Yoshinori, 2016. "A dual-objective metaheuristic approach to solve practical pollution routing problem," International Journal of Production Economics, Elsevier, vol. 176(C), pages 143-153.
    18. Fagui Liu & Lvshengbiao Wang & Mengke Gui & Yang Zhang & Yulin Lan & Chengqi Lai & Boyuan Zhu, 2023. "A hybrid heuristic algorithm for urban distribution with simultaneous pickup-delivery and time window," Journal of Heuristics, Springer, vol. 29(2), pages 269-311, June.
    19. Tao Yang & Weixin Wang, 2022. "Logistics Network Distribution Optimization Based on Vehicle Sharing," Sustainability, MDPI, vol. 14(4), pages 1-12, February.
    20. Lin Zhou & Yanping Chen & Yi Jing & Youwei Jiang, 2021. "Evolutionary Game Analysis on Last Mile Delivery Resource Integration—Exploring the Behavioral Strategies between Logistics Service Providers, Property Service Companies and Customers," Sustainability, MDPI, vol. 13(21), pages 1-18, November.

    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:gam:jsusta:v:14:y:2022:i:18:p:11639-:d:916674. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.