Systematic Integration of Parameterized Local Search Into Evolutionary Algorithms
Authors:
- S.S. BhattacharyyaSBS.S. Bhattacharyya
- J. TeichJTJ. Teich
- E. ZitzlerEZE. Zitzler
- 19 April 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 8 (2) , 137-155
Abstract
Application-specific, parameterized local search algorithms (PLSAs), in which optimization accuracy can be traded off with run time, 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 static and dynamic strategies for systematically managing the tradeoff between PLSA accuracy and optimization effort. Our goal is to achieve maximum solution quality within a fixed optimization time budget. We show that the simulated heating technique better utilizes the given optimization time resources than standard hybrid methods that employ fixed parameters, and that the technique is less sensitive to these parameter settings. We apply this framework to three different optimization problems, compare our results to the standard hybrid methods, and show quantitatively that careful management of this tradeoff is necessary to achieve the full potential of an EA/PLSA combination.Keywords
This publication has 20 references indexed in Scilit:
- Microgenetic algorithms as generalized hill-climbing operators for GA optimizationIEEE Transactions on Evolutionary Computation, 2001
- Solving equations by hybrid evolutionary computation techniquesIEEE Transactions on Evolutionary Computation, 2000
- Multidimensional Exploration of Software Implementations for DSP AlgorithmsJournal of Signal Processing Systems, 2000
- An expanding-core algorithm for the exact 0–1 knapsack problemEuropean Journal of Operational Research, 1995
- A GRASP™ for a difficult single machine scheduling problemComputers & Operations Research, 1991
- A probabilistic heuristic for a computationally difficult set covering problemOperations Research Letters, 1989
- Monte Carlo Methods1986
- An Algorithm for Large Zero-One Knapsack ProblemsOperations Research, 1980
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970
- Discrete OptimizingJournal of the Society for Industrial and Applied Mathematics, 1965