Cooperative Ant Colonies for Solving the Maximum Weighted Satisfiability Problem

This paper presents a new generic Evolutionary Algorithm (EA) for retarding the unwanted effects of premature convergence. This is accomplished by a combination of interacting methods. To be intent on this a new selection scheme is introduced, which is designed to maintain the genetic diversity within the population by advantageous self-adaptive steering of selection pressure. Additionally this new selection model enables a quite intuitive condition to detect premature convergence. Based upon this newly postulated basic principle the new selection mechanism is combined with the already proposed Segregative Genetic Algorithm (SEGA) [3], an advanced Genetic Algorithm (GA) that introduces parallelism mainly to improve global solution quality. As a whole, a new generic evolutionary algorithm (SASEGASA) is introduced. The performance of the algorithm is evaluated on a set of characteristic benchmark problems. Computational results show that the new method is capable of producing highest quality solutions without any problem-specific additions.

[1]  Michael Affenzeller,et al.  Segregative Genetic Algorithms (SEGA): A hybrid superstructure upwards compatible to genetic algorithms for retarding premature convergence , 2001, Int. J. Comput. Syst. Signals.

[2]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[3]  Michael Affenzeller.  TRANSFERRING THE CONCEPT OF SELECTIVE PRESSURE FROM EVOLUTIONARY STRATEGIES TO GENETIC ALGORITHMS , 2003 .

[4]  Habiba Drias,et al.  Scatter Search with Random Walk Strategy for SAT and MAX-W-SAT Problems , 2001, IEA/AIE.

[5]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[6]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[7]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[8]  Richard F. Hartl,et al.  Applying the ANT System to the Vehicle Routing Problem , 1999 .

[9]  Lalit M. Patnaik,et al.  Adaptive probabilities of crossover and mutation in genetic algorithms , 1994, IEEE Trans. Syst. Man Cybern..

[10]  Pedro Larrañaga,et al.  Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators , 1999, Artificial Intelligence Review.

[11]  Michael Affenzeller.  A New Approach to Evolutionary Computation: Segregative Genetic Algorithms (SEGA) , 2001, IWANN.

[12]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[13]  Habiba Drias.  Genetic Algorithm versus Scatter Search and Solving Hard MAX-W-SAT Problems , 2001, IWANN.

[14]  David B. Fogel,et al.  An introduction to simulated evolutionary optimization , 1994, IEEE Trans. Neural Networks.

[15]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[16]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[17]  G. Di Caro,et al.  Ant colony optimization: a new meta-heuristic , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[18]  Panos M. Pardalos,et al.  Approximate solution of weighted MAX-SAT problems using GRASP , 1996, Satisfiability Problem: Theory and Applications.

[19]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[20]  Alan S. Perelson,et al.  Population Diversity in an Immune System Model: Implications for Genetic Search , 1992, FOGA.

[21]  Pierre Hansen,et al.  Algorithms for the maximum satisfiability problem , 1987, Computing.