IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v276y2019i3p893-909.html
   My bibliography  Save this article

Product-oriented time window assignment for a multi-compartment vehicle routing problem

Author

Listed:
  • Martins, Sara
  • Ostermeier, Manuel
  • Amorim, Pedro
  • Hübner, Alexander
  • Almada-Lobo, Bernardo

Abstract

Besides fuel and waste distribution, one core application of multi-compartment vehicles (MCVs) is the distribution of groceries, as they enable retailers to jointly transport products with different temperature requirements, thus reducing the number of visits to a store. Grocery stores usually define preferable time windows that depend on the temperature of products (for example, fresh products in the morning) to indicate when deliveries should occur to better plan their in-store operations. Distribution planning therefore needs to take these preferences into consideration to obtain consistent delivery times. This work extends the research on multi-compartment vehicle routing problems (MCVRPs) by tackling a multi-period setting with a product-oriented time window assignment. In this problem, a fleet of MCVs is used for distribution and a unique time window for the delivery of each product segment to each store is defined consistently throughout the planning horizon. An ALNS is proposed to solve the product-oriented time window assignment for MCVRP. Daily and weekly operators are developed respectively focusing on the improvement of routing aspects of the problem on each day and aligning the time window assignment consistently throughout the planning horizon. The approach is tested on benchmark instances from the literature to demonstrate its effectiveness. We also use direct information from retail practice and enhance this with simulated data to further generalize our findings. The numerical experiments demonstrate that planning consistent MCV distribution leads to better overall solutions than the ex-post time window assignment of daily plans, facilitating more on-time deliveries.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:276:y:2019:i:3:p:893-909
    DOI: 10.1016/j.ejor.2019.01.053
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221719300888
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2019.01.053?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. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    2. Ilgaz Sungur & Yingtao Ren & Fernando Ordóñez & Maged Dessouky & Hongsheng Zhong, 2010. "A Model and Algorithm for the Courier Delivery Problem with Uncertainty," Transportation Science, INFORMS, vol. 44(2), pages 193-205, May.
    3. Ioannou, George & Kritikos, Manolis & Prastacos, Gregory, 2003. "A problem generator-solver heuristic for vehicle routing with soft time windows," Omega, Elsevier, vol. 31(1), pages 41-53, February.
    4. Attila A. Kovacs & Bruce L. Golden & Richard F. Hartl & Sophie N. Parragh, 2015. "The Generalized Consistent Vehicle Routing Problem," Transportation Science, INFORMS, vol. 49(4), pages 796-816, November.
    5. Chris Groër & Bruce Golden & Edward Wasil, 2009. "The Consistent Vehicle Routing Problem," Manufacturing & Service Operations Management, INFORMS, vol. 11(4), pages 630-643, February.
    6. 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.
    7. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, August.
    8. 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.
    9. Subramanyam, Anirudh & Gounaris, Chrysanthos E., 2016. "A branch-and-cut framework for the consistent traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 248(2), pages 384-395.
    10. 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.
    11. P. Kabcome & T. Mouktonglang, 2015. "Vehicle Routing Problem for Multiple Product Types, Compartments, and Trips with Soft Time Windows," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 2015, pages 1-9, July.
    12. Henriette Koch & Tino Henke & Gerhard Wäscher, 2016. "A Genetic Algorithm for the Multi-Compartment Vehicle Routing Problem with Flexible Compartment Sizes," FEMM Working Papers 160004, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    13. Spliet, Remy & Desaulniers, Guy, 2015. "The discrete time window assignment vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 244(2), pages 379-391.
    14. Kunlei Lian & Ashlea Bennett Milburn & Ronald L. Rardin, 2016. "An improved multi-directional local search algorithm for the multi-objective consistent vehicle routing problem," IISE Transactions, Taylor & Francis Journals, vol. 48(10), pages 975-992, October.
    15. 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.
    16. 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.
    17. 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.
    18. van Zelst, Susan & van Donselaar, Karel & van Woensel, Tom & Broekmeulen, Rob & Fransoo, Jan, 2009. "Logistics drivers for shelf stacking in grocery retail stores: Potential for efficiency improvement," International Journal of Production Economics, Elsevier, vol. 121(2), pages 620-632, October.
    19. Hübner, Alexander & Schaal, Kai, 2017. "An integrated assortment and shelf-space optimization model with demand substitution and space-elasticity effects," European Journal of Operational Research, Elsevier, vol. 261(1), pages 302-316.
    20. Holzapfel, Andreas & Hübner, Alexander & Kuhn, Heinrich & Sternbeck, Michael G., 2016. "Delivery pattern and transportation planning in grocery retailing," European Journal of Operational Research, Elsevier, vol. 252(1), pages 54-68.
    21. 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.
    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. Paredes-Belmar, Germán & Montero, Elizabeth & Lüer-Villagra, Armin & Marianov, Vladimir & Araya-Sassi, Claudio, 2022. "Vehicle routing for milk collection with gradual blending: A case arising in Chile," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1403-1416.
    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. Frank, Markus & Ostermeier, Manuel & Holzapfel, Andreas & Hübner, Alexander & Kuhn, Heinrich, 2021. "Optimizing routing and delivery patterns with multi-compartment vehicles," European Journal of Operational Research, Elsevier, vol. 293(2), pages 495-510.
    4. Sun, Lijun & Zhang, Yuankai & Hu, Xiangpei, 2021. "Economical-traveling-distance-based fleet composition with fuel costs: An application in petrol distribution," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    5. Yajun Zhan & Yiping Jiang, 2022. "Integrated Optimization of Order Allocation and Last-Mile Multi-Temperature Joint Distribution for Fresh Agriproduct Community Retail," Sustainability, MDPI, vol. 14(15), pages 1-18, August.
    6. Marseglia, G. & Mesa, J.A. & Ortega, F.A. & Piedra-de-la-Cuadra, R., 2022. "A heuristic for the deployment of collecting routes for urban recycle stations (eco-points)," Socio-Economic Planning Sciences, Elsevier, vol. 82(PA).
    7. Mar Vazquez-Noguerol & Jose Comesaña-Benavides & Raul Poler & J. Carlos Prado-Prado, 2022. "An optimisation approach for the e-grocery order picking 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. 30(3), pages 961-990, September.

    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. Frank, Markus & Ostermeier, Manuel & Holzapfel, Andreas & Hübner, Alexander & Kuhn, Heinrich, 2021. "Optimizing routing and delivery patterns with multi-compartment vehicles," European Journal of Operational Research, Elsevier, vol. 293(2), pages 495-510.
    2. 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.
    3. Manuel Ostermeier & Sara Martins & Pedro Amorim & Alexander Hübner, 2018. "Loading constraints for a multi-compartment vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(4), pages 997-1027, October.
    4. 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.
    5. Yang, Meng & Ni, Yaodong & Song, Qinyu, 2022. "Optimizing driver consistency in the vehicle routing problem under uncertain environment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    6. Dominik Goeke & Roberto Roberti & Michael Schneider, 2019. "Exact and Heuristic Solution of the Consistent Vehicle-Routing Problem," Transportation Science, INFORMS, vol. 53(4), pages 1023-1042, July.
    7. Alexander Hübner & Manuel Ostermeier, 2019. "A Multi-Compartment Vehicle Routing Problem with Loading and Unloading Costs," Service Science, INFORMS, vol. 53(1), pages 282-300, February.
    8. 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.
    9. Stavropoulou, F. & Repoussis, P.P. & Tarantilis, C.D., 2019. "The Vehicle Routing Problem with Profits and consistency constraints," European Journal of Operational Research, Elsevier, vol. 274(1), pages 340-356.
    10. 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.
    11. 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.
    12. 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.
    13. Braekers, Kris & Kovacs, Attila A., 2016. "A multi-period dial-a-ride problem with driver consistency," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 355-377.
    14. Ulmer, Marlin & Nowak, Maciek & Mattfeld, Dirk & Kaminski, Bogumił, 2020. "Binary driver-customer familiarity in service routing," European Journal of Operational Research, Elsevier, vol. 286(2), pages 477-493.
    15. 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.
    16. Anirudh Subramanyam & Chrysanthos E. Gounaris, 2018. "A Decomposition Algorithm for the Consistent Traveling Salesman Problem with Vehicle Idling," Transportation Science, INFORMS, vol. 52(2), pages 386-401, March.
    17. 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.
    18. Henriette Koch & Tino Henke & Gerhard Wäscher, 2016. "A Genetic Algorithm for the Multi-Compartment Vehicle Routing Problem with Flexible Compartment Sizes," FEMM Working Papers 160004, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    19. Neves-Moreira, Fábio & Pereira da Silva, Diogo & Guimarães, Luís & Amorim, Pedro & Almada-Lobo, Bernardo, 2018. "The time window assignment vehicle routing problem with product dependent deliveries," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 163-183.
    20. Campelo, Pedro & Neves-Moreira, Fábio & Amorim, Pedro & Almada-Lobo, Bernardo, 2019. "Consistent vehicle routing problem with service level agreements: A case study in the pharmaceutical distribution sector," European Journal of Operational Research, Elsevier, vol. 273(1), pages 131-145.

    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:eee:ejores:v:276:y:2019:i:3:p:893-909. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.