This Article 
 Bibliographic References 
 Add to: 
Hybrid Evolutionary Search Method Based on Clusters
August 2001 (vol. 23 no. 8)
pp. 786-799

Abstract—This paper presents a hybrid evolutionary search method based on clusters (HESC). The method is specifically designed to enhance the search efficiency while alleviating the problem of premature convergence inherent in standard evolutionary search methods (SES). It involves the simultaneous evolution of a main species and an additional fast mutating species. A hybrid search method which includes a local parallel single agent search and a global multiagent evolutionary search is carried out for the main species. Effective utilization of the search history is achieved with the clustering and training of a fuzzy ART neural network (ART NN) during the search. The advantages of HESC include 1) guaranteed population diversity at each generation, 2) effective integration of local search for the exploitation of important regions and the global search for the exploration of the entire space, and 3) fast exploration ability of the fast mutating species and migration from the additional species to the main species. Those advantages have been confirmed with experiments in which hard optimization problems were successfully solved with HESC.

[1] T. Bäck, U. Hammel, and H.-P. Schwefel, “Evolutionary Computation: Comments on the History and Current State,” IEEE Trans. Evolutionary Computation, vol. 1, no.1, pp. 3–17, Apr. 1997.
[2] K.A. De Jong, “Evolutionary Computation: Recent Developments and Open Issues,” Proc. First Int'l Conf. Evolutionary Computation and Its Applications, pp. 7-17, 1996.
[3] D. Fogel, "An Introduction to Simulated Evolutionary Optimization," IEEE Trans. Neural Networks, vol. 5, pp. 3-14, Jan. 1994.
[4] A. Wirt, “Notes on the Simulation of Evolution,” IEEE Trans. Neural Networks, vol. 5, no. 1, pp. 130-147, 1994.
[5] D. Quagliarella, J. Periaux, C. Poloni, and G. Winter, Genetic Algorithms and Evolution Strategy in Engineering and Computer Science, Recent Advances and Industrial Applications. New York: John Wiley&Sons, 1998.
[6] T. Baeck and H.-P. Schwefel, “An Overview of Evolutionary Algorithms for Parameter Optimization,” Evolutionary Computation, vol. 1, no.1, pp. 1-24, 1993.
[7] H. Muhlenbein, M. Schomisch, and J. Born, “The Parallel Genetic Algorithm as Function Optimizer,” Parallel Computing, vol. 17, pp. 619-632, 1991.
[8] S. Forrest and M. Mitchell, “What Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation,” Machine Learning, vol. 13, pp. 285-319, 1993.
[9] B.M. Kim, Y.B. Kim, and C.H. Oh, “A Study on the Convergence of Genetic Algorithms,” Computers Industrial Eng., vol. 33, nos. 3-4, pp.581-588, 1997.
[10] W. Pedrycz, Fuzzy Neural Networks with Reference Neurons as Pattern Classifiers IEEE Trans. Neural Networks, vol. 3, no. 5, pp. 770-775, Sept. 1992.
[11] M Herrera, M. Lozano, and J.L. Verdegay, “Dynamic and Heuristic Fuzzy Connectives-Based Crossover Operators for Controlling the Diversity and Convergence of Real-Coded Genetic Algorithms,” Int'l J. Intelligent Systems, vol. 11, no. 12, pp. 1013-1040, 1996.
[12] C.-Y. Mao and Y.H. Hu, “Analysis of Convergence Properties of a Stochastic Evolution Algorithm,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 15, no. 7, pp. 826-831, 1996.
[13] G. Rudolph, “Local Convergence Rates of Simple Evolutionary Algorithms with Cauchy Mutation,” IEEE Trans. Evolutionary Computation, vol. 1, no. 5, pp. 249-258, 1997.
[14] G. Rudolph, “Convergence Analysis of Canonical Genetic Algorithms,” IEEE Trans. Neural Networks, vol. 5, no. 1, pp. 96-101, 1994.
[15] Y. Leung, Y. Gao, and Z.-B. Xu, “Degree of Population Diversity-A Perspective on Premature Convergence in Genetic Algorithms and Its Markov Chain Analysis,” IEEE Trans. Neural Networks, vol. 8, no. 5, pp. 1165-1176, 1997.
[16] J.C. Potts, D.G. Terri, and B.Y. Surya, “The Development and Evaluation of an Improved Genetic Algorithm Based on Migration and Artificial Selection,” IEEE Trans. Systems, Man, and Cybernetics, vol. 24, no. 1, pp. 73-86, 1994.
[17] J. Grefenstette, “Optimization of Control Parameters for Genetic Algorithms,” IEEE Trans. Systems, Man, and Cybernetics, vol. 16, no. 1, pp. 122-128, 1986.
[18] Q. Xiaofeng and F. Palmieri, “Theoretical Analysis of Evolutionary Algorithms with an Infinite Population Size in Continuous Space Part I: Basic Properties of Selection and Mutation,” IEEE Trans. Neural Networks, vol. 5, no. 1, pp. 102-119, 1994.
[19] T. Kuo and S.-Y. Hwang, “A Genetic Algorithm with Disruptive Selection,” IEEE Trans. Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 26, no. 2, pp. 299-307, 1998.
[20] T. Kuo and S.-Y. Hwang, “Using Disruptive Selection to Maintain Diversity in Genetic Algorithms,” Applied Intelligence, vol. 7, no. 3, pp.257-267, 1997.
[21] L. Davis, Handbook of Genetic Algorithms. New York: Van Nostrand Reinhold, 1991.
[22] K. Chellapilla, “Combining Mutation Operators in Evolutionary Programming,” IEEE Trans. Evolutionary Computation, vol. 2, no. 3, pp. 91-96, 1998.
[23] N. Schraudolph and R.K. Belew, “Dynamic Parameter Encoding for Genetic Algorithms,” Machine Learning, vol. 9, no. 1, pp. 9-21, 1992.
[24] Y. Duan, V.K. Gupta, and S. Sorooshian, “Shuffled Complex Evolution Approach for Effective and Efficient Global Minimization,” J. Optimization Theory and Applications, vol. 76, no. 3, pp. 501-521, 1993.
[25] R. McDonnell and D. Waagen, “Evolving Recurrent Perceptrons for Time-Series Modeling,” IEEE Trans. Neural Networks, vol. 5, no. 1, pp. 24-38, 1994.
[26] J.-M. Renders and S.P. Flasse, “Hybrid Methods Using Genetic Algorithms for Global Optimization,” IEEE Trans. Systems, Man, and Cybernetics-Part B: Cybernetics, vol. 26, no.2, pp. 243-258, 1996.
[27] E.K. Bruke and J.P. Newall, “A Multistage Evolutionary Algorithm for the Timetable Problem,” IEEE Trans. Evolutionary Computation, vol. 3, no. 1, pp. 63-74, 1999.
[28] D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, Mass.: Addison-Wesley, 1989.
[29] H.-G. Beyer, “Toward a Theory of Evolution Strategies: On the Benefits of Sex—The$(\mu/\ \! \mu, \lambda) $Theory,” Evolutionary Computation, vol. 3, no. 1, pp. 81-111, 1995.
[30] G. Carpenter and S. Grossberg, “A Massively Parallel Architecture for a Self-Organizing Neural Pattern Recognition Machine,” Computer Vision, Graphics and Image Understanding, vol. 37, pp. 54–115, 1987.
[31] G.A. Carpenter, S. Grossberg, and D.B. Rosen, “Fuzzy ART: Fast Stable Learning and Categorization of Analog Patterns by an Adaptive Resonance System,” Neural Networks, vol. 4, pp. 759–771, 1991.
[32] J. Huang, M. Georgiopoulos, and G.L. Heileman, “Fuzzy ART Properties,” Neural Networks, vol. 8, no. 2, pp. 203–213, 1995.
[33] C.-A. Hung and S.-F. Lin, “Adaptive Hamming Net: A Fast-Learning ART1 Model without Searching,” Neural Networks, vol. 8, no. 4, pp. 605-618, 1995.
[34] R. Tanese, “Distributed Genetic Algorithms,” Proc. Third Int'l Conf. Genetic Algorithms, pp. 434-439, 1989.
[35] R. Tanese, “Parallel Genetic Algorithm for a Hypercube,” Proc. Second Int'l Conf. Genetic Algorithms, pp. 177-183, 1987.
[36] J. Solis and J.B. Wets, “Minimization by Random Search Techniques,” Math. Operations Research, vol. 6, no. 1, pp. 19-50, 1981.
[37] J.D. Schaffer, R.A. Caruana, L.J. Eshelman, and R. Das, “A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization,” Proc. Third Int'l Conf. Genetic Algorithms, pp. 51-60, 1989.
[38] A.J. Keane, “Genetic Algorithm Optimization of Multi-Peak Problems: Studies in Convergence and Robustness,” Artificial Intelligence in Eng., vol. 9, no. 2, pp. 75-83, 1995.
[39] S.Y.P. Wu and M. Li, “Supervised and Unsupervised Fuzzy Adaptive Hamming Net,” Pattern Recognition, vol. 32, no. 10, pp. 1801-1816, 1999.
[40] D.E. Goldberg and J. Richardson, “Genetic Algorithms with Sharing for Multimodal Function Optimization,” Proc. Second Int'l Conf. Genetic Algorithms, pp. 41-49, 1987.

Index Terms:
Evolutionary computation, ART neural network, prematurity, cluster, optimization.
Ming Li, Hon-Yuen Tam, "Hybrid Evolutionary Search Method Based on Clusters," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 23, no. 8, pp. 786-799, Aug. 2001, doi:10.1109/34.946984
Usage of this product signifies your acceptance of the Terms of Use.