Please wait a minute...
FITEE
Front. Inform. Technol. Electron. Eng.  2010, Vol. 11 Issue (4): 249-260    DOI: 10.1631/jzus.C0910072
    
A relative feasibility degree based approach for constrained optimization problems
Cheng-gang Cui, Yan-jun Li, Tie-jun Wu*
Department of Control Science and Engineering, Zhejiang University, Hangzhou 310027, China
A relative feasibility degree based approach for constrained optimization problems
Cheng-gang Cui, Yan-jun Li, Tie-jun Wu*
Department of Control Science and Engineering, Zhejiang University, Hangzhou 310027, China
 全文: PDF(305 KB)  
摘要： Based on the ratio of the size of the feasible region of constraints to the size of the feasible region of a constrained optimization problem, we propose a new constraint handling approach to improve the efficiency of heuristic search methods in solving the constrained optimization problems. In the traditional classification of a solution candidate, it is either a feasible or an infeasible solution. To refine this classification, a new concept about the relative feasibility degree of a solution candidate is proposed to represent the amount by which the ‘feasibility’ of the solution candidate exceeds that of another candidate. Relative feasibility degree based selection rules are also proposed to enable evolutionary computation techniques to accelerate the search process of reaching a feasible region. In addition, a relative feasibility degree based differential evolution algorithm is derived to solve constraint optimization problems. The proposed approach is tested with nine benchmark problems. Results indicate that our approach is very competitive compared with four existing state-of-the-art techniques, though still sensitive to the intervals of control parameters of the differential evolution.
关键词： Constrained optimization;  Evolutionary computation;  Relative feasibility degree (RFD);  Evolution differential algorithm    
Abstract: Based on the ratio of the size of the feasible region of constraints to the size of the feasible region of a constrained optimization problem, we propose a new constraint handling approach to improve the efficiency of heuristic search methods in solving the constrained optimization problems. In the traditional classification of a solution candidate, it is either a feasible or an infeasible solution. To refine this classification, a new concept about the relative feasibility degree of a solution candidate is proposed to represent the amount by which the ‘feasibility’ of the solution candidate exceeds that of another candidate. Relative feasibility degree based selection rules are also proposed to enable evolutionary computation techniques to accelerate the search process of reaching a feasible region. In addition, a relative feasibility degree based differential evolution algorithm is derived to solve constraint optimization problems. The proposed approach is tested with nine benchmark problems. Results indicate that our approach is very competitive compared with four existing state-of-the-art techniques, though still sensitive to the intervals of control parameters of the differential evolution.
Key words: Constrained optimization    Evolutionary computation    Relative feasibility degree (RFD)    Evolution differential algorithm
收稿日期: 2009-02-10 出版日期: 2010-03-22
CLC:  TP18  
基金资助: Project (No. 2006AA04Z184) supported by the National High-Tech Research and Development Program (863) of China
通讯作者: Tie-jun WU     E-mail: tjwu@zju.edu.cn
服务　　
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章　　
Cheng-gang Cui
Yan-jun Li
Tie-jun Wu

引用本文:

Cheng-gang Cui, Yan-jun Li, Tie-jun Wu. A relative feasibility degree based approach for constrained optimization problems. Front. Inform. Technol. Electron. Eng., 2010, 11(4): 249-260.

链接本文:

http://www.zjujournals.com/xueshu/fitee/CN/10.1631/jzus.C0910072    或    http://www.zjujournals.com/xueshu/fitee/CN/Y2010/V11/I4/249

[1] Li XIE, Yi-qun ZHANG, Jun-yan XU. Hohmann transfer via constrained optimization[J]. Front. Inform. Technol. Electron. Eng., 2018, 19(11): 1444-1458.