关键词: 可视化, 聚类分析, 带约束优化, 遗传算法

Abstract: Genetic Algorithms (GA) based on penalty function methods have been the most popular approach to constrained optimization problems because of their simplicity and ease of implementation. But how to find appropriate penalty parameters needed to guide the search towards the constrained optimum in the penalty function approaches is very difficult. A new cluster analysis based on visualization is proposed to address the constrained optimization problems. First, a Cluster Constrained Mapping (CCM) method based on feed-forward Artificial Neural Network (ANN) is proposed for dimension-reduction mapping from the original n-D space to 2-D, conserving the cluster information in the reduced dimensional space. Then the agglomerative algorithm that works in 2-D space is called upon for cluster analysis. Its parameters are provided through visualization and subsequent interaction with the user. Finally, the cluster information is derived from 2-D back into n-D to obtain the feasible region knowledge in the original dimensions, which is used in the IGA. The enhanced GA, incorporating a new cluster analysis method through data visualization (CCM) and user interaction guarantees the process of evolution in feasible regions without requiring any penalty parameters.

Key words: visualization, cluster analysis, constrained optimization, genetic algorithm