default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNoritaka Tsukamoto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j5]Hisao Ishibuchi
, Yuji Sakane, Noritaka Tsukamoto, Yusuke Nojima:
Implementation of cellular genetic algorithms with two neighborhood structures for single-objective and multi-objective optimization. Soft Comput. 15(9): 1749-1767 (2011)- 2010
- [j4]Hisao Ishibuchi, Noritaka Tsukamoto, Yusuke Nojima:
Diversity Improvement by Non-Geometric Binary Crossover in Evolutionary Multiobjective Optimization. IEEE Trans. Evol. Comput. 14(6): 985-998 (2010) - [c21]Hisao Ishibuchi, Yuji Sakane, Noritaka Tsukamoto, Yusuke Nojima:
Simultaneous use of different scalarizing functions in MOEA/D. GECCO 2010: 519-526 - [c20]Hisao Ishibuchi, Noritaka Tsukamoto, Yuji Sakane, Yusuke Nojima:
Indicator-based evolutionary algorithm with hypervolume approximation by achievement scalarizing functions. GECCO 2010: 527-534 - [c19]Hisao Ishibuchi, Yasuhiro Hitotsuyanagi, Noritaka Tsukamoto, Yusuke Nojima:
Many-Objective Test Problems to Visually Examine the Behavior of Multiobjective Evolution in a Decision Space. PPSN (2) 2010: 91-100
2000 – 2009
- 2009
- [j3]Noritaka Tsukamoto, Yusuke Nojima, Hisao Ishibuchi:
Effects of nongeometric binary crossover on multiobjective 0/1 knapsack problems. Artif. Life Robotics 13(2): 434-437 (2009) - [j2]Hisao Ishibuchi, Yasuhiro Hitotsuyanagi, Noritaka Tsukamoto, Yusuke Nojima:
Use of biased neighborhood structures in multiobjective memetic algorithms. Soft Comput. 13(8-9): 795-810 (2009) - [c18]Hisao Ishibuchi, Noritaka Tsukamoto, Yuji Sakane, Yusuke Nojima:
Hypervolume approximation using achievement scalarizing functions for evolutionary many-objective optimization. IEEE Congress on Evolutionary Computation 2009: 530-537 - [c17]Hisao Ishibuchi, Yuji Sakane, Noritaka Tsukamoto, Yusuke Nojima:
Effects of using two neighborhood structures on the performance of cellular evolutionary algorithms for many-objective optimization. IEEE Congress on Evolutionary Computation 2009: 2508-2515 - [c16]Hisao Ishibuchi, Yuji Sakane, Noritaka Tsukamoto, Yusuke Nojima:
Adaptation of Scalarizing Functions in MOEA/D: An Adaptive Scalarizing Function-Based Multiobjective Evolutionary Algorithm. EMO 2009: 438-452 - [c15]Hisao Ishibuchi, Yuji Sakane, Noritaka Tsukamoto, Yusuke Nojima:
Selecting a small number of representative non-dominated solutions by a hypervolume-based solution selection approach. FUZZ-IEEE 2009: 1609-1614 - [c14]Hisao Ishibuchi, Yuji Sakane, Noritaka Tsukamoto, Yusuke Nojima:
Single-objective and multi-objective formulations of solution selection for hypervolume maximization. GECCO 2009: 1831-1832 - [c13]Hisao Ishibuchi, Yuji Sakane, Noritaka Tsukamoto, Yusuke Nojima:
Evolutionary Many-Objective Optimization by NSGA-II and MOEA/D with Large Populations. SMC 2009: 1758-1763 - [c12]Hisao Ishibuchi, Noritaka Tsukamoto, Yusuke Nojima:
Empirical Analysis of Using Weighted Sum Fitness Functions in NSGA-II for Many-Objective 0/1 Knapsack Problems. UKSim 2009: 71-76 - 2008
- [j1]Hisao Ishibuchi, Kaname Narukawa, Noritaka Tsukamoto, Yusuke Nojima:
An empirical study on similarity-based mating for evolutionary multiobjective combinatorial optimization. Eur. J. Oper. Res. 188(1): 57-75 (2008) - [c11]Hisao Ishibuchi, Noritaka Tsukamoto, Yusuke Nojima:
Evolutionary many-objective optimization: A short review. IEEE Congress on Evolutionary Computation 2008: 2419-2426 - [c10]Hisao Ishibuchi, Noritaka Tsukamoto, Yasuhiro Hitotsuyanagi, Yusuke Nojima:
Effectiveness of scalability improvement attempts on the performance of NSGA-II for many-objective problems. GECCO 2008: 649-656 - [c9]Hisao Ishibuchi, Noritaka Tsukamoto, Yusuke Nojima:
Maintaining the diversity of solutions by non-geometric binary crossover: a worst one-max solver competition case study. GECCO 2008: 1111-1112 - [c8]Hisao Ishibuchi, Noritaka Tsukamoto, Yusuke Nojima:
Evolutionary many-objective optimization. GEFS 2008: 47-52 - [c7]Hisao Ishibuchi, Noritaka Tsukamoto, Yusuke Nojima:
Examining the Effect of Elitism in Cellular Genetic Algorithms Using Two Neighborhood Structures. PPSN 2008: 458-467 - [c6]Hisao Ishibuchi, Yasuhiro Hitotsuyanagi, Noritaka Tsukamoto, Yusuke Nojima:
Use of Heuristic Local Search for Single-Objective Optimization in Multiobjective Memetic Algorithms. PPSN 2008: 743-752 - [c5]Hisao Ishibuchi, Noritaka Tsukamoto, Yusuke Nojima:
Use of Local Ranking in Cellular Genetic Algorithms with Two Neighborhood Structures. SEAL 2008: 309-318 - [c4]Hisao Ishibuchi, Noritaka Tsukamoto, Yusuke Nojima:
Behavior of Evolutionary Many-Objective Optimization. UKSim 2008: 266-271 - 2007
- [c3]Hisao Ishibuchi, Noritaka Tsukamoto, Yusuke Nojima:
Iterative approach to indicator-based multiobjective optimization. IEEE Congress on Evolutionary Computation 2007: 3967-3974 - [c2]Hisao Ishibuchi, Yusuke Nojima, Noritaka Tsukamoto, Ken Ohara:
Effects of the use of non-geometric binary crossover on evolutionary multiobjective optimization. GECCO 2007: 829-836 - [c1]Hisao Ishibuchi, Noritaka Tsukamoto, Yusuke Nojima:
Choosing extreme parents for diversity improvement in evolutionary multiobjective optimization algorithms. SMC 2007: 1946-1951
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-05-08 21:00 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:
