0
Views
0
CrossRef citations to date
0
Altmetric
Research Article

Column generation for the collaborative multi-stop truckload shipping problem in daily regional distribution

, , &
Received 02 Sep 2023, Accepted 02 Jul 2024, Published online: 17 Jul 2024

References

  • Adenso-Díaz, B., S. Lozano, and P. Moreno. 2013. “Analysis of the Synergies of Merging Multi-Company Transportation Needs.” Transportmetrica A: Transport Science 10 (6): 533–547. https://doi.org/10.1080/23249935.2013.797518.
  • Ahuja, Ravindra K., Kurt Mehlhorn, James Orlin, and Robert E. Tarjan. 1990. “Faster Algorithms for the Shortest Path Problem.” Journal of the ACM 37 (2): 213–223. https://doi.org/10.1145/77600.77615.
  • Aloui, Aymen, Nadia Hamani, Ridha Derrouiche, and Laurent Delahoche. 2021. “Systematic Literature Review on Collaborative Sustainable Transportation: Overview, Analysis and Perspectives.” Transportation Research Interdisciplinary Perspectives 9:100291. https://doi.org/10.1016/j.trip.2020.100291.
  • Amap. n.d. “Route Planning API Document.” Amap.com. Accessed December 10, 2022. https://lbs.amap.com/api/webservice/guide/api/direction.
  • Atefi, Reza, Majid Salari, Leandro C. Coelho, and Jacques Renaud. 2018. “The Open Vehicle Routing Problem with Decoupling Points.” European Journal of Operational Research 265 (1): 316–327. https://doi.org/10.1016/j.ejor.2017.07.033.
  • Baldacci, Roberto, Enrico Bartolini, and Aristide Mingozzi. 2011. “An Exact Algorithm for the Pickup and Delivery Problem with Time Windows.” Operations Research 59 (2): 414–426. https://doi.org/10.1287/opre.1100.0881.
  • Basso, Franco, Sophie D'Amours, Mikael Rönnqvist, and Andrés Weintraub. 2019. “A Survey on Obstacles and Difficulties of Practical Implementation of Horizontal Collaboration in Logistics.” International Transactions in Operational Research 26 (3): 775–793. https://doi.org/10.1111/itor.12577.
  • Beliën, Jeroen, Robert Boute, Stefan Creemers, Philippe De Bruecker, Joren Gijsbrechts, Silvia Valeria Padilla Tinoco, and Wouter Verheyen. 2017. “Collaborative Shipping: Logistics in the Sharing Economy.” ORMS Today 44 (2): 20–23. https://doi.org/10.1287/orms.2017.02.01.
  • Berger, Susanne, and Christian Bierwirth. 2010. “Solutions to the Request Reassignment Problem in Collaborative Carrier Networks.” Transportation Research Part E: Logistics and Transportation Review46 (5): 627–638. https://doi.org/10.1016/j.tre.2009.12.006.
  • Bertsekas, Dimitri P. 1993. “A Simple and Fast Label Correcting Algorithm for Shortest Paths.” Networks23 (8): 703–709. https://doi.org/10.1002/net.3230230808.
  • Bombelli, Alessandro, and Stefano Fazi. 2022. “The Ground Handler Dock Capacitated Pickup and Delivery Problem with Time Windows: A Collaborative Framework for Air Cargo Operations.” Transportation Research Part E: Logistics and Transportation Review 159:102603. https://doi.org/10.1016/j.tre.2022.102603.
  • Buriol, Luciana S., Mauricio G. C. Resende, and Mikkel Thorup. 2008. “Speeding Up Dynamic Shortest-Path Algorithms.” INFORMS Journal on Computing 20 (2): 191–204. https://doi.org/10.1287/ijoc.1070.0231.
  • Caplice, Chris. 2007. “Electronic Markets for Truckload Transportation.” Production and Operations Management 16 (4): 423–436. https://doi.org/10.1111/j.1937-5956.2007.tb00270.x.
  • Capstone Logistics. n.d. “Ride-Sharing for Freight: Is Co-Loading Right for Your Business?” Capstone Logistics, LLC. Accessed January 10, 2022. https://www.capstonelogistics.com/blog/ride-sharing-for-freight-is-co-loading-right-for-your-business/.
  • Chabot, Thomas, Florence Bouchard, Ariane Legault-Michaud, Jacques Renaud, and Leandro C. Coelho. 2018. “Service Level, Cost and Environmental Optimization of Collaborative Transportation.” Transportation Research Part E: Logistics and Transportation Review 110:1–14. https://doi.org/10.1016/j.tre.2017.11.008.
  • Chen, Haoxun. 2016. “Combinatorial Clock-Proxy Exchange for Carrier Collaboration in Less Than Truck Load Transportation.” Transportation Research Part E: Logistics and Transportation Review91:152–172. https://doi.org/10.1016/j.tre.2016.04.008.
  • Chen, Xiaojia Amy, and Shanglin Tsai. 2016. “Multi-Stop Trucking: Understanding the True Impact.” Supply Chain Management Review, August 3, 2016. https://www.scmr.com/article/multi_stop_trucking_understanding_the_true_impact.
  • Cherkesly, Marilène, and Timo Gschwind. 2022. “The Pickup and Delivery Problem with Time Windows, Multiple Stacks, and Handling Operations.” European Journal of Operational Research 301 (2): 647–666. https://doi.org/10.1016/j.ejor.2021.11.021.
  • Costa, Luciano, Claudio Contardo, and Guy Desaulniers. 2019. “Exact Branch-Price-and-Cut Algorithms for Vehicle Routing.” Transportation Science 53 (4): 946–985. https://doi.org/10.1287/trsc.2018.0878.
  • Coyote Logistics. n.d. “Multi-Stop Freight: Deliver to Every Facility, Every Time.” Coyote. Accessed May 10, 2023. https://coyote.com/ship-freight/services/multi-stop/.
  • Creemers, Stefan, Gert Woumans, Robert Boute, and Jeroen Beliën. 2017. “Tri-Vizor Uses an Efficient Algorithm to Identify Collaborative Shipping Opportunities.” Interfaces 47 (3): 244–259. https://doi.org/10.1287/inte.2016.0878.
  • Dai, Bo, Haoxun Chen, and Genke Yang. 2014. “Price-Setting Based Combinatorial Auction Approach for Carrier Collaboration with Pickup and Delivery Requests.” Operational Research 14 (3): 361–386. https://doi.org/10.1007/s12351-014-0141-1.
  • Deppon Express. 2022. Service Price Quote Information. Deppon Logistics Co., Ltd. Accessed August 10, 2022. https://www.deppon.com/newwebsite/mail/price.
  • Desaulniers, Guy, Jacques Desrosiers, and Marius M. Solomon. 2006. Column Generation, GERAD 25th Anniversary Series 5. New York, NY: Springer.
  • Desrochers, Martin, and François Soumis. 1988. “A Generalized Permanent Labelling Algorithm for the Shortest Path Problem with Time Windows.” INFOR: Information Systems and Operational Research26 (3): 191–212. https://doi.org/10.1080/03155986.1988.11732063.
  • Erera, Alan, Michael Hewitt, Martin Savelsbergh, and Yang Zhang. 2013. “Improved Load Plan Design Through Integer Programming Based Local Search.” Transportation Science 47 (3): 412–427. https://doi.org/10.1287/trsc.1120.0441.
  • Farvaresh, Hamid, and Samira Shahmansouri. 2020. “A Coalition Structure Algorithm for Large-Scale Collaborative Pickup and Delivery Problem.” Computers & Industrial Engineering 149:106737. https://doi.org/10.1016/j.cie.2020.106737.
  • Feillet, Dominique, Pierre Dejax, Michel Gendreau, and Cyrille Gueguen. 2004. “An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints: Application to Some Vehicle Routing Problems.” Networks: An International Journal 44 (3): 216–229. https://doi.org/10.1002/net.20033.
  • Ferrell, William, Kimberly Ellis, Phil Kaminsky, and Chase Rainwater. 2020. “Horizontal Collaboration: Opportunities for Improved Logistics Planning.” International Journal of Production Research 58 (14): 4267–4284. https://doi.org/10.1080/00207543.2019.1651457.
  • Gansterer, Margaretha, and Richard F. Hartl. 2018a. “Centralized Bundle Generation in Auction-Based Collaborative Transportation.” OR Spectrum 40 (3): 613–635. https://doi.org/10.1007/s00291-018-0516-4.
  • Gansterer, Margaretha, and Richard F. Hartl. 2018b. “Collaborative Vehicle Routing: A Survey.” European Journal of Operational Research 268 (1): 1–12. https://doi.org/10.1016/j.ejor.2017.10.023.
  • Gansterer, Margaretha, and Richard F. Hartl. 2020. “Shared Resources in Collaborative Vehicle Routing.” TOP 28 (1): 1–20. https://doi.org/10.1007/s11750-020-00541-6.
  • Gansterer, Margaretha, Richard F. Hartl, and Kenneth Sörensen. 2020. “Pushing Frontiers in Auction-Based Transport Collaborations.” Omega 94:102042. https://doi.org/10.1016/j.omega.2019.01.011.
  • Gansterer, Margaretha, Richard F. Hartl, and Sarah Wieser. 2021. “Assignment Constraints in Shared Transportation Services.” Annals of Operations Research 305 (1-2): 513–539. https://doi.org/10.1007/s10479-020-03522-x.
  • Ghilas, Veaceslav, Jean-François Cordeau, Emrah Demir, and Tom Van Woensel. 2018. “Branch-and-Price for the Pickup and Delivery Problem with Time Windows and Scheduled Lines.” Transportation Science 52 (5): 1191–1210. https://doi.org/10.1287/trsc.2017.0798.
  • Gleditsch, Marte D., Kristine Hagen, Henrik Andersson, Steffen J. Bakker, and Kjetil Fagerholt. 2022. “A Column Generation Heuristic for the Dynamic Bicycle Rebalancing Problem.” European Journal of Operational Research 317 (3): 762–775. https://doi.org/10.1016/j.ejor.2022.07.004.
  • Glover, Fred. 1996. “Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems.” Discrete Applied Mathematics 65 (1-3): 223–253. https://doi.org/10.1016/0166-218X(94)00037-E.
  • Hernández, Salvador, and Srinivas Peeta. 2014. “A Carrier Collaboration Problem for Less-Than-Truckload Carriers: Characteristics and Carrier Collaboration Model.” Transportmetrica A: Transport Science 10 (4): 327–349. https://doi.org/10.1080/23249935.2013.766279.
  • Innovate. n.d. “TRI-VIZOR: The World'S First Cross Supply Chain Orchestrator.” Global Village Ventures LLC. Accessed December 10, 2021. https://innovationsoftheworld.com/tri-vizor-the-worlds-first-cross-supply-chain-orchestrator/.
  • Jarrah, Ahmad I., Ellis Johnson, and Lucas C. Neubert. 2009. “Large-Scale, Less-Than-Truckload Service Network Design.” Operations Research 57 (3): 609–625. https://doi.org/10.1287/opre.1080.0587.
  • Lai, Minghui, Yating Wu, and Xiaoqiang Cai. 2024. “Core-Based Cost Allocation for Collaborative Multi-Stop Truckload Shipping Problem.” IISE Transactions 1–19. (Online). https://doi.org/10.1080/24725854.2024.2324358.
  • Liang, Zhe, Fan Xiao, Xiongwen Qian, Lei Zhou, Xianfei Jin, Xuehua Lu, and Sureshan Karichery. 2018. “A Column Generation-Based Heuristic for Aircraft Recovery Problem with Airport Capacity Constraints and Maintenance Flexibility.” Transportation Research Part B: Methodological 113:70–90. https://doi.org/10.1016/j.trb.2018.05.007.
  • Liu, Jialin, Rui Jiang, Xingang Li, Bin Jia, Zheng Liu, and Marouane Bouadi. 2022. “Lane-Based Multi-Class Vehicle Collaborative Evacuation Management.” Transportmetrica B: Transport Dynamics10 (1): 184–206. https://doi.org/10.1080/21680566.2021.1985008.
  • Liu, Dan, Pengyu Yan, Zhenghong Deng, Yinhai Wang, and Evangelos I. Kaisar. 2020. “Collaborative Intermodal Freight Transport Network Design and Vehicle Arrangement with Applications in the Oil and Gas Drilling Equipment Industry.” Transportmetrica A: Transport Science 16 (3): 1574–1603. https://doi.org/10.1080/23249935.2020.1758235.
  • Los, Johan, Frederik Schulte, Margaretha Gansterer, Richard F. Hartl, Matthijs T. J. Spaan, and Rudy R. Negenborn. 2022. “Large-Scale Collaborative Vehicle Routing.” Annals of Operations Research 1–33. (Online). https://doi.org/10.1007/s10479-021-04504-3.
  • Lozano, Leonardo, Daniel Duque, and Andrés L. Medaglia. 2016. “An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints.” Transportation Science 50 (1): 348–357. https://doi.org/10.1002/net.20033.
  • Lozano, Leonardo, and Andrés L. Medaglia. 2013. “On an Exact Method for the Constrained Shortest Path Problem.” Computers & Operations Research 40 (1): 378–384. https://doi.org/10.1016/j.cor.2012.07.008.
  • Luan, Jianlin, Nicolò Daina, Kristian Hegner Reinau, Aruna Sivakumar, and John W. Polak. 2022. “A Data-Based Opportunity Identification Engine for Collaborative Freight Logistics Based on a Trailer Capacity Graph.” Expert Systems with Applications 210:118494. https://doi.org/10.1016/j.eswa.2022.118494.
  • Luenberger, David G., and Yinyu Ye. 2015. Linear and Nonlinear Programming. 3rd ed., International Series in Operations Research & Management Science 228, New York, NY: Springer.
  • Lyu, Xiaohui, Haoxun Chen, Nengmin Wang, and Zhen Yang. 2019. “A Multi-Round Exchange Mechanism for Carrier Collaboration in Less Than Truckload Transportation.” Transportation Research Part E: Logistics and Transportation Review 129:38–59. https://doi.org/10.1016/j.tre.2019.07.004.
  • MercuryGate. n.d. “Multi-Stop.” MercuryGate. Accessed May 10, 2023. https://mercurygate.com/glossary/multi-stop/.
  • Mersmann, Olaf, Bernd Bischl, Jakob Bossek, Heike Trautmann, Markus Wagner, and Frank Neumann. 2012. “Local Search and The Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness.” In Learning and Intelligent Optimization. LION 2012, edited by Y. Hamadi and M. Schoenauer, 115–129. Paris, France: Springer.
  • Nallian. 2018. “Clusters 2.0: Open Network of Hyper Connected Logistics Clusters Towards Physical Internet.” CLUSTERS 2.0. Accessed March 10, 2022. http://www.clusters20.eu/wp-content/uploads/2018/11/Newsletter-3-Final-.pdf.
  • Nguyen, H. N., C. E. Rainwater, S. J. Mason, and E. A. Pohl. 2014. “Quantity Discount with Freight Consolidation.” Transportation Research Part E: Logistics and Transportation Review 66:66–82. https://doi.org/10.1016/j.tre.2014.03.004.
  • Padmanabhan, Bhavya, Nathan Huynh, William Ferrell, and Vishal Badyal. 2022. “Potential Benefits of Carrier Collaboration in Vehicle Routing Problem with Pickup and Delivery.” Transportation Letters14 (3): 258–273. https://doi.org/10.1080/19427867.2020.1852506.
  • Parsa, Payam, Manuel Rossetti, and Shengfan Zhang. 2017. “Multi Stop Truckload Planning.” In Proceedings of the 2017 Industrial and Systems Engineering Conference, edited by K. Coperich, E. Cudney, and H. Nembhard, 1276–1281. Norcross, GA: Institute of Industrial & Systems Engineers (IISE).
  • Redwood Logistics. 2023. “What You Really Need to Make Your Multi-Stops More Efficient.” Redwood. Accessed May 10, 2023. https://www.redwoodlogistics.com/what-you-really-need-to-make-your-multi-stops-more-efficient/.
  • Righini, Giovanni, and Matteo Salani. 2006. “Symmetry Helps: Bounded Bi-Directional Dynamic Programming for the Elementary Shortest Path Problem with Resource Constraints.” Discrete Optimization 3 (3): 255–273. https://doi.org/10.1016/j.disopt.2006.05.007.
  • Robinson, C. H. 2016. “Assessing the 5 Biggest LTL Savings Opportunities.” C.H. Robinson Worldwide, Inc. Accessed March 10, 2022. https://www.chrobinson.com/en-US/Resources/White-Papers/.
  • Robinson, C. H. 2017. Multi-Stop Trucking: How It Affects Load Acceptance and Pricing and What You Can Do about It? C.H. Robinson Worldwide, Inc. Accessed March 10, 2022. https://www.mytmc.com/en-us/resources/white-papers/.
  • Ropke, Stefan, and Jean-François Cordeau. 2009. “Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows.” Transportation Science 43 (3): 267–286. https://doi.org/10.1287/trsc.1090.0272.
  • Rüther, Cornelius, and Julia Rieck. 2022. “Bundle Selection Approaches for Collaborative Practical-Oriented Pickup and Delivery Problems.” EURO Journal on Transportation and Logistics11:100087. https://doi.org/10.1016/j.ejtl.2022.100087.
  • Schrotenboer, Albert H., Evrim Ursavas, and Iris F. A. Vis. 2019. “A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems.” Transportation Science 53 (4): 1001–1022. https://doi.org/10.1287/trsc.2018.0880.
  • Sheu, Jiuh-Biing, and Cheng Pan. 2015. “Relief Supply Collaboration for Emergency Logistics Responses to Large-Scale Disasters.” Transportmetrica A: Transport Science 11 (3): 210–242. https://doi.org/10.1080/23249935.2014.951886.
  • Soriano, Adria, Margaretha Gansterer, and Richard F. Hartl. 2018. “The Two-Region Multi-Depot Pickup and Delivery Problem.” OR Spectrum 40 (4): 1077–1108. https://doi.org/10.1007/s00291-018-0534-2.
  • Taherian, H. 2014. “All You Need to Know about Co-Loadings.” Inbound Logistics. Accessed March 10, 2022. https://www.inboundlogistics.com/cms/article/all-you-need-to-know-about-co-loading/.
  • Tilk, Christian, Ann-Kathrin Rothenbächer, Timo Gschwind, and Stefan Irnich. 2017. “Asymmetry Matters: Dynamic Half-Way Points in Bidirectional Labeling for Solving Shortest Path Problems with Resource Constraints Faster.” European Journal of Operational Research 261 (2): 530–539. https://doi.org/10.1016/j.ejor.2017.03.017.
  • TRI-VIZOR. 2023. “Services & References.” TRI-VIZOR. Accessed May 10, 2023. https://trivizor.com/services/.
  • Vanovermeire, Christine, and Kenneth Sörensen. 2014. “Integration of the Cost Allocation in the Optimization of Collaborative Bundling.” Transportation Research Part E: Logistics and Transportation Review 72 (2): 125–143. https://doi.org/10.1016/j.tre.2014.09.009.
  • Vanovermeire, Christine, Kenneth Sörensen, Alex Van Breedam, Bart Vannieuwenhuyse, and Sven Verstrepen. 2014. “Horizontal Logistics Collaboration: Decreasing Costs Through Flexibility and an Adequate Cost Allocation Strategy.” International Journal of Logistics Research and Applications 17 (4): 339–355. https://doi.org/10.1080/13675567.2013.865719.
  • Vaziri, Sh., F. Etebari, and B. Vahdani. 2019. “Development and Optimization of a Horizontal Carrier Collaboration Vehicle Routing Model with Multi-Commodity Request Allocation.” Journal of Cleaner Production 224:492–505. https://doi.org/10.1016/j.jclepro.2019.02.043.
  • Verheyen, Wouter, and Philippe De Bruecker. 2020. “Automated SME Cargo Bundling as a Tool to Reduce Transaction Costs While Limiting the Platform's Liability Exposure.” In Maritime Supply Chains, edited by Thierry Vanelslander and Christa Sys, 167–204. Amsterdam, Netherlands: Elsevier.
  • Wang, Xin, and Herbert Kopfer. 2014. “Collaborative Transportation Planning of Less-Than-Truckload Freight: A Route-Based Request Exchange Mechanism.” OR Spectrum 36 (2): 357–380. https://doi.org/10.1007/s00291-013-0331-x.
  • Wang, Xin, Herbert Kopfer, and Michel Gendreau. 2014. “Operational Transportation Planning of Freight Forwarding Companies in Horizontal Coalitions.” European Journal of Operational Research 237 (3): 1133–1141. https://doi.org/10.1016/j.ejor.2014.02.056.
  • Wang, Yong, Shouguo Peng, Chengcheng Xu, Kevin Assogba, Haizhong Wang, Maozeng Xu, and Yinhai Wang. 2018a. “Two-Echelon Logistics Delivery and Pickup Network Optimization Based on Integrated Cooperation and Transportation Fleet Sharing.” Expert Systems with Applications113:44–65. https://doi.org/10.1016/j.eswa.2018.06.037.
  • Wang, Yong, Yingying Yuan, Kevin Assogba, Ke Gong, Haizhong Wang, Maozeng Xu, and Yinhai Wang. 2018b. “Design and Profit Allocation in Two-Echelon Heterogeneous Cooperative Logistics Network Optimization.” Journal of Advanced Transportation 160 (15): 296–310. https://doi.org/10.1155/2018/4607493.
  • Wang, Yong, Jie Zhang, Kevin Assogba, Yong Liu, Maozeng Xu, and Yinhai Wang. 2018c. “Collaboration and Transportation Resource Sharing in Multiple Centers Vehicle Routing Optimization with Delivery and Pickup.” Knowledge-Based Systems 160:296–310. https://doi.org/10.1016/j.knosys.2018.07.024.
  • Willis, Neal. 2016. “What is the Difference between FTL and LTL.” Kuehne + Nagel. Accessed March 20, 2024. https://www.re-transfreight.com/blog/what-is-the-difference-between-ftl-and-ltl.
  • Yunmanman. 2018. Yunmanman Technology Data Contest. JiangSu ManYun Software Technology Co., Ltd. Accessed January 10, 2022. http://ymmtech.ymm56.com.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.