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

An exact algorithm for the multi-trip container drayage problem with truck platooning

Author

Listed:
  • You, Jintao
  • Wang, Yuan
  • Xue, Zhaojie

Abstract

Container Drayage Problem (CDP) refers to the optimization problem of routing and scheduling a set of container trucks around a container terminal. Conventionally, a driver is stuck to one container truck and allowed to perform multiple trips (multi-trip) to the terminal within their working time. The recent development of automation technologies enables semi-autonomous trucks to follow the leading human-driven truck as a platoon on the road; therefore, truck platooning can save human labor and reduce the fuel cost of following trucks through aerodynamic drag reduction. In this paper, we study a multi-trip container drayage problem with truck platooning (MT-CDP-TP), where multi-trip, truck platooning, and fuel cost reduction are simultaneously considered in a CDP. Despite the operational benefits brought by the MT-CDP-TP, the problem is challenging to solve due to its NP-hardness when formulated as a multi-trip pickup and delivery problem with load-dependent cost. We propose a Branch-and-Price-and-Cut (BPC) algorithm, with a route-based set partitioning model and tight linear relaxations, to yield the exact solutions. Valid inequalities are generated based on a graph structure, where each node represents a feasible route, and each arc stands for the conflict between two routes. Moreover, we design a tailored pulse propagation algorithm with novel pruning procedures based on the dual information from the master problem and valid inequalities to solve the pricing problem efficiently. Extensive numerical experiments are conducted for performance validation, and the computational results show that the proposed exact algorithm can solve instances with up to 100 task nodes (i.e., 50 customers) and facilitate reducing the labor cost and fuel consumption by a wide margin in container drayage operations.

