%0 Journal Article
%T A Comparative Study of EAG and PBIL on Large-Scale Global Optimization Problems
%A Imtiaz Hussain Khan
%J Applied Computational Intelligence and Soft Computing
%D 2014
%I Hindawi Publishing Corporation
%R 10.1155/2014/182973
%X Estimation of Distribution Algorithms (EDAs) use global statistical information effectively to sample offspring disregarding the location information of the locally optimal solutions found so far. Evolutionary Algorithm with Guided Mutation (EAG) combines global statistical information and location information to sample offspring, aiming that this hybridization improves the search and optimization process. This paper discusses a comparative study of Population-Based Incremental Learning (PBIL), a representative of EDAs, and EAG on large-scale global optimization problems. We implemented PBIL and EAG to build an experimental setup upon which simulations were run. The performance of these algorithms was analyzed in terms of solution quality and computational cost. We found that EAG performed better than PBIL in attaining a good quality solution, but the latter performed better in terms of computational cost. We also compared the performance of EAG and PBIL with MA-SW-Chains, the winner of CECĄŻ2010, and found that the overall performance of EAG is comparable to MA-SW-Chains. 1. Introduction Many search and optimization techniques have been developed to solve complex optimization problems, like travelling salesman problem. One widely studied approach in this area is Estimation of Distribution Algorithms (EDAs) [1¨C3]. The main difference between traditional evolutionary algorithms [4¨C6], for example, genetic algorithms, and EDAs lies in their offspring generation strategies. Traditional evolutionary algorithms use crossover and mutation to generate new solutions, whereas EDAs use probabilistic models to sample offspring. The probabilistic models are based on global statistical information, extracted from population. According to proximate optimality principle [7], which assumes that good solutions have similar structure, an ideal offspring generator should be able to generate a solution that is close to the best solutions found so far. In this respect, both evolutionary algorithms and EDAs have their own merits and demerits. Evolutionary algorithms allow that the new solutions would not be far away from the best solutions found so far, whereas EDAs have no mechanism to directly control the similarity between an offspring and its parent. On the other hand, EDAs better control the similarity among solutions in the current population because they use the global statistical information effectively to sample offspring. Evolutionary Algorithm with Guided Mutation (EAG) [8] combines global statistical information (i.e., the EDA approach) and location information
%U http://www.hindawi.com/journals/acisc/2014/182973/