Approximation Algorithms for the Bid Construction Problem in Combinatorial Auctions for the Procurement of Freight Transportation Contracts

Science Direct Working Paper No S1574-034X(04)70265-3

27 Pages Posted: 5 Jun 2017 Last revised: 18 Nov 2018

See all articles by Amelia Regan

Amelia Regan

University of California, Irvine

Jiongjiong Song

University of California, Irvine - Institute of Transportation Studies

Date Written: March 2003

Abstract

The bid valuation and construction problem for carriers facing combinatorial auctions for the procurement of freight transportation contracts is very difficult and involves the computation of a number of NP-hard sub problems. In this paper we examine computationally tractable approxim ation methods for estim ating these values and constructing bids. The benefit of our approxim ation method is that it provides a way for carriers to construct optimal or near optimal bids by solving a single NP-hard problem. This represents a significant improvement in efficiency. In addition, this method can be extended to m any other applications.

Keywords: Combinatorial auctions, contract procurement, set covering, trucking operations

Suggested Citation

Regan, Amelia and Song, Jiongjiong, Approximation Algorithms for the Bid Construction Problem in Combinatorial Auctions for the Procurement of Freight Transportation Contracts (March 2003). Science Direct Working Paper No S1574-034X(04)70265-3, Available at SSRN: https://ssrn.com/abstract=2978378

Amelia Regan (Contact Author)

University of California, Irvine

Campus Drive
Irvine, CA California 62697-3125
United States

Jiongjiong Song

University of California, Irvine - Institute of Transportation Studies ( email )

CA
United States

Do you have negative results from your research you’d like to share?

Paper statistics

Downloads
29
Abstract Views
312
PlumX Metrics