Results 161 to 170 of about 66,599 (198)
Some of the next articles are maybe not open access.
A Unified Framework for Metaheuristics
2003Over the past decades, a multitude of new search heuristics, often called “metaheuristics” have been proposed, many of them inspired by principles observed in nature. What distinguishes them from random search is primarily that they maintain some sort of memory of the information gathered during the search so far, and that they use this information to ...
Jürgen Branke +2 more
openaire +1 more source
Metaheuristics for Dynamic Optimization
2013This book is an updated effort in summarizing the trending topics and new hot research lines in solving dynamic problems using metaheuristics. An analysis of the present state in solving complex problems quickly draws a clear picture: problems that change in time, having noise and uncertainties in their definition are becoming very important. The tools
Alba, Enrique +2 more
openaire +3 more sources
Metaheuristics for graph bisection
Proceedings of the 11th Annual conference on Genetic and evolutionary computation, 2009This paper compares several metaheuristics on the balanced graph bisection problem and identifies their relative performance on structured test graphs. For this purpose, a Simple implementation of a graph Bisection Iterated Local Search algorithm (SBILS) is introduced. Its results are compared to the well-known Genetic Bisection Algorithm, to the state-
openaire +2 more sources
Journal of Parallel and Distributed Computing, 2013
El-Ghazali Talbi, Geir Hasle
openaire +1 more source
El-Ghazali Talbi, Geir Hasle
openaire +1 more source
Decomposing Metaheuristic Operations
2013Non-exhaustive local search methods are fundamental tools in applied branches of computing such as operations research, and in other applications of optimisation. These problems have proven stubbornly resistant to attempts to find generic meta-heuristic toolkits that are both expressive and computationally efficient for the large problem spaces ...
Richard Senington, David Duke
openaire +1 more source
DESICOM as Metaheuristic Search
2020Decomposition into Simple Components (DESICOM) is a constrained matrix factorization method to decompose asymmetric square data matrices and represent them as combinations of very sparse basis matrices as well as dense asymmetric affinity matrices. When cast as a least squares problem, the process of finding the factor matrices needs special attention ...
openaire +1 more source
Metaheuristic algorithms for PID controller parameters tuning: review, approaches and open problems
Heliyon, 2022Joseph Stephen Bassi +2 more
exaly
This volume constitutes the refereed proceedings of Metaheuristics on 15th International Conference, MIC 2024, held in Lorient, France, during June 4–7, 2024.The 36 full papers presented together with 34 short papers were carefully reviewed and selected from 127 submissions. The conference focuses on artificial intelligence, combinatorial optimization,
Sevaux, Marc +4 more
openaire +1 more source
Sevaux, Marc +4 more
openaire +1 more source
Towards Metaheuristic Scheduling Techniques in Cloud and Fog: An Extensive Taxonomic Review
ACM Computing Surveys, 2023Raj Mohan Singh +2 more
exaly