Solving Truckload Procurement Auctions Over an Exponential Number of Bundles

Richard Li-Yang Chen (), Shervin AhmadBeygi (), Amy Cohn (), Damian R. Beil () and Amitabh Sinha ()
Additional contact information
Richard Li-Yang Chen: Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109-2117
Shervin AhmadBeygi: Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109-2117
Amy Cohn: Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109-2117
Damian R. Beil: Ross School of Business, University of Michigan, Ann Arbor, Michigan 48109-1234
Amitabh Sinha: Ross School of Business, University of Michigan, Ann Arbor, Michigan 48109-1234

Transportation Science, 2009, vol. 43, issue 4, 493-510

Abstract: Truckload carriers provide hundreds of billions of dollars worth of services to shippers in the United States alone each year. Internet auctions provide these shippers with a fast and easy way to negotiate potential contracts with a large number of carriers. Combinatorial auctions have the added benefit of allowing multiple lanes to be considered simultaneously in a single auction. This is important because it enables carriers to connect multiple lanes in continuous moves or tours, decreasing the empty mileage that must be driven, and therefore increasing overall efficiency. On the other hand, combinatorial auctions require bidding on an exponential number of bundles to achieve full economies of scope and scale, which is not tractable except for very small auctions. In most real-world auctions, bidding is instead typically limited to a very small subset of the potential bids. We present an implicit bidding approach to combinatorial auctions for truckload procurement that enables the complete set of all possible bids to be considered implicitly, without placing the corresponding burden of an exponential number of bids on the bidders or the auctioneer. We present the models needed to solve this problem. We then provide extensive computational results to demonstrate the tractability of our approach. Finally, we conclude with numerical analysis to assess the quality of the solutions that are generated and to demonstrate the benefits of our approach over existing bidding methods in practice.

Keywords: combinatorial auctions; implicit bidding approach; truckload procurement; network flows (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (21)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1090.0273 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:43:y:2009:i:4:p:493-510

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().