Suggested Citation

  • 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).
    • Handle: RePEc:eee:transe:v:175:y:2023:i:c:s1366554523001266
    DOI: 10.1016/j.tre.2023.103138
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554523001266
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2023.103138?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. Xue, Zhaojie & Zhang, Canrong & Lin, Wei-Hua & Miao, Lixin & Yang, Peng, 2014. "A tabu search heuristic for the local container drayage problem under a new operation mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 136-150.
    3. Xue, Zhaojie & Lin, Hui & You, Jintao, 2021. "Local container drayage problem with truck platooning mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    4. Martin Desrochers & Jacques Desrosiers & Marius Solomon, 1992. "A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 40(2), pages 342-354, April.
    5. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2016. "Vehicle routing problems with multiple trips," 4OR, Springer, vol. 14(3), pages 223-259, September.
    6. Wenyi Chen & Martijn Mes & Marco Schutten & Job Quint, 2019. "A Ride-Sharing Problem with Meeting Points and Return Restrictions," Transportation Science, INFORMS, vol. 53(2), pages 401-426, March.
    7. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2016. "The Multi-Trip Vehicle Routing Problem with Time Windows and Release Dates," Transportation Science, INFORMS, vol. 50(2), pages 676-693, May.
    8. 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.
    9. Jula, Hossein & Dessouky, Maged & Ioannou, Petros & Chassiakos, Anastasios, 2005. "Container movement by trucks in metropolitan networks: modeling and optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 41(3), pages 235-259, May.
    10. Matteo Fischetti & Paolo Toth, 1989. "An Additive Bounding Procedure for Combinatorial Optimization Problems," Operations Research, INFORMS, vol. 37(2), pages 319-328, April.
    11. Coslovich, Luca & Pesenti, Raffaele & Ukovich, Walter, 2006. "Minimizing fleet operating costs for a container transportation company," European Journal of Operational Research, Elsevier, vol. 171(3), pages 776-786, June.
    12. Azi, Nabila & Gendreau, Michel & Potvin, Jean-Yves, 2007. "An exact algorithm for a single-vehicle routing problem with time windows and multiple routes," European Journal of Operational Research, Elsevier, vol. 178(3), pages 755-766, May.
    13. Albert H. Schrotenboer & Evrim Ursavas & Iris F. A. Vis, 2019. "A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 53(4), pages 1001-1022, July.
    14. 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.
    15. Karla L. Hoffman & Manfred Padberg, 1993. "Solving Airline Crew Scheduling Problems by Branch-and-Cut," Management Science, INFORMS, vol. 39(6), pages 657-682, June.
    16. 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.
    17. Leonardo Lozano & Daniel Duque & Andrés L. Medaglia, 2016. "An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints," Transportation Science, INFORMS, vol. 50(1), pages 348-357, February.
    18. 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.
    19. Bhoopalam, Anirudh Kishore & Agatz, Niels & Zuidwijk, Rob, 2018. "Planning of truck platoons: A literature review and directions for future research," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 212-228.
    20. Samuel Pelletier & Ola Jabali & Gilbert Laporte, 2016. "50th Anniversary Invited Article—Goods Distribution with Electric Vehicles: Review and Research Perspectives," Transportation Science, INFORMS, vol. 50(1), pages 3-22, February.
    21. You, Jintao & Miao, Lixin & Zhang, Canrong & Xue, Zhaojie, 2020. "A generic model for the local container drayage problem using the emerging truck platooning operation mode," Transportation Research Part B: Methodological, Elsevier, vol. 133(C), pages 181-209.
    22. Macharis, C. & Bontekoning, Y. M., 2004. "Opportunities for OR in intermodal freight transport research: A review," European Journal of Operational Research, Elsevier, vol. 153(2), pages 400-416, March.
    23. Aristide Mingozzi & Roberto Roberti & Paolo Toth, 2013. "An Exact Algorithm for the Multitrip Vehicle Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 193-207, May.
    24. Zhixing Luo & Hu Qin & Wenbin Zhu & Andrew Lim, 2017. "Branch and Price and Cut for the Split-Delivery Vehicle Routing Problem with Time Windows and Linear Weight-Related Cost," Transportation Science, INFORMS, vol. 51(2), pages 668-687, May.
    25. Zhang, Ruiyou & Yun, Won Young & Moon, Il Kyeong, 2011. "Modeling and optimization of a container drayage problem with resource constraints," International Journal of Production Economics, Elsevier, vol. 133(1), pages 351-359, September.
    26. Boysen, Nils & Briskorn, Dirk & Schwerdfeger, Stefan, 2018. "The identical-path truck platooning problem," Transportation Research Part B: Methodological, Elsevier, vol. 109(C), pages 26-39.
    27. Song, Yujian & Zhang, Jiantong & Liang, Zhe & Ye, Chunming, 2017. "An exact algorithm for the container drayage problem under a separation mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 231-254.
    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. You, Jintao & Miao, Lixin & Zhang, Canrong & Xue, Zhaojie, 2020. "A generic model for the local container drayage problem using the emerging truck platooning operation mode," Transportation Research Part B: Methodological, Elsevier, vol. 133(C), pages 181-209.
    2. Chen, Rui & Meng, Qiang & Jia, Peng, 2022. "Container port drayage operations and management: Past and future," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    3. Yan, Xiaoyuan & Xu, Min & Xie, Chi, 2023. "Local container drayage problem with improved truck platooning operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 169(C).
    4. Cui, Haipeng & Chen, Shukai & Chen, Rui & Meng, Qiang, 2022. "A two-stage hybrid heuristic solution for the container drayage problem with trailer reposition," European Journal of Operational Research, Elsevier, vol. 299(2), pages 468-482.
    5. Xue, Zhaojie & Lin, Hui & You, Jintao, 2021. "Local container drayage problem with truck platooning mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    6. 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.
    7. Huang, Nan & Li, Jiliu & Zhu, Wenbin & Qin, Hu, 2021. "The multi-trip vehicle routing problem with time windows and unloading queue at depot," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    8. Chen, Rui & Jia, Shuai & Meng, Qiang, 2023. "Dynamic container drayage booking and routing decision support approach for E-commerce platforms," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    9. Jia, Shuai & Cui, Haipeng & Chen, Rui & Meng, Qiang, 2022. "Dynamic container drayage with uncertain request arrival times and service time windows," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 237-258.
    10. Bustos-Coral, Daniel & Costa, Alysson M., 2022. "Drayage routing with heterogeneous fleet, compatibility constraints, and truck load configurations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    11. Hernandez, Florent & Feillet, Dominique & Giroudeau, Rodolphe & Naud, Olivier, 2016. "Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 249(2), pages 551-559.
    12. Martin Wölck & Stephan Meisel, 2022. "Branch-and-Price Approaches for Real-Time Vehicle Routing with Picking, Loading, and Soft Time Windows," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2192-2211, July.
    13. Benantar, A. & Abourraja, M.N. & Boukachour, J. & Boudebous, D. & Duvallet, C., 2020. "On the integration of container availability constraints into daily drayage operations arising in France: Modelling and optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    14. Escudero-Santana, Alejandro & Muñuzuri, Jesús & Cortés, Pablo & Onieva, Luis, 2021. "The one container drayage problem with soft time windows," Research in Transportation Economics, Elsevier, vol. 90(C).
    15. Chen, Shukai & Wang, Hua & Meng, Qiang, 2021. "Autonomous truck scheduling for container transshipment between two seaport terminals considering platooning and speed optimization," Transportation Research Part B: Methodological, Elsevier, vol. 154(C), pages 289-315.
    16. Cheng, Chun & Adulyasak, Yossiri & Rousseau, Louis-Martin, 2020. "Drone routing with energy function: Formulation and exact algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 364-387.
    17. Song, Yujian & Zhang, Jiantong & Liang, Zhe & Ye, Chunming, 2017. "An exact algorithm for the container drayage problem under a separation mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 231-254.
    18. 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.
    19. Xue, Zhaojie & Zhang, Canrong & Lin, Wei-Hua & Miao, Lixin & Yang, Peng, 2014. "A tabu search heuristic for the local container drayage problem under a new operation mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 136-150.
    20. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2018. "Vehicle routing problems with multiple trips," Annals of Operations Research, Springer, vol. 271(1), pages 127-159, 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:transe:v:175:y:2023:i:c:s1366554523001266. 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.