Skip to Main Content
A generic design model for evolutionary algorithms is proposed in this paper. The model, which was described by UML in details, focuses on the key concepts and mechanisms in evolutionary algorithms. The mode not only achieves separation of concerns and encapsulation of implementations by classification and abstraction of those concepts, but also has a flexible architecture due to tile application of design patterns. As a result, the model is reusable, extendible, easy to understand, easy to use, and easy to test. A large number of experiments applying the model to solve many different problems adequately illustrate the generality and effectiveness of the model.
Machine Learning and Cybernetics, 2004. Proceedings of 2004 International Conference on (Volume:5 )
Date of Conference: 26-29 Aug. 2004