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

A less-than-truckload carrier collaboration planning problem under dynamic capacities

Author

Listed:
  • Hernández, Salvador
  • Peeta, Srinivas
  • Kalafatas, George

Abstract

This paper addresses the deterministic dynamic single carrier collaboration problem for the small- to medium-sized less-than-truckload (LTL) industry. It is formulated as a binary (0–1) multi-commodity minimum cost flow problem and solved using a branch-and-cut algorithm. Its inherent network structure is exploited to generate the lower bounds to the branch-and-cut algorithm using the network simplex method and by relaxing the integrality constraints. Results from numerical experiments indicate inherent trade-offs at the higher degrees of collaboration between waiting for more affordable collaborative capacity and incurring higher holding costs. They also suggest that collaborating LTL carriers experience increased capacity utilization.

Suggested Citation

  • Hernández, Salvador & Peeta, Srinivas & Kalafatas, George, 2011. "A less-than-truckload carrier collaboration planning problem under dynamic capacities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 933-946.
    • Handle: RePEc:eee:transe:v:47:y:2011:i:6:p:933-946
    DOI: 10.1016/j.tre.2011.03.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S136655451100038X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2011.03.001?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. Kawamura, Kazuya, 1999. "Commercial Vehicle Value of Time and Perceived Benefit of Congestion Pricing," University of California Transportation Center, Working Papers qt4pz727p6, University of California Transportation Center.
    2. Richa Agarwal & Özlem Ergun, 2008. "Ship Scheduling and Network Design for Cargo Routing in Liner Shipping," Transportation Science, INFORMS, vol. 42(2), pages 175-196, May.
    3. M A Krajewska & H Kopfer & G Laporte & S Ropke & G Zaccour, 2008. "Horizontal cooperation among freight carriers: request allocation and profit sharing," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(11), pages 1483-1491, November.
    4. 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.
    5. Golob, Thomas F. & Regan, Amelia C., 2001. "Impacts of highway congestion on freight operations: perceptions of trucking industry managers," Transportation Research Part A: Policy and Practice, Elsevier, vol. 35(7), pages 577-599, August.
    6. John J. Bartholdi & Kevin R. Gue, 2000. "Reducing Labor Costs in an LTL Crossdocking Terminal," Operations Research, INFORMS, vol. 48(6), pages 823-832, December.
    7. Raymond K. Cheung & B. Muralidharan, 2000. "Dynamic Routing for Priority Shipments in LTL Service Networks," Transportation Science, INFORMS, vol. 34(1), pages 86-98, February.
    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. Buijs, Paul & Vis, Iris F.A. & Carlo, Héctor J., 2014. "Synchronization in cross-docking networks: A research classification and framework," European Journal of Operational Research, Elsevier, vol. 239(3), pages 593-608.
    2. 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.
    3. Zhang, Hongtao & Lee, Chung-Yee & Li, Tian, 2016. "The value of specific cargo information for substitutable modes of inland transport," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 85(C), pages 23-39.
    4. Gansterer, Margaretha & Hartl, Richard F., 2018. "Collaborative vehicle routing: A survey," European Journal of Operational Research, Elsevier, vol. 268(1), pages 1-12.
    5. Zhang, Qihuan & Wang, Ziteng & Huang, Min & Yu, Yang & Fang, Shu-Cherng, 2022. "Heterogeneous multi-depot collaborative vehicle routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 160(C), pages 1-20.
    6. Ching-Hui Tang, 2018. "Two-stage stochastic modeling of transportation outsourcing plans for transshipment centers," 4OR, Springer, vol. 16(1), pages 67-94, March.
    7. Tamvada, Srinivas Subramanya & Mansouri, Bahareh & Hassini, Elkafi & Pribytkov, Theodore, 2021. "An integer programming model and directed Steiner-forest based heuristic for routing less-than-truckload freight," International Journal of Production Economics, Elsevier, vol. 232(C).
    8. Agrell, Per J. & Lundin, Johan & Norrman, Andreas, 2017. "Supply Chain Management: Horizontal carrier coordination through cooperative governance structures," International Journal of Production Economics, Elsevier, vol. 194(C), pages 59-72.
    9. Lai, Minghui & Cai, Xiaoqiang & Hu, Qian, 2017. "An iterative auction for carrier collaboration in truckload pickup and delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 107(C), pages 60-80.
    10. Guo, Yuhan & Yu, Junyu & Allaoui, Hamid & Choudhary, Alok, 2022. "Lateral collaboration with cost-sharing in sustainable supply chain optimisation: A combinatorial framework," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 157(C).
    11. Brekalo, Lisa & Albers, Sascha, 2015. "Effective logistics alliance design and management," Working Paper Series 113, University of Cologne, Department of Business Policy and Logistics.
    12. Jianfeng Zheng & Ziyou Gao & Dong Yang & Zhuo Sun, 2015. "Network Design and Capacity Exchange for Liner Alliances with Fixed and Variable Container Demands," Transportation Science, INFORMS, vol. 49(4), pages 886-899, November.
    13. Wei, Hairui & Lee, Paul Tae-Woo, 2021. "Designing a coordinated horizontal alliance system for China’s inland ports with China railway express platforms along the Silk Road Economic Belt," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    14. Lai, Minghui & Cai, Xiaoqiang & Li, Xiang, 2017. "Mechanism design for collaborative production-distribution planning with shipment consolidation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 137-159.
    15. Lyu, Xiaohui & Chen, Haoxun & Wang, Nengmin & Yang, Zhen, 2019. "A multi-round exchange mechanism for carrier collaboration in less than truckload transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 129(C), pages 38-59.
    16. Shuvomoy Das Gupta & Lacra Pavel, 2019. "On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems," Journal of Global Optimization, Springer, vol. 74(3), pages 523-548, July.
    17. Margaretha Gansterer & Richard F. Hartl, 2016. "Request evaluation strategies for carriers in auction-based collaborations," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(1), pages 3-23, January.

    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. Al Hajj Hassan, Lama & Hewitt, Mike & Mahmassani, Hani S., 2022. "Daily load planning under different autonomous truck deployment scenarios," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).
    2. Agrell, Per J. & Lundin, Johan & Norrman, Andreas, 2017. "Supply Chain Management: Horizontal carrier coordination through cooperative governance structures," International Journal of Production Economics, Elsevier, vol. 194(C), pages 59-72.
    3. Bektaş, Tolga & Ehmke, Jan Fabian & Psaraftis, Harilaos N. & Puchinger, Jakob, 2019. "The role of operational research in green freight transportation," European Journal of Operational Research, Elsevier, vol. 274(3), pages 807-823.
    4. Yiting Xing & Ling Li & Zhuming Bi & Marzena Wilamowska‐Korsak & Li Zhang, 2013. "Operations Research (OR) in Service Industries: A Comprehensive Review," Systems Research and Behavioral Science, Wiley Blackwell, vol. 30(3), pages 300-353, May.
    5. Dung-Ying Lin & Chien-Chih Huang & ManWo Ng, 2017. "The coopetition game in international liner shipping," Maritime Policy & Management, Taylor & Francis Journals, vol. 44(4), pages 474-495, May.
    6. Moussawi-Haidar, Lama & Nasr, Walid & Jalloul, Maya, 2021. "Standardized cargo network revenue management with dual channels under stochastic and time-dependent demand," European Journal of Operational Research, Elsevier, vol. 295(1), pages 275-291.
    7. Wang, Shuaian & Meng, Qiang, 2012. "Liner ship route schedule design with sea contingency time and port time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 615-633.
    8. Mario Guajardo & Kurt Jörnsten & Mikael Rönnqvist, 2016. "Constructive and blocking power in collaborative transportation," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(1), pages 25-50, January.
    9. Asghari, Mohammad & Jaber, Mohamad Y. & Mirzapour Al-e-hashem, S.M.J., 2023. "Coordinating vessel recovery actions: Analysis of disruption management in a liner shipping service," European Journal of Operational Research, Elsevier, vol. 307(2), pages 627-644.
    10. Gansterer, Margaretha & Hartl, Richard F. & Sörensen, Kenneth, 2020. "Pushing frontiers in auction-based transport collaborations," Omega, Elsevier, vol. 94(C).
    11. Dan Liu & Zhenghong Deng & Qipeng Sun & Yong Wang & Yinhai Wang, 2019. "Design and Freight Corridor-Fleet Size Choice in Collaborative Intermodal Transportation Network Considering Economies of Scale," Sustainability, MDPI, vol. 11(4), pages 1-19, February.
    12. Lars M. Hvattum & Arne Løkketangen & Gilbert Laporte, 2006. "Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic," Transportation Science, INFORMS, vol. 40(4), pages 421-438, November.
    13. 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.
    14. Meng, Qiang & Lee, Chung-Yee, 2016. "Liner container assignment model with transit-time-sensitive container shipment demand and its applicationsAuthor-Name: Wang, Shuaian," Transportation Research Part B: Methodological, Elsevier, vol. 90(C), pages 135-155.
    15. Luca Zamparini & Aura Reggiani, 2007. "Freight Transport and the Value of Travel Time Savings: A Meta‐analysis of Empirical Studies," Transport Reviews, Taylor & Francis Journals, vol. 27(5), pages 621-636, March.
    16. Guericke, Stefan & Tierney, Kevin, 2015. "Liner shipping cargo allocation with service levels and speed optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 84(C), pages 40-60.
    17. SteadieSeifi, M. & Dellaert, N.P. & Nuijten, W. & Van Woensel, T., 2017. "A metaheuristic for the multimodal network flow problem with product quality preservation and empty repositioning," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 321-344.
    18. Santini, Alberto & Plum, Christian E.M. & Ropke, Stefan, 2018. "A branch-and-price approach to the feeder network design problem," European Journal of Operational Research, Elsevier, vol. 264(2), pages 607-622.
    19. Golob, Thomas F. & Regan, A C, 2003. "Traffic Congestion and Trucking Managers' Use of Automated Routing and Scheduling," University of California Transportation Center, Working Papers qt74z234n4, University of California Transportation Center.
    20. Michael F. Gorman & John-Paul Clarke & Amir Hossein Gharehgozli & Michael Hewitt & René de Koster & Debjit Roy, 2014. "State of the Practice: A Review of the Application of OR/MS in Freight Transportation," Interfaces, INFORMS, vol. 44(6), pages 535-554, 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:47:y:2011:i:6:p:933-946. 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.