Yuichi Nagata

Orcid: 0000-0001-7582-2699

According to our database1, Yuichi Nagata authored at least 47 papers between 1997 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Escherization with Large Deformations Based on As-Rigid-As-Possible Shape Modeling.
ACM Trans. Graph., 2022

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

Escherization with Generalized Distance Functions Focusing on Local Structural Similarity.
CoRR, 2020

A genetic algorithm for the picture maze generation problem.
Comput. Oper. Res., 2020

An Efficient Exhaustive Search Algorithm for the Escherization Problem.
Algorithmica, 2020

2019
An Efficient Algorithm for the Escherization Problem in the Polygon Representation.
CoRR, 2019

2018
A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem.
Comput. Oper. Res., 2018

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

Escherization with a Distance Function Focusing on the Similarity of Local Structure.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

2016
Population Diversity Measures Based on Variable-Order Markov Models for the Traveling Salesman Problem.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

2014
Random Partial Neighborhood Search for University Course Timetabling Problem.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIII, 2014

2013
An Evolutionary Algorithm for Black-Box Chance-Constrained Function Optimization.
J. Adv. Comput. Intell. Intell. Informatics, 2013

A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem.
INFORMS J. Comput., 2013

High-Order Sequence Entropies for Measuring Population Diversity in the Traveling Salesman Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2013

A new real-coded genetic algorithm for implicit constrained black-box function optimization.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

Extending distance-weighted exponential natural evolution strategy for function optimization in uncertain environments.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

A parallel genetic algorithm with edge assembly crossover for 100, 000-city scale TSPs.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

2012
A new genetic algorithm for the asymmetric traveling salesman problem.
Expert Syst. Appl., 2012

Theoretical foundation for CMA-ES from information geometric perspective
CoRR, 2012

Theoretical Foundation for CMA-ES from Information Geometry Perspective.
Algorithmica, 2012

A new Pareto frontier covering strategy in FS-MOGA for multi-objective function optimization.
Proceedings of the 6th International Conference on Soft Computing and Intelligent Systems (SCIS), 2012

2011
The mixed capacitated general routing problem with turn penalties.
Expert Syst. Appl., 2011

A new framework taking account of multi-funnel functions for Real-coded Genetic Algorithms.
Proceedings of the IEEE Congress on Evolutionary Computation, 2011

Adaptive Weighted Aggregation 2: More scalable AWA for multiobjective function optimization.
Proceedings of the IEEE Congress on Evolutionary Computation, 2011

On scalability of Adaptive Weighted Aggregation for multiobjective function optimization.
Proceedings of the IEEE Congress on Evolutionary Computation, 2011

Proposal of distance-weighted exponential natural evolution strategies.
Proceedings of the IEEE Congress on Evolutionary Computation, 2011

2010
A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows.
Comput. Oper. Res., 2010

A Memetic Algorithm for the Pickup and Delivery Problem with Time Windows Using Selective Route Exchange Crossover.
Proceedings of the Parallel Problem Solving from Nature, 2010

Bidirectional Relation between CMA Evolution Strategies and Natural Evolution Strategies.
Proceedings of the Parallel Problem Solving from Nature, 2010

Natural Policy Gradient Methods with Parameter-based Exploration for Control Tasks.
Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

Theoretical analysis of evolutionary computation on continuously differentiable functions.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Guided Ejection Search for the Pickup and Delivery Problem with Time Windows.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2010

Globally multimodal function optimization by Real-Coded Genetic Algorithms using traps.
Proceedings of the IEEE Congress on Evolutionary Computation, 2010

Adaptive weighted aggregation: A multiobjective function optimization framework taking account of spread and evenness of approximate solutions.
Proceedings of the IEEE Congress on Evolutionary Computation, 2010

2009
A powerful route minimization heuristic for the vehicle routing problem with time windows.
Oper. Res. Lett., 2009

Edge assembly-based memetic algorithm for the capacitated vehicle routing problem.
Networks, 2009

Guided Ejection Search for the Job Shop Scheduling Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2009

2008
Efficient Local Search Limitation Strategies for Vehicle Routing Problems.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2008

2007
Edge Assembly Crossover for the Capacitated Vehicle Routing Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2007

Efficient evolutionary algorithm for the vehicle routing problem with time windows: edge assembly crossover for the VRPTW.
Proceedings of the IEEE Congress on Evolutionary Computation, 2007

2006
New EAX Crossover for Large TSP Instances.
Proceedings of the Parallel Problem Solving from Nature, 2006

Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2006

Niching Method for Combinatorial Optimization Problems and Application to JSP.
Proceedings of the IEEE International Conference on Evolutionary Computation, 2006

2004
The EAX Algorithm Considering Diversity Loss.
Proceedings of the Parallel Problem Solving from Nature, 2004

The Lens Design Using the CMA-ES Algorithm.
Proceedings of the Genetic and Evolutionary Computation, 2004

Criteria for designing crossovers for TSP.
Proceedings of the IEEE Congress on Evolutionary Computation, 2004

1997
Edge Assembly Crossover: A High-Power Genetic Algorithm for the Travelling Salesman Problem.
Proceedings of the 7th International Conference on Genetic Algorithms, 1997


  Loading...