模式识别与人工智能
Wednesday, Apr. 23, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2017, Vol. 30 Issue (12): 1069-1082    DOI: 10.16451/j.cnki.issn1003-6059.201712002
Orignal Article Current Issue| Next Issue| Archive| Adv Search |
Decomposition Multi-objective Evolutionary Algorithm Based on Differentiated Neighborhood Strategy
WANG Liping1,2, WU Feng1,2, ZHANG Mengzi1,2, QIU Feiyue3
1.College of Economics and Management, Zhejiang University of Technology, Hangzhou 310023
2.Institute of Information Intelligence and Decision Optimization, Zhejiang University of Technology, Hangzhou 310014
3.College of Educational Science and Technology, Zhejiang University of Technology, Hangzhou 310023

Download: PDF (1486 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  The performance of the decomposition-based multi-objective evolutionary algorithm is easily affected by the neighborhood of a subproblem. When the neighborhood is too large, the new solutions generated by the population propagation deviate from the Pareto set and the frequency of comparison between new solutions and old solutions in the neighborhood is increased for the updating subproblems. Consequently, the computational complexity of the algorithm is increased. If the neighborhood is too small, the algorithm easily falls into the local optimum. To solve this problem, a decomposed multi-objective evolutionary algorithm based on differentiated neighborhood strategy(MOEA/D-DN) is proposed. The suitable parameters are selected by analyzing the influence of different neighborhood sizes on the algorithm performance and different sizes of neighborhood for each subproblem are set according to the angle between their weight vectors and the central vector. Thus, the resource of algorithm is allocated more rationally and the velocity of searching for the optimal solution is also improved. Finally, the experimental results on the test functions of 2 dimensional ZDT and 3-5 dimensional DTLZ show that the convergence rate and the performance of MOEA/D-DN algorithm are improved obviously and the computational resource allocation of the algorithm is more reasonable. The overall solution quality is better.
Key wordsMulti-objective Optimization      Different Subproblem      Differentiated Neighborhood      Resource Allocation     
Received: 21 August 2017     
ZTFLH: TP 18  
Fund:Supported by National Natural Science Foundation of China(No.61472366,61379077), Natural Science Foundation of Zhejiang Province(No.LY17F020022)
About author:: (WANG Liping, born in 1964, Ph.D., professor. Her research interests include decision optimization and business intelligence.)
(WU Feng, born in 1992, master student. His research interests include intelligent evolutionary algorithm and decision optimization.)
(ZHANG Mengzi, born in 1993, master student. Her research interests include intelligent evolutionary algorithm and decision optimization.)
(QIU Feiyue(Corresponding author), born in 1965, Ph.D., professor. His research interests include computational intelligence and deep learning.)
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
WANG Liping
WU Feng
ZHANG Mengzi
QIU Feiyue
Cite this article:   
WANG Liping,WU Feng,ZHANG Mengzi等. Decomposition Multi-objective Evolutionary Algorithm Based on Differentiated Neighborhood Strategy[J]. , 2017, 30(12): 1069-1082.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/10.16451/j.cnki.issn1003-6059.201712002      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2017/V30/I12/1069
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