Combinatorial Auctions for Trucking Service Procurement: An Examination of Carrier Bidding Policies

Jiongjiong Song and Amelia C. Regan

University of California Transportation Center, Working Papers from University of California Transportation Center

Abstract: Combinatorial auctions are increasingly used by large shippers as a method to establish service contracts with trucking companies. In order to achieve maximal benefits in these auctions, carriers must determine a bidding policy that can accurately evaluate the costs they will incur to fulfill these contracts and which can quickly examine many different possible options. In this paper, we analyze the complexity of this bidding problem for the procurement of truckload trucking service contracts; further, we propose an optimization-based approximation method to aid a carrier in constructing bids. Using a simulation framework, we examine the performance of this method elative to a straightforward bidding policy similar to those used in practice.

Keywords: Combinatorial auctions; bidding; contract procurement; trucking; set covering; Social and Behavioral Sciences (search for similar items in EconPapers)
Date: 2003-08-01
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.escholarship.org/uc/item/3s63255j.pdf;origin=repeccitec (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:cdl:uctcwp:qt3s63255j

Access Statistics for this paper

More papers in University of California Transportation Center, Working Papers from University of California Transportation Center Contact information at EDIRC.
Bibliographic data for series maintained by Lisa Schiff ().