A Memetic Algorithm for the Pickup and Delivery Problem with Time Windows Using Selective Route Exchange Crossover
暂无分享,去创建一个
[1] Paul Shaw,et al. Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.
[2] Principles and Practice of Constraint Programming — CP98 , 1999, Lecture Notes in Computer Science.
[3] Andrew Lim,et al. A metaheuristic for the pickup and delivery problem with time windows , 2001, Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001.
[4] Olli Bräysy,et al. Active guided evolution strategies for large-scale vehicle routing problems with time windows , 2005, Comput. Oper. Res..
[5] Russell Bent,et al. A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows , 2006, Comput. Oper. Res..
[6] David Pisinger,et al. An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..
[7] Jens Gottlieb,et al. Evolutionary Computation in Combinatorial Optimization , 2006, Lecture Notes in Computer Science.
[8] Hideki Hashimoto,et al. An iterated local search algorithm for the time-dependent vehicle routing problem with time windows , 2008, Discret. Optim..
[9] Yuichi Nagata,et al. Efficient Local Search Limitation Strategies for Vehicle Routing Problems , 2008, EvoCOP.
[10] Guy Desaulniers,et al. A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows , 2009, Networks.
[11] Shigenobu Kobayashi,et al. Guided Ejection Search for the Pickup and Delivery Problem with Time Windows , 2010, EvoCOP.
[12] Wout Dullaert,et al. A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows , 2010, Comput. Oper. Res..