IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v34y2004i4p245-252.html
   My bibliography  Save this article

Combinatorial Auctions in the Procurement of Transportation Services

Author

Listed:
  • Yossi Sheffi

    (MIT Center for Transportation and Logistics, Massachusetts Institute of Technology, E40-275, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139)

Abstract

Most shippers use annual auctions to procure transportation services, leading to annual contracts. By using combinatorial auctions they can reduce their operating costs while protecting carriers from winning lanes that do not fit their networks, thereby improving carriers' operations as well. Combinatorial auctions account for carriers' economies of scope, which many consider more important than economies of scale in transportation operations. Any transportation procurement procedure, however, must account for level of service and other nonprice variables, which are as important as price in determining which carrier should serve what lane. These considerations can be incorporated into the combinatorial auction framework easily and holistically. After several years of using this approach, leading shippers have adopted it, and several software providers offer the requisite software.

Suggested Citation

  • Yossi Sheffi, 2004. "Combinatorial Auctions in the Procurement of Transportation Services," Interfaces, INFORMS, vol. 34(4), pages 245-252, August.
    • Handle: RePEc:inm:orinte:v:34:y:2004:i:4:p:245-252
    DOI: 10.1287/inte.1040.0075
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.1040.0075
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.1040.0075?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
    ---><---

    References listed on IDEAS

    as
    1. E. William Moore & Janice M. Warmke & Lonny R. Gorban, 1991. "The Indispensable Role of Management Science in Centralizing Freight Operations at Reynolds Metals Company," Interfaces, INFORMS, vol. 21(1), pages 107-129, February.
    2. Paul Klemperer, 2002. "What Really Matters in Auction Design," Journal of Economic Perspectives, American Economic Association, vol. 16(1), pages 169-189, Winter.
    3. John O. Ledyard & Mark Olson & David Porter & Joseph A. Swanson & David P. Torma, 2002. "The First Use of a Combined-Value Auction for Transportation Services," Interfaces, INFORMS, vol. 32(5), pages 4-12, October.
    4. Sven de Vries & Rakesh V. Vohra, 2003. "Combinatorial Auctions: A Survey," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 284-309, August.
    Full references (including those not matched with items on IDEAS)

    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. Dellbrügge, Marius & Brilka, Tim & Kreuz, Felix & Clausen, Uwe, 2022. "Auction design in strategic freight procurement," Chapters from the Proceedings of the Hamburg International Conference of Logistics (HICL), in: Kersten, Wolfgang & Jahn, Carlos & Blecker, Thorsten & Ringle, Christian M. (ed.), Changing Tides: The New Role of Resilience and Sustainability in Logistics and Supply Chain Management – Innovative Approaches for the Shift to a New , volume 33, pages 295-325, Hamburg University of Technology (TUHH), Institute of Business Logistics and General Management.
    2. 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.
    3. Mesa-Arango, Rodrigo & Ukkusuri, Satish V., 2013. "Benefits of in-vehicle consolidation in less than truckload freight transportation operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 113-125.
    4. Y Guo & A Lim & B Rodrigues & Y Zhu, 2006. "Carrier assignment models in transportation procurement," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(12), pages 1472-1481, December.
    5. Gansterer, Margaretha & Hartl, Richard F. & Sörensen, Kenneth, 2020. "Pushing frontiers in auction-based transport collaborations," Omega, Elsevier, vol. 94(C).
    6. Muñoz, Juan Carlos & Molina, Diego, 2009. "A multi-unit tender award process: The case of Transantiago," European Journal of Operational Research, Elsevier, vol. 197(1), pages 307-311, August.
    7. Pittawat Ueasangkomsate & Manoj Lohatepanont, 2012. "Bidding Strategies for Carrier in Combinatorial Transportation Auction," International Journal of Business Research and Management (IJBRM), Computer Science Journals (CSC Journals), vol. 3(1), pages 1-17, February.
    8. Drexl, Andreas & Jørnsten, Kurt & Knof, Diether, 2009. "Non-linear anonymous pricing combinatorial auctions," European Journal of Operational Research, Elsevier, vol. 199(1), pages 296-302, November.
    9. Aleksandar Pekev{c} & Michael H. Rothkopf, 2003. "Combinatorial Auction Design," Management Science, INFORMS, vol. 49(11), pages 1485-1503, November.
    10. Oktay Günlük & Lászlo Ladányi & Sven de Vries, 2005. "A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions," Management Science, INFORMS, vol. 51(3), pages 391-406, March.
    11. Anthony M. Kwasnica & Katerina Sherstyuk, 2013. "Multiunit Auctions," Journal of Economic Surveys, Wiley Blackwell, vol. 27(3), pages 461-490, July.
    12. Dirk Briskorn & Kurt Jørnsten & Jenny Nossack, 2016. "Pricing combinatorial auctions by a set of linear price vectors," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(4), pages 1043-1070, October.
    13. Lim, Andrew & Qin, Hu & Xu, Zhou, 2012. "The freight allocation problem with lane cost balancing constraint," European Journal of Operational Research, Elsevier, vol. 217(1), pages 26-35.
    14. Andrew Lim & Brian Rodrigues & Zhou Xu, 2008. "Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees," Operations Research, INFORMS, vol. 56(3), pages 758-771, June.
    15. Rönnqvist, Mikael & D'Amours, Sophie & Carle, Marc-André & Azouzi, Riadh, 2018. "Timber selling policies using bundle-based auction: The case of public forests in Québec," Forest Policy and Economics, Elsevier, vol. 96(C), pages 9-18.
    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. 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.
    18. 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.
    19. Elendner, Thomas, 2003. "Scheduling and combinatorial auctions: Lagrangean relaxation-based bonds for the WJISP," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 570, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    20. Gediminas Adomavicius & Shawn P. Curley & Alok Gupta & Pallab Sanyal, 2012. "Effect of Information Feedback on Bidder Behavior in Continuous Combinatorial Auctions," Management Science, INFORMS, vol. 58(4), pages 811-830, April.

    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:orinte:v:34:y:2004:i:4:p:245-252. 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: 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.