| Edge Assembly Crossover: A High-power Genetic Algorithm fot the Traveling Salesman Problem Y Nagata Proceedings of the 7th International Conference on Genetic Algorithms, 1997, 1997 | 271 | 1997 |
| 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 | 264 | 2010 |
| 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 | 138 | 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 | 126 | 2009 |
| 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 | 116 | 2009 |
| A new genetic algorithm for the asymmetric traveling salesman problem Y Nagata, D Soler Expert Systems with Applications 39 (10), 8947-8953, 2012 | 103 | 2012 |
| Edge assembly crossover for the capacitated vehicle routing problem Y Nagata European Conference on Evolutionary Computation in Combinatorial …, 2007 | 89 | 2007 |
| Bidirectional relation between CMA evolution strategies and natural evolution strategies Y Akimoto, Y Nagata, I Ono, S Kobayashi International Conference on Parallel Problem Solving from Nature, 154-163, 2010 | 84 | 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 (3), 311-322, 2011 | 65 | 2011 |
| New EAX crossover for large TSP instances Y Nagata Parallel Problem Solving from Nature-PPSN IX, 372-381, 2006 | 50 | 2006 |
| Theoretical foundation for CMA-ES from information geometry perspective Y Akimoto, Y Nagata, I Ono, S Kobayashi Algorithmica 64 (4), 698-716, 2012 | 46 | 2012 |
| The Proposal and Evaluation of a Crossover for Traveling Salesman Problems' Edge Assembly Crossover Y Nagata, S Kobayashi JOURNAL-JAPANESE SOCIETY FOR ARTIFICIAL INTELLIGENCE 14, 848-859, 1999 | 40 | 1999 |
| A genetic algorithm taking account of characteristics preservation for job shop scheduling problems I Ono Proc. of the International Conference on Intelligent Autonomous Systems, 1998, 1998 | 36 | 1998 |
| Guided ejection search for the pickup and delivery problem with time windows Y Nagata, S Kobayashi European Conference on Evolutionary Computation in Combinatorial …, 2010 | 33 | 2010 |
| Efficient local search limitation strategies for vehicle routing problems Y Nagata, O Bräysy European Conference on Evolutionary Computation in Combinatorial …, 2008 | 32 | 2008 |
| 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 | 30 | 2010 |
| 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 | 27 | 1999 |
| Fast EAX algorithm considering population diversity for traveling salesman problems Y Nagata European Conference on Evolutionary Computation in Combinatorial …, 2006 | 26 | 2006 |
| The mixed capacitated general routing problem with turn penalties O Bräysy, E Martínez, Y Nagata, D Soler Expert Systems with Applications 38 (10), 12954-12966, 2011 | 24 | 2011 |
| 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, 1660-1668, 2010 | 21 | 2010 |
