Adaptive global optimization with local search
Adaptive global optimization with local search
Journal of Global Optimization
Lamarckian Evolution, The Baldwin Effect and Function Optimization
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Real-coded memetic algorithms with crossover hill-climbing
Evolutionary Computation - Special issue on magnetic algorithms
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Adaptive cellular memetic algorithms
Evolutionary Computation
A probabilistic memetic framework
IEEE Transactions on Evolutionary Computation
Memetic algorithms for continuous optimisation based on local search chains
Evolutionary Computation
IEEE Transactions on Evolutionary Computation
Meta-Lamarckian learning in memetic algorithms
IEEE Transactions on Evolutionary Computation
Systematic integration of parameterized local search into evolutionary algorithms
IEEE Transactions on Evolutionary Computation
Accelerating Differential Evolution Using an Adaptive Local Search
IEEE Transactions on Evolutionary Computation
Classification of adaptive memetic algorithms: a comparative study
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A Fast Adaptive Memetic Algorithm for Online and Offline Control Design of PMSM Drives
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Coevolving Memetic Algorithms: A Review and Progress Report
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Power law-based local search in differential evolution
International Journal of Computational Intelligence Studies
Hi-index | 0.00 |
The performance of a memetic algorithm (MA) largely depends on the synergy between its global and local search counterparts. The amount of global exploration and local exploitation to be carried out, for optimal performance, varies with problem type. Therefore, an algorithm should intelligently allocate its computational efforts between genetic search and local search. In this work we propose an adaptive local search method that adjusts the effort for local tuning of individuals, taking feedback from the search. We implemented an MA hybridizing this adaptive local search method with differential evolution algorithm. Experimenting with a standard benchmark suite it was found that the proposed MA can utilize its global and local search components adaptively. The proposed algorithm also exhibited very competitive performance with other existing algorithms.