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

A multi-round exchange mechanism for carrier collaboration in less than truckload transportation

Author

Listed:
  • Lyu, Xiaohui
  • Chen, Haoxun
  • Wang, Nengmin
  • Yang, Zhen

Abstract

We propose an iterative request exchange mechanism to solve carrier collaboration in less than truckload transportation. In each iteration, each carrier first provides multiple bundles of requests to offer and their corresponding transfer payments. Each carrier then determines which bundles of requests to acquire from one or multiple carriers. Multiple bundles of requests can be exchanged among carriers in each iteration. In each round of the auction, each carrier updates its outsourcing bundles of requests based on the feedback information from previous iterations. Numerical experiments show that this multi-round exchange mechanism provides 11.80% more profit compared to other mechanisms.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:transe:v:129:y:2019:i:c:p:38-59
    DOI: 10.1016/j.tre.2019.07.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554518312250
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2019.07.004?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. 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.
    2. Aleksandar Pekev{c} & Michael H. Rothkopf, 2003. "Combinatorial Auction Design," Management Science, INFORMS, vol. 49(11), pages 1485-1503, November.
    3. 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.
    4. Yossi Sheffi, 2004. "Combinatorial Auctions in the Procurement of Transportation Services," Interfaces, INFORMS, vol. 34(4), pages 245-252, August.
    5. 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.
    6. 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.
    7. Richard Li-Yang Chen & Shervin AhmadBeygi & Amy Cohn & Damian R. Beil & Amitabh Sinha, 2009. "Solving Truckload Procurement Auctions Over an Exponential Number of Bundles," Transportation Science, INFORMS, vol. 43(4), pages 493-510, November.
    8. Song, Jiongjiong & Regan, A C, 2003. "An Auction Based Collaborative Carrier Network," University of California Transportation Center, Working Papers qt2g88d8vc, University of California Transportation Center.
    9. Song, Jiongjiong & Regan, Amelia, 2005. "Approximation algorithms for the bid construction problem in combinatorial auctions for the procurement of freight transportation contracts," Transportation Research Part B: Methodological, Elsevier, vol. 39(10), pages 914-933, December.
    10. Chang, Tsung-Sheng, 2009. "Decision support for truckload carriers in one-shot combinatorial auctions," Transportation Research Part B: Methodological, Elsevier, vol. 43(5), pages 522-541, June.
    11. Wang, Xin & Kopfer, Herbert & Gendreau, Michel, 2014. "Operational transportation planning of freight forwarding companies in horizontal coalitions," European Journal of Operational Research, Elsevier, vol. 237(3), pages 1133-1141.
    12. Li, Junsong & Rong, Gang & Feng, Yiping, 2015. "Request selection and exchange approach for carrier collaboration based on auction of a single request," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 84(C), pages 23-39.
    13. 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.
    14. 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.
    15. Gansterer, Margaretha & Hartl, Richard F., 2018. "Collaborative vehicle routing: A survey," European Journal of Operational Research, Elsevier, vol. 268(1), pages 1-12.
    16. Richa Agarwal & Özlem Ergun, 2010. "Network Design and Allocation Mechanisms for Carrier Alliances in Liner Shipping," Operations Research, INFORMS, vol. 58(6), pages 1726-1742, December.
    17. Park, Sunju & Rothkopf, Michael H., 2005. "Auctions with bidder-determined allowable combinations," European Journal of Operational Research, Elsevier, vol. 161(2), pages 399-415, March.
    18. Okan Örsan Özener & Özlem Ergun & Martin Savelsbergh, 2011. "Lane-Exchange Mechanisms for Truckload Carrier Collaboration," Transportation Science, INFORMS, vol. 45(1), pages 1-17, February.
    19. Huang, George Q. & Xu, Su Xiu, 2013. "Truthful multi-unit transportation procurement auctions for logistics e-marketplaces," Transportation Research Part B: Methodological, Elsevier, vol. 47(C), pages 127-148.
    20. Lori Houghtalen & Özlem Ergun & Joel Sokol, 2011. "Designing Mechanisms for the Management of Carrier Alliances," Transportation Science, INFORMS, vol. 45(4), pages 465-482, November.
    21. Berger, Susanne & Bierwirth, Christian, 2010. "Solutions to the request reassignment problem in collaborative carrier networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(5), pages 627-638, September.
    22. Chen, Haoxun, 2016. "Combinatorial clock-proxy exchange for carrier collaboration in less than truck load transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 91(C), pages 152-172.
    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. Guo, Chaojie & Thompson, Russell G. & Foliente, Greg & Kong, Xiang T.R., 2021. "An auction-enabled collaborative routing mechanism for omnichannel on-demand logistics through transshipment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 146(C).
    2. Shejun Deng & Yingying Yuan & Yong Wang & Haizhong Wang & Charles Koll, 2020. "Collaborative multicenter logistics delivery network optimization with resource sharing," PLOS ONE, Public Library of Science, vol. 15(11), pages 1-31, November.
    3. Ni, Linglin & Wang, Xiaokun, 2021. "Load factors of less-than-truckload delivery tours: An analysis with operation data," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 150(C).
    4. Kong, Xiang T.R. & Kang, Kai & Zhong, Ray Y. & Luo, Hao & Xu, Su Xiu, 2021. "Cyber physical system-enabled on-demand logistics trading," International Journal of Production Economics, Elsevier, vol. 233(C).
    5. Baṣak Altan & Okan Örsan Özener, 2021. "A Game Theoretical Approach for Improving the Operational Efficiencies of Less-than-truckload Carriers Through Load Exchanges," Networks and Spatial Economics, Springer, vol. 21(3), pages 547-579, September.
    6. Yu, Hao & Huang, Min & Chao, Xiuli & Yue, Xiaohang, 2022. "Truthful multi-attribute multi-unit double auctions for B2B e-commerce logistics service transactions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    7. Soriano, Adria & Gansterer, Margaretha & Hartl, Richard F., 2023. "The multi-depot vehicle routing problem with profit fairness," International Journal of Production Economics, Elsevier, vol. 255(C).
    8. Soriano, Adria & Gansterer, Margaretha & Hartl, Richard F., 2022. "Reprint of: The multi-depot vehicle routing problem with profit fairness," International Journal of Production Economics, Elsevier, vol. 250(C).
    9. Los, Johan & Schulte, Frederik & Spaan, Matthijs T.J. & Negenborn, Rudy R., 2020. "The value of information sharing for platform-based collaborative vehicle routing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    10. Cheng, Lihong & Guo, Xiaolong & Li, Xiaoxiao & Yu, Yugang, 2022. "Data-driven ordering and transshipment decisions for online retailers and logistics service providers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    11. Margaretha Gansterer & Richard F. Hartl, 2020. "Shared resources in collaborative vehicle routing," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(1), pages 1-20, April.

    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. Lafkihi, Mariam & Pan, Shenle & Ballot, Eric, 2019. "Freight transportation service procurement: A literature review and future research opportunities in omnichannel E-commerce," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 348-365.
    2. 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.
    3. Gansterer, Margaretha & Hartl, Richard F. & Sörensen, Kenneth, 2020. "Pushing frontiers in auction-based transport collaborations," Omega, Elsevier, vol. 94(C).
    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. Gansterer, Margaretha & Hartl, Richard F. & Savelsbergh, Martin, 2020. "The value of information in auction-based carrier collaborations," International Journal of Production Economics, Elsevier, vol. 221(C).
    6. Nassim Mrabti & Nadia Hamani & Laurent Delahoche, 2022. "A Comprehensive Literature Review on Sustainable Horizontal Collaboration," Sustainability, MDPI, vol. 14(18), pages 1-38, September.
    7. Hammami, Farouk & Rekik, Monia & Coelho, Leandro C., 2019. "Exact and heuristic solution approaches for the bid construction problem in transportation procurement auctions with a heterogeneous fleet," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 150-177.
    8. Minghui Lai & Weili Xue & Qian Hu, 2019. "An Ascending Auction for Freight Forwarder Collaboration in Capacity Sharing," Transportation Science, INFORMS, vol. 53(4), pages 1175-1195, July.
    9. Hammami, Farouk & Rekik, Monia & Coelho, Leandro C., 2021. "Exact and hybrid heuristic methods to solve the combinatorial bid construction problem with stochastic prices in truckload transportation services procurement auctions," Transportation Research Part B: Methodological, Elsevier, vol. 149(C), pages 204-229.
    10. 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.
    11. Su Xiu Xu & George Q. Huang & Meng Cheng, 2017. "Truthful, Budget-Balanced Bundle Double Auctions for Carrier Collaboration," Transportation Science, INFORMS, vol. 51(4), pages 1365-1386, November.
    12. 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.
    13. Baṣak Altan & Okan Örsan Özener, 2021. "A Game Theoretical Approach for Improving the Operational Efficiencies of Less-than-truckload Carriers Through Load Exchanges," Networks and Spatial Economics, Springer, vol. 21(3), pages 547-579, September.
    14. Xu, Su Xiu & Huang, George Q., 2013. "Transportation service procurement in periodic sealed double auctions with stochastic demand and supply," Transportation Research Part B: Methodological, Elsevier, vol. 56(C), pages 136-160.
    15. Margaretha Gansterer & Richard F. Hartl, 2018. "Centralized bundle generation in auction-based collaborative transportation," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(3), pages 613-635, July.
    16. Richard Li-Yang Chen & Shervin AhmadBeygi & Amy Cohn & Damian R. Beil & Amitabh Sinha, 2009. "Solving Truckload Procurement Auctions Over an Exponential Number of Bundles," Transportation Science, INFORMS, vol. 43(4), pages 493-510, November.
    17. Margaretha Gansterer & Richard F. Hartl & Sarah Wieser, 2021. "Assignment constraints in shared transportation services," Annals of Operations Research, Springer, vol. 305(1), pages 513-539, October.
    18. Kuyzu, Gültekin & Akyol, Çağla Gül & Ergun, Özlem & Savelsbergh, Martin, 2015. "Bid price optimization for truckload carriers in simultaneous transportation procurement auctions," Transportation Research Part B: Methodological, Elsevier, vol. 73(C), pages 34-58.
    19. Ziebuhr, Mario & Kopfer, Herbert, 2016. "Solving an integrated operational transportation planning problem with forwarding limitations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 87(C), pages 149-166.
    20. Yu, Hao & Huang, Min & Chao, Xiuli & Yue, Xiaohang, 2022. "Truthful multi-attribute multi-unit double auctions for B2B e-commerce logistics service transactions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).

    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:129:y:2019:i:c:p:38-59. 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.