Skip to main content
SpringerLink
Log in

Dynamic Multi-compartment Vehicle Routing Problem: Formulation and Algorithm

  • Conference paper
  • First Online:
Artificial Intelligence, Data Science and Applications (ICAISE 2023)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 838))

  • 190 Accesses

Abstract

In this paper, two complex variations of the classic vehicle routing problem (VRP) are combined together to present a new VRP variant called the Dynamic Multi-Compartment Vehicle Routing Problem (DMCVRP). The aim of DMCVRP is to minimize the total traveled distance, in this type of problems different product types are loaded into a fleet of homogeneous vehicle with multiple compartments, and each compartment is dedicated to a single type of products. During the execution of the multi-compartment vehicle routing problem (MCVRP) routes the dynamic behavior of the problem shows up and causes some changes in the MCVRP routes. In this problem, we divide the DMCVRP into a set of standard MCVRP, and we present the mathematical model of DMCVRP as a MCVRP model, in which the total customer demands for each product must be fully delivered by the same vehicle with respect of each compartment capacity. Moreover, the distance traveled by each vehicle is subject to a constraint Considering the NP-hardness of the proposed problem, we propose the hybrid adaptive variable neighborhood search (HAVNS) to solve the problem.

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 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.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

References

  1. Evering, R., Reed, M., Yiannakou, A.: An ant colony algorithm for the multicompartment vehicle routing problem. Appl. Soft Comput. 15, 169–176 (2014)

    Article  Google Scholar 

  2. Mavrovouniotis, M., Yang, S.: Ant algorithms with immigrants schemes for the dynamic vehicle routing problem. Inform. Sci. 294, 456–477 (2015)

    Article  MathSciNet  Google Scholar 

  3. Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)

    Article  MathSciNet  Google Scholar 

  4. ElMekkawy, T.Y., Abdulkader, M.M., Gajpal, Y.: Hybridized ant colony algorithm for the multi compartment vehicle routing problem. Appl. Soft Comput. 37, 196–203 (2015)

    Article  Google Scholar 

  5. Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31(12), 1985–2002 (2004)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory of Mathematics, Computer Science and Applications-Security of Information, Department of Mathematics, Faculty of Sciences, Mohammed V University in Rabat, Rabat, Morocco

    Chaymaa Beneich & Sidi Mohamed Douiri

Authors
  1. Chaymaa Beneich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sidi Mohamed Douiri
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chaymaa Beneich .

Editor information

Editors and Affiliations

  1. Department of Computer Science, Moulay Ismail University, Errachidia, Morocco

    Yousef Farhaoui

  2. Centre of AI and Robotics, Napier University, Edinburgh, UK

    Amir Hussain

  3. Prince Sultan University, Riyadh, Saudi Arabia

    Tanzila Saba

  4. University Canada West, Vancouver, BC, Canada

    Hamed Taherdoost

  5. Institute of Science, Banaras Hindu University, Varanasi, India

    Anshul Verma

Rights and permissions

Reprints and permissions

Copyright information

© 2024 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

Beneich, C., Douiri, S.M. (2024). Dynamic Multi-compartment Vehicle Routing Problem: Formulation and Algorithm. In: Farhaoui, Y., Hussain, A., Saba, T., Taherdoost, H., Verma, A. (eds) Artificial Intelligence, Data Science and Applications. ICAISE 2023. Lecture Notes in Networks and Systems, vol 838. Springer, Cham. https://doi.org/10.1007/978-3-031-48573-2_15

Download citation

Publish with us

Policies and ethics

Search

Navigation