Systematic Integration of Parameterized Local Search Into Evolutionary Algorithms
نویسندگان
چکیده
منابع مشابه
Systematic Integration of Parameterized Local Search Techniques in Evolutionary Algorithms
Application-specific, parameterized local search algorithms (PLSAs), in which optimization accuracy can be traded off with runtime, arise naturally in many optimization contexts. We introduce a novel approach, called simulated heating, for systematically integrating parameterized local search into evolutionary algorithms (EAs). Using the framework of simulated heating, we investigate both stati...
متن کاملAcceptance Driven Local Search and Evolutionary Algorithms
Local Search (LS) and Evolutionary Algorithms (EA) are probabilistic search algorithms, widely used in global optimization, where selection is important as it drives the search. In this paper, we introduce acceptance, a metric measuring the selective pressure in LS and EA, that is the tradeoff between exploration and exploitation. Informally, acceptance is the proportion of accepted non-improvi...
متن کاملIntegrating Local Search into Genetic Algorithms
Genetic algorithms (GAs) have proved to be a versatile and eeective approach for solving combinatorial optimization problems. Nevertheless, there are many situations in which the simple GA does not perform particularly well, and various methods of hybridization have been proposed. These often involve incorporating other methods such as simulated annealing or local optimization as a post-process...
متن کاملA Hybrid Algorithm using Firefly, Genetic, and Local Search Algorithms
In this paper, a hybrid multi-objective algorithm consisting of features of genetic and firefly algorithms is presented. The algorithm starts with a set of fireflies (particles) that are randomly distributed in the solution space; these particles converge to the optimal solution of the problem during the evolutionary stages. Then, a local search plan is presented and implemented for searching s...
متن کاملEvolutionary Algorithms, Randomized Local Search, and the Maximum Matching Problem
The design and analysis of problem-specific algorithms for combinatorial optimization problems is a well-studied subject. It is accepted that randomization is a powerful concept for theoretically and practically efficient problem-specific algorithms. Randomized search heuristics like randomized local search, tabu search, simulated annealing, and variants of evolutionary algorithms can be combin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Evolutionary Computation
سال: 2004
ISSN: 1089-778X
DOI: 10.1109/tevc.2004.823471