期刊
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
卷 39, 期 10, 页码 914-933出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.trb.2004.11.003
关键词
combinatorial auctions; contract procurement; set covering; trucking operations
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. (c) 2005 Published by Elsevier Ltd.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据