IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v20y2020i4d10.1007_s12351-018-0403-4.html
   My bibliography  Save this article

Two metaheuristic approaches for solving the multi-compartment vehicle routing problem

Author

Listed:
  • Hiba Yahyaoui

    (Université de Tunis
    Dhofar University)

  • Islem Kaabachi

    (Université de Tunis)

  • Saoussen Krichen

    (Université de Tunis)

  • Abdulkader Dekdouk

    (Dhofar University)

Abstract

We address in this paper a multi-compartment vehicle routing problem (MCVRP) that aims to plan the delivery of different products to a set of geographically dispatched customers. The MCVRP is encountered in many industries, our research has been motivated by petrol station replenishment problem. The main objective of the delivery process is to minimize the total driving distance by the used trucks. The problem configuration is described through a prefixed set of trucks with several compartments and a set of customers with demands and prefixed delivery. Given such inputs, the minimization of the total traveled distance is subject to assignment and routing constraints that express the capacity limitations of each truck’s compartment in terms of the pathways’ restrictions. For the NP-hardness of the problem, we propose in this paper two algorithms mainly for large problem instances: an adaptive variable neighborhood search (AVNS) and a Partially Matched Crossover PMX-based Genetic Algorithm to solve this problem with the goal of ensuring a better solution quality. We compare the ability of the proposed AVNS with the exact solution using CPLEX and a set of benchmark problem instances is used to analyze the performance of the both proposed meta-heuristics.

