三维装载约束下车辆路径问题研究
|
摘要
在现代社会经济运行中，物流占据越来越重要的地位，如何有效的降低物流成本，提高物流配送效率，正成为企业面临的重要经营管理问题。高效的运作，不仅有利于企业效益的改善、用户满意度的提高，而且对于整个生态环境的改善、低碳社会的形成，也起着至关重要的作用。物流配送车辆路径问题作为物流运作管理的核心问题之一，对于提高物流效率非常关键，受到了广泛的关注，该问题经过几十年的研究，也取得了丰富的研究成果。但是，目前的研究很少考虑货物的装载约束，然而在实际配送过程中，配送的货物存在长、宽和高的三维外形约束、并且货物在配送过程中要满足“先进后出”的原则、货物需要底面支撑、以及配送过程中需要考虑装载的稳定性等，因此不考虑货物装载约束下求得的最优解可能在现实配送中根本无法成功操作。
本文研究了考虑货物装载的车辆路径问题，即三维装载约束下车辆路径问题，通过对问题进行描述、建模，综合利用基本启发式和现代启发式算法等工具，对基本的三维装载约束下车辆路径问题和扩展的几类重要三维装载约束下车辆路径问题进行了系统的研究，主要研究内容和创新成果如下：
1.给出了三维装载约束下车辆路径问题的描述和数学模型，在此基础上设计了货物的装载算法、三维空间处理算法、客户的选择算法，结合禁忌搜索优化算法，实现了多种混合式禁忌搜索算法。通过对已有测试集进行实验，与现有算法结果相比较，验证了算法的有效性；同时构建了新的测试数据集，分析和验证了算法的特征。
2.研究了带时间窗的三维装载约束下车辆路径问题。在基本的三维装载约束下车辆路径问题中引入了时间窗约束。构建了带时间窗的三维装载约束下车辆路径问题的数学模型；在此基础上，利用不同的时间窗选择算法、启发式算法和禁忌搜索算法求解上述问题；最后设计了问题的测试数据集，比较和分析不同的求解算法的性能。
3.研究了动态交通状况下三维装载约束下车辆路径问题。在带时间窗的考虑三维装载约束下车辆路径问题的基础上，引入新的约束条件：动态旅行时间。通过引入动态交通模型，构成了一类新的三维装载约束下车辆路径问题-----时变的三维装载约束下车辆路径问题。首先对问题进行描述，建立了问题的数学模型；然后提出了问题的启发式求解算法和基于禁忌搜索的智能求解算法；最后设计测试数据集，通过实验检验算法的有效性；同时对比分析了在不同算法参数、不同支撑面积下的计算结果，以及数据测试的时间效率。
4.研究多车型的三维装载约束下车辆路径问题。在实际的物流配送过程中，企业的配送车队往往是由具有多种车型、多种体积、多种载重量和使用成本的一组异质的车辆所组成。通过设计车辆车型的选择算法，有效实现了在多车型情况下，求解三维装载约束下车辆路径问题；最后设计测试数据集，通过实验检验算法的有效性；同时对比分析了在不同算法参数、不同支撑面积下的计算结果，以及数据测试的时间效率。
本文综合运用运筹学和智能优化等理论和方法，对几类三维装载约束下车辆路径问题模型及其算法进行了系统的研究。本文的研究扩展了车辆路径问题的研究空间，丰富了车辆路径问题的理论体系，同时为企业的物流配送、车辆调度提供了借鉴和参考。
In the modern social economy, logistics becomes more and more important. How toeffectively lower logistics cost, improve the efficiency of logistics distribution, is becoming akey and important problem that the companies must face. Efficient operation is not onlybeneficial to the improvement of the enterprise efficiency and customer satisfaction, but alsoplay an important role for the formation of the whole ecological environment and low carbonsociety. Logistics distribution vehicle routing problem as one of the core problems in logisticsmanagement, is crucial for improving the efficiency of logistics, and has received thewidespread attention. After decades of research, the problem has been abundant researchresults. But past research seldom consider the goods loading constraints. In fact, during theprocess of actual delivery, due to the three dimensional shape constraints, length, width andheight, and the principle of “First In Late Out”, minimumal bottom support area, and thestability of distribution need to be considered. The optimal resuts can be infeasible withoutconsidering the loading constraints.
The paper research the vehicle routing problem with three dimensional loadingconstraints. By descripting and modeling problems, comprehensive utilization of theheuristics and modern heuristic algorithms, the basic vehicle routing problem withthree-dimension loading costrint and several important extend problems are researched. Themain research results are list as follows:
1. We present the description and mathematical model of vehicle routing problem withthree dimensional loading constraints. And then, we devised loading algorithms of goods,three-dimension space process algorithms, and customer selection algorithms. Next, wepropose the hybrid tabu search algorithms. At last, we build problem test data sets, andsystematically analyze and dicuss the performance of the algorithm. The results show thathybrid tabu search algorithm can get better solutions comparing to current algorithms onseveral test data.
2. We research vehicle routing problem with three dimensions loading constraints and time windows. On the basis of basic vehicle routing problem with three dimension loadingconstraints, the time windows constraint is introduced. Firstly, we present the description andmathematical model. And then, using different time windows selection algorithms, differentheuristic algorithms and tabu seach algorithm, the problem is solved. Fially, we build problemtest data sets, and systematically analyze and dicuss the performance of the algorithm.
3. We research time dependent vehicle routing problem with three dimensional loadingconstraints. On the basis of vehicle routing problem with three dimensional loadingconstraints and time windows, we introduce new constraint, dynamic travel time length, anddesign the segemented time function to describle the speed. Firstly, we give the descriptionand mathematical models of the problem. And then, we present heuristic algorithms andintelligent algorithms based on tabu search. Finally, we build problem test data sets, andsystematically analyze and dicuss the performance of the algorithm.
4. We research heterogeneous fleet vehicle routing problem with three dimensionalloading constraints. Considering the actual logistics distribution process, the enterprises’distribution teams are usually composed of several vhelcie types, different sizes, differentloads and different deposit costs. Through designing vehicle model selection algorithms, weeffectively solve the heterogeneous fleet vehicle routing problem with three dimensionalloading constraints. Finally, we build problem test data sets, and systematically analyze anddicuss the performance of the algorithm.
This paper systematically research several vehicle routing problems with threedimensional loading constraints, integrated using the theories and methods of operationresearch and intelligent optimization. This paper extends the research fields of vehicle routingproblem, enrichs the theoretical system of vehicle routing problem, and provides reference forthe enterprise logistics distribution and vehicle scheduling at the same time.
本文研究了考虑货物装载的车辆路径问题，即三维装载约束下车辆路径问题，通过对问题进行描述、建模，综合利用基本启发式和现代启发式算法等工具，对基本的三维装载约束下车辆路径问题和扩展的几类重要三维装载约束下车辆路径问题进行了系统的研究，主要研究内容和创新成果如下：
1.给出了三维装载约束下车辆路径问题的描述和数学模型，在此基础上设计了货物的装载算法、三维空间处理算法、客户的选择算法，结合禁忌搜索优化算法，实现了多种混合式禁忌搜索算法。通过对已有测试集进行实验，与现有算法结果相比较，验证了算法的有效性；同时构建了新的测试数据集，分析和验证了算法的特征。
2.研究了带时间窗的三维装载约束下车辆路径问题。在基本的三维装载约束下车辆路径问题中引入了时间窗约束。构建了带时间窗的三维装载约束下车辆路径问题的数学模型；在此基础上，利用不同的时间窗选择算法、启发式算法和禁忌搜索算法求解上述问题；最后设计了问题的测试数据集，比较和分析不同的求解算法的性能。
3.研究了动态交通状况下三维装载约束下车辆路径问题。在带时间窗的考虑三维装载约束下车辆路径问题的基础上，引入新的约束条件：动态旅行时间。通过引入动态交通模型，构成了一类新的三维装载约束下车辆路径问题-----时变的三维装载约束下车辆路径问题。首先对问题进行描述，建立了问题的数学模型；然后提出了问题的启发式求解算法和基于禁忌搜索的智能求解算法；最后设计测试数据集，通过实验检验算法的有效性；同时对比分析了在不同算法参数、不同支撑面积下的计算结果，以及数据测试的时间效率。
4.研究多车型的三维装载约束下车辆路径问题。在实际的物流配送过程中，企业的配送车队往往是由具有多种车型、多种体积、多种载重量和使用成本的一组异质的车辆所组成。通过设计车辆车型的选择算法，有效实现了在多车型情况下，求解三维装载约束下车辆路径问题；最后设计测试数据集，通过实验检验算法的有效性；同时对比分析了在不同算法参数、不同支撑面积下的计算结果，以及数据测试的时间效率。
本文综合运用运筹学和智能优化等理论和方法，对几类三维装载约束下车辆路径问题模型及其算法进行了系统的研究。本文的研究扩展了车辆路径问题的研究空间，丰富了车辆路径问题的理论体系，同时为企业的物流配送、车辆调度提供了借鉴和参考。
In the modern social economy, logistics becomes more and more important. How toeffectively lower logistics cost, improve the efficiency of logistics distribution, is becoming akey and important problem that the companies must face. Efficient operation is not onlybeneficial to the improvement of the enterprise efficiency and customer satisfaction, but alsoplay an important role for the formation of the whole ecological environment and low carbonsociety. Logistics distribution vehicle routing problem as one of the core problems in logisticsmanagement, is crucial for improving the efficiency of logistics, and has received thewidespread attention. After decades of research, the problem has been abundant researchresults. But past research seldom consider the goods loading constraints. In fact, during theprocess of actual delivery, due to the three dimensional shape constraints, length, width andheight, and the principle of “First In Late Out”, minimumal bottom support area, and thestability of distribution need to be considered. The optimal resuts can be infeasible withoutconsidering the loading constraints.
The paper research the vehicle routing problem with three dimensional loadingconstraints. By descripting and modeling problems, comprehensive utilization of theheuristics and modern heuristic algorithms, the basic vehicle routing problem withthree-dimension loading costrint and several important extend problems are researched. Themain research results are list as follows:
1. We present the description and mathematical model of vehicle routing problem withthree dimensional loading constraints. And then, we devised loading algorithms of goods,three-dimension space process algorithms, and customer selection algorithms. Next, wepropose the hybrid tabu search algorithms. At last, we build problem test data sets, andsystematically analyze and dicuss the performance of the algorithm. The results show thathybrid tabu search algorithm can get better solutions comparing to current algorithms onseveral test data.
2. We research vehicle routing problem with three dimensions loading constraints and time windows. On the basis of basic vehicle routing problem with three dimension loadingconstraints, the time windows constraint is introduced. Firstly, we present the description andmathematical model. And then, using different time windows selection algorithms, differentheuristic algorithms and tabu seach algorithm, the problem is solved. Fially, we build problemtest data sets, and systematically analyze and dicuss the performance of the algorithm.
3. We research time dependent vehicle routing problem with three dimensional loadingconstraints. On the basis of vehicle routing problem with three dimensional loadingconstraints and time windows, we introduce new constraint, dynamic travel time length, anddesign the segemented time function to describle the speed. Firstly, we give the descriptionand mathematical models of the problem. And then, we present heuristic algorithms andintelligent algorithms based on tabu search. Finally, we build problem test data sets, andsystematically analyze and dicuss the performance of the algorithm.
4. We research heterogeneous fleet vehicle routing problem with three dimensionalloading constraints. Considering the actual logistics distribution process, the enterprises’distribution teams are usually composed of several vhelcie types, different sizes, differentloads and different deposit costs. Through designing vehicle model selection algorithms, weeffectively solve the heterogeneous fleet vehicle routing problem with three dimensionalloading constraints. Finally, we build problem test data sets, and systematically analyze anddicuss the performance of the algorithm.
This paper systematically research several vehicle routing problems with threedimensional loading constraints, integrated using the theories and methods of operationresearch and intelligent optimization. This paper extends the research fields of vehicle routingproblem, enrichs the theoretical system of vehicle routing problem, and provides reference forthe enterprise logistics distribution and vehicle scheduling at the same time.
引文
[1] Dantzig G., Ramser J.The truck dispatching problem[J].Management Science,1959,6(1):80-91
[2] SW Lin, ZJ Lee, KC Ying, CY Lee. Applying hybrid meta-heuristics for capacitatedvehicle routing problem[J]. Expert Systems with Applications,2009,36(2):1505–1512
[3] Clark G, Wright J V. Scheduling of vehicles from a central depot to a number of deliverypoints[J]. Operations Research,1965,12(4):568-581
[4] Solomon M. Vehicle routing and scheduling with time windows constraints: Models andalgorithms[D]. Philadelphia, University of Pennsylvania,1983
[5]曹二保，赖明勇，聂凯.带时间窗的车辆路径问题的改进差分进化算法研究[J].系统仿真学报.2009,21(8):2420-2423
[6]张钦，李辉.带有时间窗约束的车辆路径问题的一种改进遗传算法[J].系统管理学报.2010,19(5):589-600
[7] Koskosidis Y., W.Powell, M.Solomon. An optimization-based heuristic for vehicle routingand scheduling with soft time window constraints[J].Transportation Science.1992.26(2):69-85
[8] Chung-Cheng Lu, Vincent F.Yu. Data envelopement ananlysis for evaluating theefficiency of genetic algorithms on solving the vehicle routing problem with soft timewindows[J]. Computer&Industrial Engineering,2012,62(2):520-529
[9] de Jong C., Kant G., van Vlient A. On Finding Minimal Route Duration in the VehicleRouting Problem with Multiple Time Windows, Manuscript, Department of ComputerScience, Utrecht University, Netherlands,1996
[10] FavarettoD., Moretti E., Pellegrini P. Ant colony system for a VRP with multiple timewindows and multiple visits[J]. Joumal of lnterdiseiPlinary Mathematies,2007,10(2):263-284
[11] Fabien T., Martin R., Karl F.D., Richard F.H. Heuristics for the multi-period orienteeringproblem with multiple time windows[J]. Computers&Operations Research,2010,37(2):351-367
[12] SR.Thangiah, IH.Osman, R.Vinayagamoorthy, T.Sun. Algorithms for the vehicle routingProblems with time deadlines[J]. American Journal of Mathematical and ManagementScience,1995,13(3):323-355
[13] Matthew G.K., Konstantinos K., Evangelos S. Containership routing with time deadlinesand simultaneous deliveries and pick-ups[J]. Transportation Research Part E,2009,45(1):210-221.
[14] L.Schrage. Formulation and strueture of more complex realistic routing and schedulingProblem[J]. Networks,1981,11(2):229-232
[15] Bodin L, Golden B,Assad A,Ball M.Routing and scheduling of vehicles and crews:thestate of the art[J]. Computers&Operations Research,1983;10(2):63-211
[16] Jose B. A tabu search algorithm for the open vehicle routing problem[J]. EuropeanJournal of Operational Research,2004,157(3):552-564
[17] P.P.Repoussisa, C.D.Tarantilisa, O.Bra¨ysyb, G.Ioannou. A hybrid evolution strategy forthe open vehicle routing problem[J]. Computers&Operations Research,2010,37(3):443-455.
[18] S.A.MirHassani, N.Abolghasemi. A particle swarm optimization algorithm for openvehicle routing problem[J]. Expert Systems with Applications.2011,38(9):11547-11551
[19] Ran Liu, Zhibin Jiang. The close–open mixed vehicle routing problem[J]. EuropeanJournal of Operational Research,2012,220(2):349-360
[20] E. Beltrami, L. Bodin. Networks and vehicle routing for municipial waste collection[J].Networks,1974,4(1):65-94
[21] N. Christofides, J. Beasley. The period routing problem[J]. Networks,1984,14(2):237-256
[22] C. Tan, J. Beasley. A heuristic algorithm for the periodic vehicle routing problem[J].Omega,1984,12(5):497-504.
[23] M. Gaudioso, G. Paletta. A heuristic for the periodic vehicle routing problem[J].Transportation Science,1992,26(2):86-92.
[25] T. Vidal, T. Crainic, M. Gendreau, N. Lahrichi, W. Rei. A hybrid genetic algorithm formulti-depot and periodic vehicle routing problems[J]. Operations Research,2012,60(3):611-624.
[24] J. Pacheco, A. Alvarez, I. García, F. Angel-Bello. Optimizing vehicle routes in a bakerycompany allowing flexibility in delivery dates[J]. Journal of the Operational ResearchSociety,2011,63(5):569-581
[26] Lee,Y.H.,Jung,J.W., Lee,K.M. Vehicle routing scheduling for cross-docking in the supplychain[J].Computers&Industrial Engineering,2006,51(2):247-256
[27] Wen,M.,Larsen,J.,Clausen,J.,Cordeau,J.-F., Laporte,G. Vehicle routing with cross-docking[J]. Journal of the Operational Research Society,2009,60(12),1708-1718
[28] Liao Ch. J., Lin Y., Shih S.C. Vehicle routing with cross-docking in the supply chain[J].Expert Systems with Applications,2010,37(10):6868-6873
[29] R Dondo, J Cerdá. A sweep-heuristic based formulation for the vehicle routing problemwith cross-docking[J]. Computers and Chemical Engineering,2013,48(10):293-311
[30] Jaillet P. Probabilistic travelling salesman Problem[D]. World Scientific, NewJersey:1987
[31] D. Bertsimas, L.H. Howell.1993. Further results on the probabilistic traveling salesmanproblem[J]. European Journal of Operational Research,1993,65(1):68-95
[32] Tillman FA. The multiple terminal delivery problem with probabilistic demands[J].Transportation Science,1969,3(3):192-204
[33] Laporte G, Louveaux FV, Mercure H. Models and exact solutions for a class of stochasticlocation-routing problems[J]. European Journal of Operational Research,1989,39(1):71-78
[34] BENTON W.C., M.D RossErri. The vehicle scheduling problem with intermittentcustomer demands[J]. Computers&Operations Research,1992,19(6):521-531
[35] M Gendreau, G Laporte, R Séguin. An exact algorithm for the vehicle routing problemwith stochastic demands and customers[J]. Transportation Science,1995,29(2):143-155
[36] M Gendreau, G Laporte, R Séguin. A tabu search heuristic for the vehicle routingproblem with stochastic demands and customers[J]. Operations research,1996,44(3):469-477
[37] H Lei, G Laporte, B Guo. The capacitated vehicle routing problem with stochasticdemands and time windows[J]. Computers&Operations Research,2011,38(12):1775-178
[38] LaPorte G., Louveaux F.V., Mereure H. The vehicle routing problem with stochastictravel times[J]. Transportation Science,1992,26(3):161-170
[39] Park Y.B., Song S.H. Vehicle scheduling problems with time-varying speed[J].Computers&Industrial Engineering,1997,33(3):553-556
[40]李相勇，田澎.带时间窗和随机事件车辆路径问题：模型和算法[J].系统工程理论与实践.2009,29(8):81-90
[41] Duygu T., Nico D., Tom v. W., Ton d. K. Vehicle routing problem with stochastic traveltimes including soft time windows and service costs[J]. Computers&OperationsResearch，2013,40(1):214-224
[42] Cao E., Lai M. The open vehicle routing problem with fuzzy demands[J]. ExpertSystems with Applications,2009,37(3):2405-2411
[43] R.J.Kuo, Ferani E.Z., Kadarsah S. Hybrid particle swarm optimization with geneticalgorithm for solving capacitated vehicle routing problem with fuzzy demand–A casestudy on garbage collection system[J]. Applied Mathematics and Computation,2012,219(5):2574-2588
[44] J Tang, Z Pan, RYK Fung, H Lau. Vehicle routing problem with fuzzy time windows[J].Fuzzy Sets and Systems,2009,160(5):683-695.
[45]王君,李波.带模糊预约时间的车辆路径问题的多目标禁忌搜索算法[J].计算机集成制造系统,2011,17(4):858-866
[46] K.K. Lai, B. Liu, J. Peng. Vehicle routing problem with fuzzy travel times and its geneticalgorithm[R]. Technical Report,2003
[47] G.B.Alvarenga, G.R.Mateus, G.de Tomi. A genetic and set partitioning two-phaseapproach for the vehicle routing problem with time windows[J]. Computers&OperationsResearch,2007,34(6):1561-1584
[48] B.F.Moghadam, S.M.Seyedhosseini. A particle swarm approach to solve vehicle routingproblem with uncertain demand: A drug distribution case study[J]. International Journalof Industrial and Engineering Computations,2010,1(1):55-64.
[49]P. Kilby, P. Prosser, P. Shaw. Dynamic VRPs: A study of scenarios[R]. UK: University ofStrathclyde,1998
[50] R.Montemanni, L.Gambardella, A.Rizzoli, A.Donati. Ant colony system for a dynamicvehicle routing problem[J]. Journal of Combinatorial Optimization,2005,10(4):327-343.
[51] F.Hanshar, B.Ombuki-Berman.Dynamic vehicle routing using genetic algorithms[J].Applied Intelligence,2007,27(1):89-99
[52] M.Gendreau, F.Guertin, J.Potvin, E.Taillard. Parallel tabu search for real-time vehiclerouting and dispatching[J]. Transportation Science,1999,33(4):381-390
[53] A.Fabri, P.Recht. On dynamic pickup and delivery vehicle routing with several timewindows and waiting times[J]. Transportation Research Part B: Methodological,2006,40(4):335-350
[54] D.Sáez, C.Cortés, A.Núnez. Hybrid adaptive predictive control for themulti-vehicledynamic pick-up and delivery problem based on genetic algorithms and fuzzyclustering[J]. Computers&Operations Research,2008,35(11):3412-3438
[55] Laporte G., Mercure H., Nobert Y. An exact algorithm for the asymmetrical capacitatedvehicle routing problem[J]. Networks,1986,16(1):33-46
[56] Daniele V. Heuristic algorithm for the asymmetric capacitated vehicle routing problem[J].European Journal of Operational Research,1996,89(1):108-126
[57] Golden B.L., Laporte G., Taillard E.D. An adaptive memory heuristic for a class ofvehicle routing problems with minmax objective[J]. Computers&Operations Research,1997,24(5):445-452
[58] Yiyo Kuo.Using simulated annealing to minimize fuel consumption for thetime-dependent vehicle routing problem[J]. Computers&Industrial Engineering,2010,59(1):157-165
[59] Y Xiao, Q Zhao, I Kaku, Y Xu. Development of a fuel consumption optimization modelfor the capacitated vehicle routing problem[J]. Computers&Operations Research,2012,39(7):1419-1431
[60]玄光南，程润伟.遗传算法与工程设计[M].北京:科学出版社,2000
[61]张建勇，郭耀煌，李军.基于顾客满意度的多目标模糊车辆优化调度问题研究[J].铁道学报.2003,25(2):15-17
[62]范静.考虑客户满意度的同时收发车辆路径问题[J].运筹与管理,2011,20(1):60-64
[63]赵燕伟，李川，张景玲，陆游，王万良.一种新的求解多目标随机需求车辆路径问题的算法[J].计算机集成制造系统,2012,18(3):523-530
[64]陈久梅，张旭梅，肖剑.随机动态装卸车辆路径问题的启发式求解策略及仿真研究[J].计算机集成制造系统,2009,15(8):1578-1620
[65] M.Dror, P.Trudeau. Split delivery routing[J]. Naval Research Logistics,1990,37(3):383-402
[66] Frizzell PW, Gi n JW. The bounded split delivery vehicle routing problem with gridnetwork distances[J]. Asia–Pacific Journal of Operational Research,1992,9(1):101-116
[67] S.C.Ho, D.Haugland. A tabu search heuristic for the vehicle routing problem with timewindows and split deliveries[J]. Computers&Operations Research,2004,31(12):1947-1964
[68]王科峰，叶春明，唐国春.带时间窗分车运输同时收发车辆路径问题及其启发式算法[J].运筹与管理,2012,21(2):83-88
[69]谢秉磊，胡小明，张一喆.需求可分的车辆路径问题模型与算法[J].运筹与管理,2012,21(3):72-76
[70] D.O.Casco, B.L.Golden, E.A.Wasi. Vehicle routing with backhauls: models, algorithmsand case studies[A]. D.O.Casco, Vehicle routing: Methods and studies[C], North-Holland:Amsterdam1988,127-147
[71] Z Wang, Z Wang. A novel two-phase heuristic method for vehicle routing problem withbackhauls[J]. Computers and Mathematics with Applications,2009,57(11):1923-1928.
[72]王志坚,王晓博,李一军.一体化集货和配送车辆路径问题的混合遗传启发式算法[J].系统管理学报,2009,18(3):338-343
[73] Min H. The multiple vehicle routing problems with simultaneous delivery and pick-uppoints[J]. Transportation Research A,1989,23(5):377-386
[74] Savelsbergh MWP, Sol M. The general pickup and delivery problem[J]. TransportationScience,1995,29(1):17-29
[75] Dethloff J. Vehicle routing and reverse logistics: the vehicle routing problem withsimultaneous delivery and pick-up[J]. OR Spektrum,2001,23(1):79-96
[76] Zachariadis EE, Tarantilis CD, Kiranoudis.CT. A hybrid metaheuristic algorithm for thevehicle routing problem with simultaneous delivery and pick-up service[J]. ExpertSystems with Applications,2009,36(2):1070-1081.
[77] A. Subramanian, L.M.A.Drummond, C.Bentes, L.S.Ochi, R.Farias. A parallel heuristicfor the vehicle routing problem with simultaneous pickup and delivery[J]. Computers&Operations Research,2010,37(11):1899-1911
[78] Lai M., Cao E. An improved differential evolution algorithm for vehicle routing problemwith simultaneous pickups and deliveries and time windows[J]. Engineering Applicationsof Artificial Intelligence,2010,23(2):188-195
[79] C.K.Y.Lin. A vehicle routing problem with pickup and delivery time windows, andcoordination of transportable resources[J]. Computers&Operations Research,2011,38(11):1596-1609
[80] Tao Zhang, W.A.Chaovalitwongse, Yuejie Zhang. Scatter search for the stochastictravel-time vehicle routing problem with simultaneous pick-ups and deliveries[J].Computers&Operations Research,2012,39(10):2277-2290
[81]张涛,余绰娅,刘岚,邵志芳,张明杰.同时送取货的随机旅行时间车辆路径问题方法[J].系统工程理论与实践.2011,31(10):1912-1920
[82] C.Malandraki, M.S.Daskin. Time dependent vehicle routing problems: Formulations,properties and heuristic algorithms[J]. Transportation Science,1992,26(3):185-20
[83] S.Ichoua, M.Gendreau, J.-Y.Potvin. Vehicle dispatching with time-dependent traveltimes[J]. European Journal of Operational Research,2003,144(2):379-396
[84] Yiyo Kuo. Using simulated annealing to minimize fuel consumption for thetime-dependent vehicle routing problem[J]. Computers&Industrial Engineering,2010,59(1):157-165
[85] Alberto V.D., Roberto M., Norman C., Andrea E.R., Luca M.G. Time dependent vehiclerouting problem with a multi ant colony system[J]. European Journal of OperationalResearch,2008,185(3):1174-1191
[86] S.R.Balseiro, I.Loiseau, J.Ramonet. An Ant Colony algorithm hybridized with insertionheuristics for the time dependent vehicle routing problem with time windows[J].Computers&Operations Research,2011,38(6):954-966
[87]吴斌，倪卫红，樊树海.开放式动态网络车辆路径问题的粒子群算法[J].计算机集成制造系统,2009,15(9):1788-1794
[88] Taillard E.D.1999.A heuristic column generation method for the heterogeneous fleet [R]Cambridge University:1999
[89] Golden B., Assad A., Levy L., Gheysens F. The fleet size and mix vehicle routingproblem[J]. Computers&Operations Research,1984,11(1):49-66
[90] Salhi S., Sari M., Touati N.1992.Adaptation of some vehicle fleet mix heuristics[J].OMEGA,1992,20(5):653-660
[91]张群，颜瑞.基于改进模糊遗传算法的混合车辆路径问题[J].中国管理科学,2012,20(2):121-128
[92] Baldacci R., Battara M., Vigo D. The vehicle routing problem: latest advances and newchallenges[M]. New York: Springer,2008:3-28
[93] Renaud J, Laporte G, Boctor FF. A tabu search heuristic for the multi-depot vehiclerouting problem[J]. Computers&Operations Research,1996,23(3):229-235
[94] Cordeau JF, Gendreau M, Laporte G. A tabu search heuristic for periodic and multi-depotvehicle routing problems[J].Networks,1997,30(2):105-119
[95] Necati A., Deniz A., Mehmet T. T. Selective multi-depot vehicle routing problem withpricing[J]. Transportation Research Part C,2011,19(2):866-884
[96] G.N. Yücenur, N.C. Demirel. A new geometric shape-based genetic clustering algorithmfor the multi-depot vehicle routing problem[J]. Expert Systems with Applications. ExpertSystems with Applications,2011,38(9):11859-11865
[97]王征,张俊,王旭坪.多车场带时间窗车辆路径问题的变邻域搜索算法[J].中国管理科学,2011,19(2):99-109
[98] Chen CS,Lee SM,Shen QS.An analytical model for the container loading problem[J].European Journal of Operational Research,1995,80(1):68-76
[99] Martello S, Pisinger D, Vigo D. The three-dimensional bin packing problem[J].Operations Research,2000,48(2):256-267
[100] den B.E., Korst J., Martello S., Pisinger D., Vigo D. Erratum to The three-dimensionalbin packing problem:robot-packable and orthogonal variants of packingproblems[J].Operations Research,2005,53(4):735-736
[101]Martello S., Pisinger D.,Vigo D.,den B.E.,Korst J. Algorithm864: general androbot-packable variants of the three-dimensional bin packing problem[J]. ACMTransactions on Mathematical Software,2007,33(1):1-12
[102]Fekete SP, Schepers J,van der Veen JC. An exact algorithm for higher dimensionalorthogonal packing[J].Operations Research,2007,55(3):569-587
[103]Ceselli A, Righini G.An optimization algorithm for the ordered open-end bin packingproblem[J]. Operations Research,2008,56(2):425-436.
[104]Yang J, Leung JYT. The ordered open-end bin-packing problem[J]. Operations Research2003,51(5):759-470.
[105]A. LIM, B. Rodrigues, Y. Yang.3-D Container Packing Heursitics[J]. AppliedIntelligence,2005,22(2):125-134
[106]George J.A., Robinson D.F. A heuristic for packing boxes into a container[J]. Computersand Operations Research,1980,7(3):147-156.
[107] Loh T.H., Nee A.Y.C.1992.A packing algorithm for hexahedral boxes[A]. In:Proceedings of the Conference of Industrial Automation[C], Singapore, IEEE,1992:115-126.
[108]Bischoff E.E., Ratcliff M.S.W.1995. Issues in the development of approaches tocontainer loading[J]. Omega,1995,23(4):377-390
[109]Pisinger D. Heuristics for the container loading problem[J]. European Journal ofOperational Research,2002,141(2):382-392.
[110]Bischoff E.E. Three-dimensional packing of items with limited load bearing strength[J].European Journal of Operational Research,2006,168(3):952-966
[111]Morabito R., Arenales M.1994.An AND/OR graph approach to the container loadingproblem[J].International Transactions in Operational Research,1994,1(1):59-73
[112]Bortfeldt A., Gehring H. Applying tabu search to container loadingproblems[A].Operations Research Proceedings[C], Springer,1998:533–538
[113]Eley M. Solving container loading problems by block arrangement[J]. European Journalof Operational Research,2002,141(2):393-409
[114]Bortfeldt A., Gehring H., Mack D. A parallel tabu search algorithm for solving thecontainer loading problem[J]. Parallel Computing,2003,29(5):641-662
[115]Huang W.Q. He K. A caving degree approach for the single container loadingproblem[J].European Journal of Operational Research,2009,196(1):93-101
[116]K. He, W. Huang. A caving degree based flake arrangement approach for the containerloading problem[J]. Computers&Industrial Engineering,2010,59(2):344-351
[117]何琨,黄文奇,胡骞.基于动作空间的求解三维矩形装箱问题的穴度算法[J].计算机科学,2010,37(10):181-183
[118]Gilmore PC. Gomory RE. Multistage cutting stock problems of two and moredimensions[J]. Operations Research,1965,13(1):94-120
[119]Gehring H., Bortfeldt A. A genetic algorithm for solving the container loadingproblem[J].International Transactions in Operational Research,1997,4(5):401-418
[120]张德富，魏丽军，陈青山，陈火旺.三维装箱问题的组合启发式算法[J].软件学报，2007,18(9):2083-2089
[121]Michael E. Solving container loading problems by block arrangement[J]. EuropeanJournal of Operational Research,2002,142(2):393-409
[122]T Fanslau, A Bortfeldt, A tree search algorithm for solving the container loadingproblem[J]. INFORMS Journal on Computing,2008,22(2):222-235
[123]张德富，彭煜，朱文兴，陈火旺.求解三维装箱问题的而混合模拟退火算法[J].计算机学报,2009,32(11):2147-2156
[124]Bortfeldt A, Gehring H. A hybrid generic algorithm for the container loadingproblem[J].European Journal of Operational Research,2001,131(1):143-161
[125]Lodi A, Martello S, Vigo D. Heuristic algorithms for the three-dimensional bin packingproblem[J].European Journal of Operational Research,2002,141(2):410-420
[126]Crainic TG, Perboli G, Tadei R. TS2PACK: a two-level tabu search for thethree-dimensional bin packing problem[J]. European Journal of Operational Research,2009,195(3):744-760
[127]曹先彬，刘克胜，王煦法.基于免疫遗传算法的装箱问题求解[J].小型微型计算机系统,2000,21(4):361-363
[128]Gehring H., Bortfeldt A. A parallel genetic algorithm for solving the container loadingproblem[J]. International Transactions in Operational Research,2002,9(4):497-511
[129]Y. He, Y. Wu, R.d. Souza. A global search framework for practical three-dimensionalpacking with variable carton orientations[J]. Computers&Operations Research,2012,39(10):2395-2414
[130]Goncalvez JF, Resende MC. A parallel multi-population biased random-key geneticalgorithm for a container loading problem[J]. Computers&Operations Research,2012,39(2):179–90.
[131] S. Szykman, J. Cagan. A simulated annealing-based approach to three-dimensionalcomponent packing[J]. Journal of mechanical design,1995,117(2A):308-314
[132]Egeblad J., D. Pisinger. Heuristic approaches for the two and three-dimensionalknapsack packing problem[J]. Computer&Operations Research,2009,36(4):1024-1049
[133]Cooke J.A. How to protect your international freight[J]. Traffic Management,1993,23(2):38-42
[134]Cochard D.D., Yost K.A. Improving utilisation of air force cargo aircraft[J]. Interfaces,1985,15(1):53-68.
[135]Amiouny S.V., Bartholdi J.J., Vande Vate J.H., Zhang J. Balanced loading[J]. OperationsResearch,1992,40(2):238-246
[136]A.P. Davies, E.E. Bischoff. Weight distribution considerations in container loading[J].European Journal of Operational Research,1999,114(3):509-527
[137]Moura A., Oliveira J.F. A grasp approach to the container loading problem[J]. IEEEIntelligent Systems,2005,20(4):50-57
[138]M. Gendreau, M. Iori, G.Laporte, S. Martello. A tabu search algorithm for a routing andcontainer loading problem[J]. Transportation Science,2006,40(3):342-350
[139]Fuellerer G., K.F. Doerner, R.F. Hartl, M. Iori. Metaheuristics for vehicle routingproblems with loading constraints[J]. Networks,2007,49(4):294-307
[140]Moura A. A multi-objective genetic algorithm for the vehicle routing problem with timewindows and loading problem[J]. Intelligent Decision Support,2008,2:187-201
[141]Moura A., J.F. Oliveira. An integrated approach to the vehicle routing and containerloading problems[J]. OR Spectrum,2009,31(4):775-800
[142]Tarantilis,C.D., E.E. Zachariadis, C.T. Kiranoudis. A hybrid metaheuristic algorithm forthe integraged vehicle routing and three-dimensional container-loading problem[J]. IEEETransactions on Intelligent Transportation Systems,2009,10(2):255-271
[143]Fullerer G., Karl F.D., Richard F.H., Manuel I. Metaheuristics for vehicle routingproblems with three-dimensional loading constraints[J]. European Journal of OperationalResearch,2010,201(3):751–759
[144]A. Bortfeldt. A hybrid algorithm for the capacitated vehicle routing problem withthree-dimensional loading constraints[J]. Computers&Operations Research,2012,39(9):2248-2257
[145]A. Bortfeldt, J. Homberger. Packing first, routing second—a heuristic for the vehiclerouting and loading problem[J]. Computers&Operations Research,2013,40(3):873-885
[146]Philippe L, Helene T, Christophe D. A GRASP×ELS for the vehicle routing problemwith basic three-dimensional loading constraints[J]. Engineering Applications ofArtificial Intelligence,2013,26(8):1795-1810
[147]Q. Ruan, Z. Zhang, L. Miao, H. Shen. A hybrid approach for the vehicle routing problemwith three-dimensional loading constraints[J]. Computers&Operations Research,2013,40(6):1579-1589
[148]http://neo.lcc.uma.es/radi-aeb/WebVRP/index.html?/Problem_Instances/instances.html
[2] SW Lin, ZJ Lee, KC Ying, CY Lee. Applying hybrid meta-heuristics for capacitatedvehicle routing problem[J]. Expert Systems with Applications,2009,36(2):1505–1512
[3] Clark G, Wright J V. Scheduling of vehicles from a central depot to a number of deliverypoints[J]. Operations Research,1965,12(4):568-581
[4] Solomon M. Vehicle routing and scheduling with time windows constraints: Models andalgorithms[D]. Philadelphia, University of Pennsylvania,1983
[5]曹二保，赖明勇，聂凯.带时间窗的车辆路径问题的改进差分进化算法研究[J].系统仿真学报.2009,21(8):2420-2423
[6]张钦，李辉.带有时间窗约束的车辆路径问题的一种改进遗传算法[J].系统管理学报.2010,19(5):589-600
[7] Koskosidis Y., W.Powell, M.Solomon. An optimization-based heuristic for vehicle routingand scheduling with soft time window constraints[J].Transportation Science.1992.26(2):69-85
[8] Chung-Cheng Lu, Vincent F.Yu. Data envelopement ananlysis for evaluating theefficiency of genetic algorithms on solving the vehicle routing problem with soft timewindows[J]. Computer&Industrial Engineering,2012,62(2):520-529
[9] de Jong C., Kant G., van Vlient A. On Finding Minimal Route Duration in the VehicleRouting Problem with Multiple Time Windows, Manuscript, Department of ComputerScience, Utrecht University, Netherlands,1996
[10] FavarettoD., Moretti E., Pellegrini P. Ant colony system for a VRP with multiple timewindows and multiple visits[J]. Joumal of lnterdiseiPlinary Mathematies,2007,10(2):263-284
[11] Fabien T., Martin R., Karl F.D., Richard F.H. Heuristics for the multi-period orienteeringproblem with multiple time windows[J]. Computers&Operations Research,2010,37(2):351-367
[12] SR.Thangiah, IH.Osman, R.Vinayagamoorthy, T.Sun. Algorithms for the vehicle routingProblems with time deadlines[J]. American Journal of Mathematical and ManagementScience,1995,13(3):323-355
[13] Matthew G.K., Konstantinos K., Evangelos S. Containership routing with time deadlinesand simultaneous deliveries and pick-ups[J]. Transportation Research Part E,2009,45(1):210-221.
[14] L.Schrage. Formulation and strueture of more complex realistic routing and schedulingProblem[J]. Networks,1981,11(2):229-232
[15] Bodin L, Golden B,Assad A,Ball M.Routing and scheduling of vehicles and crews:thestate of the art[J]. Computers&Operations Research,1983;10(2):63-211
[16] Jose B. A tabu search algorithm for the open vehicle routing problem[J]. EuropeanJournal of Operational Research,2004,157(3):552-564
[17] P.P.Repoussisa, C.D.Tarantilisa, O.Bra¨ysyb, G.Ioannou. A hybrid evolution strategy forthe open vehicle routing problem[J]. Computers&Operations Research,2010,37(3):443-455.
[18] S.A.MirHassani, N.Abolghasemi. A particle swarm optimization algorithm for openvehicle routing problem[J]. Expert Systems with Applications.2011,38(9):11547-11551
[19] Ran Liu, Zhibin Jiang. The close–open mixed vehicle routing problem[J]. EuropeanJournal of Operational Research,2012,220(2):349-360
[20] E. Beltrami, L. Bodin. Networks and vehicle routing for municipial waste collection[J].Networks,1974,4(1):65-94
[21] N. Christofides, J. Beasley. The period routing problem[J]. Networks,1984,14(2):237-256
[22] C. Tan, J. Beasley. A heuristic algorithm for the periodic vehicle routing problem[J].Omega,1984,12(5):497-504.
[23] M. Gaudioso, G. Paletta. A heuristic for the periodic vehicle routing problem[J].Transportation Science,1992,26(2):86-92.
[25] T. Vidal, T. Crainic, M. Gendreau, N. Lahrichi, W. Rei. A hybrid genetic algorithm formulti-depot and periodic vehicle routing problems[J]. Operations Research,2012,60(3):611-624.
[24] J. Pacheco, A. Alvarez, I. García, F. Angel-Bello. Optimizing vehicle routes in a bakerycompany allowing flexibility in delivery dates[J]. Journal of the Operational ResearchSociety,2011,63(5):569-581
[26] Lee,Y.H.,Jung,J.W., Lee,K.M. Vehicle routing scheduling for cross-docking in the supplychain[J].Computers&Industrial Engineering,2006,51(2):247-256
[27] Wen,M.,Larsen,J.,Clausen,J.,Cordeau,J.-F., Laporte,G. Vehicle routing with cross-docking[J]. Journal of the Operational Research Society,2009,60(12),1708-1718
[28] Liao Ch. J., Lin Y., Shih S.C. Vehicle routing with cross-docking in the supply chain[J].Expert Systems with Applications,2010,37(10):6868-6873
[29] R Dondo, J Cerdá. A sweep-heuristic based formulation for the vehicle routing problemwith cross-docking[J]. Computers and Chemical Engineering,2013,48(10):293-311
[30] Jaillet P. Probabilistic travelling salesman Problem[D]. World Scientific, NewJersey:1987
[31] D. Bertsimas, L.H. Howell.1993. Further results on the probabilistic traveling salesmanproblem[J]. European Journal of Operational Research,1993,65(1):68-95
[32] Tillman FA. The multiple terminal delivery problem with probabilistic demands[J].Transportation Science,1969,3(3):192-204
[33] Laporte G, Louveaux FV, Mercure H. Models and exact solutions for a class of stochasticlocation-routing problems[J]. European Journal of Operational Research,1989,39(1):71-78
[34] BENTON W.C., M.D RossErri. The vehicle scheduling problem with intermittentcustomer demands[J]. Computers&Operations Research,1992,19(6):521-531
[35] M Gendreau, G Laporte, R Séguin. An exact algorithm for the vehicle routing problemwith stochastic demands and customers[J]. Transportation Science,1995,29(2):143-155
[36] M Gendreau, G Laporte, R Séguin. A tabu search heuristic for the vehicle routingproblem with stochastic demands and customers[J]. Operations research,1996,44(3):469-477
[37] H Lei, G Laporte, B Guo. The capacitated vehicle routing problem with stochasticdemands and time windows[J]. Computers&Operations Research,2011,38(12):1775-178
[38] LaPorte G., Louveaux F.V., Mereure H. The vehicle routing problem with stochastictravel times[J]. Transportation Science,1992,26(3):161-170
[39] Park Y.B., Song S.H. Vehicle scheduling problems with time-varying speed[J].Computers&Industrial Engineering,1997,33(3):553-556
[40]李相勇，田澎.带时间窗和随机事件车辆路径问题：模型和算法[J].系统工程理论与实践.2009,29(8):81-90
[41] Duygu T., Nico D., Tom v. W., Ton d. K. Vehicle routing problem with stochastic traveltimes including soft time windows and service costs[J]. Computers&OperationsResearch，2013,40(1):214-224
[42] Cao E., Lai M. The open vehicle routing problem with fuzzy demands[J]. ExpertSystems with Applications,2009,37(3):2405-2411
[43] R.J.Kuo, Ferani E.Z., Kadarsah S. Hybrid particle swarm optimization with geneticalgorithm for solving capacitated vehicle routing problem with fuzzy demand–A casestudy on garbage collection system[J]. Applied Mathematics and Computation,2012,219(5):2574-2588
[44] J Tang, Z Pan, RYK Fung, H Lau. Vehicle routing problem with fuzzy time windows[J].Fuzzy Sets and Systems,2009,160(5):683-695.
[45]王君,李波.带模糊预约时间的车辆路径问题的多目标禁忌搜索算法[J].计算机集成制造系统,2011,17(4):858-866
[46] K.K. Lai, B. Liu, J. Peng. Vehicle routing problem with fuzzy travel times and its geneticalgorithm[R]. Technical Report,2003
[47] G.B.Alvarenga, G.R.Mateus, G.de Tomi. A genetic and set partitioning two-phaseapproach for the vehicle routing problem with time windows[J]. Computers&OperationsResearch,2007,34(6):1561-1584
[48] B.F.Moghadam, S.M.Seyedhosseini. A particle swarm approach to solve vehicle routingproblem with uncertain demand: A drug distribution case study[J]. International Journalof Industrial and Engineering Computations,2010,1(1):55-64.
[49]P. Kilby, P. Prosser, P. Shaw. Dynamic VRPs: A study of scenarios[R]. UK: University ofStrathclyde,1998
[50] R.Montemanni, L.Gambardella, A.Rizzoli, A.Donati. Ant colony system for a dynamicvehicle routing problem[J]. Journal of Combinatorial Optimization,2005,10(4):327-343.
[51] F.Hanshar, B.Ombuki-Berman.Dynamic vehicle routing using genetic algorithms[J].Applied Intelligence,2007,27(1):89-99
[52] M.Gendreau, F.Guertin, J.Potvin, E.Taillard. Parallel tabu search for real-time vehiclerouting and dispatching[J]. Transportation Science,1999,33(4):381-390
[53] A.Fabri, P.Recht. On dynamic pickup and delivery vehicle routing with several timewindows and waiting times[J]. Transportation Research Part B: Methodological,2006,40(4):335-350
[54] D.Sáez, C.Cortés, A.Núnez. Hybrid adaptive predictive control for themulti-vehicledynamic pick-up and delivery problem based on genetic algorithms and fuzzyclustering[J]. Computers&Operations Research,2008,35(11):3412-3438
[55] Laporte G., Mercure H., Nobert Y. An exact algorithm for the asymmetrical capacitatedvehicle routing problem[J]. Networks,1986,16(1):33-46
[56] Daniele V. Heuristic algorithm for the asymmetric capacitated vehicle routing problem[J].European Journal of Operational Research,1996,89(1):108-126
[57] Golden B.L., Laporte G., Taillard E.D. An adaptive memory heuristic for a class ofvehicle routing problems with minmax objective[J]. Computers&Operations Research,1997,24(5):445-452
[58] Yiyo Kuo.Using simulated annealing to minimize fuel consumption for thetime-dependent vehicle routing problem[J]. Computers&Industrial Engineering,2010,59(1):157-165
[59] Y Xiao, Q Zhao, I Kaku, Y Xu. Development of a fuel consumption optimization modelfor the capacitated vehicle routing problem[J]. Computers&Operations Research,2012,39(7):1419-1431
[60]玄光南，程润伟.遗传算法与工程设计[M].北京:科学出版社,2000
[61]张建勇，郭耀煌，李军.基于顾客满意度的多目标模糊车辆优化调度问题研究[J].铁道学报.2003,25(2):15-17
[62]范静.考虑客户满意度的同时收发车辆路径问题[J].运筹与管理,2011,20(1):60-64
[63]赵燕伟，李川，张景玲，陆游，王万良.一种新的求解多目标随机需求车辆路径问题的算法[J].计算机集成制造系统,2012,18(3):523-530
[64]陈久梅，张旭梅，肖剑.随机动态装卸车辆路径问题的启发式求解策略及仿真研究[J].计算机集成制造系统,2009,15(8):1578-1620
[65] M.Dror, P.Trudeau. Split delivery routing[J]. Naval Research Logistics,1990,37(3):383-402
[66] Frizzell PW, Gi n JW. The bounded split delivery vehicle routing problem with gridnetwork distances[J]. Asia–Pacific Journal of Operational Research,1992,9(1):101-116
[67] S.C.Ho, D.Haugland. A tabu search heuristic for the vehicle routing problem with timewindows and split deliveries[J]. Computers&Operations Research,2004,31(12):1947-1964
[68]王科峰，叶春明，唐国春.带时间窗分车运输同时收发车辆路径问题及其启发式算法[J].运筹与管理,2012,21(2):83-88
[69]谢秉磊，胡小明，张一喆.需求可分的车辆路径问题模型与算法[J].运筹与管理,2012,21(3):72-76
[70] D.O.Casco, B.L.Golden, E.A.Wasi. Vehicle routing with backhauls: models, algorithmsand case studies[A]. D.O.Casco, Vehicle routing: Methods and studies[C], North-Holland:Amsterdam1988,127-147
[71] Z Wang, Z Wang. A novel two-phase heuristic method for vehicle routing problem withbackhauls[J]. Computers and Mathematics with Applications,2009,57(11):1923-1928.
[72]王志坚,王晓博,李一军.一体化集货和配送车辆路径问题的混合遗传启发式算法[J].系统管理学报,2009,18(3):338-343
[73] Min H. The multiple vehicle routing problems with simultaneous delivery and pick-uppoints[J]. Transportation Research A,1989,23(5):377-386
[74] Savelsbergh MWP, Sol M. The general pickup and delivery problem[J]. TransportationScience,1995,29(1):17-29
[75] Dethloff J. Vehicle routing and reverse logistics: the vehicle routing problem withsimultaneous delivery and pick-up[J]. OR Spektrum,2001,23(1):79-96
[76] Zachariadis EE, Tarantilis CD, Kiranoudis.CT. A hybrid metaheuristic algorithm for thevehicle routing problem with simultaneous delivery and pick-up service[J]. ExpertSystems with Applications,2009,36(2):1070-1081.
[77] A. Subramanian, L.M.A.Drummond, C.Bentes, L.S.Ochi, R.Farias. A parallel heuristicfor the vehicle routing problem with simultaneous pickup and delivery[J]. Computers&Operations Research,2010,37(11):1899-1911
[78] Lai M., Cao E. An improved differential evolution algorithm for vehicle routing problemwith simultaneous pickups and deliveries and time windows[J]. Engineering Applicationsof Artificial Intelligence,2010,23(2):188-195
[79] C.K.Y.Lin. A vehicle routing problem with pickup and delivery time windows, andcoordination of transportable resources[J]. Computers&Operations Research,2011,38(11):1596-1609
[80] Tao Zhang, W.A.Chaovalitwongse, Yuejie Zhang. Scatter search for the stochastictravel-time vehicle routing problem with simultaneous pick-ups and deliveries[J].Computers&Operations Research,2012,39(10):2277-2290
[81]张涛,余绰娅,刘岚,邵志芳,张明杰.同时送取货的随机旅行时间车辆路径问题方法[J].系统工程理论与实践.2011,31(10):1912-1920
[82] C.Malandraki, M.S.Daskin. Time dependent vehicle routing problems: Formulations,properties and heuristic algorithms[J]. Transportation Science,1992,26(3):185-20
[83] S.Ichoua, M.Gendreau, J.-Y.Potvin. Vehicle dispatching with time-dependent traveltimes[J]. European Journal of Operational Research,2003,144(2):379-396
[84] Yiyo Kuo. Using simulated annealing to minimize fuel consumption for thetime-dependent vehicle routing problem[J]. Computers&Industrial Engineering,2010,59(1):157-165
[85] Alberto V.D., Roberto M., Norman C., Andrea E.R., Luca M.G. Time dependent vehiclerouting problem with a multi ant colony system[J]. European Journal of OperationalResearch,2008,185(3):1174-1191
[86] S.R.Balseiro, I.Loiseau, J.Ramonet. An Ant Colony algorithm hybridized with insertionheuristics for the time dependent vehicle routing problem with time windows[J].Computers&Operations Research,2011,38(6):954-966
[87]吴斌，倪卫红，樊树海.开放式动态网络车辆路径问题的粒子群算法[J].计算机集成制造系统,2009,15(9):1788-1794
[88] Taillard E.D.1999.A heuristic column generation method for the heterogeneous fleet [R]Cambridge University:1999
[89] Golden B., Assad A., Levy L., Gheysens F. The fleet size and mix vehicle routingproblem[J]. Computers&Operations Research,1984,11(1):49-66
[90] Salhi S., Sari M., Touati N.1992.Adaptation of some vehicle fleet mix heuristics[J].OMEGA,1992,20(5):653-660
[91]张群，颜瑞.基于改进模糊遗传算法的混合车辆路径问题[J].中国管理科学,2012,20(2):121-128
[92] Baldacci R., Battara M., Vigo D. The vehicle routing problem: latest advances and newchallenges[M]. New York: Springer,2008:3-28
[93] Renaud J, Laporte G, Boctor FF. A tabu search heuristic for the multi-depot vehiclerouting problem[J]. Computers&Operations Research,1996,23(3):229-235
[94] Cordeau JF, Gendreau M, Laporte G. A tabu search heuristic for periodic and multi-depotvehicle routing problems[J].Networks,1997,30(2):105-119
[95] Necati A., Deniz A., Mehmet T. T. Selective multi-depot vehicle routing problem withpricing[J]. Transportation Research Part C,2011,19(2):866-884
[96] G.N. Yücenur, N.C. Demirel. A new geometric shape-based genetic clustering algorithmfor the multi-depot vehicle routing problem[J]. Expert Systems with Applications. ExpertSystems with Applications,2011,38(9):11859-11865
[97]王征,张俊,王旭坪.多车场带时间窗车辆路径问题的变邻域搜索算法[J].中国管理科学,2011,19(2):99-109
[98] Chen CS,Lee SM,Shen QS.An analytical model for the container loading problem[J].European Journal of Operational Research,1995,80(1):68-76
[99] Martello S, Pisinger D, Vigo D. The three-dimensional bin packing problem[J].Operations Research,2000,48(2):256-267
[100] den B.E., Korst J., Martello S., Pisinger D., Vigo D. Erratum to The three-dimensionalbin packing problem:robot-packable and orthogonal variants of packingproblems[J].Operations Research,2005,53(4):735-736
[101]Martello S., Pisinger D.,Vigo D.,den B.E.,Korst J. Algorithm864: general androbot-packable variants of the three-dimensional bin packing problem[J]. ACMTransactions on Mathematical Software,2007,33(1):1-12
[102]Fekete SP, Schepers J,van der Veen JC. An exact algorithm for higher dimensionalorthogonal packing[J].Operations Research,2007,55(3):569-587
[103]Ceselli A, Righini G.An optimization algorithm for the ordered open-end bin packingproblem[J]. Operations Research,2008,56(2):425-436.
[104]Yang J, Leung JYT. The ordered open-end bin-packing problem[J]. Operations Research2003,51(5):759-470.
[105]A. LIM, B. Rodrigues, Y. Yang.3-D Container Packing Heursitics[J]. AppliedIntelligence,2005,22(2):125-134
[106]George J.A., Robinson D.F. A heuristic for packing boxes into a container[J]. Computersand Operations Research,1980,7(3):147-156.
[107] Loh T.H., Nee A.Y.C.1992.A packing algorithm for hexahedral boxes[A]. In:Proceedings of the Conference of Industrial Automation[C], Singapore, IEEE,1992:115-126.
[108]Bischoff E.E., Ratcliff M.S.W.1995. Issues in the development of approaches tocontainer loading[J]. Omega,1995,23(4):377-390
[109]Pisinger D. Heuristics for the container loading problem[J]. European Journal ofOperational Research,2002,141(2):382-392.
[110]Bischoff E.E. Three-dimensional packing of items with limited load bearing strength[J].European Journal of Operational Research,2006,168(3):952-966
[111]Morabito R., Arenales M.1994.An AND/OR graph approach to the container loadingproblem[J].International Transactions in Operational Research,1994,1(1):59-73
[112]Bortfeldt A., Gehring H. Applying tabu search to container loadingproblems[A].Operations Research Proceedings[C], Springer,1998:533–538
[113]Eley M. Solving container loading problems by block arrangement[J]. European Journalof Operational Research,2002,141(2):393-409
[114]Bortfeldt A., Gehring H., Mack D. A parallel tabu search algorithm for solving thecontainer loading problem[J]. Parallel Computing,2003,29(5):641-662
[115]Huang W.Q. He K. A caving degree approach for the single container loadingproblem[J].European Journal of Operational Research,2009,196(1):93-101
[116]K. He, W. Huang. A caving degree based flake arrangement approach for the containerloading problem[J]. Computers&Industrial Engineering,2010,59(2):344-351
[117]何琨,黄文奇,胡骞.基于动作空间的求解三维矩形装箱问题的穴度算法[J].计算机科学,2010,37(10):181-183
[118]Gilmore PC. Gomory RE. Multistage cutting stock problems of two and moredimensions[J]. Operations Research,1965,13(1):94-120
[119]Gehring H., Bortfeldt A. A genetic algorithm for solving the container loadingproblem[J].International Transactions in Operational Research,1997,4(5):401-418
[120]张德富，魏丽军，陈青山，陈火旺.三维装箱问题的组合启发式算法[J].软件学报，2007,18(9):2083-2089
[121]Michael E. Solving container loading problems by block arrangement[J]. EuropeanJournal of Operational Research,2002,142(2):393-409
[122]T Fanslau, A Bortfeldt, A tree search algorithm for solving the container loadingproblem[J]. INFORMS Journal on Computing,2008,22(2):222-235
[123]张德富，彭煜，朱文兴，陈火旺.求解三维装箱问题的而混合模拟退火算法[J].计算机学报,2009,32(11):2147-2156
[124]Bortfeldt A, Gehring H. A hybrid generic algorithm for the container loadingproblem[J].European Journal of Operational Research,2001,131(1):143-161
[125]Lodi A, Martello S, Vigo D. Heuristic algorithms for the three-dimensional bin packingproblem[J].European Journal of Operational Research,2002,141(2):410-420
[126]Crainic TG, Perboli G, Tadei R. TS2PACK: a two-level tabu search for thethree-dimensional bin packing problem[J]. European Journal of Operational Research,2009,195(3):744-760
[127]曹先彬，刘克胜，王煦法.基于免疫遗传算法的装箱问题求解[J].小型微型计算机系统,2000,21(4):361-363
[128]Gehring H., Bortfeldt A. A parallel genetic algorithm for solving the container loadingproblem[J]. International Transactions in Operational Research,2002,9(4):497-511
[129]Y. He, Y. Wu, R.d. Souza. A global search framework for practical three-dimensionalpacking with variable carton orientations[J]. Computers&Operations Research,2012,39(10):2395-2414
[130]Goncalvez JF, Resende MC. A parallel multi-population biased random-key geneticalgorithm for a container loading problem[J]. Computers&Operations Research,2012,39(2):179–90.
[131] S. Szykman, J. Cagan. A simulated annealing-based approach to three-dimensionalcomponent packing[J]. Journal of mechanical design,1995,117(2A):308-314
[132]Egeblad J., D. Pisinger. Heuristic approaches for the two and three-dimensionalknapsack packing problem[J]. Computer&Operations Research,2009,36(4):1024-1049
[133]Cooke J.A. How to protect your international freight[J]. Traffic Management,1993,23(2):38-42
[134]Cochard D.D., Yost K.A. Improving utilisation of air force cargo aircraft[J]. Interfaces,1985,15(1):53-68.
[135]Amiouny S.V., Bartholdi J.J., Vande Vate J.H., Zhang J. Balanced loading[J]. OperationsResearch,1992,40(2):238-246
[136]A.P. Davies, E.E. Bischoff. Weight distribution considerations in container loading[J].European Journal of Operational Research,1999,114(3):509-527
[137]Moura A., Oliveira J.F. A grasp approach to the container loading problem[J]. IEEEIntelligent Systems,2005,20(4):50-57
[138]M. Gendreau, M. Iori, G.Laporte, S. Martello. A tabu search algorithm for a routing andcontainer loading problem[J]. Transportation Science,2006,40(3):342-350
[139]Fuellerer G., K.F. Doerner, R.F. Hartl, M. Iori. Metaheuristics for vehicle routingproblems with loading constraints[J]. Networks,2007,49(4):294-307
[140]Moura A. A multi-objective genetic algorithm for the vehicle routing problem with timewindows and loading problem[J]. Intelligent Decision Support,2008,2:187-201
[141]Moura A., J.F. Oliveira. An integrated approach to the vehicle routing and containerloading problems[J]. OR Spectrum,2009,31(4):775-800
[142]Tarantilis,C.D., E.E. Zachariadis, C.T. Kiranoudis. A hybrid metaheuristic algorithm forthe integraged vehicle routing and three-dimensional container-loading problem[J]. IEEETransactions on Intelligent Transportation Systems,2009,10(2):255-271
[143]Fullerer G., Karl F.D., Richard F.H., Manuel I. Metaheuristics for vehicle routingproblems with three-dimensional loading constraints[J]. European Journal of OperationalResearch,2010,201(3):751–759
[144]A. Bortfeldt. A hybrid algorithm for the capacitated vehicle routing problem withthree-dimensional loading constraints[J]. Computers&Operations Research,2012,39(9):2248-2257
[145]A. Bortfeldt, J. Homberger. Packing first, routing second—a heuristic for the vehiclerouting and loading problem[J]. Computers&Operations Research,2013,40(3):873-885
[146]Philippe L, Helene T, Christophe D. A GRASP×ELS for the vehicle routing problemwith basic three-dimensional loading constraints[J]. Engineering Applications ofArtificial Intelligence,2013,26(8):1795-1810
[147]Q. Ruan, Z. Zhang, L. Miao, H. Shen. A hybrid approach for the vehicle routing problemwith three-dimensional loading constraints[J]. Computers&Operations Research,2013,40(6):1579-1589
[148]http://neo.lcc.uma.es/radi-aeb/WebVRP/index.html?/Problem_Instances/instances.html
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |