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

Combinatorial clock-proxy exchange for carrier collaboration in less than truck load transportation

Author

Listed:
  • Chen, Haoxun

Abstract

A carrier collaboration problem in less-than-truck load transportation is considered, where multiple carriers exchange their pickup and delivery requests in order to improve their operational efficiency. We extend the clock-proxy auction proposed by Ausubel et al. (2006) to a combinatorial clock-proxy exchange for the problem. This mechanism combines the price discovery of the clock exchange designed based on Lagrangian relaxation with the efficiency of the proxy exchange determined based on the information observed in the clock phase. Numerical experiments on randomly generated instances demonstrate the necessity of the proxy phase and the effectiveness of the clock-proxy exchange.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:transe:v:91:y:2016:i:c:p:152-172
    DOI: 10.1016/j.tre.2016.04.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554515302738
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2016.04.008?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. Triki, Chefi & Oprea, Simona & Beraldi, Patriza & Crainic, Teodor Gabriel, 2014. "The stochastic bid generation problem in combinatorial transportation auctions," European Journal of Operational Research, Elsevier, vol. 236(3), pages 991-999.
    2. Myerson, Roger B. & Satterthwaite, Mark A., 1983. "Efficient mechanisms for bilateral trading," Journal of Economic Theory, Elsevier, vol. 29(2), pages 265-281, April.
    3. 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.
    4. Pellegrini, Paola & Castelli, Lorenzo & Pesenti, Raffaele, 2012. "Secondary trading of airport slots as a combinatorial exchange," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(5), pages 1009-1022.
    5. A. Mochon & Y. Saez & J. Gómez-Barroso & P. Isasi, 2011. "The Clock Proxy Auction for Allocating Radio Spectrum Licenses," Computational Economics, Springer;Society for Computational Economics, vol. 37(4), pages 411-431, April.
    6. Cruijssen, Frans & Cools, Martine & Dullaert, Wout, 2007. "Horizontal cooperation in logistics: Opportunities and impediments," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 43(2), pages 129-142, March.
    7. Karla Hoffman & Dinesh Menon, 2010. "A Practical Combinatorial Clock Exchange for Spectrum Licenses," Decision Analysis, INFORMS, vol. 7(1), pages 58-77, March.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. Goel, Asvin & Gruhn, Volker, 2008. "A General Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 191(3), pages 650-660, December.
    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. 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.
    2. Kangye Tan & Fang Xu & Xiaozhao Fang & Chunsheng Li, 2023. "Research on Location Selection for Urban Networks of Less-than-Truckload Express Enterprises Based on Improved Immune Optimization Algorithm," Mathematics, MDPI, vol. 11(6), pages 1-20, March.
    3. Nuraiman, Dian & Ozlen, Melih & Hearne, John, 2020. "A spatial decomposition based math-heuristic approach to the asset protection problem," Operations Research Perspectives, Elsevier, vol. 7(C).
    4. 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.
    5. Nassim Mrabti & Nadia Hamani & Laurent Delahoche, 2022. "A Comprehensive Literature Review on Sustainable Horizontal Collaboration," Sustainability, MDPI, vol. 14(18), pages 1-38, September.
    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. 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.
    8. Margaretha Gansterer & Richard F. Hartl, 2021. "The Prisoners’ Dilemma in collaborative carriers’ request selection," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(1), pages 73-87, March.
    9. 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.
    10. Shao, Saijun & Xu, Su Xiu & Huang, George Q., 2020. "Variable neighborhood search and tabu search for auction-based waste collection synchronization," Transportation Research Part B: Methodological, Elsevier, vol. 133(C), pages 1-20.
    11. Gansterer, Margaretha & Hartl, Richard F., 2018. "Collaborative vehicle routing: A survey," European Journal of Operational Research, Elsevier, vol. 268(1), pages 1-12.
    12. 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.
    13. 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.

    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. Kangye Tan & Fang Xu & Xiaozhao Fang & Chunsheng Li, 2023. "Research on Location Selection for Urban Networks of Less-than-Truckload Express Enterprises Based on Improved Immune Optimization Algorithm," Mathematics, MDPI, vol. 11(6), pages 1-20, March.
    2. 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.
    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. 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.
    6. 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.
    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. Fernández, Elena & Roca-Riu, Mireia & Speranza, M. Grazia, 2018. "The Shared Customer Collaboration Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 265(3), pages 1078-1093.
    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. Scherr, Yannick Oskar & Gansterer, Margaretha & Hartl, Richard F., 2024. "Request acceptance with overbooking in dynamic and collaborative vehicle routing," European Journal of Operational Research, Elsevier, vol. 314(2), pages 612-629.
    11. 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).
    12. 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.
    13. 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).
    14. Jacob, Jonathan & Buer, Tobias, 2016. "Impact of Non-truthful Bidding on Transport Coalition Profits," Bremen Computational Logistics Group Working Papers 3, University of Bremen, Computational Logistics Junior Research Group.
    15. 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).
    16. 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.
    17. 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).
    18. Nassim Mrabti & Nadia Hamani & Laurent Delahoche, 2022. "A Comprehensive Literature Review on Sustainable Horizontal Collaboration," Sustainability, MDPI, vol. 14(18), pages 1-38, September.
    19. Bin Qiao & Shenle Pan & Eric Ballot, 2020. "Revenue Optimization for Less-than-truckload Carriers in the Physical Internet: dynamic pricing and request selection," Post-Print hal-01949543, HAL.
    20. Aghdas Badiee & Hamed Kalantari & Chefi Triki, 2023. "Leader-based diffusion optimization model in transportation service procurement under heterogeneous drivers’ collaboration networks," Annals of Operations Research, Springer, vol. 322(1), pages 345-383, March.

    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:91:y:2016:i:c:p:152-172. 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.