带软时间窗约束的开放式车辆路径问题及其应用
|
摘要
车辆路径问题是运输组织优化中的核心问题之一。本文将首先对车辆路径问题的特点、分类以及求解算法的研究现状等进行综述。
带软时间窗约束的开放式车辆路径问题在实践中广泛存在。它与基本的车辆路径问题的主要不同点,一是不要求车辆完成运输任务后返回原出发点,或者是若要求返回原出发点,则沿原去程路线返回,二是客户希望车辆在给定时间窗内进行服务,如果违背了时间窗,则须支付惩罚。本文对带软时间窗约束的开放式车辆路径问题从理论上进行了研究。通过利用所研究的问题的特点,设计了七种邻域结构、并在搜索过程中引入一种随机多样性等,从而构造了一个求解该问题的禁忌搜索算法。从用随机方式产生的初始解出发,用该禁忌搜索算法对56个标准测试问题进行求解。与相关文献中的结果进行了比较。通过比较,显示了本禁忌搜索算法的优势。
在理论研究的基础上,本文运用禁忌搜索算法对长沙市市内邮政运输趟班数据进行了环形和辐射形两种邮路形式、共四种邮车路径规划方案的案例测试。通过比较各种规划方案的结果,显示出通用启发式算法对于依靠经验的传统手工编排趟班的明显优势,表明了在物流发达、经营点众多、分布范围较广、车辆行驶距离较长的大中城市,相对于环形邮路,辐射形邮路具有很大的优势。
多车场车辆路径问题广泛存在于多个行业之中,对其研究不仅具有实际应用价值,更是研究供应链集成与协调的基础。多车场带软时间窗约束的开放式车辆路径问题则比单车场带软时间窗约束的开放式车辆路径问题求解更加复杂。本文以客户直接排列方法表示多车场带软时间窗约束的开放式车辆路径问题中的解；对于多车场的处理,则是随机从车场集合中选一个车场并从中派出一辆车,该车完成配送任务后再回到距离这条路径上的最后一个配送点最近的车场。如此循环,直到所有配送任务完成。这样,就从整体上对多车场带软时间窗约束的开放式车辆路径问题进行了求解。
分析了农产品物流起点——农产品物流集货运输,将其归结为一类各车辆最后客户相同且确定的带软时间窗约束的不完全开放式车辆路径问题,并提出了一个遗传算法用于求解。通过对提供第三方物流服务的农村汽车货运企业的农产品物流集货运输问题进行模拟,构造了一个农产品物流集货运输路径问题算例,进行了算例测试,获得了满意的优化效果,表明了本遗传算法的优势。
Vehicle routing problem (VRP) is the core of transport organizing optimization. In this dissertation, the characteristics, classification and algorithms of the VRP will be reviewed first of all.
The Open Vehicle Routing Problem with Soft Time Windows (OVRPSTW) is widespread in practice. OVRPSTW is different to the basic vehicle routing problem (VRP). One difference is that OVRPSTW doesn't require the vehicle to return to the original starting depot after its completing the task, or if it requires the vehicle to return to the original starting depot, then a back trip along the original route is needed. Another difference is that OVRPSTW demands the service of the vehicle being in the customer's desired time windows, and if the service of the vehicle violates the customer's time windows, a penalty must be paid. In this dissertation, OVRPSTW will be studied theoretically. Based on the design of seven kinds of neighborhood structures and the introduction of a randomly diverse search process, a tabu search algorithm is constructed to solve OVRPSTW whose features are exploited. Starting with an initial solution which is generated randomly, the tabu search algorithm is tested with 56 benchmark problems. A comparison with other related approach in the literature is carried out. By the comparison, it shows that the proposed tabu search algorithm is good.
Based on the theoretical study, the urban local post transportation network running data of Changsha City Post and the proposed tabu search algorithm are used to test two kinds of post routing, i.e., radial shape post routing and ring shape post routing which have four post routing programs. By comparing the result of every program with each other, the metaheuristic algorithm is visibly advantageous to the traditional planning manually in scheduling, and the radial shape post routing is much more better than the ring shape post routing in a medium-large-sized city which is with well-developed logistics business, a lot of business point, a wider distribution region, and a long vehicle running distance.
The Multiple-Depot VRP (MDVRP) widely presents in many businesses. The research on MDVRP not only has practical value, but also is a base on supply-chain integration and coordination. To solve a Multi-Depot OVRPSTW (MDOVRPSTW) is more sophisticated. In this dissertation, the solution shows as arrange-customer-directly, a depot is selected randomly from the set of depots, and a vehicle in the selected depot is selected randomly to deliver to deal with the multiple depots. After completing final distribution in its routing, the selected vehicle goes to the nearest depot from it. Do so cyclically till all of the deliveries are completed. Thus, the MDOVRPSTW is solved integrally.
With analyzing the beginning of agricultural products logistics, i.e., the transport logistics of agricultural products pickup, a research about the same and identified last customer of all vehicles which is claasified into a kind of an OVRPSTW named incomplete OVRPSTW (IOVRPSTW) is carried on. Meanwhile, a genetic algorithm is proposed to solve it. With simulating the agricultural products pickup logistics transport routing problem operated by a rural freight company who engages in third-party logistics business, an example of the agricultural products pickup logistics transport routing problem is constructed. The example is tested, and a satisfactorily optimal result is obtained, therefore, the genetic algorithm is indicated to be advantageous.
带软时间窗约束的开放式车辆路径问题在实践中广泛存在。它与基本的车辆路径问题的主要不同点,一是不要求车辆完成运输任务后返回原出发点,或者是若要求返回原出发点,则沿原去程路线返回,二是客户希望车辆在给定时间窗内进行服务,如果违背了时间窗,则须支付惩罚。本文对带软时间窗约束的开放式车辆路径问题从理论上进行了研究。通过利用所研究的问题的特点,设计了七种邻域结构、并在搜索过程中引入一种随机多样性等,从而构造了一个求解该问题的禁忌搜索算法。从用随机方式产生的初始解出发,用该禁忌搜索算法对56个标准测试问题进行求解。与相关文献中的结果进行了比较。通过比较,显示了本禁忌搜索算法的优势。
在理论研究的基础上,本文运用禁忌搜索算法对长沙市市内邮政运输趟班数据进行了环形和辐射形两种邮路形式、共四种邮车路径规划方案的案例测试。通过比较各种规划方案的结果,显示出通用启发式算法对于依靠经验的传统手工编排趟班的明显优势,表明了在物流发达、经营点众多、分布范围较广、车辆行驶距离较长的大中城市,相对于环形邮路,辐射形邮路具有很大的优势。
多车场车辆路径问题广泛存在于多个行业之中,对其研究不仅具有实际应用价值,更是研究供应链集成与协调的基础。多车场带软时间窗约束的开放式车辆路径问题则比单车场带软时间窗约束的开放式车辆路径问题求解更加复杂。本文以客户直接排列方法表示多车场带软时间窗约束的开放式车辆路径问题中的解；对于多车场的处理,则是随机从车场集合中选一个车场并从中派出一辆车,该车完成配送任务后再回到距离这条路径上的最后一个配送点最近的车场。如此循环,直到所有配送任务完成。这样,就从整体上对多车场带软时间窗约束的开放式车辆路径问题进行了求解。
分析了农产品物流起点——农产品物流集货运输,将其归结为一类各车辆最后客户相同且确定的带软时间窗约束的不完全开放式车辆路径问题,并提出了一个遗传算法用于求解。通过对提供第三方物流服务的农村汽车货运企业的农产品物流集货运输问题进行模拟,构造了一个农产品物流集货运输路径问题算例,进行了算例测试,获得了满意的优化效果,表明了本遗传算法的优势。
Vehicle routing problem (VRP) is the core of transport organizing optimization. In this dissertation, the characteristics, classification and algorithms of the VRP will be reviewed first of all.
The Open Vehicle Routing Problem with Soft Time Windows (OVRPSTW) is widespread in practice. OVRPSTW is different to the basic vehicle routing problem (VRP). One difference is that OVRPSTW doesn't require the vehicle to return to the original starting depot after its completing the task, or if it requires the vehicle to return to the original starting depot, then a back trip along the original route is needed. Another difference is that OVRPSTW demands the service of the vehicle being in the customer's desired time windows, and if the service of the vehicle violates the customer's time windows, a penalty must be paid. In this dissertation, OVRPSTW will be studied theoretically. Based on the design of seven kinds of neighborhood structures and the introduction of a randomly diverse search process, a tabu search algorithm is constructed to solve OVRPSTW whose features are exploited. Starting with an initial solution which is generated randomly, the tabu search algorithm is tested with 56 benchmark problems. A comparison with other related approach in the literature is carried out. By the comparison, it shows that the proposed tabu search algorithm is good.
Based on the theoretical study, the urban local post transportation network running data of Changsha City Post and the proposed tabu search algorithm are used to test two kinds of post routing, i.e., radial shape post routing and ring shape post routing which have four post routing programs. By comparing the result of every program with each other, the metaheuristic algorithm is visibly advantageous to the traditional planning manually in scheduling, and the radial shape post routing is much more better than the ring shape post routing in a medium-large-sized city which is with well-developed logistics business, a lot of business point, a wider distribution region, and a long vehicle running distance.
The Multiple-Depot VRP (MDVRP) widely presents in many businesses. The research on MDVRP not only has practical value, but also is a base on supply-chain integration and coordination. To solve a Multi-Depot OVRPSTW (MDOVRPSTW) is more sophisticated. In this dissertation, the solution shows as arrange-customer-directly, a depot is selected randomly from the set of depots, and a vehicle in the selected depot is selected randomly to deliver to deal with the multiple depots. After completing final distribution in its routing, the selected vehicle goes to the nearest depot from it. Do so cyclically till all of the deliveries are completed. Thus, the MDOVRPSTW is solved integrally.
With analyzing the beginning of agricultural products logistics, i.e., the transport logistics of agricultural products pickup, a research about the same and identified last customer of all vehicles which is claasified into a kind of an OVRPSTW named incomplete OVRPSTW (IOVRPSTW) is carried on. Meanwhile, a genetic algorithm is proposed to solve it. With simulating the agricultural products pickup logistics transport routing problem operated by a rural freight company who engages in third-party logistics business, an example of the agricultural products pickup logistics transport routing problem is constructed. The example is tested, and a satisfactorily optimal result is obtained, therefore, the genetic algorithm is indicated to be advantageous.
引文
[1]M. Fisher. Vehicle routing. In:M. O. Ball, T. L. Magnanti, C. L. Monma, eds. Handbooks in Operations Research and Management Science, Volume Network Routing. Amsterdam:Elsevier Science,1995.1-33
[2]Paolo Toth and Daniele Vigo. An overview of vehicle routing problems. In: Paolo Toth and Daniele Vigo, eds. The Vehicle Routing Problem. Philadelphia: Society for Industrial and Applied Mathematics,2002.1-26
[3]吴斌.车辆路径问题的粒子群算法研究与应用：[博士学位论文].浙江：浙江工业大学,2007
[4]国家发展改革委,国家统计局,中国物流与采购联合会.2007年全国物流运行情况通报,http://www. chinawuliu. com. cn/cflp/newss/content1/200803/812 26979. html
[5]G. B. Dantzig and J. H. Ramser. The truck dispatching problem. Management Science,1959,6:80
[6]G. Clarke and J. V Wright. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research,1964,12:568-581
[7]L. Bodin, B. Golden, A. Assad and M. Ball. Routing and Scheduling of Vehicles and Crews:The State of Art. Computers&Operations Research,1983, No.10: 63-211
[8]M. O. Ball, T. L. Magnanti, C. L. Monma et al, eds. Handbooks in Operations Research and Management Science, Volume 8:Network Routing. Amsterdam: Elsevier Science,1995
[9]Paolo Toth and Daniele Vigo (eds). The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, Philadelphia, USA,2002
[10]李军,郭耀煌.物流配送车辆优化调度理论与方法.北京：中国物资出版社,2001
[11]郎茂祥.配送车辆优化调度模型与算法.北京：电子工业出版社,2009
[12]张潜著.物流配送路径优化调度建模与实务.北京：中国物资出版社,2006
[13]M. Dror and P. Trudeau. Split delivery routing. Naval Research Logistics, 1990,37:383-402
[14]谢秉磊.随机车辆路径问题研究：[博士学位论文].成都：西南交通大学,2003
[15]Laporte G, Louveaux F. V, Mercure H., The vehicle routing problem with stochastic travel times. Transportation Science,1992,26,161-170
[16]Bent Russell W. Van Hentenryck. Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers. Operations Research,2004,52 (6):977-987
[17]Teodorovie. D. The fuzzy set approach to the vehicle routing problem when demand at nodes uncertain. Fuzzy sets and system,1996,82:307-317
[18]陈宝文,宋申民,陈兴林.模糊需求车辆路径问题及其启发式蚁群算法.计算机应用,2006,26(11)：2639-2642
[19]Johan Oppen, Arne. Arc routing in a node routing environment. Computers & Operations Research,133(4):2006,1033-1055
[20]Psaraftis H. N.. Dynamic Vehicle Routing:status and prospects. Annals of Operations Research,1995,61:143-164
[21]Ali Haghani and Soojung Jung. A dynamic vehicle routing problem with time-dependent travel times. Computers& Operations Research,2005,32(11): 2959-2986
[22]Eiichi Taniguchi and Hiroshi Shimamoto. Intelligent transportation system based dynamic vehicle routing and scheduling with variable travel times. Transportation Research PartC:Emerging Technologies,2004,12(3):235-250
[23]Hanshar, Franklin, Ombuki-Berman, Beatrice. Dynamic vehicle routing using genetic algorithms. Applied Intelligence,2007,27(1):89-99
[24]R. Montemanni, L. M. Gambardella, A. E. Rizzoli. Ant Colony System for a Dynamic Vehicle Routing Problem. Journal of Combinatorial Optimization,2005, 10(4):327-343
[25]Benoit Crevier, Jean-Franeois Cordeau and Gilbert LaPorte. The multi-depot vehicle routing Problem with inter-depot routes. European Journal of Operational Research,2007,176(2):756-773
[26]Lim, Andrew, Fan Wang. Multi-Depot Vehicle Routing Problem:A One-Stage Approach. IEEE Transactions on Automation Science& Engineering,2005, 2(4):397-402
[27]Golden B, Assad A, LevyL. The fleet size and mix vehicle routing problem. Computers and Operations Research,1984,11:49-66
[28]Eunjeong Choia, Dong-Wan Tchab. A column generation approaeh to the Heterogeneous fleet vehicle routing problem. Computers& Operations Researeh, 2007,34:2080-2095
[29]Tarantilis, Kiranoudis, Vassiliadis. A threshold acecpting metaheuristcfor the heterogeneous fixed fleet vehicle routing problem. European Journal of Operational Research,2004,152(1):148-158
[30]E. D. Taillard, L. M. Gambardella. M. Gendreau, et al. Adaptive memory programming:A unified view of metaheuristics. Research RePort IDSIA/19-98, IDSIA, Lugano, Switzerland,1998
[31]A. Colorni, M. Dorigo, V. Maniezzo. Distributed optimization by ant colonies. In:Proc of the First European Conf. of Artificial Life. Paris, France Elsevier Publishing,1991,134-142
[32]B. Bullnheimer, R. F. Hartl, and C. Strauss. Applying ant system algorithm to the vehicle routing problem[A]. In I. H. Osman S., S. Martello and C. Roucairol, editors, Meta-Heuristies:Advances and Trends in Local Search Paradigms for OPtimization [C], Kluwer Acedenics,1998.109-120
[33]Silvia Mazzeo, Irene Loiseau. An Ant Colony Algorithm for the Capacitated Vehicle Routing. Electronic Notes in Discrete Mathematics,2004,18:181-186
[34]John E. Bella, Patrick R. Mcmullen. Ant colony optimization techques for thevehicle routing problem. Advanced Engineering Informatics,2004,18(1):41-48
[35]Issmail Ellabib, Paul Calamai a, Otman Basir. Exchange strategies for multiple Ant Colony System. Information Sciences,2007,177:1248-1264
[36]L. M. Gambardella, E. Taillard, and G. Agazzi. MACS-VRPTW:a multiple ant colony System for vehicle routing problems with time windows[A]. D. Corne et. al. Editors. New ideas in optimization[C]. London, U. K.:McGraw-Hill,1999,63-76
[37]Alberto V. Donati, Roberto Montemanni, Norman Casagrande, Andrea E. Rizzoli, Luca M. Gambardella. Time dependent vehicle routing problem with a multi ant colony system. European Journal of Operational Research,2008,185:1174-1191
[38]A. V. Donati, R. Montemanni, N. Casagrande, A. E. Rizzoll, and L. M. Gambardella. Time dependent vehicle routing problem with a multi ant colony system. Technical Report TR-17-03, IDSIA, Galleria2, Manno,6928, Switzerland,2003
[39]R. Montemanni, L. M. Gambardella, A. E. zzoll, and A. V. Donati. A new Algorithm for a dynamic vehicle routing problem based on ant colonys ystem Technical Report TR-23-02, IDSIA, Galleria2, Manno,6928, Switzerland,2004
[40]Paola Pellegrini, Daniela Favaretto, Elena Moretti. Multiple Ant Colony Optimization for a Rich Vehicle Routing Problem:A Case Study. Lecture Notes in Computer Science,2007,4693:627-634
[41]Yuvraj Gajpal, Prakash Abad. An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup Computers&Operations Research,2009,36:3215-3223
[42]Yuvraj Gajpal, P. L. Abad. Multi-ant colony system (MACS) for a vehicle routing problem with backhauls. European Journal of Operational Research,2009, 196:102-117
[43]Boris Bontoux, Dominique Feillet. Ant colony optimization for the traveling purchaser problem. Computers& Operations Research,2008,35:628-637
[44]C. A. Silva, J. M. C. Sousa, T. A. Runkler, J. M. G. Sa da Costa. Distributed supply chain management using ant colony optimization. European Journal of Operational Research,2009,199:349-358
[45]Aybars Ugur, Dogan Aydin. An interactive simulation and analysis software for solving TSP using Ant Colony Optimization algorithms. Advances in Engineering Software,2009,40:341-349
[46]Guenther Fuellerer, Karl F. Doerner, Richard F. Hartl, Manuel Iori. Ant colony optimization for the two-dimensional loading vehicle routing problem. Computers& Operations Research,2009,36:655-673
[47]Xiaoxia Zhang, Lixin Tang. A new hybrid ant colony optimization algorithm for the vehicle routing problem Pattern Recognition Letters,2009,30:848-855.
[48]Yu Bin, Yang Zhong-Zhen, Yao Baozhen. An improved ant colony optimization for vehicle routing problem. European Journal of Operational Research, 2009,196:171-176
[49]侯立文,谭家美,赵元.求解带时间窗的客户需求可分条件下的车辆路径问题.中国管理科学,2007,15(6)：46-51
[50]刘云忠,宣慧玉.动态蚁群算法在带时间窗车辆路径问题中的应用.中国工程科学,2005,7(12)：35-40
[51]张涛,王珊珊,田文馨.车辆可重复利用VRPTW问题的模型和改进蚁群算法.系统工程,2007,25(4)：20-26
[52]陈美军,张志胜,史金飞.基于自适应多态蚁群算法的多约束车辆路径问题. 东南大学学报(自然科学版),2008,38(1)：37-42
[53]王素欣,高利,崔小光,陈雪梅.多集散点车辆路径问题及其蚁群算法研究系统工程理论与实践,2008,2：143-147
[54]陆琳,谭清美.基于自感应蚁群算法的VRPSDP问题研究.中国管理科学,2007,15(2)：97-103
[55]刘志硕,申金升,关伟.车辆路径问题的混合蚁群算法设计与实现.管理科学学报,2007,10(3)：15-22
[56]屈稳太,丁伟.一种改进的蚁群算法及其在TSP中的应用.系统工程理论与实践,2006,5：93-98
[57]Kennedy. J., Eberhart R. C. Particle Swarm Optimization[A]. In:Proc. IEEE International Confereneeon NeuralNetworks, IV. Piscataway, NJ:IEEE Serviee Center,1995,1942-1948
[58]李宁,付国江,库少平,陈明俊.粒子群优化算法的发展与展望.武汉理工大学学报,2005,27(2)：26-29
[59]The Jin Ai, Voratas Kachitvichyanukul. A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Computers& Operations Research,2009,36:1693-1702
[60]The Jin Ai, Voratas Kachitvichyanukul. Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Computers& Industrial Engineering,2009,56:380-387
[61]Chen AL, Yang GK, Wu ZM. Hy brid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. Journal of Zhejiang University Science A 2006,7(4):607-14
[62]李宁,邹彤,孙德宝.带时间窗车辆路径问题的粒子群算法.系统工程理论与实践,2004,24(4)：130-135.
[63]肖健梅,黄有方,李军军,王锡淮.基于离散微粒群优化的物流配送车辆路径问题.系统工程,2005,23(4)：97-100.
[64]陈利.基士混合粒子群算法的物流配送车辆路径问题研究：[硕士学位论文].长沙：中南大学,2007
[65]丰伟,李雪芹.基于粒子群算法的多目标车辆调度模型求解闭.系统工程,2007,25(4,)：15-19
[66]王芳,丁海利,高成修.改进的粒子群优化算法在随机需求车辆路径问题中的应用.武汉大学学报(理学版),2007,53(1)：41-44
[67]徐杰,黄德先.基于混合粒子群算法的多目标车辆路径研究.计算机集成制造系统,2007,13(3)：573-579
[68]P. Tian, J. Ma, and D. M. Zhang. Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property:an investigation of generation mechanism. European Journal of Operational Research, 1999,118(1):81-94
[69]Li, H., A. Lim, J. Huang. Local search with annealing-like restarts to solve the VRPTW. European Journal of Operational Research,2003,150(1):115-127
[70]Bent R., P. Van Henteliryck. A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science,2004,38(4):515-530
[71]Czech, Z. P. Czarnas. Parallel simulated annealing for the vehicle routing problem with time windows. In:Proc.10th European Workshop Parallel Distributed Network-Based Processing, Canary Islands, Spain:2002,376-383
[72]R. Tavakkoli-Moghaddam, N. Safaei, Y. Gholipour. A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length. Applied Mathematics and Computation,2006,176(2):445-454
[73]谢秉磊,李良,郭耀煌.求解配送＼收集旅行商问题的模拟退火算法.系统工程理论方法应用,2002,11(3)：240-243
[74]郎茂祥.装卸混合车辆路径问题的模拟退火算法研究.系统工程学报,2005,20(5)：485-491
[75]胡大伟,朱志强,胡勇.车辆路径问题的模拟退火算法.中国公路学报,2006,19(4)：123-126
[76]邓爱民,周彦霆,毛超,任红强.集配货一体化VRP问题的具记忆功能的模拟退火算法研究.湖南大学学报(社会科学版),2008,22(3)：55-58
[77]杨宇栋,朗茂祥,胡思继.有时间窗车辆路径问题的模型及其改进模拟退火算法研究.管理工程学报,2006,20(3)：104-107
[78]D. Whitley, et al. Scheduling problems and traveling salesman:The genetic edge recombination operator. In:Proceedings of the 3rd International Conference on Genetic Algorithms. Morgan Kaufinann.1989,133-140
[79]A. Van Breedam. An analysis of the effect of local improvement operators in genetic algorithms and simulated annealing for the vehicle routing problem. RUCA working Paper 96/14, University of Antwerp, Belgium,1996
[80]Mitsuo Gena, Admi Syarifb. Hybrid genetic algorithm for multi-time period production/distribution planning. Computers& Industrial Engineering,2005, (48):799-809
[81]J.-Y Potvin and S. Bengio. The vehicle routing problem with time windows Part Ⅱ:Genetic search. INFORMS Journal on Computing,1996, (8):165-172
[82]L. J. Schmitt. 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
[83]Gehring, H. and J. Homberger. Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows. Journal of Heuristics,2002, (8):251-276
[84]Berger, J., M. Barkaoui, O. Braysy. A route-directed hybrid genetic approach for the vehicle routing problem with time windows. Information Systems Operational Research,2003, (41):179-194
[85]Jung, S., B. R. Moon. A hybrid genetic algorlthm for the vehicle routing problem with time windows. In:Proceding Genetic Evolutionary ComPuting Conference. San Francisco:Morgan Kaufmann Publishers,2002,1309-1316
[86]Bouthillier, G. Craiule. A cooperative parallel metaheuristic for vehicle routing with time windows. Computer & Operation Researeh,2005,32(7): 1685-1708
[87]贺国先,刘凯.优化物流中心配送方案的遗传算法.系统工程理论与实践,2003,(4)：76-81
[88]Glover F. Future Paths for Integer Programming and Links to Artificial Intelligence. Computers and Operations Research,1986, (13):533-549
[89]J. A. G. Willard. Vehicle routing using r-optimaltabu seareh:[M. Sc. dissertation]. London:The Imperial College,1989
[90]V. M. Pureza and P. M. Franca. Vehicle routing problems via tabu seareh metaheuristic. Technical Report CRT-347, Centre for Research on Transportatlon, Montreal, Canada1,1991
[91]Osman, I., Wassan, N., A reactive tabu search metaheuristic for the vehicle routing problem with back-hauls. Journal of Scheduling,2002,5(4):263-285
[92]M. Gendreau, A. Hertz, and G. Laporte. A tabu search heuristic for the vehicle routing problem. Management Science,1994,40:1276-1290
[93]Brandao, J., Eglese, R. A deterministic tabu search algorithm for the capacitated arc routing problem. Computers & Operations Research,2008,35
[94]刘兴,贺国光.车辆路径问题的禁忌搜索算法研究.计算机工程与应用,2007,43(24)：179-181
[95]尹传忠.铁路行包物流配送系统优化若干问题研究：[博士学位论文].成都：西南交通大学,2006
[96]J. Xu and J. P Kelly. A network flow based tabu search heuristic for the vehicle routing problem. Transportation Science,1996,30:379-393
[97]Y. Rochat and E. D. Taillard Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics,1995,1:147-167
[98]P. Toth and D. Vigo. The granular tabu search (and its application to the vehicle routing problem). Technical Report OR19819, DEIS, Universita di Bologna, Italy,1998
[99]Jose Brandao. A new tabu search algnrithm for the vehicle routing problem with backhauls. European Journal of Operational Researeh,2006,173(2):540-555
[100]Lau, H. C.,M. Sim, K. M. Teo. Vehicle routing Problem with time windows and a limited number of vehicles. European Journal of Operational Research,2003, 148(3):559-568
[101]Cordeau, J. F., G. LaPorte, A. Mereier. A unified Tabu Search Heuristic for Vehiele Routing Problems with Time Windows. Journal of the Operational Research Society,2001,52:928-936
[102]符卓.开放式车辆路径问题及其应用研究：[博士学位论文].长沙：中南大学,2004
[103]R. S. Barr, B. L. Golden, J. P Kelly, et al. Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics,1995,1: 9-32
[104]B. L. Golden, E. A. Wasil, J. P. Kelly, et al. Metaheuristics in vehicle routing. In:T. G. Crainic and G. Laporte, eds. Fleet Management and Logistics, Kluwer, Boston, MA,1998.33-56
[105]Garcia B. L., J. Y. Potvin, J. M. Rousseau. A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints. Computers& Operations Researeh,1994,1:1025-1033
[106]Homberger. Jorg, GeMng, Hermann. ATwo-phase hybrid metaheuristic for the vehicle routing problem with time windows. European Journal of Operational Research,2005,162(1):220-38
[107]王明春,高成修,曾永廷VRPTW的扰动恢复及其TABU SEARCH算法数学杂志,2006,26(2)：231-236
[108]郎茂祥,胡思继.：车辆路径问题的禁忌搜索算法研究.管理工程学报,2004,18(1)：81-84
[109]J.-F. Cote, J.-Y. Potvin, A tabu search heuristic for the vehicle routing problem with private fleet and common carrier. European Journal of Operational Research,2008, doi:10.1016/j. ejor.2008.09.009
[110]尹传忠,卜雷,蒲云,赵宜.带回送和时间窗的车辆路径问题的模型和算法.西南交通大学学报，2006,41(3)：290-295
[111]蓝伯雄,张跃.求解带时间窗的装-卸载问题的概率式禁忌搜索算法.中国管理科学,2004,24(3)：66-72
[112]Duhamal, C., Potvin, J.-Y.,&Rousseau, J.-M.. A tabu search heuristic for the vehicle routing problem with backhauls and time windows. Transportation Science, 1997,31(1):49-59
[113]Nanry, W. P.,&Barnes, J. W.. Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research Part B,2000,34(2): 107-121
[114]Curri, R. H.,&Salhi, S.. A tabu search heuristic for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows. Journal of Mathematical Modeling and Algorithms,2004,3(3):225-243
[115]C. K. Y. Lin. A cooperative strategy for a vehicle routing problem with pickup and delivery time windows. Computers& Industrial Engineering(2008), doi: 10.1016/j. cie.2008.03.001
[116]Dumas, Y., Desrosiers, J.,& Soumis, F.. The pickup and delivery problem with time windows. European Journal of Operational Research,1991,54(1):7-22
[117]Bent, R.,&VanHentenryck, P.. A two-stage hybrid algorithm for pick-up and delivery vehicle routing problem with time windows. Computers& Operations Research,2006,33(4):875-893
[118]Kohl,& Madsen, O. B. G. An optimization algorithe the vehicle routing problem with time windows based on Lagrangian relaxation. Management Science, 1997,45(3):395-406
[119]Lu, Q.,& Dessouky, M. M.. A new insertion-based construction heuristic for solving pickup and delivery problem with time windows. European Journal of Operational Research,2006,175(2):672-687
[120]Mitrovic-Minic, S.,& Laporte, G.. Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Research Part B, 2004,38(7):635-655
[121]Van der Bruggen, L. J. J., Lenstra, J. K.,&Schuur, P.C.. Variable-depth search for the single-vehicle pickup and delivery problem with time windows. Transportation Science,1993,27(3):298-311
[122]FRED GLOVER, JAMES P. KELLY and MANUEL LAGUNA. GENETIC ALGORITHMS AND TABU SEARCH:HYBRIDS FOR OPTIMIZATION. Computers Ops Res,1995,22(1):111-134
[123]Doris Saez, Cristian E. Cortes, Alfredo Nunez. Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering. Computers & Operations Research,2008,35: 3412-3438
[124]郎茂祥,胡思继.用混合遗传算法求解物流配送路径优化问题的研究.中国管理科学,2002,10(5)：51-56
[125]王庆泉,武和雷,方梦飞.基于遗传模拟退火算法的钢管订购和运输优化问题求解.南昌大学学报(工学版),2007,29(1)：94-98
[126]魏明,蔡延光.一种基于混沌邻域搜索的自适应遗传算法.计算机应用研究,2009,26(2)：464-465
[127]邱晗光,张旭梅,基于改进粒子群算法的开放式定位-运输路线问题研究.中国机械工程,2006,17(22)：2359-2361
[128]QingZhu, Limin Qian, Yingchun Li, Shanjun Zhu. An Improved Particle Swarm Optimization Algorithm for Vehicle Routing Problem with Time Windows. In:Evolutionary Computation,2006, IEEE Congresson.2006,1386-1390
[129]Chen Ai-ling, Yang Gen-ke and Wu Zhi-ming. Hybrid discrcte Particle swarm optimization algorithm for capacitated vehicle routing problem. Journal ofZhejiang University-Science A,2006,7(3):607-614
[130]李相勇.车辆路径问题模型及算法研究：[博士学位论文].上海：上海交通大学,2007
[131]陆琳,谭清美.一类随机需求VRP的混合粒子群算法研究.系统工程与电子技术,2006,28(2)：244-247
[132]丁秋雷,胡祥培,李永先.求解有时间窗的车辆路径问题的混合蚁群算法.系统工程理论与实践,2007,10：98-104
[133]张建勇,李军.具有模糊旅行时间的VRP的一种混合遗传算法.管理工程学报,2006,20(4)：13-17
[134]张建勇,李军,郭耀煌.具有模糊预约时间的VRP混合遗传算法.管理科学学报,2005,8(3)：64-71
[135]林清国.基于混合遗传算法的有时间窗车辆路径问题研究：[硕士学位论文].济南：山东大学,2007
[136]李卓君.混合蚁群算法求解物流配送路径问题.武汉理工大学学报(交通科学与工程版),2006,3(4)：306-309
[137]高尚.解旅行商问题的混沌蚁群算法.系统工程理论与实践,2005,9：100-105
[138]孙艳丰.基于遗传算法和禁忌搜索算法的混合策略及其应用.北京工业大学学报,2006,32(3)：258-262
[139]曹二宝.物流配送车辆路径问题模型及算法研究：[博士学位论文].长沙：湖南大学,2008
[140]M. Gendreau, G. Laprote and J. Y Potvin. Metaheuristics for the capacitated VRP In:Paolo Toth and Daniele Vigo, eds. The Vehicle Routing Problem. Philadelphia:Society for Industrial and Applied Mathematics,2002.129-149
[141]J-F Cordeau, M. Gendreau, G. Laporte, J-Y Potvin and F. Semet. A guide to vehicle routing heuristics. Journal of the Operational Research Society,2002,53: 512-522
[142]J. K. Lenstra and K. Rinnooy. Complexity of vehicle routing and scheduling problem. Networks,1981,11:221-227
[143]M. W P Savelsbergh. Local search in routing problems with time windows. Operations Research,1985,33(4):285-305
[144]M. M. Solomon. On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints. Networks, 1986,(16):161-174
[145]M. M. Syslo, N. Deo and J. S. Kowalik. Discrete Optimization Algorithms with Pascal Programs. New Jersey:Prentice-Hall, Inc.,1983
[146]L Schrage. Formulation and structure of more complex/realistic routing and scheduling problems. Networks,1981,11:229-232
[147]D Sariklis and S Powell. A heuristic method for the open vehicle routing problem. Journal of the Operational Research Society,2000,51:564-573
[148]符卓.带装载能力约束的开放式车辆路径问题及其禁忌搜索算法研究.系统工程理论与实践,2004,(3)：123-128
[149]符卓，聂靖.开放式车辆路径问题及其若干研究进展.见：中国运筹学会·第八届学术交流会论文集,深圳：2006：395-400
[150]Z Fu, R Eglese and LYO Li. A new tabu search heuristic for the open vehicle routing problem. Journal of the Operational Research Society,2005,56(3): 267-274
[151]钟石泉,杜纲.基于核心路径禁忌算法的开放式车辆路径问题研究计算机集成制造系统,2007,13(4)：827-832
[152]Feiyue Li, Bruce Golden, Edward Wasil. The open vehicle routing problem: Algorithms, large-scale test problems, and computational results. Computers & Operations Research,2007,34:2918-2930
[153]Krzysztof Fleszar, Ibrahim H. Osman, Khalil S. Hindi. A variable neighbourhood search algorithm for the open vehicle routing problem. European Journal of Operational Research,2009,195:803-809
[154]Tarantilis C, Ioannou G, Kiranoudis C, Prastacos G. A threshold accepting approach to the open vehicle routing problem. RAIRO Operations Research,2004,38: 345-560
[155]Tarantilis C, Ioannou G, Kiranoudis C, Prastacos G. Solving the open vehicle routing problem via a single parameter metaheuristic algorithm. Journal of the Operational Research Society,2005,56:588-596
[156]C. D. Tarantilis, D. Diakoulaki, and C. T. Kiranoudis. Combination of geographical information system and efficient routing algorithms for real life distribution operations. European Journal of Operational Research,2004,152(2): 437-453
[157]C. D. Tarantilis and C. T. Kiranoudis. Boneroute. An adaptive memory-based method for effective fleet management. Annals of Operations Research,2002,115(1):227-241
[158]C. D. Tarantilis, G. Ioannou, C. T. Kiranoudis, and G. P. Prastacos. A threshold accepting approaeh to the open vehicle routing problem. Rairo-Operations Research,2004,38(4):345-360
[159]C. D. Tarantilis, G. Ioannou, CT. Kiranoudis, and G. P. Prastaeos. Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm. The Journal of the Operational Research Society,2005,56(5):588-596
[160]J. Brandao. A tabu search algorithm for the open vehicle routing problem. European Journal of Operational Research,2004,157(3):552-564
[161]聂靖..带装载能力限制的开放式车辆路径问题及其遗传算法研究：[硕士学位论文].长沙：中南大学,2007
[162]Li LYO and Fu Z. The school bus routing problem:a case study. J Opl Res Soc,2002,53:552-558
[163]P. P. Repoussis, C. D Tarantilis and G Ioannou. The open vehicle routing problem with time windows. Journal of the Operational Research Society,2006,1-13
[164]Koskosidis Y. A., Powell W. B. and Solomon M. M. An optimization-based heuristic for vehicle routing and scheduling with soft time windows constraints. Transport Sci,1992,26:69-85
[165]Balakrishnan N. Simple heuristic for the vehicle routing problem with soft time windows. J Opl Res Soc,1993,44:279-287
[166]Taillard E., Badeau P., Gendreau M, Guertin Fand Potvin JY. A tabu search heuristic for the vehicle routing problem with soft time windows. Transport Sci,1997, 31:170-186
[167]Fagerholt K. Ship scheduling with soft time windows:An optimisation based approach. Eur J Opl Res 2001,131:559-571
[168]Chiang W-C and Russell R. A. A metaheuristic for the vehicle routing problem with soft time windows. J Opl Res Soc.,2004,55:1298-1310
[169]Herminia I. Calvete, Carmen Gale, Maria-Jose Oliveros, Belen Sanchez Valverde. A goal programming approach to vehicle routing problems with soft time windows. European Journal of Operational Research,2007, (177):1720-1733
[170]Hashimoto, H., Ibaraki, T., Imahori, S., Yagiura, M., The vehicle routing problem with flexible time windows and traveling times. Discrete Applied Mathematics,2006, (154):2271-2290
[171]宾松,符卓.求解带软时间窗的车辆路径问题的改进遗传算法.系统工程,2003,21(6)：12-15
[172]蔡延光,师凯.带软时间窗的联盟运输调度问题研究.计算机集成制造系统,2006,12(11)：1903-1908
[173]肖雁,符卓,李育安.带软时间窗的车辆路径问题及其应用前景探讨.见：中国运筹学会第六届学术交流会论文集.香港Global-Link出版社(香港),2000.634-638
[174]袁庆达,杜文,周再玲.带软时间窗的混合车队车辆路线问题的模型和算法研究.西南交通大学学报,2001,36(4)：401-406
[175]T. Sexton&Y. Choi. Pickup and Delivery of Partial Loads with Soft Time Windows.Am. J. Math. Mgmt. Sci.,1986,6:369-398
[176]Y. Dumas, F. Soumis&J. Desrosiers. Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience costs. Transp. Sci.,1990,24:145-152
[177]J. Deserosiers, Y Dumas, M. M. Solomon& F. Soumis. Time Constrained Routing and Scheduling. In:M. O. Ball, T. L. Magnanti, C. L. Monma& G. L. Nemhauser, eds. Network Routing Handbooks in Operations Research and Management Science, Amsterdam:Elsevier.1995-8
[178]刘诚,陈治亚,封全喜.带软时间窗物流配送车辆路径问题的并行遗传算法.系统工程,2005,10
[179]Mak, K. L. Guo, Z. G. A genetic algorithm for vehicle routing problems with stochastic demand and soft time windows. In:Systems and Information Engineering Design Symposium 2004. Proceedings of the 2004 IEEE,2004,4: 183-190
[180]Z Fu, R Eglese and LYo Li. A unified tabu search heuristic for vehicle routing problem with soft time windows. Journal of the Operational Research Society, 2008, (59):663-673
[181]H. I. Calvete, C. Gale,M. J. Oliveros, B. Sanchez-Valverde. A goal programming approach to vehicle routing problems with soft time windows. European Journal of Operational Research,2007, (177):1720-1733
[182]H. Min, A multiobjective vehicle routing problem with soft time windows: The case of a public library distribution system, Socio-Economic Planning Science, 1991,25(3):179-188
[183]H. I. Calvete, C. Gale, M. J. Oliveros, B. Sanchez-Valverde. Vehicle routing problems with soft time windows:An optimization based approach. In:M. C. Lopez de Silanes et al. (Eds.), Proceedings of VIII Journees Zaragoza-Pau de Mathematiques Appliquees et Statistiques, vol.31. Monografias del Seminario Matematico Garcia Galdeano:2004, (31):295-304
[184]Ioannou, G, Kritikos, M., Prastacos, G. A problem generator-solver heuristic for vehicle routing with soft time windows. Omega,2003, (31):41-53
[185]郎茂祥.物流配送车辆调度问题的模型与算法研究：[博士学位论文].北京：北京交通大学,2002
[186]肖天国,符卓.求解带软时间窗的开放式车辆路径问题的遗传算法.铁道科学与工程学报,2008,5(2)：79-83
[187]钟石泉,杜纲,贺国光.有时间窗的开放式车辆路径问题及其遗传算法.计算机工程与应用,2006(34)：201-204
[188]M. Gendreau, A. Hertz, and G. Laporte. A tabu search heuristic for the vehicle routing problem. Management Science,1994,40:1276-1290
[189]C. Duhamel, J. Y Potvin and J. M. Rousseau. A tabu search heuristic for the vehicle routing problem with backhauls and time windows. Transportation Science, 1997,31:49-59
[190]王为民,邮政通信组织管理.北京：北京邮电大学出版社,2008.33
[191]胡向东,张海盛,王平,聂能.面向电子商务的邮政运输路由规划技术.微电子学与计算机,2001,(1)：42-54
[192]叶耀华,王律,杨文涛等.我国邮政网络的优化设计方法.管理工程学报,2004,18(2)：39-43
[193]宋青,李晓磊,郝风柱,张承进.区县内邮政运输网络的建模及优化.系统仿真学报,2008,20(6)：1611-1614
[194]Deif I., Bodin L.. Extension of the Clarke and Wright algorithm for solving the vehicle routing problem with backhauling. Proceedings of the Babson Conference on Software Uses in Transportation and Logistics Management,1984: 75-96
[195]Goetschalckx M., JacobspBlecha C. The vehicle routing problem with backhauls. European Journal of Operational Research.1989,42:39-51
[196]Toth P., Vigo D.. A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls. European Journal of Operational Research, 1999,113(3):528-544
[197]Tillman F A. The multiple terminal delivery problem with probabilistic demands. Transportation Science,1969,3(3):192-204
[198]Wren A H A. Computer scheduling of vehicles from one or more depots to a number of delivery points. Operational Research Quarterly,1972,23(3):333-344.
[199]Raft O M. Modular algorithm for an extended vehicle scheduling problem. European Journal of Operational Research,1982,11(1):67-76
[200]Ball M O, Golden B L, Assad A A, Bodin L D. Planning for truck fleet size in the presence of a common-carrier option. Decision Science,1983,14(1):103-120
[201]杨元峰,崔志明,陈建明.有时间窗约束的多车场车辆路径问题的改进遗传算法.苏州大学学报,2006,26(2)：20-23
[202]钟石泉,贺国光.多车场有时间窗的多车型车辆调度及其禁忌算法研究.运筹学学报,2005,9(4)：67-73
[203]Renaud J, Laporte G, Boctor F F. A tabu search heuristic for the multi-depot vehicle routing problem. Computers and Operations Research,1996,23(3):229-235
[204]Pisinger D, Ropke S. A general heuristic for vehicle routing problems. Computers and Operations Research,2007,34(8):2403-2435
[205]Tillman, Hering. A study of a look-ahead procedure for sovling the multiple terminal delivery problem. Tranp Res,1971, (5):225-229
[206]Chao I M, Golden B L, Wasil E. A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions. American Journal of Mathematical and Management Sciences,1983,13(13):371-406
[207]陈美军,张志胜,史金飞.多约束下多车场车辆路径问题的蚁群算法研究.中国机械工程,2008,19(1)：1939-1944
[208]陈美军,张志胜,陈春咏,史金飞.多车场车辆路径问题的新型聚类蚁群算法.中国制造业信息化,2008,37(11)：1-5
[209]王素欣,高利,崔小光,曹宏美.多需求点车辆调度模型及其群体智能混合求解.自动化学报,2008,34(1)：102-104
[210]李玲,谷寒雨,陈坚.复杂PDPTW问题的插入启发式算法.计算机工程,2003,29(16)：65-67
[211]Ribeiro C., Soumis F. A column generation approach to the multiple depot vehicle scheduling problem. Operations Research,1994, (42):41-52
[212]BiancoL, MingozziA, RicciardelliS. A set partitioning approach to the multiple depot vehicle scheduling problem. Optimization Methods and Software, 1994, (3):163-194
[213]Suk-Tae Bae, Heung Suk Hwang, Gyu-Sung Cho, Meng-Jong Goan. Integrated GA-VRP solver for multi-depot system, Computers& Industrial Engineering,2007, (53):233-240
[214]A. Tatarakis, I. Minis. Stochastic single vehicle routing with a predened customer sequence and multiple depot returns. European Journal of Operational Research,2008, doi:10.1016/j. ejor.2008.07.006
[215]邹彤.多车场车辆路径问题的遗传算法.计算机工程与应用,2004,40(4)：82-85
[216]G. Nagy, S. Salhi. Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. European Journal of Operational Research,2005, (162):126-141
[217]李延晖,刘向.沿途补货的多车场开放式车辆路径问题及蚁群算法.计算机集成制造系统,2008，14(3)：557-562
[218]Dondo, R.,& Cerda, J. A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. European Journal of Operational Research,2007,176(3):1478-1507
[219]Desaulniers G, Lavigne J, Soumis F. Multi-depot vehicle scheduling problems scheduling problems with time windows and waiting costs. European Journal of Operations Research,1998, (111):479-494
[220]Ahmed Hadjar, Francois Soumis. Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows. Computers& Operations Research,2009,36:2160-2172
[221]Rodolfo G. Dondo, Jaime Cerda. A hybrid local improvement algorithm for large-scale multi-depot vehicle routing problems with time windows. Computers and Chemical Engineering,2009, (33):513-530
[222]钟石泉,杜纲,贺国光.有顾客时间窗和发货量变化的紧急车辆调度研究.管理工程学报,2007,21(4)：114-118
[223]Barallona F, Jensen D. Plant Location with Minimum Inventory. Mathematical Programming,1998,83(1):101-111
[224]D. Vanecek, D. Kalab. Logisties in Agricultural Produetion. AGRIC. ECON,-CZECH.2003,49(9):439-443
[225]Karol Wajszczuk. Logistics costs analysis as anassisting tool to achieve competitive Advantage for agricultural enterprises. In:European Association of Agricultural Eeonomists, Poznan:2005
[226]Takeo SHINA. Logistics of Fruit and Vegetables. Farming Japan,2003, 37(5):26-36
[227]Patrizia Busato, Remigio Berruto. Fruit Game:Simulation Model to Study the Supply Chain Logistics for Fresh Produce. In:Computers in Agriculture and Natrural Resources 4th World Congress Conference. Florida:ASABE,200
[228]Ghare P. N., Schrader G. F. A model for exponentially decaying inventories. Journal of Industrial Engineering,1963, (15):235
[229]Dave U, Patel LK (TSI) Policy Inventory Model For deteriorating items with time proportional demand. J Opt. Res. Soc.,1981, (32):137-142
[230]Roychowdhury M Chaudhuri K S. An order-level inventory model for deteriorating items with finite rate of replenishment. Op. search,1983, (20):99-106
[231]Petrovic Dobrila. Simulation of Supply chain behavior and performance in an uncertain environment. In:Production Economics,2001, (71):429-438
[232]任伟.区域农产品物流配送问题优化研究：[硕士学位论文].曲阜：曲阜师范大学,2008
[233]钟晓燕.生鲜农产品配送系统优化与动态仿真：[硕士学位论文].福州：福建农林大学,2008
[234]刘婵媛.鲜活农产品配送的模式及路线优化研究：[硕士学位论文].武汉：华中科技大学,2006
[235]邱祝强.基于冷藏链的生鲜农产品物流网络优化及其安全风险评价研究：[博士学位论文].长沙：中南大学,2007
[236]张晓绩,戴冠,徐乃平.遗传算法种群多样性的分析研究.控制理论与应用,1998,15(1)：17-22
[237]C. Oguz, B. Cheung. C. Oguz and B. Cheung. A Genetic Algorithm for Flow-shop Scheduling problems with Multiprocessor Tasks. Proceeding of 8th International Workshop in Project Management and Scheduling Spain,2002
[2]Paolo Toth and Daniele Vigo. An overview of vehicle routing problems. In: Paolo Toth and Daniele Vigo, eds. The Vehicle Routing Problem. Philadelphia: Society for Industrial and Applied Mathematics,2002.1-26
[3]吴斌.车辆路径问题的粒子群算法研究与应用：[博士学位论文].浙江：浙江工业大学,2007
[4]国家发展改革委,国家统计局,中国物流与采购联合会.2007年全国物流运行情况通报,http://www. chinawuliu. com. cn/cflp/newss/content1/200803/812 26979. html
[5]G. B. Dantzig and J. H. Ramser. The truck dispatching problem. Management Science,1959,6:80
[6]G. Clarke and J. V Wright. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research,1964,12:568-581
[7]L. Bodin, B. Golden, A. Assad and M. Ball. Routing and Scheduling of Vehicles and Crews:The State of Art. Computers&Operations Research,1983, No.10: 63-211
[8]M. O. Ball, T. L. Magnanti, C. L. Monma et al, eds. Handbooks in Operations Research and Management Science, Volume 8:Network Routing. Amsterdam: Elsevier Science,1995
[9]Paolo Toth and Daniele Vigo (eds). The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, Philadelphia, USA,2002
[10]李军,郭耀煌.物流配送车辆优化调度理论与方法.北京：中国物资出版社,2001
[11]郎茂祥.配送车辆优化调度模型与算法.北京：电子工业出版社,2009
[12]张潜著.物流配送路径优化调度建模与实务.北京：中国物资出版社,2006
[13]M. Dror and P. Trudeau. Split delivery routing. Naval Research Logistics, 1990,37:383-402
[14]谢秉磊.随机车辆路径问题研究：[博士学位论文].成都：西南交通大学,2003
[15]Laporte G, Louveaux F. V, Mercure H., The vehicle routing problem with stochastic travel times. Transportation Science,1992,26,161-170
[16]Bent Russell W. Van Hentenryck. Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers. Operations Research,2004,52 (6):977-987
[17]Teodorovie. D. The fuzzy set approach to the vehicle routing problem when demand at nodes uncertain. Fuzzy sets and system,1996,82:307-317
[18]陈宝文,宋申民,陈兴林.模糊需求车辆路径问题及其启发式蚁群算法.计算机应用,2006,26(11)：2639-2642
[19]Johan Oppen, Arne. Arc routing in a node routing environment. Computers & Operations Research,133(4):2006,1033-1055
[20]Psaraftis H. N.. Dynamic Vehicle Routing:status and prospects. Annals of Operations Research,1995,61:143-164
[21]Ali Haghani and Soojung Jung. A dynamic vehicle routing problem with time-dependent travel times. Computers& Operations Research,2005,32(11): 2959-2986
[22]Eiichi Taniguchi and Hiroshi Shimamoto. Intelligent transportation system based dynamic vehicle routing and scheduling with variable travel times. Transportation Research PartC:Emerging Technologies,2004,12(3):235-250
[23]Hanshar, Franklin, Ombuki-Berman, Beatrice. Dynamic vehicle routing using genetic algorithms. Applied Intelligence,2007,27(1):89-99
[24]R. Montemanni, L. M. Gambardella, A. E. Rizzoli. Ant Colony System for a Dynamic Vehicle Routing Problem. Journal of Combinatorial Optimization,2005, 10(4):327-343
[25]Benoit Crevier, Jean-Franeois Cordeau and Gilbert LaPorte. The multi-depot vehicle routing Problem with inter-depot routes. European Journal of Operational Research,2007,176(2):756-773
[26]Lim, Andrew, Fan Wang. Multi-Depot Vehicle Routing Problem:A One-Stage Approach. IEEE Transactions on Automation Science& Engineering,2005, 2(4):397-402
[27]Golden B, Assad A, LevyL. The fleet size and mix vehicle routing problem. Computers and Operations Research,1984,11:49-66
[28]Eunjeong Choia, Dong-Wan Tchab. A column generation approaeh to the Heterogeneous fleet vehicle routing problem. Computers& Operations Researeh, 2007,34:2080-2095
[29]Tarantilis, Kiranoudis, Vassiliadis. A threshold acecpting metaheuristcfor the heterogeneous fixed fleet vehicle routing problem. European Journal of Operational Research,2004,152(1):148-158
[30]E. D. Taillard, L. M. Gambardella. M. Gendreau, et al. Adaptive memory programming:A unified view of metaheuristics. Research RePort IDSIA/19-98, IDSIA, Lugano, Switzerland,1998
[31]A. Colorni, M. Dorigo, V. Maniezzo. Distributed optimization by ant colonies. In:Proc of the First European Conf. of Artificial Life. Paris, France Elsevier Publishing,1991,134-142
[32]B. Bullnheimer, R. F. Hartl, and C. Strauss. Applying ant system algorithm to the vehicle routing problem[A]. In I. H. Osman S., S. Martello and C. Roucairol, editors, Meta-Heuristies:Advances and Trends in Local Search Paradigms for OPtimization [C], Kluwer Acedenics,1998.109-120
[33]Silvia Mazzeo, Irene Loiseau. An Ant Colony Algorithm for the Capacitated Vehicle Routing. Electronic Notes in Discrete Mathematics,2004,18:181-186
[34]John E. Bella, Patrick R. Mcmullen. Ant colony optimization techques for thevehicle routing problem. Advanced Engineering Informatics,2004,18(1):41-48
[35]Issmail Ellabib, Paul Calamai a, Otman Basir. Exchange strategies for multiple Ant Colony System. Information Sciences,2007,177:1248-1264
[36]L. M. Gambardella, E. Taillard, and G. Agazzi. MACS-VRPTW:a multiple ant colony System for vehicle routing problems with time windows[A]. D. Corne et. al. Editors. New ideas in optimization[C]. London, U. K.:McGraw-Hill,1999,63-76
[37]Alberto V. Donati, Roberto Montemanni, Norman Casagrande, Andrea E. Rizzoli, Luca M. Gambardella. Time dependent vehicle routing problem with a multi ant colony system. European Journal of Operational Research,2008,185:1174-1191
[38]A. V. Donati, R. Montemanni, N. Casagrande, A. E. Rizzoll, and L. M. Gambardella. Time dependent vehicle routing problem with a multi ant colony system. Technical Report TR-17-03, IDSIA, Galleria2, Manno,6928, Switzerland,2003
[39]R. Montemanni, L. M. Gambardella, A. E. zzoll, and A. V. Donati. A new Algorithm for a dynamic vehicle routing problem based on ant colonys ystem Technical Report TR-23-02, IDSIA, Galleria2, Manno,6928, Switzerland,2004
[40]Paola Pellegrini, Daniela Favaretto, Elena Moretti. Multiple Ant Colony Optimization for a Rich Vehicle Routing Problem:A Case Study. Lecture Notes in Computer Science,2007,4693:627-634
[41]Yuvraj Gajpal, Prakash Abad. An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup Computers&Operations Research,2009,36:3215-3223
[42]Yuvraj Gajpal, P. L. Abad. Multi-ant colony system (MACS) for a vehicle routing problem with backhauls. European Journal of Operational Research,2009, 196:102-117
[43]Boris Bontoux, Dominique Feillet. Ant colony optimization for the traveling purchaser problem. Computers& Operations Research,2008,35:628-637
[44]C. A. Silva, J. M. C. Sousa, T. A. Runkler, J. M. G. Sa da Costa. Distributed supply chain management using ant colony optimization. European Journal of Operational Research,2009,199:349-358
[45]Aybars Ugur, Dogan Aydin. An interactive simulation and analysis software for solving TSP using Ant Colony Optimization algorithms. Advances in Engineering Software,2009,40:341-349
[46]Guenther Fuellerer, Karl F. Doerner, Richard F. Hartl, Manuel Iori. Ant colony optimization for the two-dimensional loading vehicle routing problem. Computers& Operations Research,2009,36:655-673
[47]Xiaoxia Zhang, Lixin Tang. A new hybrid ant colony optimization algorithm for the vehicle routing problem Pattern Recognition Letters,2009,30:848-855.
[48]Yu Bin, Yang Zhong-Zhen, Yao Baozhen. An improved ant colony optimization for vehicle routing problem. European Journal of Operational Research, 2009,196:171-176
[49]侯立文,谭家美,赵元.求解带时间窗的客户需求可分条件下的车辆路径问题.中国管理科学,2007,15(6)：46-51
[50]刘云忠,宣慧玉.动态蚁群算法在带时间窗车辆路径问题中的应用.中国工程科学,2005,7(12)：35-40
[51]张涛,王珊珊,田文馨.车辆可重复利用VRPTW问题的模型和改进蚁群算法.系统工程,2007,25(4)：20-26
[52]陈美军,张志胜,史金飞.基于自适应多态蚁群算法的多约束车辆路径问题. 东南大学学报(自然科学版),2008,38(1)：37-42
[53]王素欣,高利,崔小光,陈雪梅.多集散点车辆路径问题及其蚁群算法研究系统工程理论与实践,2008,2：143-147
[54]陆琳,谭清美.基于自感应蚁群算法的VRPSDP问题研究.中国管理科学,2007,15(2)：97-103
[55]刘志硕,申金升,关伟.车辆路径问题的混合蚁群算法设计与实现.管理科学学报,2007,10(3)：15-22
[56]屈稳太,丁伟.一种改进的蚁群算法及其在TSP中的应用.系统工程理论与实践,2006,5：93-98
[57]Kennedy. J., Eberhart R. C. Particle Swarm Optimization[A]. In:Proc. IEEE International Confereneeon NeuralNetworks, IV. Piscataway, NJ:IEEE Serviee Center,1995,1942-1948
[58]李宁,付国江,库少平,陈明俊.粒子群优化算法的发展与展望.武汉理工大学学报,2005,27(2)：26-29
[59]The Jin Ai, Voratas Kachitvichyanukul. A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Computers& Operations Research,2009,36:1693-1702
[60]The Jin Ai, Voratas Kachitvichyanukul. Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Computers& Industrial Engineering,2009,56:380-387
[61]Chen AL, Yang GK, Wu ZM. Hy brid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. Journal of Zhejiang University Science A 2006,7(4):607-14
[62]李宁,邹彤,孙德宝.带时间窗车辆路径问题的粒子群算法.系统工程理论与实践,2004,24(4)：130-135.
[63]肖健梅,黄有方,李军军,王锡淮.基于离散微粒群优化的物流配送车辆路径问题.系统工程,2005,23(4)：97-100.
[64]陈利.基士混合粒子群算法的物流配送车辆路径问题研究：[硕士学位论文].长沙：中南大学,2007
[65]丰伟,李雪芹.基于粒子群算法的多目标车辆调度模型求解闭.系统工程,2007,25(4,)：15-19
[66]王芳,丁海利,高成修.改进的粒子群优化算法在随机需求车辆路径问题中的应用.武汉大学学报(理学版),2007,53(1)：41-44
[67]徐杰,黄德先.基于混合粒子群算法的多目标车辆路径研究.计算机集成制造系统,2007,13(3)：573-579
[68]P. Tian, J. Ma, and D. M. Zhang. Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property:an investigation of generation mechanism. European Journal of Operational Research, 1999,118(1):81-94
[69]Li, H., A. Lim, J. Huang. Local search with annealing-like restarts to solve the VRPTW. European Journal of Operational Research,2003,150(1):115-127
[70]Bent R., P. Van Henteliryck. A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science,2004,38(4):515-530
[71]Czech, Z. P. Czarnas. Parallel simulated annealing for the vehicle routing problem with time windows. In:Proc.10th European Workshop Parallel Distributed Network-Based Processing, Canary Islands, Spain:2002,376-383
[72]R. Tavakkoli-Moghaddam, N. Safaei, Y. Gholipour. A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length. Applied Mathematics and Computation,2006,176(2):445-454
[73]谢秉磊,李良,郭耀煌.求解配送＼收集旅行商问题的模拟退火算法.系统工程理论方法应用,2002,11(3)：240-243
[74]郎茂祥.装卸混合车辆路径问题的模拟退火算法研究.系统工程学报,2005,20(5)：485-491
[75]胡大伟,朱志强,胡勇.车辆路径问题的模拟退火算法.中国公路学报,2006,19(4)：123-126
[76]邓爱民,周彦霆,毛超,任红强.集配货一体化VRP问题的具记忆功能的模拟退火算法研究.湖南大学学报(社会科学版),2008,22(3)：55-58
[77]杨宇栋,朗茂祥,胡思继.有时间窗车辆路径问题的模型及其改进模拟退火算法研究.管理工程学报,2006,20(3)：104-107
[78]D. Whitley, et al. Scheduling problems and traveling salesman:The genetic edge recombination operator. In:Proceedings of the 3rd International Conference on Genetic Algorithms. Morgan Kaufinann.1989,133-140
[79]A. Van Breedam. An analysis of the effect of local improvement operators in genetic algorithms and simulated annealing for the vehicle routing problem. RUCA working Paper 96/14, University of Antwerp, Belgium,1996
[80]Mitsuo Gena, Admi Syarifb. Hybrid genetic algorithm for multi-time period production/distribution planning. Computers& Industrial Engineering,2005, (48):799-809
[81]J.-Y Potvin and S. Bengio. The vehicle routing problem with time windows Part Ⅱ:Genetic search. INFORMS Journal on Computing,1996, (8):165-172
[82]L. J. Schmitt. 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
[83]Gehring, H. and J. Homberger. Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows. Journal of Heuristics,2002, (8):251-276
[84]Berger, J., M. Barkaoui, O. Braysy. A route-directed hybrid genetic approach for the vehicle routing problem with time windows. Information Systems Operational Research,2003, (41):179-194
[85]Jung, S., B. R. Moon. A hybrid genetic algorlthm for the vehicle routing problem with time windows. In:Proceding Genetic Evolutionary ComPuting Conference. San Francisco:Morgan Kaufmann Publishers,2002,1309-1316
[86]Bouthillier, G. Craiule. A cooperative parallel metaheuristic for vehicle routing with time windows. Computer & Operation Researeh,2005,32(7): 1685-1708
[87]贺国先,刘凯.优化物流中心配送方案的遗传算法.系统工程理论与实践,2003,(4)：76-81
[88]Glover F. Future Paths for Integer Programming and Links to Artificial Intelligence. Computers and Operations Research,1986, (13):533-549
[89]J. A. G. Willard. Vehicle routing using r-optimaltabu seareh:[M. Sc. dissertation]. London:The Imperial College,1989
[90]V. M. Pureza and P. M. Franca. Vehicle routing problems via tabu seareh metaheuristic. Technical Report CRT-347, Centre for Research on Transportatlon, Montreal, Canada1,1991
[91]Osman, I., Wassan, N., A reactive tabu search metaheuristic for the vehicle routing problem with back-hauls. Journal of Scheduling,2002,5(4):263-285
[92]M. Gendreau, A. Hertz, and G. Laporte. A tabu search heuristic for the vehicle routing problem. Management Science,1994,40:1276-1290
[93]Brandao, J., Eglese, R. A deterministic tabu search algorithm for the capacitated arc routing problem. Computers & Operations Research,2008,35
[94]刘兴,贺国光.车辆路径问题的禁忌搜索算法研究.计算机工程与应用,2007,43(24)：179-181
[95]尹传忠.铁路行包物流配送系统优化若干问题研究：[博士学位论文].成都：西南交通大学,2006
[96]J. Xu and J. P Kelly. A network flow based tabu search heuristic for the vehicle routing problem. Transportation Science,1996,30:379-393
[97]Y. Rochat and E. D. Taillard Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics,1995,1:147-167
[98]P. Toth and D. Vigo. The granular tabu search (and its application to the vehicle routing problem). Technical Report OR19819, DEIS, Universita di Bologna, Italy,1998
[99]Jose Brandao. A new tabu search algnrithm for the vehicle routing problem with backhauls. European Journal of Operational Researeh,2006,173(2):540-555
[100]Lau, H. C.,M. Sim, K. M. Teo. Vehicle routing Problem with time windows and a limited number of vehicles. European Journal of Operational Research,2003, 148(3):559-568
[101]Cordeau, J. F., G. LaPorte, A. Mereier. A unified Tabu Search Heuristic for Vehiele Routing Problems with Time Windows. Journal of the Operational Research Society,2001,52:928-936
[102]符卓.开放式车辆路径问题及其应用研究：[博士学位论文].长沙：中南大学,2004
[103]R. S. Barr, B. L. Golden, J. P Kelly, et al. Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics,1995,1: 9-32
[104]B. L. Golden, E. A. Wasil, J. P. Kelly, et al. Metaheuristics in vehicle routing. In:T. G. Crainic and G. Laporte, eds. Fleet Management and Logistics, Kluwer, Boston, MA,1998.33-56
[105]Garcia B. L., J. Y. Potvin, J. M. Rousseau. A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints. Computers& Operations Researeh,1994,1:1025-1033
[106]Homberger. Jorg, GeMng, Hermann. ATwo-phase hybrid metaheuristic for the vehicle routing problem with time windows. European Journal of Operational Research,2005,162(1):220-38
[107]王明春,高成修,曾永廷VRPTW的扰动恢复及其TABU SEARCH算法数学杂志,2006,26(2)：231-236
[108]郎茂祥,胡思继.：车辆路径问题的禁忌搜索算法研究.管理工程学报,2004,18(1)：81-84
[109]J.-F. Cote, J.-Y. Potvin, A tabu search heuristic for the vehicle routing problem with private fleet and common carrier. European Journal of Operational Research,2008, doi:10.1016/j. ejor.2008.09.009
[110]尹传忠,卜雷,蒲云,赵宜.带回送和时间窗的车辆路径问题的模型和算法.西南交通大学学报，2006,41(3)：290-295
[111]蓝伯雄,张跃.求解带时间窗的装-卸载问题的概率式禁忌搜索算法.中国管理科学,2004,24(3)：66-72
[112]Duhamal, C., Potvin, J.-Y.,&Rousseau, J.-M.. A tabu search heuristic for the vehicle routing problem with backhauls and time windows. Transportation Science, 1997,31(1):49-59
[113]Nanry, W. P.,&Barnes, J. W.. Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research Part B,2000,34(2): 107-121
[114]Curri, R. H.,&Salhi, S.. A tabu search heuristic for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows. Journal of Mathematical Modeling and Algorithms,2004,3(3):225-243
[115]C. K. Y. Lin. A cooperative strategy for a vehicle routing problem with pickup and delivery time windows. Computers& Industrial Engineering(2008), doi: 10.1016/j. cie.2008.03.001
[116]Dumas, Y., Desrosiers, J.,& Soumis, F.. The pickup and delivery problem with time windows. European Journal of Operational Research,1991,54(1):7-22
[117]Bent, R.,&VanHentenryck, P.. A two-stage hybrid algorithm for pick-up and delivery vehicle routing problem with time windows. Computers& Operations Research,2006,33(4):875-893
[118]Kohl,& Madsen, O. B. G. An optimization algorithe the vehicle routing problem with time windows based on Lagrangian relaxation. Management Science, 1997,45(3):395-406
[119]Lu, Q.,& Dessouky, M. M.. A new insertion-based construction heuristic for solving pickup and delivery problem with time windows. European Journal of Operational Research,2006,175(2):672-687
[120]Mitrovic-Minic, S.,& Laporte, G.. Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Research Part B, 2004,38(7):635-655
[121]Van der Bruggen, L. J. J., Lenstra, J. K.,&Schuur, P.C.. Variable-depth search for the single-vehicle pickup and delivery problem with time windows. Transportation Science,1993,27(3):298-311
[122]FRED GLOVER, JAMES P. KELLY and MANUEL LAGUNA. GENETIC ALGORITHMS AND TABU SEARCH:HYBRIDS FOR OPTIMIZATION. Computers Ops Res,1995,22(1):111-134
[123]Doris Saez, Cristian E. Cortes, Alfredo Nunez. Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering. Computers & Operations Research,2008,35: 3412-3438
[124]郎茂祥,胡思继.用混合遗传算法求解物流配送路径优化问题的研究.中国管理科学,2002,10(5)：51-56
[125]王庆泉,武和雷,方梦飞.基于遗传模拟退火算法的钢管订购和运输优化问题求解.南昌大学学报(工学版),2007,29(1)：94-98
[126]魏明,蔡延光.一种基于混沌邻域搜索的自适应遗传算法.计算机应用研究,2009,26(2)：464-465
[127]邱晗光,张旭梅,基于改进粒子群算法的开放式定位-运输路线问题研究.中国机械工程,2006,17(22)：2359-2361
[128]QingZhu, Limin Qian, Yingchun Li, Shanjun Zhu. An Improved Particle Swarm Optimization Algorithm for Vehicle Routing Problem with Time Windows. In:Evolutionary Computation,2006, IEEE Congresson.2006,1386-1390
[129]Chen Ai-ling, Yang Gen-ke and Wu Zhi-ming. Hybrid discrcte Particle swarm optimization algorithm for capacitated vehicle routing problem. Journal ofZhejiang University-Science A,2006,7(3):607-614
[130]李相勇.车辆路径问题模型及算法研究：[博士学位论文].上海：上海交通大学,2007
[131]陆琳,谭清美.一类随机需求VRP的混合粒子群算法研究.系统工程与电子技术,2006,28(2)：244-247
[132]丁秋雷,胡祥培,李永先.求解有时间窗的车辆路径问题的混合蚁群算法.系统工程理论与实践,2007,10：98-104
[133]张建勇,李军.具有模糊旅行时间的VRP的一种混合遗传算法.管理工程学报,2006,20(4)：13-17
[134]张建勇,李军,郭耀煌.具有模糊预约时间的VRP混合遗传算法.管理科学学报,2005,8(3)：64-71
[135]林清国.基于混合遗传算法的有时间窗车辆路径问题研究：[硕士学位论文].济南：山东大学,2007
[136]李卓君.混合蚁群算法求解物流配送路径问题.武汉理工大学学报(交通科学与工程版),2006,3(4)：306-309
[137]高尚.解旅行商问题的混沌蚁群算法.系统工程理论与实践,2005,9：100-105
[138]孙艳丰.基于遗传算法和禁忌搜索算法的混合策略及其应用.北京工业大学学报,2006,32(3)：258-262
[139]曹二宝.物流配送车辆路径问题模型及算法研究：[博士学位论文].长沙：湖南大学,2008
[140]M. Gendreau, G. Laprote and J. Y Potvin. Metaheuristics for the capacitated VRP In:Paolo Toth and Daniele Vigo, eds. The Vehicle Routing Problem. Philadelphia:Society for Industrial and Applied Mathematics,2002.129-149
[141]J-F Cordeau, M. Gendreau, G. Laporte, J-Y Potvin and F. Semet. A guide to vehicle routing heuristics. Journal of the Operational Research Society,2002,53: 512-522
[142]J. K. Lenstra and K. Rinnooy. Complexity of vehicle routing and scheduling problem. Networks,1981,11:221-227
[143]M. W P Savelsbergh. Local search in routing problems with time windows. Operations Research,1985,33(4):285-305
[144]M. M. Solomon. On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints. Networks, 1986,(16):161-174
[145]M. M. Syslo, N. Deo and J. S. Kowalik. Discrete Optimization Algorithms with Pascal Programs. New Jersey:Prentice-Hall, Inc.,1983
[146]L Schrage. Formulation and structure of more complex/realistic routing and scheduling problems. Networks,1981,11:229-232
[147]D Sariklis and S Powell. A heuristic method for the open vehicle routing problem. Journal of the Operational Research Society,2000,51:564-573
[148]符卓.带装载能力约束的开放式车辆路径问题及其禁忌搜索算法研究.系统工程理论与实践,2004,(3)：123-128
[149]符卓，聂靖.开放式车辆路径问题及其若干研究进展.见：中国运筹学会·第八届学术交流会论文集,深圳：2006：395-400
[150]Z Fu, R Eglese and LYO Li. A new tabu search heuristic for the open vehicle routing problem. Journal of the Operational Research Society,2005,56(3): 267-274
[151]钟石泉,杜纲.基于核心路径禁忌算法的开放式车辆路径问题研究计算机集成制造系统,2007,13(4)：827-832
[152]Feiyue Li, Bruce Golden, Edward Wasil. The open vehicle routing problem: Algorithms, large-scale test problems, and computational results. Computers & Operations Research,2007,34:2918-2930
[153]Krzysztof Fleszar, Ibrahim H. Osman, Khalil S. Hindi. A variable neighbourhood search algorithm for the open vehicle routing problem. European Journal of Operational Research,2009,195:803-809
[154]Tarantilis C, Ioannou G, Kiranoudis C, Prastacos G. A threshold accepting approach to the open vehicle routing problem. RAIRO Operations Research,2004,38: 345-560
[155]Tarantilis C, Ioannou G, Kiranoudis C, Prastacos G. Solving the open vehicle routing problem via a single parameter metaheuristic algorithm. Journal of the Operational Research Society,2005,56:588-596
[156]C. D. Tarantilis, D. Diakoulaki, and C. T. Kiranoudis. Combination of geographical information system and efficient routing algorithms for real life distribution operations. European Journal of Operational Research,2004,152(2): 437-453
[157]C. D. Tarantilis and C. T. Kiranoudis. Boneroute. An adaptive memory-based method for effective fleet management. Annals of Operations Research,2002,115(1):227-241
[158]C. D. Tarantilis, G. Ioannou, C. T. Kiranoudis, and G. P. Prastacos. A threshold accepting approaeh to the open vehicle routing problem. Rairo-Operations Research,2004,38(4):345-360
[159]C. D. Tarantilis, G. Ioannou, CT. Kiranoudis, and G. P. Prastaeos. Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm. The Journal of the Operational Research Society,2005,56(5):588-596
[160]J. Brandao. A tabu search algorithm for the open vehicle routing problem. European Journal of Operational Research,2004,157(3):552-564
[161]聂靖..带装载能力限制的开放式车辆路径问题及其遗传算法研究：[硕士学位论文].长沙：中南大学,2007
[162]Li LYO and Fu Z. The school bus routing problem:a case study. J Opl Res Soc,2002,53:552-558
[163]P. P. Repoussis, C. D Tarantilis and G Ioannou. The open vehicle routing problem with time windows. Journal of the Operational Research Society,2006,1-13
[164]Koskosidis Y. A., Powell W. B. and Solomon M. M. An optimization-based heuristic for vehicle routing and scheduling with soft time windows constraints. Transport Sci,1992,26:69-85
[165]Balakrishnan N. Simple heuristic for the vehicle routing problem with soft time windows. J Opl Res Soc,1993,44:279-287
[166]Taillard E., Badeau P., Gendreau M, Guertin Fand Potvin JY. A tabu search heuristic for the vehicle routing problem with soft time windows. Transport Sci,1997, 31:170-186
[167]Fagerholt K. Ship scheduling with soft time windows:An optimisation based approach. Eur J Opl Res 2001,131:559-571
[168]Chiang W-C and Russell R. A. A metaheuristic for the vehicle routing problem with soft time windows. J Opl Res Soc.,2004,55:1298-1310
[169]Herminia I. Calvete, Carmen Gale, Maria-Jose Oliveros, Belen Sanchez Valverde. A goal programming approach to vehicle routing problems with soft time windows. European Journal of Operational Research,2007, (177):1720-1733
[170]Hashimoto, H., Ibaraki, T., Imahori, S., Yagiura, M., The vehicle routing problem with flexible time windows and traveling times. Discrete Applied Mathematics,2006, (154):2271-2290
[171]宾松,符卓.求解带软时间窗的车辆路径问题的改进遗传算法.系统工程,2003,21(6)：12-15
[172]蔡延光,师凯.带软时间窗的联盟运输调度问题研究.计算机集成制造系统,2006,12(11)：1903-1908
[173]肖雁,符卓,李育安.带软时间窗的车辆路径问题及其应用前景探讨.见：中国运筹学会第六届学术交流会论文集.香港Global-Link出版社(香港),2000.634-638
[174]袁庆达,杜文,周再玲.带软时间窗的混合车队车辆路线问题的模型和算法研究.西南交通大学学报,2001,36(4)：401-406
[175]T. Sexton&Y. Choi. Pickup and Delivery of Partial Loads with Soft Time Windows.Am. J. Math. Mgmt. Sci.,1986,6:369-398
[176]Y. Dumas, F. Soumis&J. Desrosiers. Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience costs. Transp. Sci.,1990,24:145-152
[177]J. Deserosiers, Y Dumas, M. M. Solomon& F. Soumis. Time Constrained Routing and Scheduling. In:M. O. Ball, T. L. Magnanti, C. L. Monma& G. L. Nemhauser, eds. Network Routing Handbooks in Operations Research and Management Science, Amsterdam:Elsevier.1995-8
[178]刘诚,陈治亚,封全喜.带软时间窗物流配送车辆路径问题的并行遗传算法.系统工程,2005,10
[179]Mak, K. L. Guo, Z. G. A genetic algorithm for vehicle routing problems with stochastic demand and soft time windows. In:Systems and Information Engineering Design Symposium 2004. Proceedings of the 2004 IEEE,2004,4: 183-190
[180]Z Fu, R Eglese and LYo Li. A unified tabu search heuristic for vehicle routing problem with soft time windows. Journal of the Operational Research Society, 2008, (59):663-673
[181]H. I. Calvete, C. Gale,M. J. Oliveros, B. Sanchez-Valverde. A goal programming approach to vehicle routing problems with soft time windows. European Journal of Operational Research,2007, (177):1720-1733
[182]H. Min, A multiobjective vehicle routing problem with soft time windows: The case of a public library distribution system, Socio-Economic Planning Science, 1991,25(3):179-188
[183]H. I. Calvete, C. Gale, M. J. Oliveros, B. Sanchez-Valverde. Vehicle routing problems with soft time windows:An optimization based approach. In:M. C. Lopez de Silanes et al. (Eds.), Proceedings of VIII Journees Zaragoza-Pau de Mathematiques Appliquees et Statistiques, vol.31. Monografias del Seminario Matematico Garcia Galdeano:2004, (31):295-304
[184]Ioannou, G, Kritikos, M., Prastacos, G. A problem generator-solver heuristic for vehicle routing with soft time windows. Omega,2003, (31):41-53
[185]郎茂祥.物流配送车辆调度问题的模型与算法研究：[博士学位论文].北京：北京交通大学,2002
[186]肖天国,符卓.求解带软时间窗的开放式车辆路径问题的遗传算法.铁道科学与工程学报,2008,5(2)：79-83
[187]钟石泉,杜纲,贺国光.有时间窗的开放式车辆路径问题及其遗传算法.计算机工程与应用,2006(34)：201-204
[188]M. Gendreau, A. Hertz, and G. Laporte. A tabu search heuristic for the vehicle routing problem. Management Science,1994,40:1276-1290
[189]C. Duhamel, J. Y Potvin and J. M. Rousseau. A tabu search heuristic for the vehicle routing problem with backhauls and time windows. Transportation Science, 1997,31:49-59
[190]王为民,邮政通信组织管理.北京：北京邮电大学出版社,2008.33
[191]胡向东,张海盛,王平,聂能.面向电子商务的邮政运输路由规划技术.微电子学与计算机,2001,(1)：42-54
[192]叶耀华,王律,杨文涛等.我国邮政网络的优化设计方法.管理工程学报,2004,18(2)：39-43
[193]宋青,李晓磊,郝风柱,张承进.区县内邮政运输网络的建模及优化.系统仿真学报,2008,20(6)：1611-1614
[194]Deif I., Bodin L.. Extension of the Clarke and Wright algorithm for solving the vehicle routing problem with backhauling. Proceedings of the Babson Conference on Software Uses in Transportation and Logistics Management,1984: 75-96
[195]Goetschalckx M., JacobspBlecha C. The vehicle routing problem with backhauls. European Journal of Operational Research.1989,42:39-51
[196]Toth P., Vigo D.. A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls. European Journal of Operational Research, 1999,113(3):528-544
[197]Tillman F A. The multiple terminal delivery problem with probabilistic demands. Transportation Science,1969,3(3):192-204
[198]Wren A H A. Computer scheduling of vehicles from one or more depots to a number of delivery points. Operational Research Quarterly,1972,23(3):333-344.
[199]Raft O M. Modular algorithm for an extended vehicle scheduling problem. European Journal of Operational Research,1982,11(1):67-76
[200]Ball M O, Golden B L, Assad A A, Bodin L D. Planning for truck fleet size in the presence of a common-carrier option. Decision Science,1983,14(1):103-120
[201]杨元峰,崔志明,陈建明.有时间窗约束的多车场车辆路径问题的改进遗传算法.苏州大学学报,2006,26(2)：20-23
[202]钟石泉,贺国光.多车场有时间窗的多车型车辆调度及其禁忌算法研究.运筹学学报,2005,9(4)：67-73
[203]Renaud J, Laporte G, Boctor F F. A tabu search heuristic for the multi-depot vehicle routing problem. Computers and Operations Research,1996,23(3):229-235
[204]Pisinger D, Ropke S. A general heuristic for vehicle routing problems. Computers and Operations Research,2007,34(8):2403-2435
[205]Tillman, Hering. A study of a look-ahead procedure for sovling the multiple terminal delivery problem. Tranp Res,1971, (5):225-229
[206]Chao I M, Golden B L, Wasil E. A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions. American Journal of Mathematical and Management Sciences,1983,13(13):371-406
[207]陈美军,张志胜,史金飞.多约束下多车场车辆路径问题的蚁群算法研究.中国机械工程,2008,19(1)：1939-1944
[208]陈美军,张志胜,陈春咏,史金飞.多车场车辆路径问题的新型聚类蚁群算法.中国制造业信息化,2008,37(11)：1-5
[209]王素欣,高利,崔小光,曹宏美.多需求点车辆调度模型及其群体智能混合求解.自动化学报,2008,34(1)：102-104
[210]李玲,谷寒雨,陈坚.复杂PDPTW问题的插入启发式算法.计算机工程,2003,29(16)：65-67
[211]Ribeiro C., Soumis F. A column generation approach to the multiple depot vehicle scheduling problem. Operations Research,1994, (42):41-52
[212]BiancoL, MingozziA, RicciardelliS. A set partitioning approach to the multiple depot vehicle scheduling problem. Optimization Methods and Software, 1994, (3):163-194
[213]Suk-Tae Bae, Heung Suk Hwang, Gyu-Sung Cho, Meng-Jong Goan. Integrated GA-VRP solver for multi-depot system, Computers& Industrial Engineering,2007, (53):233-240
[214]A. Tatarakis, I. Minis. Stochastic single vehicle routing with a predened customer sequence and multiple depot returns. European Journal of Operational Research,2008, doi:10.1016/j. ejor.2008.07.006
[215]邹彤.多车场车辆路径问题的遗传算法.计算机工程与应用,2004,40(4)：82-85
[216]G. Nagy, S. Salhi. Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. European Journal of Operational Research,2005, (162):126-141
[217]李延晖,刘向.沿途补货的多车场开放式车辆路径问题及蚁群算法.计算机集成制造系统,2008，14(3)：557-562
[218]Dondo, R.,& Cerda, J. A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. European Journal of Operational Research,2007,176(3):1478-1507
[219]Desaulniers G, Lavigne J, Soumis F. Multi-depot vehicle scheduling problems scheduling problems with time windows and waiting costs. European Journal of Operations Research,1998, (111):479-494
[220]Ahmed Hadjar, Francois Soumis. Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows. Computers& Operations Research,2009,36:2160-2172
[221]Rodolfo G. Dondo, Jaime Cerda. A hybrid local improvement algorithm for large-scale multi-depot vehicle routing problems with time windows. Computers and Chemical Engineering,2009, (33):513-530
[222]钟石泉,杜纲,贺国光.有顾客时间窗和发货量变化的紧急车辆调度研究.管理工程学报,2007,21(4)：114-118
[223]Barallona F, Jensen D. Plant Location with Minimum Inventory. Mathematical Programming,1998,83(1):101-111
[224]D. Vanecek, D. Kalab. Logisties in Agricultural Produetion. AGRIC. ECON,-CZECH.2003,49(9):439-443
[225]Karol Wajszczuk. Logistics costs analysis as anassisting tool to achieve competitive Advantage for agricultural enterprises. In:European Association of Agricultural Eeonomists, Poznan:2005
[226]Takeo SHINA. Logistics of Fruit and Vegetables. Farming Japan,2003, 37(5):26-36
[227]Patrizia Busato, Remigio Berruto. Fruit Game:Simulation Model to Study the Supply Chain Logistics for Fresh Produce. In:Computers in Agriculture and Natrural Resources 4th World Congress Conference. Florida:ASABE,200
[228]Ghare P. N., Schrader G. F. A model for exponentially decaying inventories. Journal of Industrial Engineering,1963, (15):235
[229]Dave U, Patel LK (TSI) Policy Inventory Model For deteriorating items with time proportional demand. J Opt. Res. Soc.,1981, (32):137-142
[230]Roychowdhury M Chaudhuri K S. An order-level inventory model for deteriorating items with finite rate of replenishment. Op. search,1983, (20):99-106
[231]Petrovic Dobrila. Simulation of Supply chain behavior and performance in an uncertain environment. In:Production Economics,2001, (71):429-438
[232]任伟.区域农产品物流配送问题优化研究：[硕士学位论文].曲阜：曲阜师范大学,2008
[233]钟晓燕.生鲜农产品配送系统优化与动态仿真：[硕士学位论文].福州：福建农林大学,2008
[234]刘婵媛.鲜活农产品配送的模式及路线优化研究：[硕士学位论文].武汉：华中科技大学,2006
[235]邱祝强.基于冷藏链的生鲜农产品物流网络优化及其安全风险评价研究：[博士学位论文].长沙：中南大学,2007
[236]张晓绩,戴冠,徐乃平.遗传算法种群多样性的分析研究.控制理论与应用,1998,15(1)：17-22
[237]C. Oguz, B. Cheung. C. Oguz and B. Cheung. A Genetic Algorithm for Flow-shop Scheduling problems with Multiprocessor Tasks. Proceeding of 8th International Workshop in Project Management and Scheduling Spain,2002