Suggested Citation

  • Hiba Yahyaoui & Islem Kaabachi & Saoussen Krichen & Abdulkader Dekdouk, 2020. "Two metaheuristic approaches for solving the multi-compartment vehicle routing problem," Operational Research, Springer, vol. 20(4), pages 2085-2108, December.
    • Handle: RePEc:spr:operea:v:20:y:2020:i:4:d:10.1007_s12351-018-0403-4
    DOI: 10.1007/s12351-018-0403-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-018-0403-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/s12351-018-0403-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. Hansen, Pierre & Mladenovic, Nenad & Moreno Pérez, Jos´e A., 2008. "Variable neighborhood search," European Journal of Operational Research, Elsevier, vol. 191(3), pages 593-595, December.
    2. Muyldermans, L. & Pang, G., 2010. "On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm," European Journal of Operational Research, Elsevier, vol. 206(1), pages 93-103, October.
    3. Coelho, Leandro C. & Laporte, Gilbert, 2015. "Classification, models and exact algorithms for multi-compartment delivery problems," European Journal of Operational Research, Elsevier, vol. 242(3), pages 854-864.
    4. Hansen, Pierre & Oguz, Ceyda & Mladenovic, Nenad, 2008. "Variable neighborhood search for minimum cost berth allocation," European Journal of Operational Research, Elsevier, vol. 191(3), pages 636-649, December.
    5. Cornillier, Fabien & Boctor, Fayez F. & Laporte, Gilbert & Renaud, Jacques, 2008. "A heuristic for the multi-period petrol station replenishment problem," European Journal of Operational Research, Elsevier, vol. 191(2), pages 295-305, December.
    6. Elbek, Maria & Wøhlk, Sanne, 2016. "A variable neighborhood search for the multi-period collection of recyclable materials," European Journal of Operational Research, Elsevier, vol. 249(2), pages 540-550.
    7. W L Ng & S C H Leung & J K P Lam & S W Pan, 2008. "Petrol delivery tanker assignment and routing: a case study in Hong Kong," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(9), pages 1191-1200, September.
    8. F Cornillier & F F Boctor & G Laporte & J Renaud, 2008. "An exact algorithm for the petrol station replenishment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 607-615, May.
    9. Paredes-Belmar, Germán & Marianov, Vladimir & Bronfman, Andrés & Obreque, Carlos & Lüer-Villagra, Armin, 2016. "A milk collection problem with blending," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 94(C), pages 26-43.
    10. Cornillier, Fabien & Boctor, Fayez & Renaud, Jacques, 2012. "Heuristics for the multi-depot petrol station replenishment problem with time windows," European Journal of Operational Research, Elsevier, vol. 220(2), pages 361-369.
    11. Avella, Pasquale & Boccia, Maurizio & Sforza, Antonio, 2004. "Solving a fuel delivery problem by heuristic and exact approaches," European Journal of Operational Research, Elsevier, vol. 152(1), pages 170-179, January.
    12. Lahyani, Rahma & Coelho, Leandro C. & Khemakhem, Mahdi & Laporte, Gilbert & Semet, Frédéric, 2015. "A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia," Omega, Elsevier, vol. 51(C), pages 1-10.
    13. Rahimian, Erfan & Akartunalı, Kerem & Levine, John, 2017. "A hybrid Integer Programming and Variable Neighbourhood Search algorithm to solve Nurse Rostering Problems," European Journal of Operational Research, Elsevier, vol. 258(2), pages 411-423.
    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. Ostermeier, Manuel & Henke, Tino & Hübner, Alexander & Wäscher, Gerhard, 2021. "Multi-compartment vehicle routing problems: State-of-the-art, modeling framework and future directions," European Journal of Operational Research, Elsevier, vol. 292(3), pages 799-817.

    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. Ostermeier, Manuel & Henke, Tino & Hübner, Alexander & Wäscher, Gerhard, 2021. "Multi-compartment vehicle routing problems: State-of-the-art, modeling framework and future directions," European Journal of Operational Research, Elsevier, vol. 292(3), pages 799-817.
    2. Samira Mirzaei & Sanne Wøhlk, 2019. "A Branch-and-Price algorithm for two multi-compartment vehicle routing problems," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(1), pages 1-33, March.
    3. Samira Mirzaei & Sanne Wøhlk, 2017. "Erratum to: A Branch-and-Price algorithm for two multi-compartment vehicle routing problems," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 185-218, June.
    4. Bani, Abderrahman & El Hallaoui, Issmail & Corréa, Ayoub Insa & Tahir, Adil, 2023. "Solving a real-world multi-depot multi-period petrol replenishment problem with complex loading constraints," European Journal of Operational Research, Elsevier, vol. 311(1), pages 154-172.
    5. 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.
    6. Heßler, Katrin, 2021. "Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes," European Journal of Operational Research, Elsevier, vol. 294(1), pages 188-205.
    7. Lobo, Benjamin J. & Brown, Donald E. & Gerber, Matthew S. & Grazaitis, Peter J., 2018. "A transient stochastic simulation–optimization model for operational fuel planning in-theater," European Journal of Operational Research, Elsevier, vol. 264(2), pages 637-652.
    8. Li, Kunpeng & Chen, Bin & Sivakumar, Appa Iyer & Wu, Yong, 2014. "An inventory–routing problem with the objective of travel time minimization," European Journal of Operational Research, Elsevier, vol. 236(3), pages 936-945.
    9. Ostermeier, Manuel & Hübner, Alexander, 2018. "Vehicle selection for a multi-compartment vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 269(2), pages 682-694.
    10. Martins, Sara & Ostermeier, Manuel & Amorim, Pedro & Hübner, Alexander & Almada-Lobo, Bernardo, 2019. "Product-oriented time window assignment for a multi-compartment vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 276(3), pages 893-909.
    11. Henke, Tino & Speranza, M. Grazia & Wäscher, Gerhard, 2015. "The multi-compartment vehicle routing problem with flexible compartment sizes," European Journal of Operational Research, Elsevier, vol. 246(3), pages 730-743.
    12. Furkan Uzar, M. & Çatay, Bülent, 2012. "Distribution planning of bulk lubricants at BP Turkey," Omega, Elsevier, vol. 40(6), pages 870-881.
    13. Yan Cheng Hsu & Jose L. Walteros & Rajan Batta, 2020. "Solving the petroleum replenishment and routing problem with variable demands and time windows," Annals of Operations Research, Springer, vol. 294(1), pages 9-46, November.
    14. Pasquale Carotenuto & Stefano Giordani & Alessio Salvatore, 2024. "A Matheuristic Approach for the Multi-Depot Periodic Petrol Station Replenishment Problem," Mathematics, MDPI, vol. 12(3), pages 1-19, January.
    15. Alinaghian, Mahdi & Shokouhi, Nadia, 2018. "Multi-depot multi-compartment vehicle routing problem, solved by a hybrid adaptive large neighborhood search," Omega, Elsevier, vol. 76(C), pages 85-99.
    16. Vasilii A. Gromov & Konstantin A. Kuznietzov & Timothy Pigden, 2019. "Decision support system for light petroleum products supply chain," Operational Research, Springer, vol. 19(1), pages 219-236, March.
    17. Tino Henke & Grazia Speranza & Gerhard Wäscher, 2017. "A Branch-and-Cut Algorithm for the Multi Compartment vehicle Routing Problem with Flexbile Compartment Sizes," FEMM Working Papers 170004, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    18. Katrin Heßler, 2020. "Exact Algorithms for the Multi-Compartment Vehicle Routing Problem with Flexible Compartment Sizes," Working Papers 2007, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    19. Cornillier, Fabien & Boctor, Fayez & Renaud, Jacques, 2012. "Heuristics for the multi-depot petrol station replenishment problem with time windows," European Journal of Operational Research, Elsevier, vol. 220(2), pages 361-369.
    20. Coelho, Leandro C. & Laporte, Gilbert, 2015. "Classification, models and exact algorithms for multi-compartment delivery problems," European Journal of Operational Research, Elsevier, vol. 242(3), pages 854-864.

    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:operea:v:20:y:2020:i:4:d:10.1007_s12351-018-0403-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.