Edge Assembly Crossover: A High-Power Genetic Algorithm for the Travelling Salesman Problem. - Yuichi Nagata; Shigenobu Kobayashi (ICGA, 1997)

Criteria for designing crossovers for TSP. - Yuichi Nagata (IEEE Congress on Evolutionary Computation, 2004)

The Lens Design Using the CMA-ES Algorithm. - Yuichi Nagata (GECCO (2), 2004)

The EAX Algorithm Considering Diversity Loss. - Yuichi Nagata (PPSN, 2004)

Niching Method for Combinatorial Optimization Problems and Application to JSP. - Yuichi Nagata (IEEE Congress on Evolutionary Computation, 2006)

Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems. - Yuichi Nagata (EvoCOP, 2006)

New EAX Crossover for Large TSP Instances. - Yuichi Nagata (PPSN, 2006)

Efficient evolutionary algorithm for the vehicle routing problem with time windows: edge assembly crossover for the VRPTW. - Yuichi Nagata (IEEE Congress on Evolutionary Computation, 2007)

Edge Assembly Crossover for the Capacitated Vehicle Routing Problem. - Yuichi Nagata (EvoCOP, 2007)

Efficient Local Search Limitation Strategies for Vehicle Routing Problems. - Yuichi Nagata; Olli Bräysy (EvoCOP, 2008)

Guided Ejection Search for the Job Shop Scheduling Problem. - Yuichi Nagata; Satoshi Tojo (EvoCOP, 2009)

Edge assembly-based memetic algorithm for the capacitated vehicle routing problem. - Yuichi Nagata; Olli Bräysy (Networks, 2009)

A powerful route minimization heuristic for the vehicle routing problem with time windows. - Yuichi Nagata; Olli Bräysy (Oper. Res. Lett., 2009)

Adaptive weighted aggregation: A multiobjective function optimization framework taking account of spread and evenness of approximate solutions. - Naoki Hamada; Yuichi Nagata; Shigenobu Kobayashi; Isao Ono (IEEE Congress on Evolutionary Computation, 2010)

Globally multimodal function optimization by Real-Coded Genetic Algorithms using traps. - Naoya Karatsu; Yuichi Nagata; Isao Ono; Shigenobu Kobayashi (IEEE Congress on Evolutionary Computation, 2010)

Guided Ejection Search for the Pickup and Delivery Problem with Time Windows. - Yuichi Nagata; Shigenobu Kobayashi (EvoCOP, 2010)

Theoretical analysis of evolutionary computation on continuously differentiable functions. - Youhei Akimoto; Yuichi Nagata; Isao Ono; Shigenobu Kobayashi (GECCO, 2010)

Natural Policy Gradient Methods with Parameter-based Exploration for Control Tasks. - Atsushi Miyamae; Yuichi Nagata; Isao Ono; Shigenobu Kobayashi (NIPS, 2010)

Bidirectional Relation between CMA Evolution Strategies and Natural Evolution Strategies. - Youhei Akimoto; Yuichi Nagata; Isao Ono; Shigenobu Kobayashi (PPSN (1), 2010)

A Memetic Algorithm for the Pickup and Delivery Problem with Time Windows Using Selective Route Exchange Crossover. - Yuichi Nagata; Shigenobu Kobayashi (PPSN (1), 2010)

A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. - Yuichi Nagata; Olli Bräysy; Wout Dullaert (Comput. Oper. Res., 2010)

Proposal of distance-weighted exponential natural evolution strategies. - Nobusumi Fukushima; Yuichi Nagata; Shigenobu Kobayashi; Isao Ono (IEEE Congress on Evolutionary Computation, 2011)

On scalability of Adaptive Weighted Aggregation for multiobjective function optimization. - Naoki Hamada; Yuichi Nagata; Shigenobu Kobayashi; Isao Ono (IEEE Congress on Evolutionary Computation, 2011)

Adaptive Weighted Aggregation 2: More scalable AWA for multiobjective function optimization. - Naoki Hamada; Yuichi Nagata; Shigenobu Kobayashi; Isao Ono (IEEE Congress on Evolutionary Computation, 2011)

A new framework taking account of multi-funnel functions for Real-coded Genetic Algorithms. - Kento Uemura; Shun-ichi Kinoshita; Yuichi Nagata; Shigenobu Kobayashi; Isao Ono (IEEE Congress on Evolutionary Computation, 2011)

