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

Scheduling heterogeneous delivery tasks on a mixed logistics platform

Author

Listed:
  • Zhen, Lu
  • Baldacci, Roberto
  • Tan, Zheyi
  • Wang, Shuaian
  • Lyu, Junyan

Abstract

Large e-commerce retailers usually establish their own logistics systems. Such systems make use of their own dedicated fleets but will also use a crowdsourced delivery mode by hiring occasional fleets. These mixed logistics systems with both dedicated and occasional fleets serve both retailers’ internal delivery tasks and external tasks requested by local businesses. This paper studies the problem of scheduling heterogeneous (internal and external) delivery tasks on a mixed logistics platform with multiple depots and two types of vehicles (dedicated and occasional). A delivery task is executed by either a dedicated vehicle or an occasional vehicle. The dedicated vehicles depart from and return to the platform's depots; the occasional vehicles depart from their original location and pick up goods from depots or external pickup locations, fulfill the delivery tasks, and finish their route at the final delivery location. We propose mixed integer programming models and column generation-based solution methods to solve the problem. A computational study is conducted based on a series of randomly generated instances and real-world instances involving 15 depots, 120 internal customers, 15 external delivery tasks, and 38 dedicated and occasional vehicles. The results obtained demonstrate the efficiency of the column generation-based solution methods. Moreover, the effectiveness of the proposed models is validated by a significant cost saving in comparison to intuitive decision rules. A sensitivity analysis is also conducted to derive a number of managerial implications.

