default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuichi Nagata
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Yuichi Nagata
, Shinji Imahori:
Creation of Dihedral Escher-like Tilings Based on As-Rigid-As-Possible Deformation. ACM Trans. Graph. 43(2): 18:1-18:18 (2024)- [c31]Haichuan Yang, Yifei Yang, Yuxin Zhang, Cheng Tang, Koichi Hashimoto, Yuichi Nagata:
Chaotic Map-Coded Evolutionary Algorithms for Dendritic Neuron Model Optimization. CEC 2024: 1-8 - 2022
- [j14]Yuichi Nagata, Shinji Imahori:
Escherization with Large Deformations Based on As-Rigid-As-Possible Shape Modeling. ACM Trans. Graph. 41(2): 11:1-11:16 (2022) - 2020
- [j13]Yuichi Nagata, Shinji Imahori:
An Efficient Exhaustive Search Algorithm for the Escherization Problem. Algorithmica 82(9): 2502-2534 (2020) - [j12]Yuichi Nagata, Akinori Imamiya, Norihiko Ono:
A genetic algorithm for the picture maze generation problem. Comput. Oper. Res. 115: 104860 (2020) - [j11]Yuichi Nagata:
High-Order Entropy-Based Population Diversity Measures in the Traveling Salesman Problem. Evol. Comput. 28(4): 595-619 (2020) - [i3]Yuichi Nagata, Shinji Imahori:
Escherization with Generalized Distance Functions Focusing on Local Structural Similarity. CoRR abs/2011.10175 (2020)
2010 – 2019
- 2019
- [i2]Yuichi Nagata, Shinji Imahori:
An Efficient Algorithm for the Escherization Problem in the Polygon Representation. CoRR abs/1912.09605 (2019) - 2018
- [j10]Yuichi Nagata, Isao Ono:
A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem. Comput. Oper. Res. 90: 60-71 (2018) - [j9]Yuichi Nagata:
Random partial neighborhood search for the post-enrollment course timetabling problem. Comput. Oper. Res. 90: 84-96 (2018) - [c30]Yuichi Nagata:
Escherization with a Distance Function Focusing on the Similarity of Local Structure. PPSN (1) 2018: 108-120 - 2016
- [c29]Yuichi Nagata:
Population Diversity Measures Based on Variable-Order Markov Models for the Traveling Salesman Problem. PPSN 2016: 973-983 - 2014
- [c28]Yuichi Nagata, Isao Ono:
Random Partial Neighborhood Search for University Course Timetabling Problem. PPSN 2014: 782-791 - 2013
- [j8]Yuichi Nagata, Shigenobu Kobayashi:
A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem. INFORMS J. Comput. 25(2): 346-363 (2013) - [j7]Kazuyuki Masutomi, Yuichi Nagata, Isao Ono:
An Evolutionary Algorithm for Black-Box Chance-Constrained Function Optimization. J. Adv. Comput. Intell. Intell. Informatics 17(2): 272-282 (2013) - [c27]Kazuma Honda, Yuichi Nagata, Isao Ono:
A parallel genetic algorithm with edge assembly crossover for 100, 000-city scale TSPs. IEEE Congress on Evolutionary Computation 2013: 1278-1285 - [c26]Kazuyuki Masutomi, Yuichi Nagata, Isao Ono:
Extending distance-weighted exponential natural evolution strategy for function optimization in uncertain environments. IEEE Congress on Evolutionary Computation 2013: 2122-2129 - [c25]Kento Uemura, Naotoshi Nakashima, Yuichi Nagata, Isao Ono:
A new real-coded genetic algorithm for implicit constrained black-box function optimization. IEEE Congress on Evolutionary Computation 2013: 2887-2894 - [c24]Yuichi Nagata, Isao Ono:
High-Order Sequence Entropies for Measuring Population Diversity in the Traveling Salesman Problem. EvoCOP 2013: 179-190 - 2012
- [j6]Youhei Akimoto, Yuichi Nagata, Isao Ono, Shigenobu Kobayashi:
Theoretical Foundation for CMA-ES from Information Geometry Perspective. Algorithmica 64(4): 698-716 (2012) - [j5]Yuichi Nagata, David Soler:
A new genetic algorithm for the asymmetric traveling salesman problem. Expert Syst. Appl. 39(10): 8947-8953 (2012) - [c23]Ryo Miyazaki, Naoki Hamada, Yuichi Nagata, Isao Ono:
A new Pareto frontier covering strategy in FS-MOGA for multi-objective function optimization. SCIS&ISIS 2012: 1888-1893 - [i1]Youhei Akimoto, Yuichi Nagata, Isao Ono, Shigenobu Kobayashi:
Theoretical foundation for CMA-ES from information geometric perspective. CoRR abs/1206.0730 (2012) - 2011
- [j4]Olli Bräysy, Eulalia Martínez, Yuichi Nagata, David Soler:
The mixed capacitated general routing problem with turn penalties. Expert Syst. Appl. 38(10): 12954-12966 (2011) - [c22]Nobusumi Fukushima, Yuichi Nagata, Shigenobu Kobayashi, Isao Ono:
Proposal of distance-weighted exponential natural evolution strategies. IEEE Congress on Evolutionary Computation 2011: 164-171 - [c21]Naoki Hamada, Yuichi Nagata, Shigenobu Kobayashi, Isao Ono:
On scalability of Adaptive Weighted Aggregation for multiobjective function optimization. IEEE Congress on Evolutionary Computation 2011: 669-678 - [c20]Kento Uemura, Shun-ichi Kinoshita, Yuichi Nagata, Shigenobu Kobayashi, Isao Ono:
A new framework taking account of multi-funnel functions for Real-coded Genetic Algorithms. IEEE Congress on Evolutionary Computation 2011: 2091-2098 - [c19]Naoki Hamada, Yuichi Nagata, Shigenobu Kobayashi, Isao Ono:
Adaptive Weighted Aggregation 2: More scalable AWA for multiobjective function optimization. IEEE Congress on Evolutionary Computation 2011: 2375-2382 - 2010
- [j3]Yuichi Nagata, Olli Bräysy, Wout Dullaert:
A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Comput. Oper. Res. 37(4): 724-737 (2010) - [c18]Naoki Hamada, Yuichi Nagata, Shigenobu Kobayashi, Isao Ono:
Adaptive weighted aggregation: A multiobjective function optimization framework taking account of spread and evenness of approximate solutions. IEEE Congress on Evolutionary Computation 2010: 1-8 - [c17]Naoya Karatsu, Yuichi Nagata, Isao Ono, Shigenobu Kobayashi:
Globally multimodal function optimization by Real-Coded Genetic Algorithms using traps. IEEE Congress on Evolutionary Computation 2010: 1-8 - [c16]Yuichi Nagata, Shigenobu Kobayashi:
Guided Ejection Search for the Pickup and Delivery Problem with Time Windows. EvoCOP 2010: 202-213 - [c15]Youhei Akimoto, Yuichi Nagata, Isao Ono, Shigenobu Kobayashi:
Theoretical analysis of evolutionary computation on continuously differentiable functions. GECCO 2010: 1401-1408 - [c14]Atsushi Miyamae, Yuichi Nagata, Isao Ono, Shigenobu Kobayashi:
Natural Policy Gradient Methods with Parameter-based Exploration for Control Tasks. NIPS 2010: 1660-1668 - [c13]Youhei Akimoto, Yuichi Nagata, Isao Ono, Shigenobu Kobayashi:
Bidirectional Relation between CMA Evolution Strategies and Natural Evolution Strategies. PPSN (1) 2010: 154-163 - [c12]Yuichi Nagata, Shigenobu Kobayashi:
A Memetic Algorithm for the Pickup and Delivery Problem with Time Windows Using Selective Route Exchange Crossover. PPSN (1) 2010: 536-545
2000 – 2009
- 2009
- [j2]Yuichi Nagata, Olli Bräysy:
Edge assembly-based memetic algorithm for the capacitated vehicle routing problem. Networks 54(4): 205-215 (2009) - [j1]Yuichi Nagata, Olli Bräysy:
A powerful route minimization heuristic for the vehicle routing problem with time windows. Oper. Res. Lett. 37(5): 333-338 (2009) - [c11]Yuichi Nagata, Satoshi Tojo:
Guided Ejection Search for the Job Shop Scheduling Problem. EvoCOP 2009: 168-179 - 2008
- [c10]Yuichi Nagata, Olli Bräysy:
Efficient Local Search Limitation Strategies for Vehicle Routing Problems. EvoCOP 2008: 48-60 - 2007
- [c9]Yuichi Nagata:
Efficient evolutionary algorithm for the vehicle routing problem with time windows: edge assembly crossover for the VRPTW. IEEE Congress on Evolutionary Computation 2007: 1175-1182 - [c8]Yuichi Nagata:
Edge Assembly Crossover for the Capacitated Vehicle Routing Problem. EvoCOP 2007: 142-153 - 2006
- [c7]Yuichi Nagata:
Niching Method for Combinatorial Optimization Problems and Application to JSP. IEEE Congress on Evolutionary Computation 2006: 2822-2829 - [c6]Yuichi Nagata:
Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems. EvoCOP 2006: 171-182 - [c5]Yuichi Nagata:
New EAX Crossover for Large TSP Instances. PPSN 2006: 372-381 - 2004
- [c4]Yuichi Nagata:
Criteria for designing crossovers for TSP. IEEE Congress on Evolutionary Computation 2004: 1465-1472 - [c3]Yuichi Nagata:
The Lens Design Using the CMA-ES Algorithm. GECCO (2) 2004: 1189-1200 - [c2]Yuichi Nagata:
The EAX Algorithm Considering Diversity Loss. PPSN 2004: 332-341
1990 – 1999
- 1997
- [c1]Yuichi Nagata, Shigenobu Kobayashi:
Edge Assembly Crossover: A High-Power Genetic Algorithm for the Travelling Salesman Problem. ICGA 1997: 450-457
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-21 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
