返回
Backtracking Search Algorithm with three constraint handling methods for constrained optimization problems
DOI:10.1016/j.eswa.2015.05.050.png)
摘要
En 中文
A new evolutionary algorithm, Backtracking Search Algorithm (BSA), is applied to solve constrained optimization problems. Three constraint handling methods are combined with BSA for constrained optimization problems; namely feasibility and dominance (FAD) rules, epsilon-constrained method with fixed control way of epsilon value and a proposed epsilon-constrained method with self-adaptive control way of epsilon value. The proposed method controls epsilon value according to the properties of current population. This kind of epsilon value enables algorithm to sufficiently search boundaries between infeasible regions and feasible regions. It can avoid low search efficiency and premature convergence which happens in fixed control method and FAD rules. The comparison of the above three algorithms demonstrates BSA combined epsilon-constrained method with self-adaptive control way of epsilon value (BSA-SA epsilon) is the best one. The proposed BSA-SA epsilon also outperforms other five classic and the latest constrained optimization algorithms. Then, BSA-SA epsilon has been applied to four engineering optimization instances, and the comparison with other algorithms has proven its advantages. Finally, BSA-SA epsilon is used to solve the car side impact design optimization problem, which illustrates the wide application prospects of the proposed BSA-SA epsilon. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
Backtracking Search Algorithm
Constrained optimization problem
Feasibility and dominance rules
epsilon-constrained method
Engineering optimization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
2.9W
被引数:
10.2W
机构
暂无机构信息
引用论文
AMA: a new approach for solving constrained real-valued optimization problemsAMA: 一种求解约束实值优化问题的新方法
SOFT COMPUTING
IF2.5

