Novel Adaptive Simulated Annealing Algorithm for Constrained Multi-Objective Optimization

被引:0
作者
Chuai Gang [1 ,2 ]
Zhao Dan [1 ,2 ]
Sun Li [1 ,3 ]
机构
[1] Beijing Univ Posts & Telecommun, Sch Informat & Commun Engn, Beijing 100876, Peoples R China
[2] Beijing Univ Posts & Telecommun, Key Lab Universal Wireless Commun, Minist Educ, Beijing 100876, Peoples R China
[3] Beijing Univ Posts & Telecommun, Beijing Key Lab Network Syst Architecture & Conve, Beijing 100876, Peoples R China
关键词
simulated annealing; constrained multi-objective optimization; adaptive; sub-iteration searching; sub-archive; pareto-optimal; NSGA-II;
D O I
暂无
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
In recent years, simulated annealing algorithms have been extensively developed and utilized to solve multi-objective optimization problems. In order to obtain better optimization performance, this paper proposes a Novel Adaptive Simulated Annealing (NASA) algorithm for constrained multi-objective optimization based on Archived Multi-objective Simulated Annealing (AMOSA). For handling multi-objective, NASA makes improvements in three aspects: sub-iteration search, sub-archive and adaptive search, which effectively strengthen the stability and efficiency of the algorithm. For handling constraints, NASA introduces corresponding solution acceptance criterion. Furthermore, NASA has also been applied to optimize TD-LTE network performance by adjusting antenna parameters; it can achieve better extension and convergence than AMOSA, NS-GAII and MOPSO. Analytical studies and simulations indicate that the proposed NASA algorithm can play an important role in improving multi-objective optimization performance.
引用
收藏
页码:68 / 78
页数:11
相关论文
共 23 条
[1]   Clustering using simulated annealing with probabilistic redistribution [J].
Bandyopadhyay, S ;
Maulik, U ;
Pakhira, MK .
INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2001, 15 (02) :269-285
[2]   A simulated annealing-based multiobjective optimization algorithm: AMOSA [J].
Bandyopadhyay, Sanghamitra ;
Saha, Sriparna ;
Maulik, Ujjwal ;
Deb, Kalyanmoy .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2008, 12 (03) :269-283
[3]   Quantitative comparison of the performance of SAR segmentation algorithms [J].
Caves, R ;
Quegan, S ;
White, R .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 1998, 7 (11) :1534-1546
[4]  
Czyzzak P., 1998, Journal of Multi-Criteria Decision Analysis, V7, P34, DOI DOI 10.1002/(SICI)1099-1360(199801)7:13.0.CO
[5]  
2-6
[6]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[7]  
Engrand P., 1997, PROCEEDINDS ICONE 5, P416
[8]   Crowded comparison operators for constraints handling in NSGA-II for optimal design of the compensation system in electrical distribution networks [J].
Favuzza, S. ;
Ippolito, M. G. ;
Sanseverino, E. Riva .
ADVANCED ENGINEERING INFORMATICS, 2006, 20 (02) :201-211
[9]   STOCHASTIC RELAXATION, GIBBS DISTRIBUTIONS, AND THE BAYESIAN RESTORATION OF IMAGES [J].
GEMAN, S ;
GEMAN, D .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1984, 6 (06) :721-741
[10]  
Lei DeMing, 2009, INTELLIGENT MULTIOBJ