http://www.emse.fr/~picard/publications/riviere13loom.pdfInternational audienceEngineering optimization often involves one or many computationally intensive softwares that must be called to calculate the performance of candidate solutions. Despite the calculation cost, it is useful to characterize the global and the local optima. A new algorithm is described here that searches for all the local optima in a reduced number of calls to the true performance functions. The algorithm is based on repeated local searches on metamodels of the true performance functions and called LOOM (LOcal Optima through Metamodels). The local optima are identified as an output of the search. The search distributes computational resources equally among the basins ...
Local search is an integral part of many meta-heuristic strategies that solve single objective optim...
The Electromagnetism-like (EM) algorithm, developed by Birbil and Fang [31 is a population-based sto...
When comparing various metaheuristics, even asking a fair and formally consis-tent question is often...
http://www.emse.fr/~picard/publications/riviere13loom.pdfInternational audienceEngineering optimizat...
The codebase for this paper is available at https://github.com/fieldsend/local_optima_networksThere...
Les problèmes d'optimisation combinatoire sont généralement NP-difficiles et les méthodes exactes de...
This paper describes algorithms that learn to improve search performance on large-scale optimization...
In many optimization problems, the structure of solutions reflects complex relationships between the...
This is the author accepted manuscript. The final version is available from ACM via the DOI in this ...
AbstractExpensive optimization aims to find the global minimum of a given function within a very lim...
This book covers local search for combinatorial optimization and its extension to mixed-variable opt...
Many practical optimization problems are dynamically changing, and require a tracking of the global ...
AbstractSimulation-based optimization combines simulation experiments used to evaluate the objective...
Application-specific, parameterized local search algorithms (PLSAs), in which optimization accuracy ...
The Electromagnetism-like (EM) algorithm, developed by Birbil and Fang [2] is a population-based sto...
Local search is an integral part of many meta-heuristic strategies that solve single objective optim...
The Electromagnetism-like (EM) algorithm, developed by Birbil and Fang [31 is a population-based sto...
When comparing various metaheuristics, even asking a fair and formally consis-tent question is often...
http://www.emse.fr/~picard/publications/riviere13loom.pdfInternational audienceEngineering optimizat...
The codebase for this paper is available at https://github.com/fieldsend/local_optima_networksThere...
Les problèmes d'optimisation combinatoire sont généralement NP-difficiles et les méthodes exactes de...
This paper describes algorithms that learn to improve search performance on large-scale optimization...
In many optimization problems, the structure of solutions reflects complex relationships between the...
This is the author accepted manuscript. The final version is available from ACM via the DOI in this ...
AbstractExpensive optimization aims to find the global minimum of a given function within a very lim...
This book covers local search for combinatorial optimization and its extension to mixed-variable opt...
Many practical optimization problems are dynamically changing, and require a tracking of the global ...
AbstractSimulation-based optimization combines simulation experiments used to evaluate the objective...
Application-specific, parameterized local search algorithms (PLSAs), in which optimization accuracy ...
The Electromagnetism-like (EM) algorithm, developed by Birbil and Fang [2] is a population-based sto...
Local search is an integral part of many meta-heuristic strategies that solve single objective optim...
The Electromagnetism-like (EM) algorithm, developed by Birbil and Fang [31 is a population-based sto...
When comparing various metaheuristics, even asking a fair and formally consis-tent question is often...