模式识别与人工智能
Friday, Apr. 11, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2009, Vol. 22 Issue (6): 869-876    DOI:
Papers and Reports Current Issue| Next Issue| Archive| Adv Search |
A Linear Evolutionary Algorithm for Solving Constrained Optimization Problems
TANG Ke-Zong1,3, YANG Jing-Yu1, GAO Shang2,3, LI Wei1
1.School of Computer Science and Technology, Nanjing University of Science and Technology, Nanjing 210094
2.School of Computer Science and Engineering, Jiangsu University of Science and Technology, Zhenjiang 212003
3.Key Laboratory of CAD&CG,Zhejiang University,Hangzhou 310027

Download: PDF (500 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  A linear evolutionary algorithm for solving constrained optimization problems (LEACOP) based on real-coded method is proposed, and its complexity and convergence are also analyzed. One of the main advantages of the proposed algorithm is that the search space of constrained dominance problems with high dimensions is compressed into two dimensions. A linear fitness function based on mathematic analysis is deduced in two dimension space to fast evaluate fitness value of each individual in population. A crossover operator based on density function and a new mutation operator are developed to extend the search space and extract better solution. In addition, an average linkage based on hierarchical clustering method is introduced into the LEACOP to maintain the number of individuals on Pareto set. A few benchmark multi-objective optimization problem which is divided into three groups is introduced to test this algorithm. The numerical experiments show that proposed algorithm is feasible and effective, and it provides good performance in terms of uniformity and diversity of solutions.
Key wordsMulti-Objective Optimization Problem      Evolutionary Algorithm      Pareto Optimal Solution      Linear Function     
Received: 22 December 2008     
ZTFLH: TP301.6  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
Cite this article:   
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2009/V22/I6/869
Copyright © 2010 Editorial Office of Pattern Recognition and Artificial Intelligence
Address: No.350 Shushanhu Road, Hefei, Anhui Province, P.R. China Tel: 0551-65591176 Fax:0551-65591176 Email: bjb@iim.ac.cn
Supported by Beijing Magtech  Email:support@magtech.com.cn