IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i4p527-d1335700.html
   My bibliography  Save this article

An Exact Approach to the Multi-Compartment Vehicle Routing Problem: The Case of a Fuel Distribution Company

Author

Listed:
  • Guilherme Baptista

    (University of Coimbra, Centre for Mechanical Engineering, Materials and Processes, ARISE, 3004-531 Coimbra, Portugal)

  • Miguel Vieira

    (University of Coimbra, Centre for Mechanical Engineering, Materials and Processes, ARISE, 3004-531 Coimbra, Portugal
    Research Centre for Asset Management and Systems Engineering, Lusófona University, 1749-024 Lisboa, Portugal)

  • Telmo Pinto

    (University of Coimbra, Centre for Mechanical Engineering, Materials and Processes, ARISE, 3004-531 Coimbra, Portugal
    Centro ALGORITMI/LASI, University of Minho, 4704-553 Braga, Portugal)

Abstract

Over the years, the vehicle routing problem has been studied by several authors, creating several extensions, such as the multi-compartment vehicle routing problem. Several studies in the literature have addressed this problem, but few have solved it through exact approaches owing to model convolution. In this way, a mathematical model is proposed for the multi-compartment vehicle routing problem with time windows, in which three types of fuel products are distributed to a set of customers using a limited homogeneous fleet. The model explicitly considers time windows, as well as regulatory rest times for the drivers and time limits for each trip and for working schedules, addressing a real company’s decision support requirements, which is scarce in the literature. The optimal solution determines, for each vehicle, the distribution route and time to carry out the deliveries with the corresponding loading of products to compartments, complemented by the calculation of carbon emissions. The main objective is to minimize the total distance traveled, which corresponds to the sum of the distances traveled by each one of the allocated vehicles. The results allow the assessment of the solution optimization applied to a set of instances for a Portuguese company to evaluate the performance and compare decision support improvements with current baseline company procedures.

Suggested Citation

  • Guilherme Baptista & Miguel Vieira & Telmo Pinto, 2024. "An Exact Approach to the Multi-Compartment Vehicle Routing Problem: The Case of a Fuel Distribution Company," Mathematics, MDPI, vol. 12(4), pages 1-14, February.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:4:p:527-:d:1335700
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/4/527/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/4/527/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. 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.
    3. 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.
    4. 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.
    5. A. Mor & M. G. Speranza, 2022. "Vehicle routing problems over time: a survey," Annals of Operations Research, Springer, vol. 314(1), pages 255-275, July.
    6. Gerald G. Brown & Glenn W. Graves, 1981. "Real-Time Dispatch of Petroleum Tank Trucks," Management Science, INFORMS, vol. 27(1), pages 19-32, January.
    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. 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. 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.
    3. 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.
    4. Gu, Wenjuan & Archetti, Claudia & Cattaruzza, Diego & Ogier, Maxime & Semet, Frédéric & Speranza, M. Grazia, 2024. "Vehicle routing problems with multiple commodities: A survey," European Journal of Operational Research, Elsevier, vol. 317(1), pages 1-15.
    5. 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.
    6. Nasr Al-Hinai & Chefi Triki, 2020. "A two-level evolutionary algorithm for solving the petrol station replenishment problem with periodicity constraints and service choice," Annals of Operations Research, Springer, vol. 286(1), pages 325-350, March.
    7. 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.
    8. Furkan Uzar, M. & Çatay, Bülent, 2012. "Distribution planning of bulk lubricants at BP Turkey," Omega, Elsevier, vol. 40(6), pages 870-881.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. 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.
    14. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    15. 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.
    16. Tino Henke & M. Grazia Speranza & Gerhard Wäscher, 2014. "The Multi-Compartment Vehicle Routing Problem with Flexible Compartment Sizes," FEMM Working Papers 140006, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    17. 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.
    18. 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.
    19. Manuel Iori & Silvano Martello, 2010. "Routing problems with loading constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 4-27, July.
    20. 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.

    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:jmathe:v:12:y:2024:i:4:p:527-:d:1335700. 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.