Suggested Citation

  • Zhen, Lu & Baldacci, Roberto & Tan, Zheyi & Wang, Shuaian & Lyu, Junyan, 2022. "Scheduling heterogeneous delivery tasks on a mixed logistics platform," European Journal of Operational Research, Elsevier, vol. 298(2), pages 680-698.
  • Handle: RePEc:eee:ejores:v:298:y:2022:i:2:p:680-698
    DOI: 10.1016/j.ejor.2021.06.057
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.ejor.2021.06.057?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. Dimitris Bertsimas & Patrick Jaillet, & Sébastien Martin, 2019. "Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications," Operations Research, INFORMS, vol. 67(1), pages 143-162, January.
    2. Gilbert Laporte & François Louveaux & Hélène Mercure, 1992. "The Vehicle Routing Problem with Stochastic Travel Times," Transportation Science, INFORMS, vol. 26(3), pages 161-170, August.
    3. 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.
    4. Azi, Nabila & Gendreau, Michel & Potvin, Jean-Yves, 2010. "An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles," European Journal of Operational Research, Elsevier, vol. 202(3), pages 756-763, May.
    5. 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.
    6. Rahma Lahyani & Anne-Lise Gouguenheim & Leandro C. Coelho, 2019. "A hybrid adaptive large neighbourhood search for multi-depot open vehicle routing problems," International Journal of Production Research, Taylor & Francis Journals, vol. 57(22), pages 6963-6976, November.
    7. Roberto Baldacci & Aristide Mingozzi & Roberto Roberti, 2011. "New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem," Operations Research, INFORMS, vol. 59(5), pages 1269-1283, October.
    8. Eduardo Lalla-Ruiz & Christopher Expósito-Izquierdo & Shervin Taheripour & Stefan Voß, 2016. "An improved formulation for the multi-depot open vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(1), pages 175-187, January.
    9. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    10. Hanafi, Saïd & Mansini, Renata & Zanotti, Roberto, 2020. "The multi-visit team orienteering problem with precedence constraints," European Journal of Operational Research, Elsevier, vol. 282(2), pages 515-529.
    11. Sun, Peng & Veelenturf, Lucas P. & Hewitt, Mike & Van Woensel, Tom, 2018. "The time-dependent pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 1-24.
    12. Roberto Baldacci & Aristide Mingozzi & Roberto Roberti & Roberto Wolfler Calvo, 2013. "An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem," Operations Research, INFORMS, vol. 61(2), pages 298-314, April.
    13. George B. Dantzig & Philip Wolfe, 1960. "Decomposition Principle for Linear Programs," Operations Research, INFORMS, vol. 8(1), pages 101-111, February.
    14. Alnaggar, Aliaa & Gzara, Fatma & Bookbinder, James H., 2021. "Crowdsourced delivery: A review of platforms and academic literature," Omega, Elsevier, vol. 98(C).
    15. Kalayci, Can B. & Kulak, Osman & Günther, Hans-Otto, 2015. "A perturbation based variable neighborhood search heuristic for solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery with Time LimitAuthor-Name: Polat, Olcay," European Journal of Operational Research, Elsevier, vol. 242(2), pages 369-382.
    16. Shen, Chan & Sun, Yao & Bai, Zijian & Cui, Hongjun, 2021. "Real-time customized bus routes design with optimal passenger and vehicle matching based on column generation algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 571(C).
    17. 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.
    18. Li, Yuan & Chen, Haoxun & Prins, Christian, 2016. "Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests," European Journal of Operational Research, Elsevier, vol. 252(1), pages 27-38.
    19. Wolfinger, David & Salazar-González, Juan-José, 2021. "The Pickup and Delivery Problem with Split Loads and Transshipments: A Branch-and-Cut Solution Approach," European Journal of Operational Research, Elsevier, vol. 289(2), pages 470-484.
    20. 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.
    21. Rosario Paradiso & Roberto Roberti & Demetrio Laganá & Wout Dullaert, 2020. "An Exact Solution Framework for Multitrip Vehicle-Routing Problems with Time Windows," Operations Research, INFORMS, vol. 68(1), pages 180-198, January.
    22. Dimitrakos, T.D. & Kyriakidis, E.G., 2015. "A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order," European Journal of Operational Research, Elsevier, vol. 244(3), pages 990-993.
    23. 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.
    24. Gilbert Laporte, 2009. "Fifty Years of Vehicle Routing," Transportation Science, INFORMS, vol. 43(4), pages 408-416, November.
    25. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    26. Riera-Ledesma, Jorge & Salazar-González, Juan José, 2017. "Solving the Team Orienteering Arc Routing Problem with a column generation approach," European Journal of Operational Research, Elsevier, vol. 262(1), pages 14-27.
    27. Yang, Hai & Qin, Xiaoran & Ke, Jintao & Ye, Jieping, 2020. "Optimizing matching time interval and matching radius in on-demand ride-sourcing markets," Transportation Research Part B: Methodological, Elsevier, vol. 131(C), pages 84-105.
    28. Casazza, Marco & Ceselli, Alberto & Wolfler Calvo, Roberto, 2021. "A route decomposition approach for the single commodity Split Pickup and Split Delivery Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 289(3), pages 897-911.
    29. Kai Wang & Lu Zhen & Shuaian Wang, 2018. "Column Generation for the Integrated Berth Allocation, Quay Crane Assignment, and Yard Assignment Problem," Transportation Science, INFORMS, vol. 52(4), pages 812-834, August.
    30. Sun, Peng & Veelenturf, Lucas P. & Hewitt, Mike & Van Woensel, Tom, 2020. "Adaptive large neighborhood search for the time-dependent profitable pickup and delivery problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 138(C).
    31. Gansterer, Margaretha & Hartl, Richard F., 2018. "Collaborative vehicle routing: A survey," European Journal of Operational Research, Elsevier, vol. 268(1), pages 1-12.
    32. 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.
    33. Aziez, Imadeddine & Côté, Jean-François & Coelho, Leandro C., 2020. "Exact algorithms for the multi-pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 284(3), pages 906-919.
    34. Fazi, Stefano & Fransoo, Jan C. & Van Woensel, Tom & Dong, Jing-Xin, 2020. "A variant of the split vehicle routing problem with simultaneous deliveries and pickups for inland container shipping in dry-port based systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    35. Tresoldi, Emanuele & Malucelli, Federico & Nonato, Maddalena, 2021. "A personalized walking bus service requiring optimized route decisions: A real case," European Journal of Operational Research, Elsevier, vol. 289(3), pages 855-866.
    36. Yao, Yu & Zhu, Xiaoning & Dong, Hongyu & Wu, Shengnan & Wu, Hailong & Carol Tong, Lu & Zhou, Xuesong, 2019. "ADMM-based problem decomposition scheme for vehicle routing problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 156-174.
    37. Diego Pecin & Claudio Contardo & Guy Desaulniers & Eduardo Uchoa, 2017. "New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 489-502, August.
    38. Véronique François & Yasemin Arda & Yves Crama, 2019. "Adaptive Large Neighborhood Search for Multitrip Vehicle Routing with Time Windows," Transportation Science, INFORMS, vol. 53(6), pages 1706-1730, November.
    39. Gábor Nagy & Niaz A. Wassan & M. Grazia Speranza & Claudia Archetti, 2015. "The Vehicle Routing Problem with Divisible Deliveries and Pickups," Transportation Science, INFORMS, vol. 49(2), pages 271-294, May.
    40. 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.
    41. M. M. Vazifeh & P. Santi & G. Resta & S. H. Strogatz & C. Ratti, 2018. "Addressing the minimum fleet problem in on-demand urban mobility," Nature, Nature, vol. 557(7706), pages 534-538, May.
    42. 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. Keartisak Sriprateep & Rapeepan Pitakaso & Surajet Khonjun & Thanatkij Srichok & Peerawat Luesak & Sarayut Gonwirat & Chutchai Kaewta & Monika Kosacka-Olejnik & Prem Enkvetchakul, 2024. "Multi-Objective Optimization of Resilient, Sustainable, and Safe Urban Bus Routes for Tourism Promotion Using a Hybrid Reinforcement Learning Algorithm," Mathematics, MDPI, vol. 12(14), pages 1-35, July.
    2. Lena Hörsting & Catherine Cleophas, 2023. "Integrating Micro-Depot Freight Transport in Existing Public Transport Services," SN Operations Research Forum, Springer, vol. 4(3), pages 1-35, 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. Borzou Rostami & Guy Desaulniers & Fausto Errico & Andrea Lodi, 2021. "Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times," Operations Research, INFORMS, vol. 69(2), pages 436-455, March.
    2. 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.
    3. Yu Zhang & Zhenzhen Zhang & Andrew Lim & Melvyn Sim, 2021. "Robust Data-Driven Vehicle Routing with Time Windows," Operations Research, INFORMS, vol. 69(2), pages 469-485, March.
    4. Aderemi Oluyinka Adewumi & Olawale Joshua Adeleke, 2018. "A survey of recent advances in vehicle routing problems," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(1), pages 155-172, February.
    5. 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.
    6. Yang, Yu & Yan, Chiwei & Cao, Yufeng & Roberti, Roberto, 2023. "Planning robust drone-truck delivery routes under road traffic uncertainty," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1145-1160.
    7. Jiliu Li & Zhixing Luo & Roberto Baldacci & Hu Qin & Zhou Xu, 2023. "A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 31-49, January.
    8. Lu, Jiawei & Nie, Qinghui & Mahmoudi, Monirehalsadat & Ou, Jishun & Li, Chongnan & Zhou, Xuesong Simon, 2022. "Rich arc routing problem in city logistics: Models and solution algorithms using a fluid queue-based time-dependent travel time representation," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 143-182.
    9. Sun, Yanshuo & Chen, Zhi-Long & Zhang, Lei, 2020. "Nonprofit peer-to-peer ridesharing optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    10. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    11. Ostermeier, Manuel, 2024. "The supply of convenience stores: Challenges of short-distance routing within the constraints of working time regulations," European Journal of Operational Research, Elsevier, vol. 314(3), pages 997-1012.
    12. 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.
    13. Yiming Liu & Yang Yu & Yu Zhang & Roberto Baldacci & Jiafu Tang & Xinggang Luo & Wei Sun, 2023. "Branch-Cut-and-Price for the Time-Dependent Green Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 14-30, January.
    14. Yang, Senyan & Ning, Lianju & Shang, Pan & (Carol) Tong, Lu, 2020. "Augmented Lagrangian relaxation approach for logistics vehicle routing problem with mixed backhauls and time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 135(C).
    15. Nicolas Rincon-Garcia & Ben J. Waterson & Tom J. Cherrett, 2018. "Requirements from vehicle routing software: perspectives from literature, developers and the freight industry," Transport Reviews, Taylor & Francis Journals, vol. 38(1), pages 117-138, January.
    16. Qie He & Stefan Irnich & Yongjia Song, 2018. "Branch-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs," Working Papers 1804, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    17. Dayarian, Iman & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2015. "A column generation approach for a multi-attribute vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 241(3), pages 888-906.
    18. Zu-Jun Ma & Fei Yang & Ying Dai & Zuo-Jun Max Shen, 2021. "The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 319-335, January.
    19. You, Jintao & Wang, Yuan & Xue, Zhaojie, 2023. "An exact algorithm for the multi-trip container drayage problem with truck platooning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(C).
    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:298:y:2022:i:2:p:680-698. 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.