A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows Y Nagata, O Bräysy, W Dullaert Computers & operations research 37 (4), 724-737, 2010 | 343 | 2010 |
Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem Y Nagata Proceedings of the 7th Internatinal Conferencenon Genetic Algorithms, 450-457, 1997 | 313 | 1997 |
A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem Y Nagata, S Kobayashi INFORMS Journal on Computing 25 (2), 346-363, 2013 | 202 | 2013 |
Edge assembly‐based memetic algorithm for the capacitated vehicle routing problem Y Nagata, O Bräysy Networks: An International Journal 54 (4), 205-215, 2009 | 158 | 2009 |
A new genetic algorithm for the asymmetric traveling salesman problem Y Nagata, D Soler Expert Systems with Applications 39 (10), 8947-8953, 2012 | 133 | 2012 |
A powerful route minimization heuristic for the vehicle routing problem with time windows Y Nagata, O Bräysy Operations Research Letters 37 (5), 333-338, 2009 | 132 | 2009 |
Bidirectional relation between CMA evolution strategies and natural evolution strategies Y Akimoto, Y Nagata, I Ono, S Kobayashi Parallel Problem Solving from Nature, PPSN XI: 11th International Conference …, 2010 | 121 | 2010 |
A new weather-routing system that accounts for ship stability based on a real-coded genetic algorithm A Maki, Y Akimoto, Y Nagata, S Kobayashi, E Kobayashi, S Shiotani, ... Journal of marine science and technology 16, 311-322, 2011 | 111 | 2011 |
Edge assembly crossover for the capacitated vehicle routing problem Y Nagata European conference on evolutionary computation in combinatorial …, 2007 | 99 | 2007 |
Theoretical foundation for CMA-ES from information geometry perspective Y Akimoto, Y Nagata, I Ono, S Kobayashi Algorithmica 64, 698-716, 2012 | 79 | 2012 |
New EAX crossover for large TSP instances Y Nagata International Conference on Parallel Problem Solving from Nature, 372-381, 2006 | 56 | 2006 |
The proposal and evaluation of a crossover for traveling salesman problems: Edge assembly crossover Y Nagata Trans. Jpn. Soc. Artif. Intell. 14 (5), 848, 1999 | 44 | 1999 |
A memetic algorithm for the pickup and delivery problem with time windows using selective route exchange crossover Y Nagata, S Kobayashi International Conference on Parallel Problem Solving from Nature, 536-545, 2010 | 40 | 2010 |
Guided ejection search for the pickup and delivery problem with time windows Y Nagata, S Kobayashi Evolutionary Computation in Combinatorial Optimization: 10th European …, 2010 | 40 | 2010 |
Efficient local search limitation strategies for vehicle routing problems Y Nagata, O Bräysy European Conference on Evolutionary Computation in Combinatorial …, 2008 | 37 | 2008 |
A genetic algorithm taking account of characteristics preservation for job shop scheduling problems ONO Isao Proc. of the International Conference on Intelligent Autonomous Systems 5 …, 1998 | 35 | 1998 |
A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem Y Nagata, I Ono Computers & Operations Research 90, 60-71, 2018 | 34 | 2018 |
Random partial neighborhood search for the post-enrollment course timetabling problem Y Nagata Computers & Operations Research 90, 84-96, 2018 | 32 | 2018 |
An analysis of edge assembly crossover for the traveling salesman problem Y Nagata, S Kobayashi IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on …, 1999 | 31 | 1999 |
Natural policy gradient methods with parameter-based exploration for control tasks A Miyamae, Y Nagata, I Ono, S Kobayashi Advances in neural information processing systems 23, 2010 | 30 | 2010 |