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

Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics

Author

Listed:
  • Schaumann, Sarah K.
  • Bergmann, Felix M.
  • Wagner, Stephan M.
  • Winkenbach, Matthias

Abstract

In this paper, we analyze the route efficiency effects that emerge from combining realistically constrained first-mile pickup and last-mile delivery operations into joint vehicle routes. Specifically, we examine (i) the individual effect of discrete, non-overlapping time window constraints; (ii) the individual effect of vehicle capacity constraints; and (iii) the joint impact of both constraint types on local route efficiency gains due to the integration of pickup and delivery operations. Extending the existent literature on continuum approximation of route distances, we propose closed-form adjustment factors which accurately capture these non-trivial route efficiency effects. To derive the adjustment factors, we conduct extensive numerical experiments and apply a novel hybrid data analysis approach which combines exploratory data analysis with symbolic regression. Our analysis suggests that these real-world constraints affect the optimal stop sequence and diminish or even eliminate the expected efficiency gains from integrating first- and last-mile operations. The proposed adjustment factors are particularly relevant for the optimal strategic design and operational planning of modern, industrial-scale distribution networks in light of growing and increasingly fragmented e-commerce volumes and a high cost pressure on the logistics industry. They help researchers and practitioners to efficiently quantify the expected benefits from integrating pickup and delivery operations, and to assess under which circumstances such an integration is (not) desirable.

Suggested Citation

  • Schaumann, Sarah K. & Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2023. "Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics," European Journal of Operational Research, Elsevier, vol. 311(1), pages 88-111.
  • Handle: RePEc:eee:ejores:v:311:y:2023:i:1:p:88-111
    DOI: 10.1016/j.ejor.2023.04.018
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221723003016
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2023.04.018?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. Mark F Olson & Jose G Juarez & Moritz U G Kraemer & Jane P Messina & Gabriel L Hamer, 2021. "Global patterns of aegyptism without arbovirus," PLOS Neglected Tropical Diseases, Public Library of Science, vol. 15(5), pages 1-12, May.
    2. Matthias Winkenbach & Alain Roset & Stefan Spinler, 2016. "Strategic Redesign of Urban Mail and Parcel Networks at La Poste," Interfaces, INFORMS, vol. 46(5), pages 445-458, October.
    3. Italo Colantone & Gianmarco Ottaviano & Piero Stanig, 2021. "The Backlash of Globalization," BAFFI CAREFIN Working Papers 21165, BAFFI CAREFIN, Centre for Applied Research on International Markets Banking Finance and Regulation, Universita' Bocconi, Milano, Italy.
    4. Dumas, Yvan & Desrosiers, Jacques & Soumis, Francois, 1991. "The pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 54(1), pages 7-22, September.
    5. Jan Christiaens & Greet Vanden Berghe, 2020. "Slack Induction by String Removals for Vehicle Routing Problems," Transportation Science, INFORMS, vol. 54(2), pages 417-433, March.
    6. 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.
    7. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    8. Marilène Cherkesly & Guy Desaulniers & Gilbert Laporte, 2015. "Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading," Transportation Science, INFORMS, vol. 49(4), pages 752-766, November.
    9. Zhu Liu & Zhu Deng & Philippe Ciais & Jianguang Tan & Biqing Zhu & Steven J. Davis & Robbie Andrew & Olivier Boucher & Simon Ben Arous & Pep Canadel & Xinyu Dou & Pierre Friedlingstein & Pierre Gentin, 2021. "Global Daily CO$_2$ emissions for the year 2020," Papers 2103.02526, arXiv.org.
    10. Figliozzi, Miguel Andres, 2009. "Planning approximations to the average length of vehicle routing problems with time window constraints," Transportation Research Part B: Methodological, Elsevier, vol. 43(4), pages 438-447, May.
    11. Heijmans, Roweno J.R.K., 2021. "On Environmental Externalities and Global Games," Other publications TiSEM bf63c5db-9095-47be-b338-a, Tilburg University, School of Economics and Management.
    12. Sami Ben Jabeur & Salma Mefteh-Wali & Jean-Laurent Viviani, 2021. "Forecasting gold price with the XGBoost algorithm and SHAP interaction values," Post-Print hal-03331805, HAL.
    13. Merrill M. Flood, 1956. "The Traveling-Salesman Problem," Operations Research, INFORMS, vol. 4(1), pages 61-75, February.
    14. Ropke, Stefan & Pisinger, David, 2006. "A unified heuristic for a large class of Vehicle Routing Problems with Backhauls," European Journal of Operational Research, Elsevier, vol. 171(3), pages 750-775, June.
    15. Jason Acimovic & Stephen C. Graves, 2015. "Making Better Fulfillment Decisions on the Fly in an Online Retail Environment," Manufacturing & Service Operations Management, INFORMS, vol. 17(1), pages 34-51, February.
    16. Thomas R. Sexton & Lawrence D. Bodin, 1985. "Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling," Transportation Science, INFORMS, vol. 19(4), pages 378-410, November.
    17. Cordeau, Jean-François & Laporte, Gilbert, 2003. "A tabu search heuristic for the static multi-vehicle dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 37(6), pages 579-594, July.
    18. Roberto Baldacci & Enrico Bartolini & Aristide Mingozzi, 2011. "An Exact Algorithm for the Pickup and Delivery Problem with Time Windows," Operations Research, INFORMS, vol. 59(2), pages 414-426, April.
    19. World Bank & UNHCR, 2021. "The Global Cost of Inclusive Refugee Education," World Bank Publications - Reports 35238, The World Bank Group.
    20. Wei Qi & Lefei Li & Sheng Liu & Zuo-Jun Max Shen, 2018. "Shared Mobility for Last-Mile Delivery: Design, Operational Prescriptions, and Environmental Impact," Manufacturing & Service Operations Management, INFORMS, vol. 20(4), pages 737-751, October.
    21. Mitrovic-Minic, Snezana & Krishnamurti, Ramesh & Laporte, Gilbert, 2004. "Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(8), pages 669-685, September.
    22. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2014. "A unified solution framework for multi-attribute vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 234(3), pages 658-673.
    23. Ansari, Sina & Başdere, Mehmet & Li, Xiaopeng & Ouyang, Yanfeng & Smilowitz, Karen, 2018. "Advancements in continuous approximation models for logistics and transportation systems: 1996–2016," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 229-252.
    24. Christos D. Tarantilis & Afroditi K. Anagnostopoulou & Panagiotis P. Repoussis, 2013. "Adaptive Path Relinking for Vehicle Routing and Scheduling Problems with Product Returns," Transportation Science, INFORMS, vol. 47(3), pages 356-379, August.
    25. Jean-François Cordeau, 2006. "A Branch-and-Cut Algorithm for the Dial-a-Ride Problem," Operations Research, INFORMS, vol. 54(3), pages 573-586, June.
    26. Figliozzi, Miguel Andres, 2007. "Analysis of the efficiency of urban commercial vehicle tours: Data collection, methodology, and policy implications," Transportation Research Part B: Methodological, Elsevier, vol. 41(9), pages 1014-1032, November.
    27. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    28. Rieck, Julia & Ehrenberg, Carsten & Zimmermann, Jürgen, 2014. "Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery," European Journal of Operational Research, Elsevier, vol. 236(3), pages 863-878.
    29. Stefan Ropke & Jean-François Cordeau, 2009. "Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 43(3), pages 267-286, August.
    30. Michael Schneider & Michael Drexl, 2017. "A survey of the standard location-routing problem," Annals of Operations Research, Springer, vol. 259(1), pages 389-414, December.
    31. Drexl, Michael & Schneider, Michael, 2015. "A survey of variants and extensions of the location-routing problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 283-308.
    32. Qiang Yang & Patrick Weigelt & Trevor S. Fristoe & Zhijie Zhang & Holger Kreft & Anke Stein & Hanno Seebens & Wayne Dawson & Franz Essl & Christian König & Bernd Lenzner & Jan Pergl & Robin Pouteau & , 2021. "The global loss of floristic uniqueness," Nature Communications, Nature, vol. 12(1), pages 1-10, December.
    33. Nanry, William P. & Wesley Barnes, J., 2000. "Solving the pickup and delivery problem with time windows using reactive tabu search," Transportation Research Part B: Methodological, Elsevier, vol. 34(2), pages 107-121, February.
    34. Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2020. "Integrating first-mile pickup and last-mile delivery on shared vehicle routes for efficient urban e-commerce distribution," Transportation Research Part B: Methodological, Elsevier, vol. 131(C), pages 26-62.
    35. L. J. J. van der Bruggen & J. K. Lenstra & P. C. Schuur, 1993. "Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 27(3), pages 298-311, August.
    36. Anna Franceschetti & Ola Jabali & Gilbert Laporte, 2017. "Rejoinder on: Continuous approximation models in freight distribution management," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(3), pages 443-444, October.
    37. Luis E C Rocha & Petter Holme & Claudio D G Linhares, 2022. "The global migration network of sex-workers," Journal of Computational Social Science, Springer, vol. 5(1), pages 969-985, May.
    38. David M. Stein, 1978. "An Asymptotic, Probabilistic Analysis of a Routing Problem," Mathematics of Operations Research, INFORMS, vol. 3(2), pages 89-101, May.
    39. Daganzo, Carlos F., 1984. "The length of tours in zones of different shapes," Transportation Research Part B: Methodological, Elsevier, vol. 18(2), pages 135-145, April.
    40. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    41. Anna Franceschetti & Ola Jabali & Gilbert Laporte, 2017. "Continuous approximation models in freight distribution management," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(3), pages 413-433, October.
    42. Martin Savelsbergh & Marc Sol, 1998. "Drive: Dynamic Routing of Independent Vehicles," Operations Research, INFORMS, vol. 46(4), pages 474-490, August.
    43. Marius M. Solomon & Jacques Desrosiers, 1988. "Survey Paper---Time Window Constrained Routing and Scheduling Problems," Transportation Science, INFORMS, vol. 22(1), pages 1-13, February.
    44. Matthias Winkenbach & Paul R. Kleindorfer & Stefan Spinler, 2016. "Enabling Urban Logistics Services at La Poste through Multi-Echelon Location-Routing," Transportation Science, INFORMS, vol. 50(2), pages 520-540, May.
    45. Margaretha Gansterer & Murat Küçüktepe & Richard F. Hartl, 2017. "The multi-vehicle profitable pickup and delivery problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 303-319, January.
    46. Paolo Toth & Daniele Vigo, 1997. "Heuristic Algorithms for the Handicapped Persons Transportation Problem," Transportation Science, INFORMS, vol. 31(1), pages 60-71, February.
    47. Robuste, Francesc & Daganzo, Carlos F. & Souleyrette, Reginald R., 1990. "Implementing vehicle routing models," Transportation Research Part B: Methodological, Elsevier, vol. 24(4), pages 263-286, August.
    48. S Salhi & G Nagy, 1999. "A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(10), pages 1034-1042, October.
    49. Lu, Quan & Dessouky, Maged M., 2006. "A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 175(2), pages 672-687, December.
    50. Carlos F. Daganzo, 1984. "The Distance Traveled to Visit N Points with a Maximum of C Stops per Vehicle: An Analytic Model and an Application," Transportation Science, INFORMS, vol. 18(4), pages 331-350, November.
    51. M. W. P. Savelsbergh & M. Sol, 1995. "The General Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 29(1), pages 17-29, February.
    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. Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2020. "Integrating first-mile pickup and last-mile delivery on shared vehicle routes for efficient urban e-commerce distribution," Transportation Research Part B: Methodological, Elsevier, vol. 131(C), pages 26-62.
    2. Liu, Ran & Xie, Xiaolan & Augusto, Vincent & Rodriguez, Carlos, 2013. "Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care," European Journal of Operational Research, Elsevier, vol. 230(3), pages 475-486.
    3. Liu, Mengyang & Luo, Zhixing & Lim, Andrew, 2015. "A branch-and-cut algorithm for a realistic dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 267-288.
    4. Janjevic, Milena & Merchán, Daniel & Winkenbach, Matthias, 2021. "Designing multi-tier, multi-service-level, and multi-modal last-mile distribution networks for omni-channel operations," European Journal of Operational Research, Elsevier, vol. 294(3), pages 1059-1077.
    5. Hou, Liwen & Li, Dong & Zhang, Dali, 2018. "Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 143-162.
    6. Diana, Marco & Dessouky, Maged M., 2004. "A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(6), pages 539-557, July.
    7. Andrew Lim & Zhenzhen Zhang & Hu Qin, 2017. "Pickup and Delivery Service with Manpower Planning in Hong Kong Public Hospitals," Transportation Science, INFORMS, vol. 51(2), pages 688-705, May.
    8. Mahmoudi, Monirehalsadat & Zhou, Xuesong, 2016. "Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 19-42.
    9. Hua, Shijia & Zeng, Wenjia & Liu, Xinglu & Qi, Mingyao, 2022. "Optimality-guaranteed algorithms on the dynamic shared-taxi problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    10. Merchán, Daniel & Winkenbach, Matthias & Snoeck, André, 2020. "Quantifying the impact of urban road networks on the efficiency of local trips," Transportation Research Part A: Policy and Practice, Elsevier, vol. 135(C), pages 38-62.
    11. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 1-31, July.
    12. Fontaine, Pirmin & Minner, Stefan & Schiffer, Maximilian, 2023. "Smart and sustainable city logistics: Design, consolidation, and regulation," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1071-1084.
    13. Z. Al Chami & H. Manier & M.-A. Manier, 2019. "A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands," Annals of Operations Research, Springer, vol. 273(1), pages 237-255, February.
    14. Mahmoudi, Monirehalsadat & Chen, Junhua & Shi, Tie & Zhang, Yongxiang & Zhou, Xuesong, 2019. "A cumulative service state representation for the pickup and delivery problem with transfers," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 351-380.
    15. Cortés, Cristián E. & Matamala, Martín & Contardo, Claudio, 2010. "The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method," European Journal of Operational Research, Elsevier, vol. 200(3), pages 711-724, February.
    16. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    17. Ertan Yakıcı & Robert F. Dell & Travis Hartman & Connor McLemore, 2018. "Daily aircraft routing for amphibious ready groups," Annals of Operations Research, Springer, vol. 264(1), pages 477-498, May.
    18. Yuan Qu & Jonathan F. Bard, 2015. "A Branch-and-Price-and-Cut Algorithm for Heterogeneous Pickup and Delivery Problems with Configurable Vehicle Capacity," Transportation Science, INFORMS, vol. 49(2), pages 254-270, May.
    19. Garaix, Thierry & Artigues, Christian & Feillet, Dominique & Josselin, Didier, 2010. "Vehicle routing problems with alternative paths: An application to on-demand transportation," European Journal of Operational Research, Elsevier, vol. 204(1), pages 62-75, July.
    20. Lu, Quan & Dessouky, Maged M., 2006. "A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 175(2), pages 672-687, December.

    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:311:y:2023:i:1:p:88-111. 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.