[1] MIN H. The multiple vehicle routing problem with simultaneous delivery and pick-up points[J]. Transportation Research,Part A:General,1989,23(5):377-386. [2] ANGELELLI E,MANSINI R. The vehicle routing problem with time windows and simultaneous pick-up and delivery[M]//KLOSE A,SPERANZA M G,VAN WASSENHOVE L N. Quantitative Approaches to Distribution Logistics and Supply Chain Management,LNE 519. Berlin:Springer,2002:249-267. [3] WANG H F,CHEN Y Y. A genetic algorithm for the simultaneous delivery and pickup problems with time window[J]. Computers and Industrial Engineering,2012,62(1):84-95. [4] SOLOMON M M. Vehicle routing and scheduling with time window constraints:models and algorithms[D]. Philadelphia:University of Philadelphia,1984. [5] LIU R,XIE X,AUGUSTO V,et al. Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care[J]. European Journal of Operational Research,2013,230(3):475-486. [6] WANG C,MU D,ZHAO F,et al. A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup-delivery and time windows[J]. Computers and Industrial Engineering,2015,83:111-122. [7] 王超, 刘超, 穆东, 等. 基于离散布谷鸟算法求解带时间窗和同时取送货的车辆路径问题[J]. 计算机集成制造系统,2018,24(3):570-582.(WANG C,LIU C,MU D,et al. VRPSPDTW problem solving by discrete cuckoo search[J]. Computer Integrated Manufacturing Systems,2018,24(3):570-582.) [8] MOSCATO P. On evolution,search,optimization,genetic algorithms and martial arts:towards memetic algorithms[EB/OL].[2019-02-10]. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.27.9474&rep=rep1&type=pdf. [9] NAGATA Y,BRÄYSY O,DULLAERT W. A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows[J]. Computers and Operations Research,2010,37(4):724-737. [10] NALEPA J,BLOCHO M. Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows[J]. Soft Computing,2016,20(6):2309-2327. [11] NAGATA Y,BRÄYSY O. A powerful route minimization heuristic for the vehicle routing problem with time windows[J]. Operations Research Letters,2009,37(5):333-338. [12] 陈祥, 朱传军, 张超勇. 基于文化基因算法的开放车间调度问题研究[J]. 工业工程,2018,21(6):16-22. (CHEN X,ZHU C J, ZHANG C Y. An open shop scheduling problem based on memetic algorithm[J]. Industrial Engineering Journal,2018,21(6):16-22.) [13] DÍAZ-PARRA O,CRUZ-CHÁVEZ M A. Evolutionary algorithm with intelligent mutation operator that solves the vehicle routing problem of clustered classification with time windows[J]. Polish Journal of Environmental Studies,2008,17(4):91-95. [14] NAGATA Y. New EAX crossover for large TSP instances[M]//RUNARSSON T P,BEYER H G,BURKE E,et al. Parallel Problem Solving from Nature-PPSN IX, LNCS 4193. Berlin:Springer,2006:372-381. [15] NAGATA Y. Edge assembly crossover for the capacitated vehicle routing problem[C]//Proceedings of the 2007 European Conference on Evolutionary Computation in Combinatorial Optimization, LNCS 4446. Berlin:Springer,2007:142-153. [16] KAWULOK M,NALEPA J. Support vector machines training data selection using a genetic algorithm[C]//Proceedings of the 2012 Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition(SPR) and Structural and Syntactic Pattern Recognition (SSPR), LNCS 7626. Berlin:Springer, 2012:557-565. [17] POTVIN J Y, ROUSSEAU J M. An exchange heuristic for routeing problems with time windows[J]. Journal of the Operational Research Society,1995,46(12):1433-1446. |