集装箱多式联运运输服务采购组合优化研究
|
摘要
集装箱多式联运运输服务是以集装箱为媒介,把水路、公路、铁路以及航空等多种运输方式有机地组织衔接为一体,采用两种或两种以上不同运输方式,为托运人提供“全程式”和“一票式”运输的物流服务。集装箱多式联运运输服务采购是托运人为实现其生产、销售目的或延伸其综合运输网络能力,从运输市场获取其需要的多式联运服务,以对其(集装箱)货物进行运输。集装箱多式联运运输服务采购的组合优化,是指从集装箱托运人的角度,按照利益最大化的原则,选择最佳的多式联运服务承运人组合,其最终目的就是以最佳的运价、效率和服务质量获得其需要的运输服务。
在集装箱多式联运运输服务采购中,集装箱货主为了实现货物的连贯运输,一般通过多式联运经营人来具体选择和落实各分段运输服务。因此,本文研究的集装箱多式联运运输服务采购行为涉及了三类参与者,即：集装箱货主、多式联运经营人和区段运输承运人。上述三类参与者在具体的集装箱多式联运运输服务采购行为中要么是运输服务的采购方(托运方),要么则是运输服务的供给方(承运方)。在多式联运包干运输服务采购中,托运方是集装箱货主,承运方是提供全程运输服务的多式联运经营人。而在多式联运分包运输采购中,多式联运经营人则成为采购行为中的采购方,承运方是区段运输承运人。
本文研究从托运方角度来探讨集装箱多式联运运输服务采购问题,对以往托运人的定向化运输服务采购模式在组合优化方面做出改进和探索,使用组合优化方法对多式联运中运输服务的最佳组合状态进行分析,研究集装箱多式联运包干运输服务采购(从集装箱货主角度)和集装箱多式联运分段运输服务采购(从多式联运经营人角度)中的运输服务组合优化问题。
针对当前研究的问题,本文从三个方面展开了具体研究：
(1)针对集装箱多式联运包干运输服务的采购行为,建立以包干运费、服务质量、承运人信誉、运网能力为属性的多属性组合拍卖的组合优化模型,探讨集装箱货主选择多式联运经营人服务的组合优化方法。首先,文中对集装箱多式联运运输服务采购中的评价属性建立了评价指标体系,权衡了几个主要属性目标对集装箱货主选择运输服务的影响情况,确定了各属性的权重系数；其次,对多式联运运输服务采购的组合拍卖过程和竞胜标结果进行模拟和分析,建立了一套多目标混合整数规划的组合优化模型；最后,引入属性状态向量间“欧式距离”的概念,将上述多目标混合整数规划问题转化为单目标规划问题,探讨集装箱多式联运包干运输服务采购的组合优化问题。
(2)针对集装箱多式联运分段运输服务的采购行为,建立以运费最小化和运输环节一体化无缝衔接为目标的服务组合优化模型,研究多式联运经营人以托运人身份选择区段运输服务的组合优化方法。首先,通过对多式联运实际运输区段服务涉及的各个要素进行分析,确定区段运输服务采购中的变量参数；其次,分析各变量参数的数据结构,引入“数值”结构的时间变量和“非数值”结构的地点变量,建立基于前后段运输方式相衔接的混合整数规划非线性模型,探讨集装箱多式联运分段运输服务采购的组合优化问题。
(3)为实现上述集装箱多式联运包干运输服务和分段运输服务托运中的组合优化目的,对上述问题中的混合整数规划非线性模型进行算法设计,建立集装箱货主和多式联运经营人服务采购的组合优化算法模型,使用集合推理、逻辑推理、启发式搜索的方法对组合优化模型进行联合推理,实际解决多式联运包干运输和分段运输服务的组合优化问题。
Multi-modal transportation service connects the transportation modal of sea, road, rail, air and others as one system, by the medium of containers, which provides "whole course, one document" transport logistics services to the shippers. Multi-modal transportation service purchase is definited as the process of obtaining the service requirements from the multi-modal transportation market services to containers transport, for the purpose of implementing production or extending the transportation network,. Multi-modal transportation service purchase optimization is definited from the perspective of the shippers and the principal of the shippers'maximum benefit, to choose the best carrier combination. The ultimate target of transportation service purchase is to pursue the opimum freight, efficiency and quality of transportation services.
During the process of multi-modal transportation service purchase, in order to achieve the coherent transportation of the container cargos, the shppers usually select the sectional transport services through the multimodal transport operators. In this paper, there are three kinds of participants during the course of container transport service purchase:the real shppers, the multi-modal transport operator(MTO) and the section al transport carrier. The participants must be the purchase party(the shipper) or the supply party(the carrier). In the multi-modal transportation sum services purchase process, the shipper party is the real shipper of containers, and the carrier party is the multi-modal transport operator who provides sum transportation service. In the multi-modal transport segmental service purchase process, the shpper party is the multi-modal transport operator, and the carrier party is the sectional transport carrier.
In this paper, the research fo multi-modal transport services purchase is discussed from the perspective of the shipper party, which explores the use of combinatorial optimization methods for oriented multi-modal transport services and its improvement. The optimum combinational state is analyzed, which involves both service purchase of sum transport(from the perspective of the container owner) and segmental transport (from the perspective of the multimodal transport operator).
Regarding to the research, the following three aspects are studied in this paper:
(1) For the sum transport service purchase study, a series of multi-attribute combinatorial optimization models are established, regarding to the freight, service quality, carriers' reputation, and their transport network capacity. Firstly, the evaluation index for multi-mode transportation operator is established, and the weight coefficients of the main attribute are given through balance idea. Secondly, the combination process of multi-modal transportation services purchase with combinatorial auction and bidding competition is analyzed and simulated. Also, the multi-objective mixed integer programming model for combinatorial optimization is established. Finally, the concept of Euclidean distance formula of state vector is introduced in the study and the multi-objective mixed integer programming problem can be turned into a single objective programming problem to discuss combinatorial optimization problems in multi-modal container transportation services purchase.
(2) For the section transport service purchase study, the combinatorial optimization model is established, aiming at the minimum sum freight and the jointless connection for the transportation links. This paper studied the combinatorial optimization method for the multimodal transport operators to select the sectional transport services as shippers.First of all, analyze all the elements in the actual sectional transport service, and determine the variable parameters in the service purchase. Secondly, analyze the data structures of variable parameters, and introduce the value structure of the time variable and non-numerical structure of the site variables. Then the nonlinear mixed integer programming model is established based on convergence of transport modes before and after.
(3) To achieve the above optimization purposes of purchase of both sum transport services and sectional transport services of multi-modal transoportation, the algorithm are designed for the above problems of nonlinear mixed integer programming models, involving both the multimodal transport operators and the real container shippers. Through the cooperate reasoning of set reasoning, logical reasoning, ane heuristic search, the optimization model for sum transporat service and segtional transport service of the multi-modal transportation services purchase optimization problems could be solved and realized at last.
在集装箱多式联运运输服务采购中,集装箱货主为了实现货物的连贯运输,一般通过多式联运经营人来具体选择和落实各分段运输服务。因此,本文研究的集装箱多式联运运输服务采购行为涉及了三类参与者,即：集装箱货主、多式联运经营人和区段运输承运人。上述三类参与者在具体的集装箱多式联运运输服务采购行为中要么是运输服务的采购方(托运方),要么则是运输服务的供给方(承运方)。在多式联运包干运输服务采购中,托运方是集装箱货主,承运方是提供全程运输服务的多式联运经营人。而在多式联运分包运输采购中,多式联运经营人则成为采购行为中的采购方,承运方是区段运输承运人。
本文研究从托运方角度来探讨集装箱多式联运运输服务采购问题,对以往托运人的定向化运输服务采购模式在组合优化方面做出改进和探索,使用组合优化方法对多式联运中运输服务的最佳组合状态进行分析,研究集装箱多式联运包干运输服务采购(从集装箱货主角度)和集装箱多式联运分段运输服务采购(从多式联运经营人角度)中的运输服务组合优化问题。
针对当前研究的问题,本文从三个方面展开了具体研究：
(1)针对集装箱多式联运包干运输服务的采购行为,建立以包干运费、服务质量、承运人信誉、运网能力为属性的多属性组合拍卖的组合优化模型,探讨集装箱货主选择多式联运经营人服务的组合优化方法。首先,文中对集装箱多式联运运输服务采购中的评价属性建立了评价指标体系,权衡了几个主要属性目标对集装箱货主选择运输服务的影响情况,确定了各属性的权重系数；其次,对多式联运运输服务采购的组合拍卖过程和竞胜标结果进行模拟和分析,建立了一套多目标混合整数规划的组合优化模型；最后,引入属性状态向量间“欧式距离”的概念,将上述多目标混合整数规划问题转化为单目标规划问题,探讨集装箱多式联运包干运输服务采购的组合优化问题。
(2)针对集装箱多式联运分段运输服务的采购行为,建立以运费最小化和运输环节一体化无缝衔接为目标的服务组合优化模型,研究多式联运经营人以托运人身份选择区段运输服务的组合优化方法。首先,通过对多式联运实际运输区段服务涉及的各个要素进行分析,确定区段运输服务采购中的变量参数；其次,分析各变量参数的数据结构,引入“数值”结构的时间变量和“非数值”结构的地点变量,建立基于前后段运输方式相衔接的混合整数规划非线性模型,探讨集装箱多式联运分段运输服务采购的组合优化问题。
(3)为实现上述集装箱多式联运包干运输服务和分段运输服务托运中的组合优化目的,对上述问题中的混合整数规划非线性模型进行算法设计,建立集装箱货主和多式联运经营人服务采购的组合优化算法模型,使用集合推理、逻辑推理、启发式搜索的方法对组合优化模型进行联合推理,实际解决多式联运包干运输和分段运输服务的组合优化问题。
Multi-modal transportation service connects the transportation modal of sea, road, rail, air and others as one system, by the medium of containers, which provides "whole course, one document" transport logistics services to the shippers. Multi-modal transportation service purchase is definited as the process of obtaining the service requirements from the multi-modal transportation market services to containers transport, for the purpose of implementing production or extending the transportation network,. Multi-modal transportation service purchase optimization is definited from the perspective of the shippers and the principal of the shippers'maximum benefit, to choose the best carrier combination. The ultimate target of transportation service purchase is to pursue the opimum freight, efficiency and quality of transportation services.
During the process of multi-modal transportation service purchase, in order to achieve the coherent transportation of the container cargos, the shppers usually select the sectional transport services through the multimodal transport operators. In this paper, there are three kinds of participants during the course of container transport service purchase:the real shppers, the multi-modal transport operator(MTO) and the section al transport carrier. The participants must be the purchase party(the shipper) or the supply party(the carrier). In the multi-modal transportation sum services purchase process, the shipper party is the real shipper of containers, and the carrier party is the multi-modal transport operator who provides sum transportation service. In the multi-modal transport segmental service purchase process, the shpper party is the multi-modal transport operator, and the carrier party is the sectional transport carrier.
In this paper, the research fo multi-modal transport services purchase is discussed from the perspective of the shipper party, which explores the use of combinatorial optimization methods for oriented multi-modal transport services and its improvement. The optimum combinational state is analyzed, which involves both service purchase of sum transport(from the perspective of the container owner) and segmental transport (from the perspective of the multimodal transport operator).
Regarding to the research, the following three aspects are studied in this paper:
(1) For the sum transport service purchase study, a series of multi-attribute combinatorial optimization models are established, regarding to the freight, service quality, carriers' reputation, and their transport network capacity. Firstly, the evaluation index for multi-mode transportation operator is established, and the weight coefficients of the main attribute are given through balance idea. Secondly, the combination process of multi-modal transportation services purchase with combinatorial auction and bidding competition is analyzed and simulated. Also, the multi-objective mixed integer programming model for combinatorial optimization is established. Finally, the concept of Euclidean distance formula of state vector is introduced in the study and the multi-objective mixed integer programming problem can be turned into a single objective programming problem to discuss combinatorial optimization problems in multi-modal container transportation services purchase.
(2) For the section transport service purchase study, the combinatorial optimization model is established, aiming at the minimum sum freight and the jointless connection for the transportation links. This paper studied the combinatorial optimization method for the multimodal transport operators to select the sectional transport services as shippers.First of all, analyze all the elements in the actual sectional transport service, and determine the variable parameters in the service purchase. Secondly, analyze the data structures of variable parameters, and introduce the value structure of the time variable and non-numerical structure of the site variables. Then the nonlinear mixed integer programming model is established based on convergence of transport modes before and after.
(3) To achieve the above optimization purposes of purchase of both sum transport services and sectional transport services of multi-modal transoportation, the algorithm are designed for the above problems of nonlinear mixed integer programming models, involving both the multimodal transport operators and the real container shippers. Through the cooperate reasoning of set reasoning, logical reasoning, ane heuristic search, the optimization model for sum transporat service and segtional transport service of the multi-modal transportation services purchase optimization problems could be solved and realized at last.
引文
[1]罗云峰.博弈论教程[M].北京：清华大学出版社；北京交通大学出版社,2006：233.
[2]Friedman L. Competitive bidding strategy[J]. Operation Research,1956,4(1):104-112.
[3]William Vickrey. Counter speculation, Auctions, and Competitive Sealed Tenders[J]. Journal of Finance,1961,16(1),8-37.
[4]王文举.拍卖与招标的对策论分析[J].数量经济技术经济研究,1998(1)：43-46.
[5]William Vickrey. Auction and Bidding Games[M]. New Jersey, USA:Princeton University Press,1962:15-27.
[6]窦莉梅.关于拍卖价格理论研究的文献述评[J].上海商学院学报,2009,10(2)：45-51.
[7]GrieSmer J, Levitan R, Shubik M. Towards a Study of Bidding Processes[J]. Naval Research Logistics Quarterly,1967,14(4):415-433.
[8]保罗·柯伦柏著,钟鸿钧译.拍卖：理论与实践[M].北京：中国人民大学出版社,2006：24.
[9]Ahmed Doghmi, Abderrahmane Ziad. Reexamination of Maskin's Theorem on Nash implementability[J]. Economics Letters,2008,100(1):150-152.
[10]张本健.赫维茨、马斯金、迈尔森：诺贝尔!经济三剑客[N].池州日报(九华周刊),2007.12.15.
[11]Roger B. Myerson. Optimal Auction Design[J], Mathematics of Operations Research,1981,6(1): 58-73.
[12]John Riley and William Samuelson. Optimal auctions[J]. American Economic Review, 1981,71(3):381-392.
[13]Milgrom Paul, Robert Weber. The Value of Information in a Sealed Bid Auction[J]. Journal of Mathematical Economics,1982,10(1):105-114.
[14]Eric Maskin, John Riley. Monopoly with Incomplete Information[J]. Rand Journal of Economics,1984,15(2):171-196.
[15]Paul Klemperer. Auctions with Almost Common Values[J]. European Economic Review,1998, 42(3):757-769.
[16]Paul Klemperer. Auction Theory:A Guide to the Literature[J]. Journal of Economic Surveys, 1999,13(3):227-286.
[17]Paul Klemperer. Applying Auction Theory to Economics.[J]. Wall Street Journal (Asia), 2000,5(10):8.
[18]方齐云,熊启滨.霍姆斯特朗和米尔格罗姆企业最优激励理论述评[J].经济学动态,2007(09)：103-107.
[19]Preston R. McAfee, John Mcmillan. Auctions and Bidding[J]. Journal of Economic Literature, 1987,25(2):699-738.
[20]Eric Maskin, John Riley. Auction Theory with Private Values[J]. American Economic Review, 1995,75(2):150-156.
[21]保罗·柯伦柏著,钟鸿钧译.拍卖：理论与实践[M].北京：中国人民大学出版社,2006：66.
[22]许永国.拍卖经济理论综述[J].经济研究,2002(9)：84-91.
[23]胡斌,刘仲英.基于智能代理的多维拍卖模型的设计[J].计算机工程与应用,2005,41(1)：8-10.
[24]蔡志明.拍卖理论与实验研究[J].经济科学1999(2)：117-125.
[25]邵晓双,谭德庆.招投标理论研究现状[J].中国市场,2008,26(6)：101-102.
[26]詹文杰,汪寿阳.评“Smith奥秘”与双向拍卖的研究进展[J].管理科学学报,2003,6(1)：1-12.
[27]刘树林.担保拍卖理论研究[J].数量经济技术经济研究,2004,21(12)：44-53.
[28]杜黎,胡奇英.网上拍卖品数量的优化[J],西安电子科技大学学报,2003,30(1)：120-124.
[29]马俊,邱菀华.多物品拍卖中的多人投标决策问题研究[J]，系统工程理论与实践,2002(1)：83-87.
[30]Rassenti,SetPhen.J,Vernon L.Smith and Robert L.Bulfin. A combinatorial auction mechanism for airport time slot allocation[J]. Bell Journal of econmics,1982,13:402-417.
[31]Jeffrey S.Banks,John O.Ledyard, and David P. Porter. Allocating uncertain and unresponsive sources:an experimental approach[J]. RAND Journal of Economics,1989,20(1) 1-25.
[32]Che Y K. Design competition through multidimensional auctions[J]. RAND Journal of Economics,1993,24:668-680.
[33]MYERSON R B. Optimal auction design[J]. Math. Operations Res,1981,6 (1):58-73.
[34]陈剑,黄河.基于树型结构的在线逆向组合拍卖模型[J].系统工程理论方法应用,2004,13(4)：310-315.
[35]陈剑,黄河.逆向组合拍卖投标者获胜概率研究[J].系统工程理论与实践,2005(3)：13-19.
[36]黄河,陈剑.政府采购组合拍卖机制[J].重庆大学学报(自然科学版),2006,29(6)：140-143.
[37]黄河,陈剑.采购组合拍卖投标均衡策略研究[J].系统工程理论与实践,2007(10)：93-97
[38]黄河,陈剑.采购组合拍卖改进机制研究[J].系统工程理论与实践2007(11)：43-47.
[39]黄河,但斌,徐鸿雁.基于树型结构的采购组合拍卖获胜概率计算方法研究[J].数学的实践与认识,2008,38(1)：16-21.
[40]范小勇,梁樑,古春生.多回合组合双向拍卖交易机制研究[J].系统工程理论与实践,2005,1：32-36.
[41]柏寰.基于Agent的多单位组合拍卖研究[D].西南师范大学,工学硕士论文,2005.
[42]陈李钢.电子商务下的组合拍卖机制设计与模型优化研究[D].哈尔滨工业大学,管理学硕士论文,2006.
[43]黄海新,薛世彤,汪定伟.多物品双向拍卖机制设计[J].东北大学学报(自然科学版),2006,27(11)：1193-1195.
[44]Tuomas Snadholm. An algorithm for optimal winner determination in combinatorial auetions[J]. Artificial Intelligence,135:1-54,2002.
[45]Tuomas Sanhdolm, Subhash Suri. BOB:Imporved winner determination in combinatorial auetions and generalizations[J]. Artificial Intelligence,145:33-58,2003.
[46]Rothkopf M.H, Pekec A, Harstad R. M. Computationally manageable combinatorial auctions[J]. Management Science44,1995:1131-1147.
[47]Arne Andesrson. Mattias Tenhunen, FredrikYgge. Inter Programming for combinatorial auction winner determination[J]. In Proceedings of the Fourth International Conference on Multi-Agent System,Boston AM,2000:39-46.
[48]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.
[49]Hohner G, Rich J, NG E, et al. Combinatorial and quality discount procurement auctions with mutual benefits at Mars Incorporated [J]. Interfaces,2003,33(1):23-35.
[50]Garfinkel R, Nemhauser G. L. The set partitioning problem:Set covering with equality constraints[J]. Operations Research.1969,17(5):848-856.
[51]Rassenti S. J, Smith V. L, Bulfin R L. A combinatorial auction mechanism for airport time slot allocation[J]. Bell Journal of Economics,1982,13:402-417.
[52]Sandholm T. Approaches towinner determination in combinatorial auctibns[J]. Decision Support Systems,2000,28(1-2):165-176.
[53]Leyton B. K, Shoham Y, Tennenholtz M. An algorithm for multi-unit combinatorial auctions[R]. 17th National Conference on Artificial Intelligence, Austin, TX:2001:56-61.
[54]Arne Andersson, Mattias Tenhunen, Fredrik Ygge. Integer programming for combinatorial auction winner determination[R]. Fourth International Conference on Multi-agent Systems Proceedings, Boston, MA:2000:39-46.
[55]Stan van Hoesel, Rudolf Miller. Optimization in electronic markets:Examples in combinatorial auctions[J]. Netnomics,2001(3):23-33.
[56]Sandolm T. W. An algorithm for optimal winner determination in combinatorial auctions[R]. Proceedings of Sixteeth International Joint Conference on Artificial Intelligence, Stockholm, Sweden,1999:542-547.
[57]Kwon R, Anandalingam G, Ungar L. Iterative combinatorial auctions with bidder-determined combinations. Management Science.2005,51(3),407-418.
[58]CHEN Peiyou, WANG Dingwei. Approaches to winner determination in combinatorial Auctions:A Review[R]. Proceedings of International Conference on Regional Logistics and Supply Chain Manageement, Shenyang:Baishan Press,2002:22-30.
[59]陈培友,汪定伟.组合拍卖竞胜标确定问题的混沌搜索算法[J].管理科学学报,2003,6(5)：24-28.
[60]陈培友,汪定伟.用改进遗传算法求解组合拍卖竞胜标[J].东北大学学报(自然科学版),2004,25(4)：349-351.
[61]Song J, Regan A.C. Combinatorial auctions for transportation service procurement:The carrier perspective. Transportation Research Record, pages 40-46,2002.
[62]Sheff i Y. Combinatorial Auctions in the Procurement of Transportation Services. Interfaces. 34(4),245-252.2004.
[63]Caplice C, Sheffi Y. Theory and Practice of Optimization-Based Bidding for Motor Carriers Transport Services, Journal of Business Logistics Vol.24, No.2,2003.
[64]杨华龙,靳志宏.集装箱航运服务组合拍卖模型研究[J].中国航海,2007(2)：66-69.
[65]刘志杰,季令,叶玉玲.路网车流径路优化调整中的最短径路算法[J].贵州师范大学学报(自 然科学版),2007,25(2)：88-90.
[66]东方.基于免疫算法的物流配送VRP研究[D].大连海事大学,工学硕士论文,2006.
[67]Cherkassky B.V,Goldberg A.V,Radzik T. Shortestpaths algorithms:theory and experimental evaluation[J].Mathematical Programming,1996,73(2):129-174.
[68]Metropolis N,Rosenbluth A,Rosenbluth M,et al. Equation of state calculations by fast computing machines[J].Journal of Chemical Physics,1953(21):1087-1092.
[69]王斌,尚新春,李海峰.解决车辆路径问题的混合模拟退火算法[J].计算机工程与设计,2009,30(3)：651-653.
[70]邓爱民,毛超,周彦艇.带软时间窗的集配货一体化VRP改进模拟退火算法优化研究[J].系统工程理论与实践,2009,29(5)：186-192.
[71]Colorni A, Dorigo M, Maniezzo V, and et.al. Distributed optimization by ant colonies[J]. In Proceedings of the 1st European Conference on Artificial Life,1991:134-142.
[72]Dorigo M, Maniezzo V and Colorni A. Ant System:An Autocatalytic Optimizing Process[R]. Technical Report,1991.
[73]于文莉.基于混合蚁群算法的物流配送路径优化问题的研究[J].商场现代化,2007(10)：137-138.
[74]尹训波.基于蚁群算法的物流配送路径优化[J].科技信息,2006(6)：195-196.
[75]程世娟.基于蚁群算法的最短路径搜索方法研究[J].科学技术与工程,2007(11)：5706-5708.
[76]邓玉芬,向凤红.蚁群算法在组合优化中的应用[J].电子测量技术,2007(01)：38-41.
[77]刘志硕,申金升.基于解均匀度的车辆路径问题的自适应蚁群算法[J].系统仿真学报,2005(05)：60-64.
[78]李祚泳,钟俊,彭荔红.基于蚁群算法的两地之间的最佳路径选择[J].系统工程,2004(07)：90-94.
[79]Glover F. Future paths for integer programming and links to artificial intelligence[J]. Computers Ops Res,1986(5):533-549.
[80]钟石泉,贺国光.多车场有时间窗的多车型车辆调度及其禁忌算法研究[J].运筹学学报,2005,9(4)：67-73.
[81]武妍,周欣.一种适用于求解TSP问题的改进的禁忌算法[J].计算机工程共与应用,2008,44(1)：57-59.
[82]李志成,吴芳,徐琛,李静.多线路准快速公交调度优化及混合遗传禁忌算法仿真[J].计算机应用,2009,29(1)：139-142.
[83]张超勇,高亮,李新宇,邵新宇.基于进化禁忌算法的Job-Shop调度问题研究[J].华中科技大学学报(自然科学版),2009,37(8)：80-84.
[84]Holland J H. Adaptation in natural and artificial systems[M].Massachusetts:MIT Press,1975.
[85]Laporte G. The vehicle routing problem:An overview of exact and approximation algorithm[J].European Journal of Operational Research,1992,5(9):345-358.
[86]Laporte G,Gendreau M,Potvin J Y. Classical and modern heuristics for the vehicle routing problem[J].Intel Trans in OperationResearch,2000(7):285-300.
[87]Yingjie Zhong,Michael H.Cole. A vehicle routing problem with backhauls and time windows:A guided local search solution[J].Transportation Research Part E,2005,:131-144.
[88]Michalewicz Z. Genetic Algorithm+Data Structure=Evolution Programs[M].3rd Edition. Springer-Verlag,1996.
[89]程细得,刘祖源.内河船舶避碰路径优化研究[J],武汉理工大学学报(交通科学与工程版),2006,30(4)：576-578.
[90]姜大立,杨西龙,杜文,周贤伟.车辆路径问题的遗传算法研究[J].系统工程理论与实践,1999(06)：4045.
[91]唐坤.车辆路径问题中的遗传算法设计[J].东华大学学报(自然科学版),2002,28(01)：66-70.
[92]李擎,谢四江,童新海,王志良.一种用于车辆最短路径规划的自适应遗传算法及其与Dijkstra和A-*算法的比较[J].北京科技大学学报,2006,28(11)：1082-1086.
[93]刘刚,曹勇,李华德.几种改进遗传算法的性能比较[J].微计算机信息,2007，23(30)：190-192.
[94]徐庆征,柯熙政.求解最短路径的遗传算法中若干问题的讨论[J].计算机工程与设计,2008，29(06)：1507-1509.
[95]赵艳,王琳莎,吕意.基于最短路谈供应链整体优化[J].物流技术,2009,28(6)：104-105.
[96]孟凡江,高输喜,杨新安,王瑶.多路径分配的车流径路优化模型[J].辽宁工程技术大学学报(自然科学版),2008,27：93-95.
[97]刘根生,苏飞,赵娣.基于Dijkstra算法的两点间多目标最优路径问题建模和优化[J].池州师专学报,2007,21(03)：17-22.
[98]冯震,刘佳,李靖,曹延飞.复杂网络中最短路径问题的求解算法研究[J].自动化技术与应用,2010,29(03)：32-35.
[99]孙华灿,李旭宏,陈大伟,于世军.综合运输网络中合理路径优化模型,东南大学学报(自然科学版),2008,38(5)：873-877.
[100]夏珩,郑四发,李兵,曹剑东,连小珉,李克强.干线运输优化的两阶段局部搜索启发式算法[J].系统仿真学报,2008，20(15)：4141-4145.
[101]陈德良.集成GIS的集装箱多式联运路径优化方法[J].物流技术,2005,6：80-82.
[102]顾国林,闫海峰,谭云江.中心站间铁路集装箱运输径路选择优化研究[J].铁道货运，2006，4：9-12.
[103]贺国先.集装箱公铁联运的费用加权最短路计算机算法[J].铁道学报,2006,28(1)：1-5.
[104]王斌,唐国春.航运集装箱运输路径选择优化研究[J].交通运输系统工程与信息,2008,28(3)：90-95.
[105]张北平.我国国际集装箱多式联运面临的问题及对策[J].现代物流,2008,1：59-60.
[106]杨清波.美国多式联运综述[J].铁道货运,2004,5：39-41.
[107]武娜.对发展我国多式联运的建议[J].环渤海经济瞭望.2003,10：22-24.
[108]高媛丽.东北地区集装箱多式联运通道发展分析[D].大连海事大学,工学硕士论文,2004.
[109]周宁.发展我国多式联运业的思考[J].广东农工商职业技术学院学报,2006,6：24-27.
[l 10]张熳.加快发展我国集装箱海铁联运的思考[J].铁道货运,2008,9：39-41.
[111]苏顺虎.快速扩充铁路运输能力推动集装箱多式联运加快发展[J].铁道运输与经济,2007,1：1-3.
[112]葛瑞,冯欲晓,郎茂祥.我国集装箱海铁联运存在的问题及对策研究[J].物流科技,2007,5：126-128.
[113]盛刚.国内集装箱过式联运发展对策研究[D].吉林大学,工学硕士论文,2009.
[114]王淑云.第三方物流服务采购研究[J].公路交通科技2004,5：141-148.
[115]付晓凤,马彬,张娟,王肇飞.多目标一体化的运路径优化方法研究[J].铁道运输与经济,2009,31(9)：83-85.
[116]王玲玲,李晓萍,覃运梅.多式联运企业运输路径的选择优化[J].商场现代化,2008(553)：18.
[117]谢芳,张楠,纪寿文.基于AHP的多式联运路径选择研究[J].物流技术,2006,29(7)：13-17.
[118]陈香兰,李曦,龚育昌.服务组合中一种服务组合路径优化方法研究[J].小型微型计算机系统2008(9)：1569-1573.
[2]Friedman L. Competitive bidding strategy[J]. Operation Research,1956,4(1):104-112.
[3]William Vickrey. Counter speculation, Auctions, and Competitive Sealed Tenders[J]. Journal of Finance,1961,16(1),8-37.
[4]王文举.拍卖与招标的对策论分析[J].数量经济技术经济研究,1998(1)：43-46.
[5]William Vickrey. Auction and Bidding Games[M]. New Jersey, USA:Princeton University Press,1962:15-27.
[6]窦莉梅.关于拍卖价格理论研究的文献述评[J].上海商学院学报,2009,10(2)：45-51.
[7]GrieSmer J, Levitan R, Shubik M. Towards a Study of Bidding Processes[J]. Naval Research Logistics Quarterly,1967,14(4):415-433.
[8]保罗·柯伦柏著,钟鸿钧译.拍卖：理论与实践[M].北京：中国人民大学出版社,2006：24.
[9]Ahmed Doghmi, Abderrahmane Ziad. Reexamination of Maskin's Theorem on Nash implementability[J]. Economics Letters,2008,100(1):150-152.
[10]张本健.赫维茨、马斯金、迈尔森：诺贝尔!经济三剑客[N].池州日报(九华周刊),2007.12.15.
[11]Roger B. Myerson. Optimal Auction Design[J], Mathematics of Operations Research,1981,6(1): 58-73.
[12]John Riley and William Samuelson. Optimal auctions[J]. American Economic Review, 1981,71(3):381-392.
[13]Milgrom Paul, Robert Weber. The Value of Information in a Sealed Bid Auction[J]. Journal of Mathematical Economics,1982,10(1):105-114.
[14]Eric Maskin, John Riley. Monopoly with Incomplete Information[J]. Rand Journal of Economics,1984,15(2):171-196.
[15]Paul Klemperer. Auctions with Almost Common Values[J]. European Economic Review,1998, 42(3):757-769.
[16]Paul Klemperer. Auction Theory:A Guide to the Literature[J]. Journal of Economic Surveys, 1999,13(3):227-286.
[17]Paul Klemperer. Applying Auction Theory to Economics.[J]. Wall Street Journal (Asia), 2000,5(10):8.
[18]方齐云,熊启滨.霍姆斯特朗和米尔格罗姆企业最优激励理论述评[J].经济学动态,2007(09)：103-107.
[19]Preston R. McAfee, John Mcmillan. Auctions and Bidding[J]. Journal of Economic Literature, 1987,25(2):699-738.
[20]Eric Maskin, John Riley. Auction Theory with Private Values[J]. American Economic Review, 1995,75(2):150-156.
[21]保罗·柯伦柏著,钟鸿钧译.拍卖：理论与实践[M].北京：中国人民大学出版社,2006：66.
[22]许永国.拍卖经济理论综述[J].经济研究,2002(9)：84-91.
[23]胡斌,刘仲英.基于智能代理的多维拍卖模型的设计[J].计算机工程与应用,2005,41(1)：8-10.
[24]蔡志明.拍卖理论与实验研究[J].经济科学1999(2)：117-125.
[25]邵晓双,谭德庆.招投标理论研究现状[J].中国市场,2008,26(6)：101-102.
[26]詹文杰,汪寿阳.评“Smith奥秘”与双向拍卖的研究进展[J].管理科学学报,2003,6(1)：1-12.
[27]刘树林.担保拍卖理论研究[J].数量经济技术经济研究,2004,21(12)：44-53.
[28]杜黎,胡奇英.网上拍卖品数量的优化[J],西安电子科技大学学报,2003,30(1)：120-124.
[29]马俊,邱菀华.多物品拍卖中的多人投标决策问题研究[J]，系统工程理论与实践,2002(1)：83-87.
[30]Rassenti,SetPhen.J,Vernon L.Smith and Robert L.Bulfin. A combinatorial auction mechanism for airport time slot allocation[J]. Bell Journal of econmics,1982,13:402-417.
[31]Jeffrey S.Banks,John O.Ledyard, and David P. Porter. Allocating uncertain and unresponsive sources:an experimental approach[J]. RAND Journal of Economics,1989,20(1) 1-25.
[32]Che Y K. Design competition through multidimensional auctions[J]. RAND Journal of Economics,1993,24:668-680.
[33]MYERSON R B. Optimal auction design[J]. Math. Operations Res,1981,6 (1):58-73.
[34]陈剑,黄河.基于树型结构的在线逆向组合拍卖模型[J].系统工程理论方法应用,2004,13(4)：310-315.
[35]陈剑,黄河.逆向组合拍卖投标者获胜概率研究[J].系统工程理论与实践,2005(3)：13-19.
[36]黄河,陈剑.政府采购组合拍卖机制[J].重庆大学学报(自然科学版),2006,29(6)：140-143.
[37]黄河,陈剑.采购组合拍卖投标均衡策略研究[J].系统工程理论与实践,2007(10)：93-97
[38]黄河,陈剑.采购组合拍卖改进机制研究[J].系统工程理论与实践2007(11)：43-47.
[39]黄河,但斌,徐鸿雁.基于树型结构的采购组合拍卖获胜概率计算方法研究[J].数学的实践与认识,2008,38(1)：16-21.
[40]范小勇,梁樑,古春生.多回合组合双向拍卖交易机制研究[J].系统工程理论与实践,2005,1：32-36.
[41]柏寰.基于Agent的多单位组合拍卖研究[D].西南师范大学,工学硕士论文,2005.
[42]陈李钢.电子商务下的组合拍卖机制设计与模型优化研究[D].哈尔滨工业大学,管理学硕士论文,2006.
[43]黄海新,薛世彤,汪定伟.多物品双向拍卖机制设计[J].东北大学学报(自然科学版),2006,27(11)：1193-1195.
[44]Tuomas Snadholm. An algorithm for optimal winner determination in combinatorial auetions[J]. Artificial Intelligence,135:1-54,2002.
[45]Tuomas Sanhdolm, Subhash Suri. BOB:Imporved winner determination in combinatorial auetions and generalizations[J]. Artificial Intelligence,145:33-58,2003.
[46]Rothkopf M.H, Pekec A, Harstad R. M. Computationally manageable combinatorial auctions[J]. Management Science44,1995:1131-1147.
[47]Arne Andesrson. Mattias Tenhunen, FredrikYgge. Inter Programming for combinatorial auction winner determination[J]. In Proceedings of the Fourth International Conference on Multi-Agent System,Boston AM,2000:39-46.
[48]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.
[49]Hohner G, Rich J, NG E, et al. Combinatorial and quality discount procurement auctions with mutual benefits at Mars Incorporated [J]. Interfaces,2003,33(1):23-35.
[50]Garfinkel R, Nemhauser G. L. The set partitioning problem:Set covering with equality constraints[J]. Operations Research.1969,17(5):848-856.
[51]Rassenti S. J, Smith V. L, Bulfin R L. A combinatorial auction mechanism for airport time slot allocation[J]. Bell Journal of Economics,1982,13:402-417.
[52]Sandholm T. Approaches towinner determination in combinatorial auctibns[J]. Decision Support Systems,2000,28(1-2):165-176.
[53]Leyton B. K, Shoham Y, Tennenholtz M. An algorithm for multi-unit combinatorial auctions[R]. 17th National Conference on Artificial Intelligence, Austin, TX:2001:56-61.
[54]Arne Andersson, Mattias Tenhunen, Fredrik Ygge. Integer programming for combinatorial auction winner determination[R]. Fourth International Conference on Multi-agent Systems Proceedings, Boston, MA:2000:39-46.
[55]Stan van Hoesel, Rudolf Miller. Optimization in electronic markets:Examples in combinatorial auctions[J]. Netnomics,2001(3):23-33.
[56]Sandolm T. W. An algorithm for optimal winner determination in combinatorial auctions[R]. Proceedings of Sixteeth International Joint Conference on Artificial Intelligence, Stockholm, Sweden,1999:542-547.
[57]Kwon R, Anandalingam G, Ungar L. Iterative combinatorial auctions with bidder-determined combinations. Management Science.2005,51(3),407-418.
[58]CHEN Peiyou, WANG Dingwei. Approaches to winner determination in combinatorial Auctions:A Review[R]. Proceedings of International Conference on Regional Logistics and Supply Chain Manageement, Shenyang:Baishan Press,2002:22-30.
[59]陈培友,汪定伟.组合拍卖竞胜标确定问题的混沌搜索算法[J].管理科学学报,2003,6(5)：24-28.
[60]陈培友,汪定伟.用改进遗传算法求解组合拍卖竞胜标[J].东北大学学报(自然科学版),2004,25(4)：349-351.
[61]Song J, Regan A.C. Combinatorial auctions for transportation service procurement:The carrier perspective. Transportation Research Record, pages 40-46,2002.
[62]Sheff i Y. Combinatorial Auctions in the Procurement of Transportation Services. Interfaces. 34(4),245-252.2004.
[63]Caplice C, Sheffi Y. Theory and Practice of Optimization-Based Bidding for Motor Carriers Transport Services, Journal of Business Logistics Vol.24, No.2,2003.
[64]杨华龙,靳志宏.集装箱航运服务组合拍卖模型研究[J].中国航海,2007(2)：66-69.
[65]刘志杰,季令,叶玉玲.路网车流径路优化调整中的最短径路算法[J].贵州师范大学学报(自 然科学版),2007,25(2)：88-90.
[66]东方.基于免疫算法的物流配送VRP研究[D].大连海事大学,工学硕士论文,2006.
[67]Cherkassky B.V,Goldberg A.V,Radzik T. Shortestpaths algorithms:theory and experimental evaluation[J].Mathematical Programming,1996,73(2):129-174.
[68]Metropolis N,Rosenbluth A,Rosenbluth M,et al. Equation of state calculations by fast computing machines[J].Journal of Chemical Physics,1953(21):1087-1092.
[69]王斌,尚新春,李海峰.解决车辆路径问题的混合模拟退火算法[J].计算机工程与设计,2009,30(3)：651-653.
[70]邓爱民,毛超,周彦艇.带软时间窗的集配货一体化VRP改进模拟退火算法优化研究[J].系统工程理论与实践,2009,29(5)：186-192.
[71]Colorni A, Dorigo M, Maniezzo V, and et.al. Distributed optimization by ant colonies[J]. In Proceedings of the 1st European Conference on Artificial Life,1991:134-142.
[72]Dorigo M, Maniezzo V and Colorni A. Ant System:An Autocatalytic Optimizing Process[R]. Technical Report,1991.
[73]于文莉.基于混合蚁群算法的物流配送路径优化问题的研究[J].商场现代化,2007(10)：137-138.
[74]尹训波.基于蚁群算法的物流配送路径优化[J].科技信息,2006(6)：195-196.
[75]程世娟.基于蚁群算法的最短路径搜索方法研究[J].科学技术与工程,2007(11)：5706-5708.
[76]邓玉芬,向凤红.蚁群算法在组合优化中的应用[J].电子测量技术,2007(01)：38-41.
[77]刘志硕,申金升.基于解均匀度的车辆路径问题的自适应蚁群算法[J].系统仿真学报,2005(05)：60-64.
[78]李祚泳,钟俊,彭荔红.基于蚁群算法的两地之间的最佳路径选择[J].系统工程,2004(07)：90-94.
[79]Glover F. Future paths for integer programming and links to artificial intelligence[J]. Computers Ops Res,1986(5):533-549.
[80]钟石泉,贺国光.多车场有时间窗的多车型车辆调度及其禁忌算法研究[J].运筹学学报,2005,9(4)：67-73.
[81]武妍,周欣.一种适用于求解TSP问题的改进的禁忌算法[J].计算机工程共与应用,2008,44(1)：57-59.
[82]李志成,吴芳,徐琛,李静.多线路准快速公交调度优化及混合遗传禁忌算法仿真[J].计算机应用,2009,29(1)：139-142.
[83]张超勇,高亮,李新宇,邵新宇.基于进化禁忌算法的Job-Shop调度问题研究[J].华中科技大学学报(自然科学版),2009,37(8)：80-84.
[84]Holland J H. Adaptation in natural and artificial systems[M].Massachusetts:MIT Press,1975.
[85]Laporte G. The vehicle routing problem:An overview of exact and approximation algorithm[J].European Journal of Operational Research,1992,5(9):345-358.
[86]Laporte G,Gendreau M,Potvin J Y. Classical and modern heuristics for the vehicle routing problem[J].Intel Trans in OperationResearch,2000(7):285-300.
[87]Yingjie Zhong,Michael H.Cole. A vehicle routing problem with backhauls and time windows:A guided local search solution[J].Transportation Research Part E,2005,:131-144.
[88]Michalewicz Z. Genetic Algorithm+Data Structure=Evolution Programs[M].3rd Edition. Springer-Verlag,1996.
[89]程细得,刘祖源.内河船舶避碰路径优化研究[J],武汉理工大学学报(交通科学与工程版),2006,30(4)：576-578.
[90]姜大立,杨西龙,杜文,周贤伟.车辆路径问题的遗传算法研究[J].系统工程理论与实践,1999(06)：4045.
[91]唐坤.车辆路径问题中的遗传算法设计[J].东华大学学报(自然科学版),2002,28(01)：66-70.
[92]李擎,谢四江,童新海,王志良.一种用于车辆最短路径规划的自适应遗传算法及其与Dijkstra和A-*算法的比较[J].北京科技大学学报,2006,28(11)：1082-1086.
[93]刘刚,曹勇,李华德.几种改进遗传算法的性能比较[J].微计算机信息,2007，23(30)：190-192.
[94]徐庆征,柯熙政.求解最短路径的遗传算法中若干问题的讨论[J].计算机工程与设计,2008，29(06)：1507-1509.
[95]赵艳,王琳莎,吕意.基于最短路谈供应链整体优化[J].物流技术,2009,28(6)：104-105.
[96]孟凡江,高输喜,杨新安,王瑶.多路径分配的车流径路优化模型[J].辽宁工程技术大学学报(自然科学版),2008,27：93-95.
[97]刘根生,苏飞,赵娣.基于Dijkstra算法的两点间多目标最优路径问题建模和优化[J].池州师专学报,2007,21(03)：17-22.
[98]冯震,刘佳,李靖,曹延飞.复杂网络中最短路径问题的求解算法研究[J].自动化技术与应用,2010,29(03)：32-35.
[99]孙华灿,李旭宏,陈大伟,于世军.综合运输网络中合理路径优化模型,东南大学学报(自然科学版),2008,38(5)：873-877.
[100]夏珩,郑四发,李兵,曹剑东,连小珉,李克强.干线运输优化的两阶段局部搜索启发式算法[J].系统仿真学报,2008，20(15)：4141-4145.
[101]陈德良.集成GIS的集装箱多式联运路径优化方法[J].物流技术,2005,6：80-82.
[102]顾国林,闫海峰,谭云江.中心站间铁路集装箱运输径路选择优化研究[J].铁道货运，2006，4：9-12.
[103]贺国先.集装箱公铁联运的费用加权最短路计算机算法[J].铁道学报,2006,28(1)：1-5.
[104]王斌,唐国春.航运集装箱运输路径选择优化研究[J].交通运输系统工程与信息,2008,28(3)：90-95.
[105]张北平.我国国际集装箱多式联运面临的问题及对策[J].现代物流,2008,1：59-60.
[106]杨清波.美国多式联运综述[J].铁道货运,2004,5：39-41.
[107]武娜.对发展我国多式联运的建议[J].环渤海经济瞭望.2003,10：22-24.
[108]高媛丽.东北地区集装箱多式联运通道发展分析[D].大连海事大学,工学硕士论文,2004.
[109]周宁.发展我国多式联运业的思考[J].广东农工商职业技术学院学报,2006,6：24-27.
[l 10]张熳.加快发展我国集装箱海铁联运的思考[J].铁道货运,2008,9：39-41.
[111]苏顺虎.快速扩充铁路运输能力推动集装箱多式联运加快发展[J].铁道运输与经济,2007,1：1-3.
[112]葛瑞,冯欲晓,郎茂祥.我国集装箱海铁联运存在的问题及对策研究[J].物流科技,2007,5：126-128.
[113]盛刚.国内集装箱过式联运发展对策研究[D].吉林大学,工学硕士论文,2009.
[114]王淑云.第三方物流服务采购研究[J].公路交通科技2004,5：141-148.
[115]付晓凤,马彬,张娟,王肇飞.多目标一体化的运路径优化方法研究[J].铁道运输与经济,2009,31(9)：83-85.
[116]王玲玲,李晓萍,覃运梅.多式联运企业运输路径的选择优化[J].商场现代化,2008(553)：18.
[117]谢芳,张楠,纪寿文.基于AHP的多式联运路径选择研究[J].物流技术,2006,29(7)：13-17.
[118]陈香兰,李曦,龚育昌.服务组合中一种服务组合路径优化方法研究[J].小型微型计算机系统2008(9)：1569-1573.