On the equality constraints tolerance of Constrained Optimization Problems

被引:9
作者
Si, Chengyong [1 ]
An, Jing [2 ]
Lan, Tian [3 ]
Ussmueller, Thomas [4 ]
Wang, Lei [2 ]
Wu, Qidi [2 ]
机构
[1] Shanghai Univ Sci & Technol, Shanghai Hamburg Coll, Shanghai 200093, Peoples R China
[2] Tongji Univ, Coll Elect & Informat Engn, Shanghai 201804, Peoples R China
[3] Tech Univ Berlin, Inst Sustainable Elect Networks & Sources Energy, D-10587 Berlin, Germany
[4] Univ Erlangen Nurnberg, Inst Elect Engn, D-91058 Erlangen, Germany
基金
中国国家自然科学基金;
关键词
Constrained optimization; Constraint handling techniques; Equality constraints tolerance; Particle Swarm Optimization; Ranking methods; EVOLUTIONARY ALGORITHMS; MULTIOBJECTIVE OPTIMIZATION; STRATEGY; TIME;
D O I
10.1016/j.tcs.2014.05.012
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The tolerance value plays an important role when converting equality constraints into inequality constraints in solving Constrained Optimization Problems. Many researchers use a fixed or dynamic setting directly based on trial or experiments without systematic study. As a well-known constraint handling technique, Deb's feasibility-based rule is widely adopted, but it has one drawback as the ranking is not consistent with the actual ranking after introducing the tolerance value. After carefully analyzing how the tolerance value influences the ranking difference, a novel strategy named Ranking Adjustment Strategy (RAS) is proposed, which can be considered as a complement of Deb's feasibility-based rule. The experiment has verified the effectiveness of the proposed strategy. This is the first time to analyze the inner mechanism of the tolerance value for equality constraints systematically, which can give some guide for future research. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:55 / 65
页数:11
相关论文
共 28 条
[1]  
[Anonymous], 2006, PROBLEM DEFINITIONS
[2]   A multiobjective optimization-based evolutionary algorithm for constrained optimization [J].
Cai, Zixing ;
Wang, Yong .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2006, 10 (06) :658-675
[3]   A large population size can be unhelpful in evolutionary algorithms [J].
Chen, Tianshi ;
Tang, Ke ;
Chen, Guoliang ;
Yao, Xin .
THEORETICAL COMPUTER SCIENCE, 2012, 436 :54-70
[4]   Choosing selection pressure for wide-gap problems [J].
Chen, Tianshi ;
He, Jun ;
Chen, Guoliang ;
Yao, Xin .
THEORETICAL COMPUTER SCIENCE, 2010, 411 (06) :926-934
[5]   Analysis of Computational Time of Simple Estimation of Distribution Algorithms [J].
Chen, Tianshi ;
Tang, Ke ;
Chen, Guoliang ;
Yao, Xin .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2010, 14 (01) :1-22
[6]   A New Approach for Analyzing Average Time Complexity of Population-Based Evolutionary Algorithms on Unimodal Problems [J].
Chen, Tianshi ;
He, Jun ;
Sun, Guangzhong ;
Chen, Guoliang ;
Yao, Xin .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2009, 39 (05) :1092-1106
[7]   Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art [J].
Coello, CAC .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2002, 191 (11-12) :1245-1287
[8]   An efficient constraint handling method for genetic algorithms [J].
Deb, K .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 186 (2-4) :311-338
[9]  
Hamida SB, 2002, IEEE C EVOL COMPUTAT, P884, DOI 10.1109/CEC.2002.1007042
[10]   From an individual to a population: An analysis of the first hitting time of population-based evolutionary algorithms [J].
He, J ;
Yao, X .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (05) :495-511