不确定信息车辆路径问题及其算法研究
|
摘要
随着全球市场分工的进一步细化,世界范围内贸易的频度与数量都呈现出显著的增长,物流效率成为甄别一个企业乃至一个国家经济运行效率的重要指标之一。车辆路径问题是物流运输系统的核心组件,并且由于其研究方法及成果可直接应用于组合优化领域,因而自诞生之日起就得到了理论与实务界的广泛关注,取得了大量的成果。但是,受于时代经济与信息处理技术的限制,这些研究大多是确定型模型,即假设在安排车辆路径之前所有的相关信息都已经知道并且确定。现今,社会经济运行的环境较之从前发生了巨大的变化,一方面,经济活动频率大大增加,并且伴随着大量的不确定信息;另一方面,通信及计算机技术的飞速发展不仅使社会经济秩序避免了因不确定信息的泛滥而可能引发的混乱,而且进一步促使人们利用这些不确定信息创造更多的财富。可以说,对不确定信息的处理策略及技术手段直接决定了经济实体的效率、盈利水平。针对这一新情况的产生、发展,本文对不确定信息车辆路径进行研究,开展了以下工作:
首先,对不确定信息车辆路径问题的进行了一般概述。阐述了车辆路径问题的定义、构成、分类、模型以及求解车辆路径问题的经典算法;在此基础上,将不确定信息车辆路径问题划分为非实时信息处理的不确定信息车辆路径问题和实时信息处理的不确定信息车辆路径问题两大类,分析了不确定信息车辆路径问题的内涵、特点、研究现状及相应的各种数学模型、优化方法,指出研究中存在的问题。
其次,对求解车辆路径问题的各类启发式算法的研究现状进行了较为详细的综述和归纳,阐述它们诞生的源泉思想、运作流程,并详尽分析了它们在车辆路径问题中的应用进展。在此基础上提出了新的改良算法,即最大熵分布估计算法、自感应蚁群算法和混合粒子群算法,进行了相应的理论分析与证明,为处理复杂的不确定信息车辆路径问题提供必要的数学求解工具。
第三,逐次递进研究了2类随机车辆路径问题。首先,研究仅有供(取)货任务的车辆路径问题,即随机需求车辆路径问题。对此,结合现实生活中长期顾客服务记录所隐含的统计性知识构建了新的统计学模型,设计了求解该模型的混合粒子群算法,并通过大量的仿真试验比较分析了新算法与其他智能算法的优劣。其次,进一步研究具有供货和取货双重任务的车辆路径问题,即同时供货和取货的随机车辆路径问题。应用上节的统计学思想,构建了该类问题的整数规划模型,提出期望程度因子、距离性比因子等概念,设计了针对该问题的自感应蚁群算法,并与其他优化算法进行了数据测试与比较,验证了算法的有效性。
第四,分析了模糊车辆路径问题,综合选择车辆行驶时间以及顾客预约时间为模糊信息参量,克服了现有研究仅局限于某种单模糊变量而未能系统考虑复合模糊变量的缺陷,并采用细分顾客类别以吸收配送者知识系统的方法,分别以物流企业效用最大化和顾客效用最大化两种决策目标构建了2类模糊车辆调度优化模型,给出了求解该类问题的最大熵分布估计算法,并结合仿真试验分析了决策参数的变化对2类模型计算结果的影响,给出了相关参数制定的依据。
第五,渐进深入研究了2类实时动态车辆路径问题。首先,研究了非满载动态车辆路径问题,即动态旅行商问题,阐述了动态车辆路径问题实现的技术支持单元以及动态信息数据生成的方法,并利用仿真试验考察了实时不确定信息车辆路径问题各现场一次性优化方法的性能。其次,研究了更具现实意义的满载有时间窗动态车辆路径问题,在服务中心处理新信息的机制以及动态规划行驶中车辆行驶路径的策略方面提出了新的见解,阐明物流企业对新信息的处理方法,提出动态车辆路径问题优化的分置策略,设计了针对该问题的改进蚁群算法以及相应的分段计算启用规则,并结合仿真试验与各现场一次性优化方法及基本蚁群算法进行了性能比较,验证新策略及新算法的有效性。
最后,在上述理论的基础上,以VB为开发语言,开发出了具有Windows图形界面的动态车辆路径规划系统,该系统可在电子地图上动态显示出车辆的行驶路线及当前位置,并可根据动态信息的变化确定最优路径并显示输出。
Along with the further division of labor in global market, trade frequency and quantity in the worldwide scale have grown remarkably, and the logistics efficiency has become one of important indicators in judging economy operating efficiency for an enterprise and even a state. Vehicle routing problem is the main problem in the field of logistics transportation system, for its research methodology and the achievement can apply directly to the combination optimization domain, thus it has obtained the widespread attention and made a great achievement in theoretical and the practical realm since it was born. However, restrained by the time economical background and the information processing technology, these researches are mostly confined in certainty models, namely supposing all related information has known and determined before planning vehicles routing. Nowadays, the environment of social economy operating has changed greatly comparing with the past. On the one hand, economic activity frequency increases considerably, and also following the massive indefinite information; on the other hand, the rapid development of correspondence and computer technology not only causes the social economy order to avoid the confusion resulting from the flood of indefinite information, but also further urges the people to use these indefinite information to create more wealth. It can be said that the processing strategy and the technical method to indefinite information directly decides efficiency and profit level of a economic entity. In view of this new situation, this article studies the uncertain information vehicle routing problem, and the work are as follows:
First, this article gives the general outline to uncertain information vehicle routing problem, including the definition, the constitution, the classification, the model as well as the classical algorithms to solve the vehicle routing problem. On this basis, this article puts the uncertain information vehicle routing problem into two parts----the problems of the non-real-time information processing and the real-time information processing according to the advancement of time development. And this article also analyzes the connotation, the characteristic, the research present situation of uncertain information vehicle routing problem and the corresponding mathematical model and the optimized method, and then points out the problems in the process of research.
Second, this article makes a throughout overview and summary of the present situation of all kinds of heuristic algorithms to solve vehicle routing problem, elaborates the source thinking and the operation flow of these algorithms and then gives a detailed analysis of application progress into vehicle routing problem. On this basis, this article has proposed new algorithms----maximum entropy distribution algorithm, self-telepathy ant colony algorithm and hybrid particle swarm optimization, and carried on the corresponding theoretical analysis and the proofs, which provide the essential mathematics solution tool to deal with the complex indefinite information vehicle routing problem.
Third, this article gradually researches on tow kinds of stochastic vehicle routing problems. The work studies from vehicle routing problem with only supplying or carrying assignment. To this, combining with the long-term customer record in the real life, this article constructs the new statistics model, designs hybrid particle swarm optimization to solve this model, and comparatively analyzes advantage and weakness between the new algorithm and other algorithms. Then, this article further studies on the vehicle routing problem with simultaneous selivery and pick-up.By application the statistics method in previous section, this article constructs integer programming model for this kind of question, proposes concepts of the expectation degree factor, the distance compares factor and so on, designs self- telepathy ant colony algorithm to solve this question, compares dates with other optimized algorithms which finally validates this algorithm.
Forth, this article analyzes the fuzzy vehicle routing problem. Taking vehicle’s fuzzy travel time and customer’s fuzzy due time as fuzzy information parameter, using the method of subdivides the customer class to absorb the allocation knowledge system and using the method of subdividing the customer’s class to absorb the carriers’knowledge system, this article converts two deciding-making goals of logistic enterprises’utility maximization and customers’s utility maximization to two kinds of fuzzy information vehicle scheduling model and gives maximum entropy distribution algorithm to solve this kind of problem, analyzes the influence of the computed results of these two kinds of models with the change of policy-making parameters and suggests the frame basis of correlation parameters of the formulation.
Fifth, this article gradually lucubrates two kinds of dynamic vehicle routing problem. The research starts from dynamic vehicle routing problem of non-full loads, namely dynamic traveling repairman problem, elaborates technical support for the realization of dynamic vehicle routing problem as well as the production method of dynamic information datas, and inspects the performance of various one-off optimization strategies in various scenes of real-time uncertain information vehicle routing problem by the simulation experiment.Then, this article makes study on dynamic vehicle routing problem of full loads with time windows, which is a more practical significance problem. This article also proposes new notions about the mechanism of deal with new information and the strategy of the dynamic programming of travel routing of the traveling vehicles, which expounds the methods of logistic enterprise to deal with new information, proposes separated-gang strategy to optimize dynamic vehicle routing problem,designs modified ant colony optimization to improve this problem and the corresponding using regulation of replicate computation, and compares the performance of various one-off optimization strategies and ant colony algorithm based on artificial test which confirms the validity of the new strategy and the new algorithm.
At last, on the basis of the above theory, taking VB as the development language, this article develops dynamic vehicle routing plan system that has Windows graphical interface. And this system can dynamically demonstrate the vehicles’traveling routing and the current position on the electronic map, choose the optimal routing according to the dynamic information change, and then demonstrate the output.
首先,对不确定信息车辆路径问题的进行了一般概述。阐述了车辆路径问题的定义、构成、分类、模型以及求解车辆路径问题的经典算法;在此基础上,将不确定信息车辆路径问题划分为非实时信息处理的不确定信息车辆路径问题和实时信息处理的不确定信息车辆路径问题两大类,分析了不确定信息车辆路径问题的内涵、特点、研究现状及相应的各种数学模型、优化方法,指出研究中存在的问题。
其次,对求解车辆路径问题的各类启发式算法的研究现状进行了较为详细的综述和归纳,阐述它们诞生的源泉思想、运作流程,并详尽分析了它们在车辆路径问题中的应用进展。在此基础上提出了新的改良算法,即最大熵分布估计算法、自感应蚁群算法和混合粒子群算法,进行了相应的理论分析与证明,为处理复杂的不确定信息车辆路径问题提供必要的数学求解工具。
第三,逐次递进研究了2类随机车辆路径问题。首先,研究仅有供(取)货任务的车辆路径问题,即随机需求车辆路径问题。对此,结合现实生活中长期顾客服务记录所隐含的统计性知识构建了新的统计学模型,设计了求解该模型的混合粒子群算法,并通过大量的仿真试验比较分析了新算法与其他智能算法的优劣。其次,进一步研究具有供货和取货双重任务的车辆路径问题,即同时供货和取货的随机车辆路径问题。应用上节的统计学思想,构建了该类问题的整数规划模型,提出期望程度因子、距离性比因子等概念,设计了针对该问题的自感应蚁群算法,并与其他优化算法进行了数据测试与比较,验证了算法的有效性。
第四,分析了模糊车辆路径问题,综合选择车辆行驶时间以及顾客预约时间为模糊信息参量,克服了现有研究仅局限于某种单模糊变量而未能系统考虑复合模糊变量的缺陷,并采用细分顾客类别以吸收配送者知识系统的方法,分别以物流企业效用最大化和顾客效用最大化两种决策目标构建了2类模糊车辆调度优化模型,给出了求解该类问题的最大熵分布估计算法,并结合仿真试验分析了决策参数的变化对2类模型计算结果的影响,给出了相关参数制定的依据。
第五,渐进深入研究了2类实时动态车辆路径问题。首先,研究了非满载动态车辆路径问题,即动态旅行商问题,阐述了动态车辆路径问题实现的技术支持单元以及动态信息数据生成的方法,并利用仿真试验考察了实时不确定信息车辆路径问题各现场一次性优化方法的性能。其次,研究了更具现实意义的满载有时间窗动态车辆路径问题,在服务中心处理新信息的机制以及动态规划行驶中车辆行驶路径的策略方面提出了新的见解,阐明物流企业对新信息的处理方法,提出动态车辆路径问题优化的分置策略,设计了针对该问题的改进蚁群算法以及相应的分段计算启用规则,并结合仿真试验与各现场一次性优化方法及基本蚁群算法进行了性能比较,验证新策略及新算法的有效性。
最后,在上述理论的基础上,以VB为开发语言,开发出了具有Windows图形界面的动态车辆路径规划系统,该系统可在电子地图上动态显示出车辆的行驶路线及当前位置,并可根据动态信息的变化确定最优路径并显示输出。
Along with the further division of labor in global market, trade frequency and quantity in the worldwide scale have grown remarkably, and the logistics efficiency has become one of important indicators in judging economy operating efficiency for an enterprise and even a state. Vehicle routing problem is the main problem in the field of logistics transportation system, for its research methodology and the achievement can apply directly to the combination optimization domain, thus it has obtained the widespread attention and made a great achievement in theoretical and the practical realm since it was born. However, restrained by the time economical background and the information processing technology, these researches are mostly confined in certainty models, namely supposing all related information has known and determined before planning vehicles routing. Nowadays, the environment of social economy operating has changed greatly comparing with the past. On the one hand, economic activity frequency increases considerably, and also following the massive indefinite information; on the other hand, the rapid development of correspondence and computer technology not only causes the social economy order to avoid the confusion resulting from the flood of indefinite information, but also further urges the people to use these indefinite information to create more wealth. It can be said that the processing strategy and the technical method to indefinite information directly decides efficiency and profit level of a economic entity. In view of this new situation, this article studies the uncertain information vehicle routing problem, and the work are as follows:
First, this article gives the general outline to uncertain information vehicle routing problem, including the definition, the constitution, the classification, the model as well as the classical algorithms to solve the vehicle routing problem. On this basis, this article puts the uncertain information vehicle routing problem into two parts----the problems of the non-real-time information processing and the real-time information processing according to the advancement of time development. And this article also analyzes the connotation, the characteristic, the research present situation of uncertain information vehicle routing problem and the corresponding mathematical model and the optimized method, and then points out the problems in the process of research.
Second, this article makes a throughout overview and summary of the present situation of all kinds of heuristic algorithms to solve vehicle routing problem, elaborates the source thinking and the operation flow of these algorithms and then gives a detailed analysis of application progress into vehicle routing problem. On this basis, this article has proposed new algorithms----maximum entropy distribution algorithm, self-telepathy ant colony algorithm and hybrid particle swarm optimization, and carried on the corresponding theoretical analysis and the proofs, which provide the essential mathematics solution tool to deal with the complex indefinite information vehicle routing problem.
Third, this article gradually researches on tow kinds of stochastic vehicle routing problems. The work studies from vehicle routing problem with only supplying or carrying assignment. To this, combining with the long-term customer record in the real life, this article constructs the new statistics model, designs hybrid particle swarm optimization to solve this model, and comparatively analyzes advantage and weakness between the new algorithm and other algorithms. Then, this article further studies on the vehicle routing problem with simultaneous selivery and pick-up.By application the statistics method in previous section, this article constructs integer programming model for this kind of question, proposes concepts of the expectation degree factor, the distance compares factor and so on, designs self- telepathy ant colony algorithm to solve this question, compares dates with other optimized algorithms which finally validates this algorithm.
Forth, this article analyzes the fuzzy vehicle routing problem. Taking vehicle’s fuzzy travel time and customer’s fuzzy due time as fuzzy information parameter, using the method of subdivides the customer class to absorb the allocation knowledge system and using the method of subdividing the customer’s class to absorb the carriers’knowledge system, this article converts two deciding-making goals of logistic enterprises’utility maximization and customers’s utility maximization to two kinds of fuzzy information vehicle scheduling model and gives maximum entropy distribution algorithm to solve this kind of problem, analyzes the influence of the computed results of these two kinds of models with the change of policy-making parameters and suggests the frame basis of correlation parameters of the formulation.
Fifth, this article gradually lucubrates two kinds of dynamic vehicle routing problem. The research starts from dynamic vehicle routing problem of non-full loads, namely dynamic traveling repairman problem, elaborates technical support for the realization of dynamic vehicle routing problem as well as the production method of dynamic information datas, and inspects the performance of various one-off optimization strategies in various scenes of real-time uncertain information vehicle routing problem by the simulation experiment.Then, this article makes study on dynamic vehicle routing problem of full loads with time windows, which is a more practical significance problem. This article also proposes new notions about the mechanism of deal with new information and the strategy of the dynamic programming of travel routing of the traveling vehicles, which expounds the methods of logistic enterprise to deal with new information, proposes separated-gang strategy to optimize dynamic vehicle routing problem,designs modified ant colony optimization to improve this problem and the corresponding using regulation of replicate computation, and compares the performance of various one-off optimization strategies and ant colony algorithm based on artificial test which confirms the validity of the new strategy and the new algorithm.
At last, on the basis of the above theory, taking VB as the development language, this article develops dynamic vehicle routing plan system that has Windows graphical interface. And this system can dynamically demonstrate the vehicles’traveling routing and the current position on the electronic map, choose the optimal routing according to the dynamic information change, and then demonstrate the output.
引文
[1]宋华,胡左浩.现代物流与供应链管理[M].北京:经济管理出版社,2000:1-4.
[2]董明望. GDP的物流含量与物流成本[J].中国储运,2004(2):16-17.
[3]张鹏,李聪.论物流成本占GDP的比重及其现实意义[J].铁道运输与经济,2005(12):28-30.
[4]李克宁.谈物流成本与GDP[J].中国流通经济,2002(4):11-13.
[5]陈淑娴.物流成本占GDP比重中的产业结构因素[J].物流科技,2005(8):80-82.
[6] Dantzig G, Ramser J.The truck dispatching problem[J]. Management Science,1959(6):80-91.
[7]李军,郭耀煌.物流配送车辆优化调度理论[M].北京:中国物资出版社,2001:2.
[8] Bodin L D, Golden B L. Routing and scheduling of vehicles and crews:the state of art[J].Computers&OperationsResearch,1983(10):63-211.
[9]郎茂祥.配送车辆调度问题刍议[J].物流技术,2003(3):62-64.
[10]丁秋雷.带有时间窗的车辆路径问题的混合蚁群算法研究[D].大连理工大学硕士论文,2006.
[11] Laporte G, Mercure H, Nobert Y. An exact algorithm for the asymmetrical capacitated vehicle routing problem[J]. Networks,1986,16:33-46.
[12] Christofides N, Mingozzi A, Toth P. Exact algorithms for the vehicle routing problem,based on spanning the shortest path relaxation[J]. Mathematical Programming,1981,20:255-282.
[13] Eilos, Watson-Gandycdt, Christofides N. Distribution management:mathematical modelling and practica lanalysis[M]. London:Griffin,1971.
[14] Balinski M, Quandt R.On an integer program for a delivery problem[J]. Operations Research,1962,12:300-304.
[15] Fisher M L, Jaikumar R. A generalized assignment heuristic for vehicle routing[J]. Networks,1981,11:109-124.
[16] Laporte G, Nobert Y, Desrocher M.Optimal routing under capacity and distance restrictions[J]. Operations Research,1985,33:1050-1073.
[17]祝崇俊,刘民,吴澄.供应链中车辆路径问题的研究进展及前景[J].计算机集成制造系统-CIMS.2001(11):1-6.
[18]刘云忠,宣惠玉.车辆路径问题的模型及算法研究综述[J].管理工程学报,2005(1):124-130.
[19] Clarke G, Wright J W. Scheduling of vehicles from a central depot to a number of delivery points[J]. OperationsResearch,1964,12:568~581.
[20] Lin S. Computer solutions of the traveling salesman problem[J]. Bell System Technical Journal,1965,44:2245-2269.
[21] Wren A. Computers in sport Planning and Operation[M]. Ian Allan, London, 1971.
[22] Gillett B, Miller L. A heuristic algorithm for the vehicle dispatch problem[J]. OperationsResearch,1974,22:340~349.
[23] Christofides N, Mingozzi A, Toth P. Cominatorial Optimization[M]. Wiley, Chichester,1979.
[24]谢秉磊.随机车辆路径问题研究[D].西南交通大学博士论文.2003.
[25] Allan Larsen. The Dynamic Vehicle Routing Problem[D]. Printed by IMM, DTU Bookbinder Hans Meyer,2000.
[26] Tillman F. The multiple termina ldelivery problem with probabilistic demands[J]. Transportation Science,1969,3(3):192-204.
[27] Stewart W, Golden B. Stochastic vehicle routing:a comprehensive approach[J]. European Journal of Operational Research,1983,14(4):371-385.
[28] Bertsimas D. Probabilistic combinatorial optimization problems[D]. Operation ResearchCenter, Massachusetts Institute of Technology,Cambridge,MA1988.
[29] Laporte G, Louveaux F, Merxure H. An exact solution for thea priori optimization of the probabilistic traveling salesman problem[J]. Operations Research,1994,42(3):543-549.
[30] Seguin R. Probdmes stochastiques de tourneesd evehicles[D]. Centre de Reserche Sur LesTransports,University d eMontreal,1994.
[31] Gendreau M, Laporte G, Seguin R. An exact algorithm for the vehicle routing problem with stochastic customers and demands[J]. Transportation Science,1995,29(2):143-155.
[32] Gendreau M, Laporte G, Seguin R. Stochastic vehicle routing[J]. European Journal of Operational Research,1996,88(1):3-12.
[33] Kao E.A preference order dynamic program for astochastic traveling salesman problem[J]. Operations Research,1978,26(6):1033-1045.
[34] Lambert V, Laporte G, Louveaux F. Designing collection routes through bank branches[J]. Computers&Operations Research,1993,20(7):783-791.
[35]袁健,刘晋.随机需求情形VRP的Hopfield神经网络解法[J].南京航空航天大学学报,2000(5):579-585.
[36]倪勤,袁健,刘晋.随机需求的车辆路线问题的新模型[J].运筹与管理,2001(3):74-79.
[37]袁健,刘晋,卢厚清.随机需求情形VRP的退火网络解法[J].系统工程理论与实践,2002(3):109-113.
[38]刘浩,钱小燕,汪荣.随机需求VRP的一个算法[J].南京工业大学学报(自然科学版) 2004(5):9-11.
[39]陆琳,谭清美.一类随机需求VRP的混合粒子群算法研究[J].系统工程与电子技术,2006,28(2):244-247.
[40]康喜兵,甘勤涛.随机需求车辆路径问题的禁忌搜索算法研究[J].科学技术与工程,2006(13):1882-1884.
[41]陈宝文,宋申民,陈兴林.随机需求车辆路径问题及其启发式算法[J].计算机工程与设计,2007(1):138-142.
[42]刘浩,钱小燕,李舒展.单类型车辆随机需求VRP的一个算法[J].南京建筑工程学院学报(自然科学版) 2001(4):25-29.
[43]刘浩,袁健,卢厚清.两种类型车辆随机需求路由问题[J].南京航空航天大学学报,2001(2):155-158.
[44]张固,陈光亭,丁巍.多车种随机需求车辆路由问题的遗传算法[J].计算机工程与应用,2005(15):76-78.
[45]高明霞,杨涛,张春民.带时间窗的随机需求车辆路线问题的模型研究[J].兰州交通大学学报,2004(3):4-7.
[46]宋瑞,何世伟,杨海,罗康锦.基于随机需求的公交运营设计优化模型及算法[J].土木工程学报,2006(4):110-115.
[47]刘浩,钱小燕.路径长度受限的随机需求VRP的模型和算法[J].南京工业大学学报(自然科学版) ,2005(3):36-38.
[48]钱小燕,程浩,刘浩.路径长度受限的随机需求VRP的节省算法及其策略分析[J].南京工业大学学报(自然科学版) ,2006(5):33-37.
[49]郭强,谢秉磊.随机旅行时间车辆路径问题的模型及其算法[J].系统工程学报,2003(3):244-247.
[50]张乐诚,杨信丰.随机时间约束的城市物流配送车辆路径问题研究[J].物流技术,2005(9):68-70.
[51]张杨,黄庆,卜祥智.随机旅行时间局内车辆路径问题的模型及其算法[J].管理工程学报,2006(3):82-85.
[52]杨信丰,杨庆丰.随机车辆路径问题的模型及其算法[J].交通运输系统工程与信息,2006(4):75-80.
[53] Halse K. Modeling and Solving Complex Vehicle Routing Problems[D]. PhD thesis, Institute of Mathematical Statistics and Operations Research, Technical University of Denmark, Lyngby,1992.
[54] Salhi S, Nagy G. A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling[J]. Journal of the Operational Research Society, 1999,50:1034–1042.
[55] Salhi S, Nagy G. Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries[J]. European Journal of Operational Research, 2005,162:126-141.
[56] Wade A, Salhi S. An ant system algorithm for the vehicle routing problem with backhauls[C]. In: MIC_2001––4th Metaheuristic International Conference.
[57] Min H. The multiple vehicle routing problem with simultaneous delivery and pick-up points[J]. Transportation Research A 23A, 1989,377–386.
[58] Gendreau M, Laporte G, Vigo, D. Heuristics for the travelling salesman problem with pickup and delivery[J].Computers and Operations Research, 1999,26:699–714.
[59] Golden B L, Baker E, Alfaro J, Schaffer J. The vehicle routing problem with backhauling: two approaches[C]. Proceedings of the Twenty-First Annual Meeting of the S. E. TIMS, Myrtle Beach,SC, USA, 1985.
[60] Casco D O, Golden B L, Wasil E A. Vehicle routing with backhauls[C]. In: Golden BL, Assad AA, editors. Vehicle routing:methods and studies. Amsterdam: North-Holland, 1988, 127–147.
[61] Dethloff J. Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up[J]. OR Spektrum, 2001,23:79–96.
[62] Dethloff J. Relation between vehicle routing problems: An insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls[J]. Journal of the Operational Research Society ,2002,53: 115–118.
[63] Tang F A, Galvao R D.Vehicle routing problems with simultaneous pick-up and delivery service[J]. Journal of the Operational Research Society, 2002,39:19–33.
[64] Beasley J E. Route first-cluster second methods for vehicle routing[J]. Omega, 1983,11:403–408.
[65] Gillett B E, Miller L R. A heuristic algorithm for the vehicle dispatch problem[J]. Operations Research, 1974,22(4):340–349.
[66] Tang F.A, Galvao R D. A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service[J]. Computers & Operations Research,2006,33:595-619.
[67] Angelelli E, Mansini R. A branch-and-price algorithm for a simultaneous pick-up and delivery problem[C]. Working Paper,Article presented at the EURO/INFORMS Meeting, 2003.
[68]谢如鹤,刘霆,邱祝强.基于剩余装载能力的逆向物流车辆路径问题[J].系统工程.2004(10):20-23.
[69]张建勇,李军.具有同时配送和回收需求的车辆路径问题的混合遗传算法[J].中国公路学报.2006(7):118-122.
[70]陆琳,谭清美.基于自感应蚁群算法的VRPSDP问题研究[J].中国管理科学, 2007,15(2):97-103.
[71] Chen R, and Gen. M. Vehicle routing problem with fuzzy due-time using genetic algorithms.Japanese Journal of Fuzzy Theory and Systems, 1995; 7(5): 1050- 1061.
[72] Teodorovic D, Pavkovic G. The fuzzy set theory approach to the vehicle routing problem when demand at nodes is uncertain[J].Fuzzy sets and systems,1996,82:307~317.
[73] Teodorovic D, Radivojevic G. A fuzzy logic approach to dynamic Dial一A-Ride problem. Fuzzy Set and Systems. 2000,116:23-33.
[74]祝崇隽,刘民,吴澄,吴晓冰.针对模糊需求的两种2-opt算法[J].电子学报,2001(8):1035-1037.
[75]张建勇,郭耀煌,李军.模糊需求信息条件下的车辆路径问题研究[J].系统工程学报,2004(1):74-78.
[76]张建勇,李军.模糊车辆路径问题的一种混合遗传算法[J].管理工程学报,2005(2):23-26 .
[77]骆正山,王小完.基于模糊条件下车辆路径问题的研究[J].微电子学与计算机,2005(3):181-184.
[78]甘勤涛,阳平华,童钟灵.模糊需求车辆路径问题的禁忌搜索算法研究[J].长春理工大学学报,2006(1):84-86.
[79]于波,丁源.带模糊需求的多类型车辆路径问题研究[J].兰州交通大学学报,2006(3):137-140.
[80] Yongshuang Zheng, Baoding Liu. Fuzzy vehicle routing model with credibility measure and its hybrid intelligent algorithm[J]. Applied Mathematics and Computation,2005.
[81]张建勇,李军,郭耀煌.具有模糊预约时间的VRP混合遗传算法[J].管理科学学报, 2005(3):64-71.
[82]张建勇,郭耀煌,李军.基于顾客满意度的多目标模糊车辆优化调度问题研究[J].铁道学报, 2003(2):15-17.
[83]党国英,王建仁,崔俊凯.模糊理论在VRPTW问题上的蚁群算法研究[J].统计与决策, 2005(24): 35-37.
[84]张建勇.模糊信息条件下车辆路径问题研究[D].西南交通大学博士学位论文,2004.
[85]陆琳,谭清美.模糊信息车辆调度优化问题研究.中国管理科学年会论文.2006.
[86] Psaraftis H N. Dynamic vehicle routing problem[A].In Golden B L and Assad A A.Vehicle Routing: Methods and Studies[M].Amstersam: North-Holland,1988.223-248.
[87]谢秉磊,郭耀煌,郭强.动态车辆路径问题:现状与展望[J].系统工程理论方法应用, 2002(2):116-120.
[88]郑丽群,王德东,李大卫.随机车辆路径问题综述[J].鞍山科技大学学报,2005(6):199-203.
[89] Psaraftis H N. Dynamic vehicle routing problem: status and prospects[J]. Annals of Operations Research,61(1995):143-164.
[90] Powell W B. Stochastic and dynamic networks and routing. In: Ball M O, Magnanti T L, Nemhauser G L,eds. Network Routing[M]. Amsterdam: North-Holland,1995.141-295.
[91] Minkoff A S. A markov decision mode land decomposition heuristic for dynamics vehicle dispatching[J]. Operations Research,1993,(41):77-90.
[92] Higginson, J. K., J. H. Bookbinder. 1994a. Markovian decision processes in shipment consolidation. Trans. Sci. 29 242–255. 1994b. Policy recommendations for a shipment consolidation problem. J. Bus. Logist. 15 87–111.
[93] Bertsimas D J,Simchi-Levi. A new generation of vehicle routing: robust algorithms, addressing uncertainty[J].Operations Research,1996,(44):286-304.
[94] Xiangwen L. Dynamic and Stochastic Routing Optimization: Algorithms Development and Analysis. University of California. 2001.
[95]肖增敏,李军.动态网络车辆路径问题:研究现状及展望[J].系统工程,2004(7):68-71.
[96]郭耀煌,谢秉磊.一类随机动态车辆路径问题的策略分析[J].管理工程学报,2003(4):114-115.
[97] Bertsimas D J,Ryzin G V. Stohastic and dynamic vehicle routing problem in the eucidean plane with multiple capacitated vehicles[J].Operations Research,1993,(41):60-76.
[98]钟小鹏.动态车辆路径问题实时策略与技术支撑分析[D].西南交通大学硕士学位论文,2003.
[99]郭耀煌,钟小鹏.动态车辆路径问题排队模型分析[J].管理科学学报,2006(1):33-37.
[100]张天学.模拟退火算法在多目标决策中的应用研究[J].郑州航空工业管理学院学报,1995(3):13-18.
[101]李静.列车编组计划及其模拟退火算法[D].华北工学院硕士学位论文,2001.
[102] Robuste F, Daganzo C F, and Souleyrette R. Implementing vehicle routing models[J]. Transportation Research B, 1990, 24: 263-286.
[103] Alfa AS, Heragu S S, and Chen M. A 3-opt based simulated annealing algorithm for vehicle routing problems[J]. Computers& Industrial Engineering, 1991,21:635-639.
[104] Osman L H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem[J]. Annals of Operations Research, 1993, 41:421-451.
[105] Laporte G, Osman I H. Metaheuristics in combinatorial optimization:A bibliography[J]. Ann.Operations Research,1996,(63):513-628.
[106] Teodorovic D, Pavkovic G. A simulated annealing technique approach to the vehicle routing in the case of stochastic demand[J]. Transportation Planning and Technology,1992,16(16):291-273.
[107] Van Breedam A. Improvement heuristics for the vehicle routing problem based on simulated annealing[J]. European Journal of Operational Research, 1995, 86:480-490.
[108]胡大伟,朱志强,胡勇.车辆路径问题的模拟退火算法[J].中国公路学报,2006(4):123-126.
[109]蔡延光,钱积新,孙优贤.多重运输调度问题的模拟退火算法[J].系统工程理论与实践,1998(10):11-15.
[110]谢秉磊,李良,郭耀煌.求解配送\收集旅行商问题的模拟退火算法[J].系统工程理论方法应用,2002(3):240-243.
[111]朗茂祥.装卸混合车辆路径问题的模拟退火算法研究[J].系统工程学报,2005(5):485-491.
[112]杨宇栋,朗茂祥,胡思继.有时间窗车辆路径问题的模型及其改进模拟退火算法研究[J].管理工程学报,2006(3):104-107.
[113] Glover F. Tabu search part I[J]. ORSA Journal of Computing,1989,1:190-206.
[114] Glover F. Tabu search: a tutorial[J]. Interfaces,1990,20:74-941.
[115]符卓.带装载能力约束的开放式车辆路径问题及其禁忌搜索算法研究[J].系统工程理论与实践,2004(3):123-128.
[116]黄继鸿,雷战波,李欣苗.基于遗传禁忌算法的案例检索策略[J].系统工程理论方法应用,2004(1):10-13.
[117]钟石泉,贺国光.多车场有时间窗的多车型车辆调度及其禁忌算法研究[J].运筹学学报,2005(4):67-73.
[118] Willard J A G.. Vehicle routing using r-optimal tabu search: [M.Sc.dissertation]. London: The Imperial College, 1989
[119] Pureza V Mand Franca P.M. Vehicle routing problems via tabu search metaheuristic. Technical Report CRT-347, Centre for Research on Transportation,Montreal, Canada, 1991.
[120] Osman L H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem[J]. Annals of Operations Research, 1993, 41:421-451.
[121] Taillard E . Parallel iterative search methods for vehicle routing problems. Networks, 1993, 23:661-673.
[122] Gendreau M, Hertz A, and Laporte G.. A tabu search heuristic for the vehicle routing problem. Management Science, 1994, 40:1276-1290.
[123] Xu J and Kelly JP. A network flow-based tabu search heuristic for the vehicle routing problem[J]. Transportation Science, 1996, 30:379-393.
[124] Rego C.and Roucairol C. A parallel tabu search algorithm usingejection chains for the vehicle routing problem. In: LH. Osman and J.P Kelly(eds).Meta-Heuristics: Theory and Apllications. Kluwer, Boston, MA, 1996. 661-675.
[125] Rego C. A subpath ejection method for the vehicle routing problem.Management Science, 1998, 44:1447-1459.
[126] Barbarosoglu G. and Ozgur D. A tabu search algorithm for the vehicle routing problem[J]. Computers and Operations Research, 1999, 26:255-270.
[127] Rochat Y and Taillard E D. Probabilistic diversification and intensification in local search for vehicle routing[J]. Journal of Heuristics, 1995,1:147-167.
[128] Toth P and Vigo D. The granular tabu search (and its application to the vehicle routing problem).Technical Report OR/98/9, DEIS, University di Bologna,Italy, 1998.
[129] Battiti R, Tecchiolli G. The reactive tabu search[J]. ORSA Journal on Computing,1994,6(2):126-1401.
[130] Carlton W B, Barnes J W. Solving the traceling salesman problem with time windows using tabu search[J]. IIE Transactions,1996,28:617-629.
[131] Cordeau J F, Laporte G and Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows[J]. Journal of the Operational Research Society,2001,52:928-936.
[132] Taillard E, Badeau P, Gendreau M, Guertin F and Potvin J Y.A tabu search heuristic for the vehicle routing problem with soft time windows[J]. Transportation Science,1997,31:170-186.
[133] Duhamel C, Potvin J Y and Rousseau J M. A tabu search heuristic for the vehicle routing problem with backhauls and time windows[J]. Transportation Science,1997,31:49-59.
[134] Gendreau M, Laporte G and Potvin J Y. Metaheuristics for the Capacitated VRP[R]. P Toth, D Vigo.The Vehicle Routing Problem.Philadelphia,PA:SIAM Monographs on Discrete Mathematics and Applications.2002.129-154.
[135] Cordeau J F, Gendreau M, Laporte G, Potvin J Y, Semet F. A guide to vehicle routing heuristics[J]. Journal of the Operational Research Society,2002,53:512-522.
[136]袁庆达,杜文,周再玲.带软时间窗的混合车队车辆路线问题的模型和算法研究[J].西南交通大学学报,2001(4): 401-406.
[137]袁庆达,闰显,周再玲.Tabu Search算法在优化配送路线问题中的应用[J].计算机工程,2001,(11):86-89.
[138]符卓.开放式车辆路径问题及其应用研究[D].中南大学博士学位论文,2003.
[139]甘勤涛,阳平华,童钟灵.模糊需求车辆路径问题的禁忌搜索算法研究[J].长春理工大学学报,2006(1):84-86.
[140]蓝伯雄,张跃.求解带时间窗的装-卸载问题的概率式禁忌搜索算法[J].中国管理科学,2004(2):66-72.
[141]郎茂祥,胡思继.车辆路径问题的禁忌搜索算法研究[J].管理工程学报,2004(1):81-84.
[142]张炯,郎茂祥.有时间窗配送车辆调度问题的禁忌搜索算法[J].北方交通大学学报,2004(2):103-107.
[143]贾永基,谷寒雨,席裕庚.一类货运车辆调度问题的混合禁忌搜索算法[J].信息与控制,2004(6):724-728.
[144]王正国,刘振元,王红卫.适应性禁忌搜索算法求解带回程的时变速度车辆路径问题[J].计算机集成制造系统,2006(9):1453-1458.
[145] Holland J H.Adaptation in Natural and Artificial Systems[M] Ann Arbor:University of Michigan Press,1975.
[146] Goldberg D. Genetic Algorithms in Search,Optimization and Machine Learning[M]. Reading,MA: Addison-Wesley, 1989.
[147] Thangiah S, Nygard K, Juell P G. A genetic algorithms system for vehicle routing with time windows[A]. Miami. Proceedings of the Seventh Conference on Artificial Intelligence Applications[C].Florida,1991.322-325.
[148] Thangiah S R. Vehicle routing with time windows using genetic algorithms. Technical Report SRU-CpSc-TR-93-23, Slippery Rock University, Slippery Rock, PA, 1993.
[149] Joe L, Roger L. Multiple vehicle routing with time and capacity constrains using genetic algorithms[A]. Proceedings of the Fifth International Conference on Genetic Algorithms[C]. Florida,1993.452-459.
[150] J.-Y Potvin and S. Bengio. The vehicle routing problem with time windows Part II: Genetic search.INFORMS Journal on Computing, 1996, 8:165-172.
[151] Schmitt L J. An evaluation of a genetic algorithmic approach to the vehicle routing problem. Working paper, Department of Information Techonogy Management, Christian Brothers University, Memphis, TN, 1995.
[152] Tan K, Lee T, Ou K, et al. A messy genetic algorithm for the vehicle routing problem with time window constraints[A]. Proceedings of IEEE Congress on Evolutionary Computation[C],2001,1:679-686.
[153] Ozdemir H, Mohan C. Evolving schedule graphs for the vehicle routing problem with time windows[A]. Proceedings of the IEEE Congress on Evolutionary Computation[C],2000,2:888-895.
[154] Hwang H. An improved model for vehicle routing problem with time constraint based on geneticalgorithm[J]. Computers&Industrial Engineering,2002,42:361-369.
[155] Baker B, Ayechew M. A genetic algorithm for the vehicle routing problem[J]. Computers&OperationsResearch,2003,30:787-800.
[156] Thangiah S R. Vehicle routing problem with time windows using genetic algorithms[A]. Application Handbook of Genetic Algorithms:New Frontiers(VolumeH)[C]. BocaRaton:CRC Press,1995:253~277.
[157] Thangiah S R, Osman I H, Sun T. Hybrid genetic algorithm,simulated annealing and Tabu search methods for vehicle routing problems with time windows[R]. Technical Report SRU-CpSc-TR-94-27.Computer Science Department, Slippery Rock University,1994.
[158] Braysy O. A new algorithm for the vehicle routing problem with time windows based on the hybridization of a genetic algorithm and route construction heuristics[R]. Proceedings of the University of Vaasa, research papers227, VaasaFinland,1999.
[159] Berger,Salois J M, Begin R. A hybrid genetic algorithm for the vehicle routing problem with time windows[Z]. Presented at the AI 98 12th Canadian Conference on Artificial Intelligence,Vancouver,Canada,1998.
[160] Braysy O, Berger J. A new hybrid evolutionary algorithm for the vehicle routing problem with time windows[Z]. Presented at the Route 2000-Workshop,Skodsborg,Denmark,2000.
[161] Tan K C, Lee L H, Zhu Q L, Qu K. Heuristic methods for vehicle routing problem with time windows[J]. Artificial Intelligence in Engineering,2001,15:281~295.
[162] Van Breedam A. An analysis of the effect of local improvement operaters in genetic algorithms and simulated annealing for the vehicle routing problem[R]. RUCA working paper 96/14,University of Antwerp,Belgium,1996.
[163]姜大立,杨西龙,杜文,周贤伟.车辆路径问题的遗传算法研究[J].系统工程理论与实践,1999(6):40-45.
[164]李大卫,王莉,王梦光.遗传算法在有时间窗车辆路径问题上的应用[J].系统工程理论与实践,1999(8):65-69.
[165]张丽萍,柴跃廷.车辆路径问题的改进遗传算法[J].系统工程理论与实践,2002(8):79-84.
[166]宋厚冰,蔡远利.带时间窗的车辆路径混合遗传算法[J].交通运输工程学报2003(4):112-115.
[167]许国平,叶效锋,鲍立威.基于模拟退火遗传算法的车辆路径问题研究[J].工业控制计算机,2004(6):49-50.
[168]吕军,冯博琴,李波.多约束条件车辆路径问题的二阶段遗传退火算法[J].西安交通大学学报,2005(12):1299-1302.
[169]刘诚,陈治亚,封全喜.带软时间窗物流配送车辆路径问题的并行遗传算法[J].系统工程2005(10):7-11.
[170]邓连波,史峰,莫辉辉.物流配送车辆路径问题多代竞争遗传算法[J].铁道科学与工程学报,2005(5):75-79.
[171]刘敏,郑金华,蒋浩.基于多目标遗传算法求解时间窗车辆路径问题[J].计算机工程与应用,2006(9):186-190.
[172]肖鹏,李茂军,张军平,童调生.车辆路径问题的单亲遗传算法[J].计算技术与自动化,2000(1):26-30.
[173]赵燕伟,吴斌,蒋丽,董红召,王万良.车辆路径问题的双种群遗传算法求解方法[J].计算机集成制造系统-CIMS,2004(3):303-306.
[174]甘勤涛,阳平华,黄万荣,刘华平.车辆路径问题的分层遗传算法研究[J].军事运筹与系统工程,2005(4):17-20.
[175]吴兴华,田森平.确定车辆数的有时间窗车辆路径问题的遗传算法[J].交通与计算机2006(3):96-99.
[176]吴璟莉,刘仁辉.分批配送的有时间窗车辆路径问题的遗传算法[J].计算机工程,2006(8):213-216.
[177]李军,谢秉磊,郭耀煌.非满载车辆调度问题的遗传算法[J].系统工程理论方法应用,2000(3): 235-239.
[178]谢秉磊,李军,郭耀煌.有时间窗的非满载车辆调度问题的遗传算法[J].系统工程学报,2000(3):290-294.
[179]宋伟刚,张宏霞,佟玲.有时间窗约束非满载车辆调度问题的遗传算法[J].系统仿真学报,2005(11):2593-2597.
[180]邹彤,李宁,孙德宝,李菁.多车场车辆路径问题的遗传算法[J].计算机工程与应用,2004(21):82-83.
[181]杨元峰,崔志明,陈建明.有时间窗约束的多车场车辆路径问题的改进遗传算法[J].苏州大学学报(工科版)2006(2):20-23.
[182]邹彤,李宁,孙德宝.不确定车辆数的有时间窗车辆路径问题的遗传算法[J].系统工程理论与实践,2004(6):134-138.
[183] Hopfield J J. Neurons with Graded Response have Collective Computational Properties Like those of Two state Neurons. Proc. Natl, Acad. Sci., 1984,81:3088- 3092.
[184] Hopfield J J, Tank DW. Neural Computation of Decisions in Optimization Problems. Biol.Cybern. 1985,52:141-152.
[185] Hopfield J J, Tank D W. Computing with Neural Circuits: A Model. Science,1986,233:625-633.
[186]李旭帅.基于神经网络的汇率预测研究[D].南京航空航天大学硕士学位论文,2005.
[187]王德东,郑丕谔.车辆路径问题的混沌神经网络解法[J].计算机集成制造系统-CIMS,2005(12):1747-1750.
[188]冯国莉,杨晓冬.基于Hopfield神经网络车辆路径的优化研究[J].信息技术,2006(7):90-92.
[189]苏一丹,李桂.流体神经网络模型在规划物流配送运输方案中的应用[J].广西大学学报(自然科学版).2002(3):203-206.
[190]阎平凡,张长水.人工神经网络与模拟进化计算[M].清华大学出版社,2005.
[191]丁才昌,方勃,鲁小平.分布估计算法及其性能研究[J].武汉大学学报(理学版), 2005(S2): 125-128.
[192] Larranga P,Etxeberria R,Lozano A,Pefia J.M. Optimization by learning and simulation of Bayesian and Gaussian networks.In:Proceedings of the 2000 Genetic and Evolutionary Computation Conference Workshop Program,Las Vegas,Nevada,USA,2000.
[193] Muhlenbein H, Paaβ; G.: From Recombination of Genes to the Estimation of Distribution Algorithms I. Binary Parameters, H.M.Voigt, et al.(eds.): Lecture Notes in Computer Science1411: Parallel Problem Solving from Nature -PPSN IV (1996) 178-187.
[194] Zhang Q. Miihliebei H. On the convergence of a class of estimation of distribution algorithms[J]. IEEE Trans on Evolutionary Computation.8(2): 127-136.
[195] Baluja S. Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning. Pittsburgh, PA: Carnegie Mellon University (Technical Report No. CMU-CS-94-163),1994.
[196] Muhlenbein H..The equation for response to selectiona nd its use for prediction[J]. Evolutionary Computation,1998,5(3):303-346.
[197] Harik G R, LoboF G, Goldberg D E. The Compact Genetic Algorithm. In Proceedings of the IEEE Conference on Evolutionary Computation 1998(ICEG’98) Piscataway, NJ: IEEE Service Center, 1998:523-528.
[198] De Bonet J S, Isbell C L, Viola, P. MMIC: Finding Optima by Estimating Probability Densities. In Mozer, M. C. , Jordan, M. I. , & Petsche, T. (editors), Advances in Neural Information Processing Systems. The MIT Press, Cambridge,1997,9:424.
[199] Baluja S and Davies S. Probablistic Modeling for Combinatorial Optimization,(Pre-Print,1997)
[200] Baluja S and Davies S. Faet Probablistic Modeling for Combinatorial Optimization, AAAI-98, (1998)
[201] Peliken M,Muhlenbein H.The bivariate marginal distribution algorithm.In: Roy R, Furnhashi T, Chandhery P K eds..Advance in Soft Computing Engineering Design and Manufacturing.London: Springer Verlag,1999,521-535.
[202] Muhlenbein H, Mahnig T. FDA-A scalable evolutionary algorithm for the optimization of additively decomposed function. Evolutionary Computation,1999,7(4):353-376.
[203] Lauritzen S L. Graphical Models, Oxford University Press,1996.
[204] Harik G. Learning via Probabilistic Modeling in the ECGA. Urbana, IL: University of Illinois Genetic Algorithms Laboratory(IlliGAL Report No. 99010),1999.
[205] Mitchell T M. Machine Learning. McGraw-Hill,1997, section 6.6, 171-173.
[206] Pelikan M, Goldberg D E. BOA: The Bayesian Optimization Algorithm[R]. Urbana: University ofIllinois at Urbana Champaign, IlliGAL Genetic Algorithm Laboratory,1998,(5):55-67.
[207] Pelikan M. A Survey of Optimization by Building and Using Probabilistic Models[R]. Urbana: University of Illinoisat Urbana Champaign, IlliGALGenetic Algorithm Laboratory,1999,(3):25-33.
[208] Zhang B T, Shin S Y. Bayesian evolutionary optimization using Helmholtz machines. Parallel Problem from Nature VI, Lecture Note in Computer Science 1917, Paris, dance: Springer, 2000: 827-836.
[209]钟伟才,刘静,刘芳,焦李成.二阶卡尔曼滤波分布估计算法[J].计算机学报,2004(9): 1272-1277.
[210]钟伟才,刘静,刘芳,焦李成.建立在一般结构Gauss网络上的分布估计算法[J].电子与信息学报,2005(3):467-470.
[211]陆琳,谭清美.最大熵分布算法及其应用[J].系统工程与电子技术. 2007,29 (5):820-822.
[212] Siddall J N. Probabilistic engineering design. Principles and Applications. New York: Marcel Dekker,1983.
[213] Shigeyoshi Tsutsui, Gordon Wilson. Solving capacitated vehicle routing problems using edge histogram,2004:1150-1157.
[214] Colorni A , Dorigo M , Maniezzo V , et al. Distributed optimization by ant colonies[C]. Proc. of the First European Conf . on Artificial Life. Paris : Elsevier Publishing ,1991. 134–142.
[215] Goss S, Aron S, J.L.Deneubourg, and J.M.Pasteels. Self-Organized shortcuts in the Argentine ant[J]. Naturwissenschaften,1989,76:579-581.
[216] Cicirello V A and Smith S F. Insect Societies and Manufacturing[R]. In IJCAI-01 Workshop on Artificial Intelligence and Manufacturing: NewAIParadigms for Manufacturing,August 2001.
[217] Lldobler B H and Wilson E O. The Ants[R]. The Belknap Press of Harvard University Press,1990.
[218] M Dorigo,G Di Cargo and L M Gambardella. Ant algorithms for distributed discrete optimization[R]. Technical Report 98-10IRIDIA,Universit Librede Brexelles,1998.
[219] Merkle D, Middendorf M and Schmeck H. Ant colony optimization for resource-constrained project scheduling[C]. In GECCO-2000: Proceedings of the Genetic and Evolutionary Computation Conference,pages893-900.Morgan Kaufmann, July2000.
[220] Hozefa M Botee, Eric Bonabeau. Evolving Ant Colony Optimization[C]. In Advances in Complex Systems,1999,1(2/3):149-159.
[221] Botee H M and Bonabeau E.“Evolving Ant Colony Optimization”. In Advanced Complex Systems, 1998,1:149-159.
[222] Pilat M L and White T.“Using Genetic Algorithms to Optimize ACS-TSP”. Proceedings of Ant Algorithms: Third International Workshop, ANTS 2002, Brussels, Belgium, September 2002, M. Dorigo et al (Eds.), LNCS 2463, Springer-Verlag, 282-287.
[223]Gambardella L M, Dorigo M. HAS-SOP: an hybrid ant system for the sequential ordering problem.Technique Report, No.IDSIA 97-11, Lugano: IDSIA, 1997.
[224]胡娟,王常青,韩伟,全智.蚁群算法及其实现方法研究[J].计算机仿真,2004(7):110-114.
[225]秦玲.蚁群算法的改进与应用[D].扬州大学硕士学位论文,2004.
[226]王静晖.改进的蚂蚁算法应用于车辆路径优化问题[D].河北工业大学硕士学位论文,2005.
[227]肇勇.改进蚁群算法的理论及方法研究[D].西南石油学院硕士学位论文,2004.
[228]高彦明.蚁群算法并行化研究[D].苏州大学硕士学位论文,2005.
[229] Dorigo M, Maniezzo V, and Colorni A. The Ant System: Optimization by a Colony of Cooperating Agents. IEEE -Transactions on Systems, Man, and Cybernetics - Part B, 26(1):29-41,1996.
[230] Bullnheimer B, Hartl R F, Strauss C. A new rank based version of the ant system—a computational study [J]. Central European J Oper Res Econom , 1999 , 7 : 25–38.
[231] Luca M,Galnbardella, Dorigo M. Ant-Q: an reinforcement learning approach to the traveling salesman problem[A]. Proc. of 12th Machine Learning Conf.[C]. France: Morgan Kaufmann, 1995. 252-260.
[232] Dorigo M, Luca M. A study of some properties of Ant-Q. Technical Report, TR/IRIDIA/1996-4, IRIDIA, Universitd Libre de Bruxelles, 1996.
[233] Stutzle T, Hoos H H. Improvements on the ant system: introducing the MAX-MIN ant system. In: Smith G D, Steele N C,Albrecht R F, eds. Proceedings of the Artificial Neural Nets and Genetic Algorithms 1997. Wien: Springer-Verlag, 1998. 245-249.
[234] Stutzle T, Hoos H H. MAX-MIN ant system[J]. Future Generation Computer Systems , 2000 , 16(8) :889–914.
[235] Gambardella L M, Dorigo M. Solving symmetric and asymmetric TSPs by ant colonie[A]. Proc of the IEEE Conference on Evolutionary Computation[C].[s.l]:[s.n.], 1996,622-627.
[236] M Dorigo and Gambardella LM. Ant Colony System: A cooperative learning approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation, 1997, 1(1):53-66.
[237]吴庆洪,张纪会,徐心和.具有变异特征的蚁群算法[J].计算机研究与发展,1999(10): 1240-1245.
[238]张纪会,高齐圣,徐心和.自适应蚁群算法[J].控制理论与应用,2000(1) :1-5.
[239]魏平,熊伟清.用于一般函数优化的蚁群算法[J].宁波大学学报(理工版),2001(4):52-55.
[240]覃刚力,杨家本.自适应调整信息素的蚁群算法[J].信息与控制,2002(3):198-204.
[241]郝晋,石立宝,周家启.具有随机扰动特性的蚁群算法[J].仪器仪表学报,2001(S2):350-352.
[242]陈崚,秦玲,陈宏建,徐晓华.具有感觉和知觉特征的蚁群算法[J].系统仿真学报2003(10):1418-1425.
[243] Bullnheimer B, Hartl R F, and Struss C. An improved ant system algorithm for the vehicle routing problem[J]. Annals of Operations Research, 89 (1999)319–328.
[244] Bullnheimer B, R F Hartl, et al. Applying the Ant System to the Vehicle Routing Problem.In:VossS., MartelloS., OsmanI.H., RoucairolC.(eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer,Boston,1999:285~296.
[245] Silvia Mazzeo, Irene Loiseau. An ant colony algorithm for the capactitated vehicle routing. Electronic Notes in Discrete Mathematics 18(2004):181-186.
[246] John E. Bell, Patrick R. McMullen. Ant colony optimization techniques for the vehicle routing problem[J]. Advanced Engineering Informatics,2004,18:41-48.
[247] Reimann M, Dorener K, Hartl R F. D-ants: savings based ants divide and conquer the vehicle routing problem[J]. Computers&OperationsResearch,2004,31:563-591.
[248] Gambardella L M, Taillard E, Agazzi G. MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows[A].New Ideas in Optimization [C]. London,U.K.: McGraw-Hill,1999.63-73.
[249] Reimann M, Dorener K, Hartl R F. Insertion based ants for vehicle routing problems with backhauls and time windows[A]. Ant Algorithms[C]. Berlin/Heidelberg, Germany: Springer LNCS2463,2002.135-147.
[250]刘志硕,申金升.基于解均匀度的车辆路径问题的自适应蚁群算法[J].系统仿真学报,2005(5):1079-1083.
[251]刘志硕,申金升,柴跃廷.基于自适应蚁群算法的车辆路径问题研究[J].控制与决策,2005(5):562-566.
[252]刘志硕,柴跃廷,申金升.蚁群算法及其在有硬时间窗的车辆路径问题中的应用[J].计算机集成制造系统,2006(4):596-602.
[253]刘云忠,宣慧玉.动态蚁群算法在带时间窗车辆路径问题中的应用[J].中国工程科学,2005(12):35-40.
[254]刘哲,李建国.基于带时间窗口车辆路径问题的蚁群算法[J].控制工程,2006(2):127-130.
[255]李继玲,卢才武,李金成.基于蚁群算法的有时间窗车辆调度问题的研究[J].信息技术,2006(5):128-131.
[256]冯远静,冯祖仁,彭勤科.一类自适应蚁群算法及其收敛性分析[J].控制理论与应用,2005(5):713-717.
[257]段海滨,王道波.蚁群算法的全局收敛性研究及改进[J].系统工程与电子技术,2004(10):1506-1509.
[258] Tarasewich P, McMullen PR.Swarm intelligence: power in numbers [J]. Commun ACM 2002,45(8):62–67.
[259]石立宝,郝晋.随机摄动蚁群算法的收敛性及其数值特性分析[J].系统仿真学报.2004(11):2421-2424.
[260] Reynolds C W. Flocks, herds and schools: a distributed behavioral model. Computer Graphics,1987,21(x):25-34.
[261] Wilson E O. Sociobiology: The new synthesis. Belknap Press,Cambridge,MA,1975.
[262] Eberhart R C, ShiY. Particle swarm optimization: developments, applications and resources[A]. Proc Congresson Evolutionary Computation2001[C].Piscataway, NJ:IEEE Press,2001.81-86.
[263]李建勇.粒子群优化算法研究[D].浙江大学硕士学位论文,2004.
[264]李爱国,覃征,鲍复民,贺升平.粒子群优化算法[J].计算机工程与应用,2002(21):1-4.
[265]杨维,李歧强.粒子群优化算法综述[J].中国工程科学,2004(5):87-94.
[266] Shi Y, Eberhart R C. A modified particle swarm optimizer[R]. IEEE International Conference of Evolutionary Computation,Anchorage,Alaska,May 1998.
[267] Parsopoulos K E, Plagianakos V P, Magoulas G D, etal. Improving particle swarm optimizer by function“stretching”[A]. Hadjisavvas N, Pardalos P. Advances in Convex Analysis and Global Optimization[M]. The Netherlands:Kluwer Academic Publishers,2001.445-457.
[268] Shi Y, Eberhart R C. Empirical study of particle swarm optimization[A]. Proceeding of Congress on Evolutionary Computation[C]. Piscataway, NJ: IEEE ServiceCenter,1999.1945-1949.
[269] Angeline P J. Evolulionary Optimization Versus Panicle Swarm Optimization:Philosophy and Perforrnance Differences[C]. In:Evolutionary Programming YII,1998:601-610.
[270] Lovbjerg M,Rasmussen T K, Krink T. Hybrid Particle Swarrn Optimiser with Breeding and Subpopulaltons[C]. In: Proc of the third Genetic and Evolulionary Cornputation Conflerence, 2001.
[271] Kennedy J. Small worlds and mega-minds: effects of neighborhood topologyon particle swarm performance[A]. Proceedings of IEEE Congress on Evolutionary Computation[C]. Piscataway,NJ: IEEE Service Center,1999.1931-1938.
[272] Van den Bergh F, Engelbrecht A P. Using cooperative particle swarm optimization to train product unit neural networks[R]. IEEE International Joint Conference on Neural Networks,WashingtonDC,USA,2001.
[273] Van den Bergh F, Engelbrecht A P. Training product unit networks using Cooperative particle swarm optimizers[C]. In: Proc of the third Genetic and Evolutionary Computation Conference(GECCO),San Francisco, USA,2001.
[274] Van den Bergh F, Engelbrecht A P. Effects of swarm size on Cooperative particle swarm optimizers[C]. In: Proc of the GECCO,San Francisco, USA,2001.
[275] Christos Voudouris, Edward Tsang. Partial constraint satisfaction problems and guided local search[A]. Proc of the second international conference on the practical application of constraint technology,1996.
[276]李宁,邹彤,孙德宝.车辆路径问题的粒子群算法研究[J].系统工程学报,2004(6):596-560.
[277]李宁,邹彤,孙德宝.带时间窗车辆路径问题的粒子群算法[J].系统工程理论与实践,2004(4):130-135.
[278]陈曦,蒋加伏.带变异粒子群算法在车辆路径问题中的应用[J].计算机与数字工程,2006(9):19-21.
[279]罗先国,侍洪波.非满载车辆路径问题的改进粒子群优化算法[J].华东理工大学学报(自然科学版) ,2006(7):767-772.
[280] Ai-ling Chen, Gen-ke Yang and Zhi-ming Wu. Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem[J]. Journal of Zhejiang University - Science A, 2006,7(4):607-614.
[281] Wanliang Wang, Bin Wu, Yanwei Zhao and Dingzhong Feng. Particle Swarm Optimization for Open Vehicle Routing Problem. Lecture Notes in Computer Science, 4114/2006,in:Irwin (Eds.): ICIC 2006, LNAI 4114, pp. 999– 1007, 2006.
[282] Nicola Secomandi. Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands[J]. Computers & Operations Research,2000,27:1201-1225.
[283] Gendreau M, Laporte G and Séguin R. An exact algorithm for the vehicle routing problem with stochastic demands and customers[J]. Transportation Science,1995,29:143–155.
[284] http:// www.branchandcut.org/pub/data/VRP/M/M-n200-k17.vrp
[285] http://www.branchandcut.org/pub/data/VRP/ M/M-n60-k17.vrp
[286]唐依珠,郑茜颖,黄金虎. GPS车辆导航系统的研究和开发[J].福州大学学报(自然科学版),2001,29(2):16-20.
[287] Cheung R K, Powell W. An algorithm for multistage dynamic networks with random arc capacities with an application to dynamic fleet management[J]. Oper. Res. 1996,44(6) 951–963.
[288]Compbell A M, Savelsbergh Martin W P. Decision Support for Consumer Direct Grocery Initiatives[J]. Transportation Science,2005,39(3):313–327.
[2]董明望. GDP的物流含量与物流成本[J].中国储运,2004(2):16-17.
[3]张鹏,李聪.论物流成本占GDP的比重及其现实意义[J].铁道运输与经济,2005(12):28-30.
[4]李克宁.谈物流成本与GDP[J].中国流通经济,2002(4):11-13.
[5]陈淑娴.物流成本占GDP比重中的产业结构因素[J].物流科技,2005(8):80-82.
[6] Dantzig G, Ramser J.The truck dispatching problem[J]. Management Science,1959(6):80-91.
[7]李军,郭耀煌.物流配送车辆优化调度理论[M].北京:中国物资出版社,2001:2.
[8] Bodin L D, Golden B L. Routing and scheduling of vehicles and crews:the state of art[J].Computers&OperationsResearch,1983(10):63-211.
[9]郎茂祥.配送车辆调度问题刍议[J].物流技术,2003(3):62-64.
[10]丁秋雷.带有时间窗的车辆路径问题的混合蚁群算法研究[D].大连理工大学硕士论文,2006.
[11] Laporte G, Mercure H, Nobert Y. An exact algorithm for the asymmetrical capacitated vehicle routing problem[J]. Networks,1986,16:33-46.
[12] Christofides N, Mingozzi A, Toth P. Exact algorithms for the vehicle routing problem,based on spanning the shortest path relaxation[J]. Mathematical Programming,1981,20:255-282.
[13] Eilos, Watson-Gandycdt, Christofides N. Distribution management:mathematical modelling and practica lanalysis[M]. London:Griffin,1971.
[14] Balinski M, Quandt R.On an integer program for a delivery problem[J]. Operations Research,1962,12:300-304.
[15] Fisher M L, Jaikumar R. A generalized assignment heuristic for vehicle routing[J]. Networks,1981,11:109-124.
[16] Laporte G, Nobert Y, Desrocher M.Optimal routing under capacity and distance restrictions[J]. Operations Research,1985,33:1050-1073.
[17]祝崇俊,刘民,吴澄.供应链中车辆路径问题的研究进展及前景[J].计算机集成制造系统-CIMS.2001(11):1-6.
[18]刘云忠,宣惠玉.车辆路径问题的模型及算法研究综述[J].管理工程学报,2005(1):124-130.
[19] Clarke G, Wright J W. Scheduling of vehicles from a central depot to a number of delivery points[J]. OperationsResearch,1964,12:568~581.
[20] Lin S. Computer solutions of the traveling salesman problem[J]. Bell System Technical Journal,1965,44:2245-2269.
[21] Wren A. Computers in sport Planning and Operation[M]. Ian Allan, London, 1971.
[22] Gillett B, Miller L. A heuristic algorithm for the vehicle dispatch problem[J]. OperationsResearch,1974,22:340~349.
[23] Christofides N, Mingozzi A, Toth P. Cominatorial Optimization[M]. Wiley, Chichester,1979.
[24]谢秉磊.随机车辆路径问题研究[D].西南交通大学博士论文.2003.
[25] Allan Larsen. The Dynamic Vehicle Routing Problem[D]. Printed by IMM, DTU Bookbinder Hans Meyer,2000.
[26] Tillman F. The multiple termina ldelivery problem with probabilistic demands[J]. Transportation Science,1969,3(3):192-204.
[27] Stewart W, Golden B. Stochastic vehicle routing:a comprehensive approach[J]. European Journal of Operational Research,1983,14(4):371-385.
[28] Bertsimas D. Probabilistic combinatorial optimization problems[D]. Operation ResearchCenter, Massachusetts Institute of Technology,Cambridge,MA1988.
[29] Laporte G, Louveaux F, Merxure H. An exact solution for thea priori optimization of the probabilistic traveling salesman problem[J]. Operations Research,1994,42(3):543-549.
[30] Seguin R. Probdmes stochastiques de tourneesd evehicles[D]. Centre de Reserche Sur LesTransports,University d eMontreal,1994.
[31] Gendreau M, Laporte G, Seguin R. An exact algorithm for the vehicle routing problem with stochastic customers and demands[J]. Transportation Science,1995,29(2):143-155.
[32] Gendreau M, Laporte G, Seguin R. Stochastic vehicle routing[J]. European Journal of Operational Research,1996,88(1):3-12.
[33] Kao E.A preference order dynamic program for astochastic traveling salesman problem[J]. Operations Research,1978,26(6):1033-1045.
[34] Lambert V, Laporte G, Louveaux F. Designing collection routes through bank branches[J]. Computers&Operations Research,1993,20(7):783-791.
[35]袁健,刘晋.随机需求情形VRP的Hopfield神经网络解法[J].南京航空航天大学学报,2000(5):579-585.
[36]倪勤,袁健,刘晋.随机需求的车辆路线问题的新模型[J].运筹与管理,2001(3):74-79.
[37]袁健,刘晋,卢厚清.随机需求情形VRP的退火网络解法[J].系统工程理论与实践,2002(3):109-113.
[38]刘浩,钱小燕,汪荣.随机需求VRP的一个算法[J].南京工业大学学报(自然科学版) 2004(5):9-11.
[39]陆琳,谭清美.一类随机需求VRP的混合粒子群算法研究[J].系统工程与电子技术,2006,28(2):244-247.
[40]康喜兵,甘勤涛.随机需求车辆路径问题的禁忌搜索算法研究[J].科学技术与工程,2006(13):1882-1884.
[41]陈宝文,宋申民,陈兴林.随机需求车辆路径问题及其启发式算法[J].计算机工程与设计,2007(1):138-142.
[42]刘浩,钱小燕,李舒展.单类型车辆随机需求VRP的一个算法[J].南京建筑工程学院学报(自然科学版) 2001(4):25-29.
[43]刘浩,袁健,卢厚清.两种类型车辆随机需求路由问题[J].南京航空航天大学学报,2001(2):155-158.
[44]张固,陈光亭,丁巍.多车种随机需求车辆路由问题的遗传算法[J].计算机工程与应用,2005(15):76-78.
[45]高明霞,杨涛,张春民.带时间窗的随机需求车辆路线问题的模型研究[J].兰州交通大学学报,2004(3):4-7.
[46]宋瑞,何世伟,杨海,罗康锦.基于随机需求的公交运营设计优化模型及算法[J].土木工程学报,2006(4):110-115.
[47]刘浩,钱小燕.路径长度受限的随机需求VRP的模型和算法[J].南京工业大学学报(自然科学版) ,2005(3):36-38.
[48]钱小燕,程浩,刘浩.路径长度受限的随机需求VRP的节省算法及其策略分析[J].南京工业大学学报(自然科学版) ,2006(5):33-37.
[49]郭强,谢秉磊.随机旅行时间车辆路径问题的模型及其算法[J].系统工程学报,2003(3):244-247.
[50]张乐诚,杨信丰.随机时间约束的城市物流配送车辆路径问题研究[J].物流技术,2005(9):68-70.
[51]张杨,黄庆,卜祥智.随机旅行时间局内车辆路径问题的模型及其算法[J].管理工程学报,2006(3):82-85.
[52]杨信丰,杨庆丰.随机车辆路径问题的模型及其算法[J].交通运输系统工程与信息,2006(4):75-80.
[53] Halse K. Modeling and Solving Complex Vehicle Routing Problems[D]. PhD thesis, Institute of Mathematical Statistics and Operations Research, Technical University of Denmark, Lyngby,1992.
[54] Salhi S, Nagy G. A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling[J]. Journal of the Operational Research Society, 1999,50:1034–1042.
[55] Salhi S, Nagy G. Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries[J]. European Journal of Operational Research, 2005,162:126-141.
[56] Wade A, Salhi S. An ant system algorithm for the vehicle routing problem with backhauls[C]. In: MIC_2001––4th Metaheuristic International Conference.
[57] Min H. The multiple vehicle routing problem with simultaneous delivery and pick-up points[J]. Transportation Research A 23A, 1989,377–386.
[58] Gendreau M, Laporte G, Vigo, D. Heuristics for the travelling salesman problem with pickup and delivery[J].Computers and Operations Research, 1999,26:699–714.
[59] Golden B L, Baker E, Alfaro J, Schaffer J. The vehicle routing problem with backhauling: two approaches[C]. Proceedings of the Twenty-First Annual Meeting of the S. E. TIMS, Myrtle Beach,SC, USA, 1985.
[60] Casco D O, Golden B L, Wasil E A. Vehicle routing with backhauls[C]. In: Golden BL, Assad AA, editors. Vehicle routing:methods and studies. Amsterdam: North-Holland, 1988, 127–147.
[61] Dethloff J. Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up[J]. OR Spektrum, 2001,23:79–96.
[62] Dethloff J. Relation between vehicle routing problems: An insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls[J]. Journal of the Operational Research Society ,2002,53: 115–118.
[63] Tang F A, Galvao R D.Vehicle routing problems with simultaneous pick-up and delivery service[J]. Journal of the Operational Research Society, 2002,39:19–33.
[64] Beasley J E. Route first-cluster second methods for vehicle routing[J]. Omega, 1983,11:403–408.
[65] Gillett B E, Miller L R. A heuristic algorithm for the vehicle dispatch problem[J]. Operations Research, 1974,22(4):340–349.
[66] Tang F.A, Galvao R D. A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service[J]. Computers & Operations Research,2006,33:595-619.
[67] Angelelli E, Mansini R. A branch-and-price algorithm for a simultaneous pick-up and delivery problem[C]. Working Paper,Article presented at the EURO/INFORMS Meeting, 2003.
[68]谢如鹤,刘霆,邱祝强.基于剩余装载能力的逆向物流车辆路径问题[J].系统工程.2004(10):20-23.
[69]张建勇,李军.具有同时配送和回收需求的车辆路径问题的混合遗传算法[J].中国公路学报.2006(7):118-122.
[70]陆琳,谭清美.基于自感应蚁群算法的VRPSDP问题研究[J].中国管理科学, 2007,15(2):97-103.
[71] Chen R, and Gen. M. Vehicle routing problem with fuzzy due-time using genetic algorithms.Japanese Journal of Fuzzy Theory and Systems, 1995; 7(5): 1050- 1061.
[72] Teodorovic D, Pavkovic G. The fuzzy set theory approach to the vehicle routing problem when demand at nodes is uncertain[J].Fuzzy sets and systems,1996,82:307~317.
[73] Teodorovic D, Radivojevic G. A fuzzy logic approach to dynamic Dial一A-Ride problem. Fuzzy Set and Systems. 2000,116:23-33.
[74]祝崇隽,刘民,吴澄,吴晓冰.针对模糊需求的两种2-opt算法[J].电子学报,2001(8):1035-1037.
[75]张建勇,郭耀煌,李军.模糊需求信息条件下的车辆路径问题研究[J].系统工程学报,2004(1):74-78.
[76]张建勇,李军.模糊车辆路径问题的一种混合遗传算法[J].管理工程学报,2005(2):23-26 .
[77]骆正山,王小完.基于模糊条件下车辆路径问题的研究[J].微电子学与计算机,2005(3):181-184.
[78]甘勤涛,阳平华,童钟灵.模糊需求车辆路径问题的禁忌搜索算法研究[J].长春理工大学学报,2006(1):84-86.
[79]于波,丁源.带模糊需求的多类型车辆路径问题研究[J].兰州交通大学学报,2006(3):137-140.
[80] Yongshuang Zheng, Baoding Liu. Fuzzy vehicle routing model with credibility measure and its hybrid intelligent algorithm[J]. Applied Mathematics and Computation,2005.
[81]张建勇,李军,郭耀煌.具有模糊预约时间的VRP混合遗传算法[J].管理科学学报, 2005(3):64-71.
[82]张建勇,郭耀煌,李军.基于顾客满意度的多目标模糊车辆优化调度问题研究[J].铁道学报, 2003(2):15-17.
[83]党国英,王建仁,崔俊凯.模糊理论在VRPTW问题上的蚁群算法研究[J].统计与决策, 2005(24): 35-37.
[84]张建勇.模糊信息条件下车辆路径问题研究[D].西南交通大学博士学位论文,2004.
[85]陆琳,谭清美.模糊信息车辆调度优化问题研究.中国管理科学年会论文.2006.
[86] Psaraftis H N. Dynamic vehicle routing problem[A].In Golden B L and Assad A A.Vehicle Routing: Methods and Studies[M].Amstersam: North-Holland,1988.223-248.
[87]谢秉磊,郭耀煌,郭强.动态车辆路径问题:现状与展望[J].系统工程理论方法应用, 2002(2):116-120.
[88]郑丽群,王德东,李大卫.随机车辆路径问题综述[J].鞍山科技大学学报,2005(6):199-203.
[89] Psaraftis H N. Dynamic vehicle routing problem: status and prospects[J]. Annals of Operations Research,61(1995):143-164.
[90] Powell W B. Stochastic and dynamic networks and routing. In: Ball M O, Magnanti T L, Nemhauser G L,eds. Network Routing[M]. Amsterdam: North-Holland,1995.141-295.
[91] Minkoff A S. A markov decision mode land decomposition heuristic for dynamics vehicle dispatching[J]. Operations Research,1993,(41):77-90.
[92] Higginson, J. K., J. H. Bookbinder. 1994a. Markovian decision processes in shipment consolidation. Trans. Sci. 29 242–255. 1994b. Policy recommendations for a shipment consolidation problem. J. Bus. Logist. 15 87–111.
[93] Bertsimas D J,Simchi-Levi. A new generation of vehicle routing: robust algorithms, addressing uncertainty[J].Operations Research,1996,(44):286-304.
[94] Xiangwen L. Dynamic and Stochastic Routing Optimization: Algorithms Development and Analysis. University of California. 2001.
[95]肖增敏,李军.动态网络车辆路径问题:研究现状及展望[J].系统工程,2004(7):68-71.
[96]郭耀煌,谢秉磊.一类随机动态车辆路径问题的策略分析[J].管理工程学报,2003(4):114-115.
[97] Bertsimas D J,Ryzin G V. Stohastic and dynamic vehicle routing problem in the eucidean plane with multiple capacitated vehicles[J].Operations Research,1993,(41):60-76.
[98]钟小鹏.动态车辆路径问题实时策略与技术支撑分析[D].西南交通大学硕士学位论文,2003.
[99]郭耀煌,钟小鹏.动态车辆路径问题排队模型分析[J].管理科学学报,2006(1):33-37.
[100]张天学.模拟退火算法在多目标决策中的应用研究[J].郑州航空工业管理学院学报,1995(3):13-18.
[101]李静.列车编组计划及其模拟退火算法[D].华北工学院硕士学位论文,2001.
[102] Robuste F, Daganzo C F, and Souleyrette R. Implementing vehicle routing models[J]. Transportation Research B, 1990, 24: 263-286.
[103] Alfa AS, Heragu S S, and Chen M. A 3-opt based simulated annealing algorithm for vehicle routing problems[J]. Computers& Industrial Engineering, 1991,21:635-639.
[104] Osman L H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem[J]. Annals of Operations Research, 1993, 41:421-451.
[105] Laporte G, Osman I H. Metaheuristics in combinatorial optimization:A bibliography[J]. Ann.Operations Research,1996,(63):513-628.
[106] Teodorovic D, Pavkovic G. A simulated annealing technique approach to the vehicle routing in the case of stochastic demand[J]. Transportation Planning and Technology,1992,16(16):291-273.
[107] Van Breedam A. Improvement heuristics for the vehicle routing problem based on simulated annealing[J]. European Journal of Operational Research, 1995, 86:480-490.
[108]胡大伟,朱志强,胡勇.车辆路径问题的模拟退火算法[J].中国公路学报,2006(4):123-126.
[109]蔡延光,钱积新,孙优贤.多重运输调度问题的模拟退火算法[J].系统工程理论与实践,1998(10):11-15.
[110]谢秉磊,李良,郭耀煌.求解配送\收集旅行商问题的模拟退火算法[J].系统工程理论方法应用,2002(3):240-243.
[111]朗茂祥.装卸混合车辆路径问题的模拟退火算法研究[J].系统工程学报,2005(5):485-491.
[112]杨宇栋,朗茂祥,胡思继.有时间窗车辆路径问题的模型及其改进模拟退火算法研究[J].管理工程学报,2006(3):104-107.
[113] Glover F. Tabu search part I[J]. ORSA Journal of Computing,1989,1:190-206.
[114] Glover F. Tabu search: a tutorial[J]. Interfaces,1990,20:74-941.
[115]符卓.带装载能力约束的开放式车辆路径问题及其禁忌搜索算法研究[J].系统工程理论与实践,2004(3):123-128.
[116]黄继鸿,雷战波,李欣苗.基于遗传禁忌算法的案例检索策略[J].系统工程理论方法应用,2004(1):10-13.
[117]钟石泉,贺国光.多车场有时间窗的多车型车辆调度及其禁忌算法研究[J].运筹学学报,2005(4):67-73.
[118] Willard J A G.. Vehicle routing using r-optimal tabu search: [M.Sc.dissertation]. London: The Imperial College, 1989
[119] Pureza V Mand Franca P.M. Vehicle routing problems via tabu search metaheuristic. Technical Report CRT-347, Centre for Research on Transportation,Montreal, Canada, 1991.
[120] Osman L H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem[J]. Annals of Operations Research, 1993, 41:421-451.
[121] Taillard E . Parallel iterative search methods for vehicle routing problems. Networks, 1993, 23:661-673.
[122] Gendreau M, Hertz A, and Laporte G.. A tabu search heuristic for the vehicle routing problem. Management Science, 1994, 40:1276-1290.
[123] Xu J and Kelly JP. A network flow-based tabu search heuristic for the vehicle routing problem[J]. Transportation Science, 1996, 30:379-393.
[124] Rego C.and Roucairol C. A parallel tabu search algorithm usingejection chains for the vehicle routing problem. In: LH. Osman and J.P Kelly(eds).Meta-Heuristics: Theory and Apllications. Kluwer, Boston, MA, 1996. 661-675.
[125] Rego C. A subpath ejection method for the vehicle routing problem.Management Science, 1998, 44:1447-1459.
[126] Barbarosoglu G. and Ozgur D. A tabu search algorithm for the vehicle routing problem[J]. Computers and Operations Research, 1999, 26:255-270.
[127] Rochat Y and Taillard E D. Probabilistic diversification and intensification in local search for vehicle routing[J]. Journal of Heuristics, 1995,1:147-167.
[128] Toth P and Vigo D. The granular tabu search (and its application to the vehicle routing problem).Technical Report OR/98/9, DEIS, University di Bologna,Italy, 1998.
[129] Battiti R, Tecchiolli G. The reactive tabu search[J]. ORSA Journal on Computing,1994,6(2):126-1401.
[130] Carlton W B, Barnes J W. Solving the traceling salesman problem with time windows using tabu search[J]. IIE Transactions,1996,28:617-629.
[131] Cordeau J F, Laporte G and Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows[J]. Journal of the Operational Research Society,2001,52:928-936.
[132] Taillard E, Badeau P, Gendreau M, Guertin F and Potvin J Y.A tabu search heuristic for the vehicle routing problem with soft time windows[J]. Transportation Science,1997,31:170-186.
[133] Duhamel C, Potvin J Y and Rousseau J M. A tabu search heuristic for the vehicle routing problem with backhauls and time windows[J]. Transportation Science,1997,31:49-59.
[134] Gendreau M, Laporte G and Potvin J Y. Metaheuristics for the Capacitated VRP[R]. P Toth, D Vigo.The Vehicle Routing Problem.Philadelphia,PA:SIAM Monographs on Discrete Mathematics and Applications.2002.129-154.
[135] Cordeau J F, Gendreau M, Laporte G, Potvin J Y, Semet F. A guide to vehicle routing heuristics[J]. Journal of the Operational Research Society,2002,53:512-522.
[136]袁庆达,杜文,周再玲.带软时间窗的混合车队车辆路线问题的模型和算法研究[J].西南交通大学学报,2001(4): 401-406.
[137]袁庆达,闰显,周再玲.Tabu Search算法在优化配送路线问题中的应用[J].计算机工程,2001,(11):86-89.
[138]符卓.开放式车辆路径问题及其应用研究[D].中南大学博士学位论文,2003.
[139]甘勤涛,阳平华,童钟灵.模糊需求车辆路径问题的禁忌搜索算法研究[J].长春理工大学学报,2006(1):84-86.
[140]蓝伯雄,张跃.求解带时间窗的装-卸载问题的概率式禁忌搜索算法[J].中国管理科学,2004(2):66-72.
[141]郎茂祥,胡思继.车辆路径问题的禁忌搜索算法研究[J].管理工程学报,2004(1):81-84.
[142]张炯,郎茂祥.有时间窗配送车辆调度问题的禁忌搜索算法[J].北方交通大学学报,2004(2):103-107.
[143]贾永基,谷寒雨,席裕庚.一类货运车辆调度问题的混合禁忌搜索算法[J].信息与控制,2004(6):724-728.
[144]王正国,刘振元,王红卫.适应性禁忌搜索算法求解带回程的时变速度车辆路径问题[J].计算机集成制造系统,2006(9):1453-1458.
[145] Holland J H.Adaptation in Natural and Artificial Systems[M] Ann Arbor:University of Michigan Press,1975.
[146] Goldberg D. Genetic Algorithms in Search,Optimization and Machine Learning[M]. Reading,MA: Addison-Wesley, 1989.
[147] Thangiah S, Nygard K, Juell P G. A genetic algorithms system for vehicle routing with time windows[A]. Miami. Proceedings of the Seventh Conference on Artificial Intelligence Applications[C].Florida,1991.322-325.
[148] Thangiah S R. Vehicle routing with time windows using genetic algorithms. Technical Report SRU-CpSc-TR-93-23, Slippery Rock University, Slippery Rock, PA, 1993.
[149] Joe L, Roger L. Multiple vehicle routing with time and capacity constrains using genetic algorithms[A]. Proceedings of the Fifth International Conference on Genetic Algorithms[C]. Florida,1993.452-459.
[150] J.-Y Potvin and S. Bengio. The vehicle routing problem with time windows Part II: Genetic search.INFORMS Journal on Computing, 1996, 8:165-172.
[151] Schmitt L J. An evaluation of a genetic algorithmic approach to the vehicle routing problem. Working paper, Department of Information Techonogy Management, Christian Brothers University, Memphis, TN, 1995.
[152] Tan K, Lee T, Ou K, et al. A messy genetic algorithm for the vehicle routing problem with time window constraints[A]. Proceedings of IEEE Congress on Evolutionary Computation[C],2001,1:679-686.
[153] Ozdemir H, Mohan C. Evolving schedule graphs for the vehicle routing problem with time windows[A]. Proceedings of the IEEE Congress on Evolutionary Computation[C],2000,2:888-895.
[154] Hwang H. An improved model for vehicle routing problem with time constraint based on geneticalgorithm[J]. Computers&Industrial Engineering,2002,42:361-369.
[155] Baker B, Ayechew M. A genetic algorithm for the vehicle routing problem[J]. Computers&OperationsResearch,2003,30:787-800.
[156] Thangiah S R. Vehicle routing problem with time windows using genetic algorithms[A]. Application Handbook of Genetic Algorithms:New Frontiers(VolumeH)[C]. BocaRaton:CRC Press,1995:253~277.
[157] Thangiah S R, Osman I H, Sun T. Hybrid genetic algorithm,simulated annealing and Tabu search methods for vehicle routing problems with time windows[R]. Technical Report SRU-CpSc-TR-94-27.Computer Science Department, Slippery Rock University,1994.
[158] Braysy O. A new algorithm for the vehicle routing problem with time windows based on the hybridization of a genetic algorithm and route construction heuristics[R]. Proceedings of the University of Vaasa, research papers227, VaasaFinland,1999.
[159] Berger,Salois J M, Begin R. A hybrid genetic algorithm for the vehicle routing problem with time windows[Z]. Presented at the AI 98 12th Canadian Conference on Artificial Intelligence,Vancouver,Canada,1998.
[160] Braysy O, Berger J. A new hybrid evolutionary algorithm for the vehicle routing problem with time windows[Z]. Presented at the Route 2000-Workshop,Skodsborg,Denmark,2000.
[161] Tan K C, Lee L H, Zhu Q L, Qu K. Heuristic methods for vehicle routing problem with time windows[J]. Artificial Intelligence in Engineering,2001,15:281~295.
[162] Van Breedam A. An analysis of the effect of local improvement operaters in genetic algorithms and simulated annealing for the vehicle routing problem[R]. RUCA working paper 96/14,University of Antwerp,Belgium,1996.
[163]姜大立,杨西龙,杜文,周贤伟.车辆路径问题的遗传算法研究[J].系统工程理论与实践,1999(6):40-45.
[164]李大卫,王莉,王梦光.遗传算法在有时间窗车辆路径问题上的应用[J].系统工程理论与实践,1999(8):65-69.
[165]张丽萍,柴跃廷.车辆路径问题的改进遗传算法[J].系统工程理论与实践,2002(8):79-84.
[166]宋厚冰,蔡远利.带时间窗的车辆路径混合遗传算法[J].交通运输工程学报2003(4):112-115.
[167]许国平,叶效锋,鲍立威.基于模拟退火遗传算法的车辆路径问题研究[J].工业控制计算机,2004(6):49-50.
[168]吕军,冯博琴,李波.多约束条件车辆路径问题的二阶段遗传退火算法[J].西安交通大学学报,2005(12):1299-1302.
[169]刘诚,陈治亚,封全喜.带软时间窗物流配送车辆路径问题的并行遗传算法[J].系统工程2005(10):7-11.
[170]邓连波,史峰,莫辉辉.物流配送车辆路径问题多代竞争遗传算法[J].铁道科学与工程学报,2005(5):75-79.
[171]刘敏,郑金华,蒋浩.基于多目标遗传算法求解时间窗车辆路径问题[J].计算机工程与应用,2006(9):186-190.
[172]肖鹏,李茂军,张军平,童调生.车辆路径问题的单亲遗传算法[J].计算技术与自动化,2000(1):26-30.
[173]赵燕伟,吴斌,蒋丽,董红召,王万良.车辆路径问题的双种群遗传算法求解方法[J].计算机集成制造系统-CIMS,2004(3):303-306.
[174]甘勤涛,阳平华,黄万荣,刘华平.车辆路径问题的分层遗传算法研究[J].军事运筹与系统工程,2005(4):17-20.
[175]吴兴华,田森平.确定车辆数的有时间窗车辆路径问题的遗传算法[J].交通与计算机2006(3):96-99.
[176]吴璟莉,刘仁辉.分批配送的有时间窗车辆路径问题的遗传算法[J].计算机工程,2006(8):213-216.
[177]李军,谢秉磊,郭耀煌.非满载车辆调度问题的遗传算法[J].系统工程理论方法应用,2000(3): 235-239.
[178]谢秉磊,李军,郭耀煌.有时间窗的非满载车辆调度问题的遗传算法[J].系统工程学报,2000(3):290-294.
[179]宋伟刚,张宏霞,佟玲.有时间窗约束非满载车辆调度问题的遗传算法[J].系统仿真学报,2005(11):2593-2597.
[180]邹彤,李宁,孙德宝,李菁.多车场车辆路径问题的遗传算法[J].计算机工程与应用,2004(21):82-83.
[181]杨元峰,崔志明,陈建明.有时间窗约束的多车场车辆路径问题的改进遗传算法[J].苏州大学学报(工科版)2006(2):20-23.
[182]邹彤,李宁,孙德宝.不确定车辆数的有时间窗车辆路径问题的遗传算法[J].系统工程理论与实践,2004(6):134-138.
[183] Hopfield J J. Neurons with Graded Response have Collective Computational Properties Like those of Two state Neurons. Proc. Natl, Acad. Sci., 1984,81:3088- 3092.
[184] Hopfield J J, Tank DW. Neural Computation of Decisions in Optimization Problems. Biol.Cybern. 1985,52:141-152.
[185] Hopfield J J, Tank D W. Computing with Neural Circuits: A Model. Science,1986,233:625-633.
[186]李旭帅.基于神经网络的汇率预测研究[D].南京航空航天大学硕士学位论文,2005.
[187]王德东,郑丕谔.车辆路径问题的混沌神经网络解法[J].计算机集成制造系统-CIMS,2005(12):1747-1750.
[188]冯国莉,杨晓冬.基于Hopfield神经网络车辆路径的优化研究[J].信息技术,2006(7):90-92.
[189]苏一丹,李桂.流体神经网络模型在规划物流配送运输方案中的应用[J].广西大学学报(自然科学版).2002(3):203-206.
[190]阎平凡,张长水.人工神经网络与模拟进化计算[M].清华大学出版社,2005.
[191]丁才昌,方勃,鲁小平.分布估计算法及其性能研究[J].武汉大学学报(理学版), 2005(S2): 125-128.
[192] Larranga P,Etxeberria R,Lozano A,Pefia J.M. Optimization by learning and simulation of Bayesian and Gaussian networks.In:Proceedings of the 2000 Genetic and Evolutionary Computation Conference Workshop Program,Las Vegas,Nevada,USA,2000.
[193] Muhlenbein H, Paaβ; G.: From Recombination of Genes to the Estimation of Distribution Algorithms I. Binary Parameters, H.M.Voigt, et al.(eds.): Lecture Notes in Computer Science1411: Parallel Problem Solving from Nature -PPSN IV (1996) 178-187.
[194] Zhang Q. Miihliebei H. On the convergence of a class of estimation of distribution algorithms[J]. IEEE Trans on Evolutionary Computation.8(2): 127-136.
[195] Baluja S. Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning. Pittsburgh, PA: Carnegie Mellon University (Technical Report No. CMU-CS-94-163),1994.
[196] Muhlenbein H..The equation for response to selectiona nd its use for prediction[J]. Evolutionary Computation,1998,5(3):303-346.
[197] Harik G R, LoboF G, Goldberg D E. The Compact Genetic Algorithm. In Proceedings of the IEEE Conference on Evolutionary Computation 1998(ICEG’98) Piscataway, NJ: IEEE Service Center, 1998:523-528.
[198] De Bonet J S, Isbell C L, Viola, P. MMIC: Finding Optima by Estimating Probability Densities. In Mozer, M. C. , Jordan, M. I. , & Petsche, T. (editors), Advances in Neural Information Processing Systems. The MIT Press, Cambridge,1997,9:424.
[199] Baluja S and Davies S. Probablistic Modeling for Combinatorial Optimization,(Pre-Print,1997)
[200] Baluja S and Davies S. Faet Probablistic Modeling for Combinatorial Optimization, AAAI-98, (1998)
[201] Peliken M,Muhlenbein H.The bivariate marginal distribution algorithm.In: Roy R, Furnhashi T, Chandhery P K eds..Advance in Soft Computing Engineering Design and Manufacturing.London: Springer Verlag,1999,521-535.
[202] Muhlenbein H, Mahnig T. FDA-A scalable evolutionary algorithm for the optimization of additively decomposed function. Evolutionary Computation,1999,7(4):353-376.
[203] Lauritzen S L. Graphical Models, Oxford University Press,1996.
[204] Harik G. Learning via Probabilistic Modeling in the ECGA. Urbana, IL: University of Illinois Genetic Algorithms Laboratory(IlliGAL Report No. 99010),1999.
[205] Mitchell T M. Machine Learning. McGraw-Hill,1997, section 6.6, 171-173.
[206] Pelikan M, Goldberg D E. BOA: The Bayesian Optimization Algorithm[R]. Urbana: University ofIllinois at Urbana Champaign, IlliGAL Genetic Algorithm Laboratory,1998,(5):55-67.
[207] Pelikan M. A Survey of Optimization by Building and Using Probabilistic Models[R]. Urbana: University of Illinoisat Urbana Champaign, IlliGALGenetic Algorithm Laboratory,1999,(3):25-33.
[208] Zhang B T, Shin S Y. Bayesian evolutionary optimization using Helmholtz machines. Parallel Problem from Nature VI, Lecture Note in Computer Science 1917, Paris, dance: Springer, 2000: 827-836.
[209]钟伟才,刘静,刘芳,焦李成.二阶卡尔曼滤波分布估计算法[J].计算机学报,2004(9): 1272-1277.
[210]钟伟才,刘静,刘芳,焦李成.建立在一般结构Gauss网络上的分布估计算法[J].电子与信息学报,2005(3):467-470.
[211]陆琳,谭清美.最大熵分布算法及其应用[J].系统工程与电子技术. 2007,29 (5):820-822.
[212] Siddall J N. Probabilistic engineering design. Principles and Applications. New York: Marcel Dekker,1983.
[213] Shigeyoshi Tsutsui, Gordon Wilson. Solving capacitated vehicle routing problems using edge histogram,2004:1150-1157.
[214] Colorni A , Dorigo M , Maniezzo V , et al. Distributed optimization by ant colonies[C]. Proc. of the First European Conf . on Artificial Life. Paris : Elsevier Publishing ,1991. 134–142.
[215] Goss S, Aron S, J.L.Deneubourg, and J.M.Pasteels. Self-Organized shortcuts in the Argentine ant[J]. Naturwissenschaften,1989,76:579-581.
[216] Cicirello V A and Smith S F. Insect Societies and Manufacturing[R]. In IJCAI-01 Workshop on Artificial Intelligence and Manufacturing: NewAIParadigms for Manufacturing,August 2001.
[217] Lldobler B H and Wilson E O. The Ants[R]. The Belknap Press of Harvard University Press,1990.
[218] M Dorigo,G Di Cargo and L M Gambardella. Ant algorithms for distributed discrete optimization[R]. Technical Report 98-10IRIDIA,Universit Librede Brexelles,1998.
[219] Merkle D, Middendorf M and Schmeck H. Ant colony optimization for resource-constrained project scheduling[C]. In GECCO-2000: Proceedings of the Genetic and Evolutionary Computation Conference,pages893-900.Morgan Kaufmann, July2000.
[220] Hozefa M Botee, Eric Bonabeau. Evolving Ant Colony Optimization[C]. In Advances in Complex Systems,1999,1(2/3):149-159.
[221] Botee H M and Bonabeau E.“Evolving Ant Colony Optimization”. In Advanced Complex Systems, 1998,1:149-159.
[222] Pilat M L and White T.“Using Genetic Algorithms to Optimize ACS-TSP”. Proceedings of Ant Algorithms: Third International Workshop, ANTS 2002, Brussels, Belgium, September 2002, M. Dorigo et al (Eds.), LNCS 2463, Springer-Verlag, 282-287.
[223]Gambardella L M, Dorigo M. HAS-SOP: an hybrid ant system for the sequential ordering problem.Technique Report, No.IDSIA 97-11, Lugano: IDSIA, 1997.
[224]胡娟,王常青,韩伟,全智.蚁群算法及其实现方法研究[J].计算机仿真,2004(7):110-114.
[225]秦玲.蚁群算法的改进与应用[D].扬州大学硕士学位论文,2004.
[226]王静晖.改进的蚂蚁算法应用于车辆路径优化问题[D].河北工业大学硕士学位论文,2005.
[227]肇勇.改进蚁群算法的理论及方法研究[D].西南石油学院硕士学位论文,2004.
[228]高彦明.蚁群算法并行化研究[D].苏州大学硕士学位论文,2005.
[229] Dorigo M, Maniezzo V, and Colorni A. The Ant System: Optimization by a Colony of Cooperating Agents. IEEE -Transactions on Systems, Man, and Cybernetics - Part B, 26(1):29-41,1996.
[230] Bullnheimer B, Hartl R F, Strauss C. A new rank based version of the ant system—a computational study [J]. Central European J Oper Res Econom , 1999 , 7 : 25–38.
[231] Luca M,Galnbardella, Dorigo M. Ant-Q: an reinforcement learning approach to the traveling salesman problem[A]. Proc. of 12th Machine Learning Conf.[C]. France: Morgan Kaufmann, 1995. 252-260.
[232] Dorigo M, Luca M. A study of some properties of Ant-Q. Technical Report, TR/IRIDIA/1996-4, IRIDIA, Universitd Libre de Bruxelles, 1996.
[233] Stutzle T, Hoos H H. Improvements on the ant system: introducing the MAX-MIN ant system. In: Smith G D, Steele N C,Albrecht R F, eds. Proceedings of the Artificial Neural Nets and Genetic Algorithms 1997. Wien: Springer-Verlag, 1998. 245-249.
[234] Stutzle T, Hoos H H. MAX-MIN ant system[J]. Future Generation Computer Systems , 2000 , 16(8) :889–914.
[235] Gambardella L M, Dorigo M. Solving symmetric and asymmetric TSPs by ant colonie[A]. Proc of the IEEE Conference on Evolutionary Computation[C].[s.l]:[s.n.], 1996,622-627.
[236] M Dorigo and Gambardella LM. Ant Colony System: A cooperative learning approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation, 1997, 1(1):53-66.
[237]吴庆洪,张纪会,徐心和.具有变异特征的蚁群算法[J].计算机研究与发展,1999(10): 1240-1245.
[238]张纪会,高齐圣,徐心和.自适应蚁群算法[J].控制理论与应用,2000(1) :1-5.
[239]魏平,熊伟清.用于一般函数优化的蚁群算法[J].宁波大学学报(理工版),2001(4):52-55.
[240]覃刚力,杨家本.自适应调整信息素的蚁群算法[J].信息与控制,2002(3):198-204.
[241]郝晋,石立宝,周家启.具有随机扰动特性的蚁群算法[J].仪器仪表学报,2001(S2):350-352.
[242]陈崚,秦玲,陈宏建,徐晓华.具有感觉和知觉特征的蚁群算法[J].系统仿真学报2003(10):1418-1425.
[243] Bullnheimer B, Hartl R F, and Struss C. An improved ant system algorithm for the vehicle routing problem[J]. Annals of Operations Research, 89 (1999)319–328.
[244] Bullnheimer B, R F Hartl, et al. Applying the Ant System to the Vehicle Routing Problem.In:VossS., MartelloS., OsmanI.H., RoucairolC.(eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer,Boston,1999:285~296.
[245] Silvia Mazzeo, Irene Loiseau. An ant colony algorithm for the capactitated vehicle routing. Electronic Notes in Discrete Mathematics 18(2004):181-186.
[246] John E. Bell, Patrick R. McMullen. Ant colony optimization techniques for the vehicle routing problem[J]. Advanced Engineering Informatics,2004,18:41-48.
[247] Reimann M, Dorener K, Hartl R F. D-ants: savings based ants divide and conquer the vehicle routing problem[J]. Computers&OperationsResearch,2004,31:563-591.
[248] Gambardella L M, Taillard E, Agazzi G. MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows[A].New Ideas in Optimization [C]. London,U.K.: McGraw-Hill,1999.63-73.
[249] Reimann M, Dorener K, Hartl R F. Insertion based ants for vehicle routing problems with backhauls and time windows[A]. Ant Algorithms[C]. Berlin/Heidelberg, Germany: Springer LNCS2463,2002.135-147.
[250]刘志硕,申金升.基于解均匀度的车辆路径问题的自适应蚁群算法[J].系统仿真学报,2005(5):1079-1083.
[251]刘志硕,申金升,柴跃廷.基于自适应蚁群算法的车辆路径问题研究[J].控制与决策,2005(5):562-566.
[252]刘志硕,柴跃廷,申金升.蚁群算法及其在有硬时间窗的车辆路径问题中的应用[J].计算机集成制造系统,2006(4):596-602.
[253]刘云忠,宣慧玉.动态蚁群算法在带时间窗车辆路径问题中的应用[J].中国工程科学,2005(12):35-40.
[254]刘哲,李建国.基于带时间窗口车辆路径问题的蚁群算法[J].控制工程,2006(2):127-130.
[255]李继玲,卢才武,李金成.基于蚁群算法的有时间窗车辆调度问题的研究[J].信息技术,2006(5):128-131.
[256]冯远静,冯祖仁,彭勤科.一类自适应蚁群算法及其收敛性分析[J].控制理论与应用,2005(5):713-717.
[257]段海滨,王道波.蚁群算法的全局收敛性研究及改进[J].系统工程与电子技术,2004(10):1506-1509.
[258] Tarasewich P, McMullen PR.Swarm intelligence: power in numbers [J]. Commun ACM 2002,45(8):62–67.
[259]石立宝,郝晋.随机摄动蚁群算法的收敛性及其数值特性分析[J].系统仿真学报.2004(11):2421-2424.
[260] Reynolds C W. Flocks, herds and schools: a distributed behavioral model. Computer Graphics,1987,21(x):25-34.
[261] Wilson E O. Sociobiology: The new synthesis. Belknap Press,Cambridge,MA,1975.
[262] Eberhart R C, ShiY. Particle swarm optimization: developments, applications and resources[A]. Proc Congresson Evolutionary Computation2001[C].Piscataway, NJ:IEEE Press,2001.81-86.
[263]李建勇.粒子群优化算法研究[D].浙江大学硕士学位论文,2004.
[264]李爱国,覃征,鲍复民,贺升平.粒子群优化算法[J].计算机工程与应用,2002(21):1-4.
[265]杨维,李歧强.粒子群优化算法综述[J].中国工程科学,2004(5):87-94.
[266] Shi Y, Eberhart R C. A modified particle swarm optimizer[R]. IEEE International Conference of Evolutionary Computation,Anchorage,Alaska,May 1998.
[267] Parsopoulos K E, Plagianakos V P, Magoulas G D, etal. Improving particle swarm optimizer by function“stretching”[A]. Hadjisavvas N, Pardalos P. Advances in Convex Analysis and Global Optimization[M]. The Netherlands:Kluwer Academic Publishers,2001.445-457.
[268] Shi Y, Eberhart R C. Empirical study of particle swarm optimization[A]. Proceeding of Congress on Evolutionary Computation[C]. Piscataway, NJ: IEEE ServiceCenter,1999.1945-1949.
[269] Angeline P J. Evolulionary Optimization Versus Panicle Swarm Optimization:Philosophy and Perforrnance Differences[C]. In:Evolutionary Programming YII,1998:601-610.
[270] Lovbjerg M,Rasmussen T K, Krink T. Hybrid Particle Swarrn Optimiser with Breeding and Subpopulaltons[C]. In: Proc of the third Genetic and Evolulionary Cornputation Conflerence, 2001.
[271] Kennedy J. Small worlds and mega-minds: effects of neighborhood topologyon particle swarm performance[A]. Proceedings of IEEE Congress on Evolutionary Computation[C]. Piscataway,NJ: IEEE Service Center,1999.1931-1938.
[272] Van den Bergh F, Engelbrecht A P. Using cooperative particle swarm optimization to train product unit neural networks[R]. IEEE International Joint Conference on Neural Networks,WashingtonDC,USA,2001.
[273] Van den Bergh F, Engelbrecht A P. Training product unit networks using Cooperative particle swarm optimizers[C]. In: Proc of the third Genetic and Evolutionary Computation Conference(GECCO),San Francisco, USA,2001.
[274] Van den Bergh F, Engelbrecht A P. Effects of swarm size on Cooperative particle swarm optimizers[C]. In: Proc of the GECCO,San Francisco, USA,2001.
[275] Christos Voudouris, Edward Tsang. Partial constraint satisfaction problems and guided local search[A]. Proc of the second international conference on the practical application of constraint technology,1996.
[276]李宁,邹彤,孙德宝.车辆路径问题的粒子群算法研究[J].系统工程学报,2004(6):596-560.
[277]李宁,邹彤,孙德宝.带时间窗车辆路径问题的粒子群算法[J].系统工程理论与实践,2004(4):130-135.
[278]陈曦,蒋加伏.带变异粒子群算法在车辆路径问题中的应用[J].计算机与数字工程,2006(9):19-21.
[279]罗先国,侍洪波.非满载车辆路径问题的改进粒子群优化算法[J].华东理工大学学报(自然科学版) ,2006(7):767-772.
[280] Ai-ling Chen, Gen-ke Yang and Zhi-ming Wu. Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem[J]. Journal of Zhejiang University - Science A, 2006,7(4):607-614.
[281] Wanliang Wang, Bin Wu, Yanwei Zhao and Dingzhong Feng. Particle Swarm Optimization for Open Vehicle Routing Problem. Lecture Notes in Computer Science, 4114/2006,in:Irwin (Eds.): ICIC 2006, LNAI 4114, pp. 999– 1007, 2006.
[282] Nicola Secomandi. Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands[J]. Computers & Operations Research,2000,27:1201-1225.
[283] Gendreau M, Laporte G and Séguin R. An exact algorithm for the vehicle routing problem with stochastic demands and customers[J]. Transportation Science,1995,29:143–155.
[284] http:// www.branchandcut.org/pub/data/VRP/M/M-n200-k17.vrp
[285] http://www.branchandcut.org/pub/data/VRP/ M/M-n60-k17.vrp
[286]唐依珠,郑茜颖,黄金虎. GPS车辆导航系统的研究和开发[J].福州大学学报(自然科学版),2001,29(2):16-20.
[287] Cheung R K, Powell W. An algorithm for multistage dynamic networks with random arc capacities with an application to dynamic fleet management[J]. Oper. Res. 1996,44(6) 951–963.
[288]Compbell A M, Savelsbergh Martin W P. Decision Support for Consumer Direct Grocery Initiatives[J]. Transportation Science,2005,39(3):313–327.