An Adaptive Hybrid Genetic Algorithm - Simulated Annealing Approach

Genetic algorithms (GAs) and simulated annealing (SA) are important search methods. Combining both may improve the search quality, for example by using SA as a genetic operator. One problem in such technique is to find annealing parameters that work for all stages of the run. In this research, we introduce a new adaptive hybrid GA-SA algorithm, in which SA acts as a mutation. However, the SA will be adaptive in the sense that its parameters are evolved during the search. Adaptation should help guide the search towards optimum solutions with minimum parameter tuning. The algorithm is tested on solving an important NP-hard problem, the MAP (Maximum a-Posteriori) Assignment Problem on BBNs (Bayesian Belief Networks). The results obtained indicate that the adaptive hybrid algorithm provides an improvement of solution quality over that obtained by GA used alone and GA augmented with standard non-adaptive SA. Its effect, however, is more profound for large problems, which are difficult for GA alone to solve. The techniques reported in this book should be of interest to researchers in heuristics and meta-heuristics, and their application to combinatorial optimization problems.

Autorentext

Manar I. Hosny, MSC: Studied Computer Science at the American University in Cairo, Egypt. Lecturer at the Information Technology Department, College of Computers and Information Sciences, King Saud University, Riyadh, Kingdom of Saudi Arabia. PhD Candidate at Cardiff University, U.K.