期刊
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
卷 43, 期 5, 页码 522-541出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.trb.2008.09.003
关键词
Combinatorial auctions; Bidding; Truckload carriers; Economies of scope; Minimum cost flow problem; Column generation
类别
资金
- Taiwan National Science Council (NSC) [NSC 93-2416-H-259-005]
Combinatorial auctions have become popular for shippers to secure transportation services. It is, however, very difficult for truck carriers to solve bid generation and evaluation problems in combinatorial auctions. The objective of this paper is to develop a bidding advisor to help truckload (TL) carriers overcome such challenging problems in one-shot combinatorial auctions. The proposed advisor integrates the load information in e-marketplaces with carriers' current fleet management plans, and then chooses the desirable load bundles. In this paper, a TL carrier's bid generation and evaluation problems in one-shot combinatorial auctions are formulated as a synergetic minimum cost flow problem by estimating the average synergy values between loads through the proposed approximation. The conventional solution approaches for solving the minimum cost flow problems cannot be applied to the synergetic network flow problem. Thus, we propose a column generation approach to solve this specific network flow problem. The main contribution of this paper is that a TL carrier adopting the proposed advisor can easily determine the desirable bid packages without evaluating all 2(n) - 1 possible bundles of loads, where n is the number of loads. (C) 2008 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据