Cargando…
Pareto-like sequential sampling heuristic for global optimisation
In this paper, we propose a simple global optimisation algorithm inspired by Pareto’s principle. This algorithm samples most of its solutions within prominent search domains and is equipped with a self-adaptive mechanism to control the dynamic tightening of the prominent domains while the greediness...
Autores principales: | Shaqfa, Mahmoud, Beyer, Katrin |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Berlin Heidelberg
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8550146/ https://www.ncbi.nlm.nih.gov/pubmed/34720704 http://dx.doi.org/10.1007/s00500-021-05853-8 |
Ejemplares similares
-
Graph-based molecular Pareto optimisation
por: Verhellen, Jonas
Publicado: (2022) -
gcFront: a tool for determining a Pareto front of growth-coupled cell factory designs
por: Legon, Laurence, et al.
Publicado: (2022) -
The reliability analysis based on the generalized intuitionistic fuzzy two-parameter Pareto distribution
por: Roohanizadeh, Zahra, et al.
Publicado: (2022) -
Inferring Pareto-optimal reconciliations across multiple event costs under the duplication-loss-coalescence model
por: Mawhorter, Ross, et al.
Publicado: (2019) -
Taking the Shortcut: Simplifying Heuristics in Discrete Choice Experiments
por: Veldwijk, Jorien, et al.
Publicado: (2023)