The mixed capacitated general routing problem with turn penalties. - Olli Bräysy; Eulalia Martínez; Yuichi Nagata; David Soler (Expert Syst. Appl., 2011)

A new Pareto frontier covering strategy in FS-MOGA for multi-objective function optimization. - Ryo Miyazaki; Naoki Hamada; Yuichi Nagata; Isao Ono (SCIS&ISIS, 2012)

Theoretical Foundation for CMA-ES from Information Geometry Perspective. - Youhei Akimoto; Yuichi Nagata; Isao Ono; Shigenobu Kobayashi (Algorithmica, 2012)

Theoretical foundation for CMA-ES from information geometric perspective - Youhei Akimoto; Yuichi Nagata; Isao Ono; Shigenobu Kobayashi (CoRR, 2012)

A new genetic algorithm for the asymmetric traveling salesman problem. - Yuichi Nagata; David Soler (Expert Syst. Appl., 2012)

A parallel genetic algorithm with edge assembly crossover for 100, 000-city scale TSPs. - Kazuma Honda; Yuichi Nagata; Isao Ono (IEEE Congress on Evolutionary Computation, 2013)

Extending distance-weighted exponential natural evolution strategy for function optimization in uncertain environments. - Kazuyuki Masutomi; Yuichi Nagata; Isao Ono (IEEE Congress on Evolutionary Computation, 2013)

A new real-coded genetic algorithm for implicit constrained black-box function optimization. - Kento Uemura; Naotoshi Nakashima; Yuichi Nagata; Isao Ono (IEEE Congress on Evolutionary Computation, 2013)

High-Order Sequence Entropies for Measuring Population Diversity in the Traveling Salesman Problem. - Yuichi Nagata; Isao Ono (EvoCOP, 2013)

A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem. - Yuichi Nagata; Shigenobu Kobayashi (INFORMS J. Comput., 2013)

An Evolutionary Algorithm for Black-Box Chance-Constrained Function Optimization. - Kazuyuki Masutomi; Yuichi Nagata; Isao Ono (J. Adv. Comput. Intell. Intell. Informatics, 2013)

Random Partial Neighborhood Search for University Course Timetabling Problem. - Yuichi Nagata; Isao Ono (PPSN, 2014)

Population Diversity Measures Based on Variable-Order Markov Models for the Traveling Salesman Problem. - Yuichi Nagata (PPSN, 2016)

Escherization with a Distance Function Focusing on the Similarity of Local Structure. - Yuichi Nagata (PPSN (1), 2018)

Random partial neighborhood search for the post-enrollment course timetabling problem. - Yuichi Nagata (Comput. Oper. Res., 2018)

A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem. - Yuichi Nagata; Isao Ono (Comput. Oper. Res., 2018)

An Efficient Algorithm for the Escherization Problem in the Polygon Representation. - Yuichi Nagata; Shinji Imahori (CoRR, 2019)

An Efficient Exhaustive Search Algorithm for the Escherization Problem. - Yuichi Nagata; Shinji Imahori (Algorithmica, 2020)

A genetic algorithm for the picture maze generation problem. - Yuichi Nagata; Akinori Imamiya; Norihiko Ono (Comput. Oper. Res., 2020)

Escherization with Generalized Distance Functions Focusing on Local Structural Similarity. - Yuichi Nagata; Shinji Imahori (CoRR, 2020)

High-Order Entropy-Based Population Diversity Measures in the Traveling Salesman Problem. - Yuichi Nagata (Evol. Comput., 2020)

Escherization with Large Deformations Based on As-Rigid-As-Possible Shape Modeling. - Yuichi Nagata; Shinji Imahori (ACM Trans. Graph., 2022)

Chaotic Map-Coded Evolutionary Algorithms for Dendritic Neuron Model Optimization. - Haichuan Yang; Yifei Yang; Yuxin Zhang; Cheng Tang 001; Koichi Hashimoto; Yuichi Nagata (CEC, 2024)

Creation of Dihedral Escher-like Tilings Based on As-Rigid-As-Possible Deformation. - Yuichi Nagata; Shinji Imahori (ACM Trans. Graph., 2024)

Chaotic map-coded metaheuristics for metameric variable-length problems. - Haichuan Yang; Haotian Li; Yifei Yang; Naoya Chiba; Shingo Kagami; Koichi Hashimoto; Yuichi Nagata (Genet. Program. Evolvable Mach., 2025)