Approximation algorithms for the bid construction problem in combinatorial auctions for the procurement of freight transportation contracts [An article from: Transportation Research Part B]

This digital document is a journal article from Transportation Research Part B, published by Elsevier in . The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
Trucking companies (carriers) are increasingly facing combinatorial auctions conducted by shippers seeking contracts for their transportation needs. The bid valuation and construction problem for carriers facing these combinatorial auctions is very difficult and involves the computation of a number of NP-hard sub problems. In this paper we examine computationally tractable approximation methods for estimating these values and constructing bids. The benefit of our approximation method is that it provides a way for carriers to discover their true costs and construct optimal or near optimal bids by solving a single NP-hard problem. This represents a significant improvement in computational efficiency. We examine our method both analytically and empirically using a simulation based analysis.