IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v116y2018icp163-183.html
   My bibliography  Save this article

The time window assignment vehicle routing problem with product dependent deliveries

Author

Listed:
  • Neves-Moreira, Fábio
  • Pereira da Silva, Diogo
  • Guimarães, Luís
  • Amorim, Pedro
  • Almada-Lobo, Bernardo

Abstract

This paper presents a new formulation for a time window assignment vehicle routing problem where time windows are defined for multiple product segments. This two-stage stochastic optimization problem is solved by means of a fix-and-optimize based matheuristic. The first stage assigns product dependent time windows while the second stage defines delivery schedules. Our approach outperforms a general-purpose solver and achieves an average cost decrease of 5.3% over expected value problem approaches. Furthermore, a sensitivity analysis on three operational models shows that it is possible to obtain significant savings compared to the solutions provided by a large European food retailer.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:transe:v:116:y:2018:i:c:p:163-183
    DOI: 10.1016/j.tre.2018.03.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554517310566
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2018.03.004?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. Salhi, Said & Wassan, Niaz & Hajarat, Mutaz, 2013. "The Fleet Size and Mix Vehicle Routing Problem with Backhauls: Formulation and Set Partitioning-based Heuristics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 56(C), pages 22-35.
    2. Bhusiri, Narath & Qureshi, Ali Gul & Taniguchi, Eiichi, 2014. "The trade-off between fixed vehicle costs and time-dependent arrival penalties in a routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 1-22.
    3. 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.
    4. Helber, Stefan & Sahling, Florian, 2010. "A fix-and-optimize approach for the multi-level capacitated lot sizing problem," International Journal of Production Economics, Elsevier, vol. 123(2), pages 247-256, February.
    5. 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.
    6. 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.
    7. Remy Spliet & Said Dabia & Tom Van Woensel, 2018. "The Time Window Assignment Vehicle Routing Problem with Time-Dependent Travel Times," Transportation Science, INFORMS, vol. 52(2), pages 261-276, March.
    8. 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.
    9. Remy Spliet & Adriana F. Gabor, 2015. "The Time Window Assignment Vehicle Routing Problem," Transportation Science, INFORMS, vol. 49(4), pages 721-731, November.
    10. Niels Agatz & Ann Campbell & Moritz Fleischmann & Martin Savelsbergh, 2011. "Time Slot Management in Attended Home Delivery," Transportation Science, INFORMS, vol. 45(3), pages 435-449, August.
    11. 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.
    12. Sternbeck, Michael G. & Kuhn, Heinrich, 2014. "An integrative approach to determine store delivery patterns in grocery retailing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 205-224.
    13. Mesa-Arango, Rodrigo & Ukkusuri, Satish V., 2013. "Benefits of in-vehicle consolidation in less than truckload freight transportation operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 113-125.
    14. J-F Cordeau & G Laporte & A Mercier, 2001. "A unified tabu search heuristic for vehicle routing problems with time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(8), pages 928-936, August.
    15. Baldacci, Roberto & Mingozzi, Aristide & Roberti, Roberto, 2012. "Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints," European Journal of Operational Research, Elsevier, vol. 218(1), pages 1-6.
    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. 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).
    2. Hao Zhang & Yan Cui & Hepu Deng & Shuxian Cui & Huijia Mu, 2021. "An Improved Genetic Algorithm for the Optimal Distribution of Fresh Products under Uncertain Demand," Mathematics, MDPI, vol. 9(18), pages 1-18, September.
    3. Neves-Moreira, Fábio & Veldman, Jasper & Teunter, Ruud H., 2021. "Service operation vessels for offshore wind farm maintenance: Optimal stock levels," Renewable and Sustainable Energy Reviews, Elsevier, vol. 146(C).
    4. Shao, Saijun & Xu, Gangyan & Li, Ming & Huang, George Q., 2019. "Synchronizing e-commerce city logistics with sliding time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 123(C), pages 17-28.
    5. Tsang, Man Yiu & Shehadeh, Karmel S., 2023. "Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times," European Journal of Operational Research, Elsevier, vol. 307(1), pages 48-63.
    6. Yao, Yu & Van Woensel, Tom & Veelenturf, Lucas P. & Mo, Pengli, 2021. "The consistent vehicle routing problem considering path consistency in a road network," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 21-44.

    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. 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).
    2. 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.
    3. Subramanyam, Anirudh & Wang, Akang & Gounaris, Chrysanthos E., 2018. "A scenario decomposition algorithm for strategic time window assignment vehicle routing problems," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 296-317.
    4. Bruck, Bruno P. & Cordeau, Jean-François & Iori, Manuel, 2018. "A practical time slot management and routing problem for attended home services," Omega, Elsevier, vol. 81(C), pages 208-219.
    5. Kevin Dalmeijer & Guy Desaulniers, 2021. "Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 495-510, May.
    6. Yao, Yu & Van Woensel, Tom & Veelenturf, Lucas P. & Mo, Pengli, 2021. "The consistent vehicle routing problem considering path consistency in a road network," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 21-44.
    7. 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.
    8. 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.
    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. 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.
    11. Waßmuth, Katrin & Köhler, Charlotte & Agatz, Niels & Fleischmann, Moritz, 2023. "Demand management for attended home delivery—A literature review," European Journal of Operational Research, Elsevier, vol. 311(3), pages 801-815.
    12. 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.
    13. Visser, T.R. & Savelsbergh, M.W.P., 2019. "Strategic Time Slot Management: A Priori Routing for Online Grocery Retailing," Econometric Institute Research Papers EI2019-04, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    14. 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.
    15. Wassmuth, K. & Köhler, C. & Agatz, N.A.H. & Fleischmann, M., 2022. "Demand Management for Attended Home Delivery – A Literature Review," ERIM Report Series Research in Management ERS-2022-002-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    16. Schneider, M., 2016. "The vehicle-routing problem with time windows and driver-specific times," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 65941, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    17. Koch, Sebastian & Klein, Robert, 2020. "Route-based approximate dynamic programming for dynamic pricing in attended home delivery," European Journal of Operational Research, Elsevier, vol. 287(2), pages 633-652.
    18. Remy Spliet & Adriana F. Gabor, 2015. "The Time Window Assignment Vehicle Routing Problem," Transportation Science, INFORMS, vol. 49(4), pages 721-731, November.
    19. Quirion-Blais, Olivier & Chen, Lu, 2021. "A case-based reasoning approach to solve the vehicle routing problem with time windows and drivers’ experience," Omega, Elsevier, vol. 102(C).
    20. Marlin W. Ulmer & Barrett W. Thomas, 2019. "Enough Waiting for the Cable Guy—Estimating Arrival Times for Service Vehicle Routing," Transportation Science, INFORMS, vol. 53(3), pages 897-916, May.

    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:transe:v:116:y:2018:i:c:p:163-183. 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/wps/find/journaldescription.cws_home/600244/description#description .

    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.