一种运输作业指派的迭代下降组合拍卖机制设计

doi:10.3969/j.issn.1674-0696.2013.02.21

重庆交通大学学报（自然科学版） ›› 2013, Vol. 32 ›› Issue (2): 267-273.DOI: 10.3969/j.issn.1674-0696.2013.02.21

一种运输作业指派的迭代下降组合拍卖机制设计

李莉英

重庆交通大学理学院，重庆400074

收稿日期:2012-05-18 修回日期:2012-10-12 出版日期:2013-04-15 发布日期:2018-01-26
作者简介:李莉英(1975—)，女，四川自贡人，讲师，博士，主要从事物流与供应链管理等方面的研究。
基金资助:
国家自然科学基金项目( 70872123)

Iterative Descending Combinatorial Auction Mechanism for Transportation Business Assignment Scheme

Li Liying

School of Science，Chongqing Jiaotong University，Chongqing 400074，China

Received:2012-05-18 Revised:2012-10-12 Online:2013-04-15 Published:2018-01-26

摘要/Abstract

摘要： 针对4PL公司的卡车运输作业指派问题提出了一种基于内生投标的迭代下降组合拍卖机制设计。根据获胜者确定问题，构造出一个限制对偶规划，其最优解提供近似单条线路运输作业的价格信息。投标者(3PL企业)根据这些价格信息，在近视最佳反应投标策略下能够确定新的有利可图的线路组合，并以此进行下一轮的投标。数值试验显示，基于内生投标的迭代拍卖机制与基于外生投标的迭代拍卖机制相比具有更高的指派效率。

关键词: 运输作业指派, 迭代组合拍卖, 近视最佳反应投标策略, 内生投标

Abstract: An iterative descending combinatorial auction mechanism is proposed on the base of endogenous bidding，whosee objective is to efficiently solve the truckload transportation business assignment problem of the 4PL company. By taking the dual of Winner Determination Problem ( WDP) ，a restricted dual planning is structured; whose optimal solution provides a set of approximate single-lane prices. Bidders ( 3PL companies) can use this price information to determine new profitable packages before the next round under a myopic best response bidding strategy. Numerical experiment shows that the efficiency of assignments produced by using single-lane prices with endogenous bidding is greater than that of assignments produced in the exogenous bidding mechanism when bidding is restricted to a fixed set of packages determined before the start of the auction.

Key words: transportationbusinessassignment, iterativecombinatorialauction, myopicbestresponsebiddingstrategy, endogenousBidding

中图分类号:

F724.59

李莉英. 一种运输作业指派的迭代下降组合拍卖机制设计[J]. 重庆交通大学学报（自然科学版）, 2013, 32(2): 267-273.

Li Liying. Iterative Descending Combinatorial Auction Mechanism for Transportation Business Assignment Scheme[J]. Journal of Chongqing Jiaotong University(Natural Science), 2013, 32(2): 267-273.

参考文献

[1]Caplice C G.An Optimization Based Bidding Process: A New Framework for Shipper-Carrier Relationships [M].Cambridge，MA: MIT Department of Civil and Environmental Engineering，1996.
[2]Ledyard J O，Olson M，Porter D，et al.The first use of a combined value auction for transportation services [J].Interfaces，2002，32( 5):4-12.
[3]Song J，Regan A C.Combinatorial auctions for transportation service procurement: the carrier perspective [J].Transportation Research Board，2002，1833: 40-46.
[4]Sheffi Y.Combinatorial auctions in the procurement of transportation services [J].Interfaces，2004，34( 4):245-252.
[5]Lim A，Rodrigues B，Zhou X.Transportation procurement with seasonally varying shipper demand and volume guarantees [J].Operations Research，2008，56( 3):758-771.
[6]杨华龙，东方，郑斌，等.集装箱航运服务多属性组合拍卖模型与算法[J].交通运输工程学报，2009，9( 5):111-115.
Yang Hualong，Dong Fang，Zhen Bin，et al.Multi-attribute combinatorial auction model and algorithm for container shipping service [J].Journal of Traffic and Transportation Engineering，2009，9( 5):111-115.
[7]Rothkopf M，Pekec A，Harstad R.Computationally manageable combinatorial auctions [J].Management Science，1998，44( 8) :1131-1147.
[8]Parkes D C，Ungar L H.Iterative Combinatoria1 Auctions: Theory and Practice[C]/ / Proceedings of 17th National Conference on Artificial Intelligence.Menlo Park，CA: AAAI Press，2000: 74-81.
[9]Kwon R H，Anandalingam G，Ungar L H.Iterative combinatorial auctions with bidder-determined combinations[J].Management Science，2005，51( 3):407-418.
[10]Guo Z，Koehler G J，Whinston A B.A market-based optimization algorithm for distributed systems[J].Management Science，2007， 53( 8):1345-1358.

一种运输作业指派的迭代下降组合拍卖机制设计

Iterative Descending Combinatorial Auction Mechanism for Transportation Business Assignment Scheme

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 1

编辑推荐

Metrics