Metaheuristics in combinatorial optimization: Overview and conceptual comparison
The field of metaheuristics for the application to combinatorial optimization problems is a
rapidly growing field of research. This is due to the importance of combinatorial optimization …
rapidly growing field of research. This is due to the importance of combinatorial optimization …
Exploration and exploitation in evolutionary algorithms: A survey
“Exploration and exploitation are the two cornerstones of problem solving by search.” For
more than a decade, Eiben and Schippers' advocacy for balancing between these two …
more than a decade, Eiben and Schippers' advocacy for balancing between these two …
[BOOK][B] Evolutionary algorithms for solving multi-objective problems
CAC Coello - 2007 - Springer
Problems with multiple objectives arise in a natural fashion in most disciplines and their
solution has been a challenge to researchers for a long time. Despite the considerable …
solution has been a challenge to researchers for a long time. Despite the considerable …
[BOOK][B] Estimation of distribution algorithms: A new tool for evolutionary computation
P Larrañaga, JA Lozano - 2001 - books.google.com
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation is devoted to
a new paradigm for evolutionary computation, named estimation of distribution algorithms …
a new paradigm for evolutionary computation, named estimation of distribution algorithms …
Stochastic local search
Stochastic local search (SLS) algorithms are among the most successful techniques for
solving computationally hard problems from computing science, operations research and …
solving computationally hard problems from computing science, operations research and …
A simple and effective evolutionary algorithm for the vehicle routing problem
C Prins - Computers & operations research, 2004 - Elsevier
The vehicle routing problem (VRP) plays a central role in the optimization of distribution
networks. Since some classical instances with 75 nodes resist the best exact solution …
networks. Since some classical instances with 75 nodes resist the best exact solution …
Hybrid metaheuristics in combinatorial optimization: A survey
Research in metaheuristics for combinatorial optimization problems has lately experienced
a noteworthy shift towards the hybridization of metaheuristics with other techniques for …
a noteworthy shift towards the hybridization of metaheuristics with other techniques for …
Iterated local search: Framework and applications
The key idea underlying iterated local search is to focus the search not on the full space of
all candidate solutions but on the solutions that are returned by some underlying algorithm …
all candidate solutions but on the solutions that are returned by some underlying algorithm …
Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling
This paper shows how the performance of evolutionary multiobjective optimization (EMO)
algorithms can be improved by hybridization with local search. The main positive effect of …
algorithms can be improved by hybridization with local search. The main positive effect of …
A tutorial for competent memetic algorithms: model, taxonomy, and design issues
The combination of evolutionary algorithms with local search was named" memetic
algorithms"(MAs)(Moscato, 1989). These methods are inspired by models of natural systems …
algorithms"(MAs)(Moscato, 1989). These methods are inspired by models of natural systems …