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

Iterative Descending Combinatorial Auction Mechanism for Transportation Business Assignment Scheme

作　　者：李莉英[1] 

机构地区：[1]重庆交通大学理学院,重庆400074

出　　处：《重庆交通大学学报（自然科学版）》2013年第2期267-273,共7页Journal of Chongqing Jiaotong University(Natural Science)

基　　金：国家自然科学基金项目(70872123)

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

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

分 类 号：F724.59[经济管理—产业经济]