IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v56y2022i3p585-611.html
   My bibliography  Save this article

Cost Allocation for Less-Than-Truckload Collaboration via Shipper Consortium

Author

Listed:
  • Minghui Lai

    (School of Economics and Management, Southeast University, Nanjing 211100, People’s Republic of China)

  • Xiaoqiang Cai

    (The Chinese University of Hong Kong-Shenzhen, 518172 Shenzhen, People’s Republic of China; The Shenzhen Research Institute of Big Data, 518172 Shenzhen, People’s Republic of China)

  • Nicholas G. Hall

    (Fisher College of Business, The Ohio State University, Columbus, Ohio 43210)

Abstract

We study the problem of collaborative less-than-truckload (LTL) transportation in the form of a shipper consortium, which is operated by a third-party logistics provider (3PL) through a cross-dock/pooling network. The 3PL has responsibility for planning the combined loads prior to actual shipments, hiring and routing carriers to execute shipping, and allocating the cost to the shippers in the consortium. Shippers receive substantial cost savings from combined truckload shipments. However, achieving consolidation and realizing this benefit requires addressing two essential issues: (i) how to find an approximately optimal consolidation solution in a large network with many freights and (ii) how to determine a fair cost allocation rule among the shippers’ consolidated freights that ensures budget balance while minimally violating coalitional stability. Our work resolves these two issues. We formulate a time-space network flow model of the problem under both incremental and all-unit discount structures of LTL rates and propose a computationally efficient algorithm based on local search heuristics. We model the problem of allocating cost to the shippers as a cooperative game. We decompose and linearize the Lagrangian dual problem by using total unimodularity and concavity. We propose an efficiently computable cost allocation rule from the linearized dual models. The dual rule ensures stable cooperation but may have underallocation equal to a duality gap. To cover the underallocation, we further develop a budget covering procedure and define an ϵ -core allocation with desirable properties. Through extensive computational experiments, we find that the shipper consortium reduces total shipping costs by more than 40% in most cases; meanwhile, the ϵ -core allocation is typically in the core for small-scale networks while violating stability by at most 5% for large-scale networks and provides consolidated freights with more than 50% individual cost savings on average.

Suggested Citation

  • Minghui Lai & Xiaoqiang Cai & Nicholas G. Hall, 2022. "Cost Allocation for Less-Than-Truckload Collaboration via Shipper Consortium," Transportation Science, INFORMS, vol. 56(3), pages 585-611, May.
  • Handle: RePEc:inm:ortrsc:v:56:y:2022:i:3:p:585-611
    DOI: 10.1287/trsc.2021.1066
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2021.1066
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.2021.1066?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
    ---><---

    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:inm:ortrsc:v:56:y:2022:i:3:p:585-611. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.