Zobrazeno 1 - 10
of 22
pro vyhledávání: '"evoluutiolaskenta"'
Publikováno v:
Mathematical and Computational Applications, 28 (2)
Kalyanmoy Deb was born in Udaipur, Tripura, the smallest state of India at the time, in 1963 [...]
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c3016599bf1bb2740c19def7f91fe2ca
https://hdl.handle.net/20.500.11850/613522
https://hdl.handle.net/20.500.11850/613522
Publikováno v:
Complex & Intelligent Systems. 9:1165-1181
Solving multiobjective optimization problems with interactive methods enables a decision maker with domain expertise to direct the search for the most preferred trade-offs with preference information and learn about the problem. There are different i
In offline data-driven multiobjective optimization, no new data is available during the optimization process. Approximation models, also known as surrogates, are built using the provided offline data. A multiobjective evolutionary algorithm can be ut
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5928d01c1c9616934d8fabf43296addb
http://urn.fi/URN:NBN:fi:jyu-202210054798
http://urn.fi/URN:NBN:fi:jyu-202210054798
Autor:
Quoc Bao Diep, Nikolai V. Kuznetsov, Giacomo Innocenti, Vaclav Snasel, Alberto Tesi, Ivan Zelinka, Swagatam Das, Fabio Schoen
Random mechanisms including mutations are an internal part of evolutionary algorithms, which are based on the fundamental ideas of Darwin's theory of evolution as well as Mendel's theory of genetic heritage. In this paper, we debate whether pseudo-ra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::86c16b3be900d8316accda0d9caa4ad9
http://urn.fi/URN:NBN:fi:jyu-202201241254
http://urn.fi/URN:NBN:fi:jyu-202201241254
Publikováno v:
Parallel Problem Solving from Nature – PPSN XVI ISBN: 9783030581145
PPSN (2)
PPSN (2)
Over the years, scalarization functions have been used to solve multiobjective optimization problems by converting them to one or more single objective optimization problem(s). This study proposes a novel idea of solving multiobjective optimization p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ed63a25f6265973d6834ff773c5ecff9
https://doi.org/10.1007/978-3-030-58115-2_17
https://doi.org/10.1007/978-3-030-58115-2_17
Publikováno v:
Applied Soft Computing. 67:558-566
The ultimate goal of learning algorithms is to find the best solution from a search space without testing each and every solution available in the search space. During the evolution process new solutions (children) are produced from existing solution
Publikováno v:
Frontiers of Computer Science. 12(5):950-965
Publikováno v:
Fieldsend, J, Chugh, T, Allmendinger, R & Miettinen, K 2019, A Feature Rich Distance-Based Many-Objective Visualisable Test Problem Generator . in GECCO '19 Proceedings of the Genetic and Evolutionary Computation Conference . The Genetic and Evolutionary Computation Conference, Prague, Czech Republic, 13/07/19 . https://doi.org/10.1145/3321707.3321727
GECCO
GECCO
In optimiser analysis and design it is informative to visualise how a search point/population moves through the design space over time. Visualisable distance-based many-objective optimisation problems have been developed whose design space is in two-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::233d524b45208bbdd9994f644d37d233
https://pure.manchester.ac.uk/ws/files/87967444/From_multi_to_many_objective_optimization_with_objectives_of_non_uniform_latencies.pdf
https://pure.manchester.ac.uk/ws/files/87967444/From_multi_to_many_objective_optimization_with_objectives_of_non_uniform_latencies.pdf
Publikováno v:
High-Performance Simulation-Based Optimization ISBN: 9783030187637
High-Performance Simulation-Based Optimization
High-Performance Simulation-Based Optimization
This chapter presents some recent advances in surrogate-assisted evolutionary optimization of large problems. By large problems, we mean either the number of decision variables is large, or the number of objectives is large, or both. These problems p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8fbbd670daad60b89b917cf2006a5be9
https://doi.org/10.1007/978-3-030-18764-4_8
https://doi.org/10.1007/978-3-030-18764-4_8
Publikováno v:
High-Performance Simulation-Based Optimization ISBN: 9783030187637
High-Performance Simulation-Based Optimization
High-Performance Simulation-Based Optimization
Surrogate-Assisted Evolutionary Algorithms (SAEAs) have been proven to be very effective in solving (synthetic and real-world) computationally expensive optimization problems with a limited number of function evaluations. The two main components of S
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a196139da557fa95b755b5bb9fd56682
https://doi.org/10.1007/978-3-030-18764-4_7
https://doi.org/10.1007/978-3-030-18764-4_7