.png){kind=icon}
返回
Random search with adaptive boundaries algorithm for obtaining better initial solutions
.png){kind=icon}
PRE
AI
DOI：10.1016/j.advengsoft.2022.103141.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Conventional random search techniques take a lot of time to reach optimum-like solutions. Thus, random search techniques with advanced competencies play an essential role in algorithms. In this study, we develop an algorithm that provides an adaptive initial solution, to some extent reducing the diversity of randomness in the initialization of the algorithms for continuous unconstrained/bounded nonlinear optimization problems. The algorithm meets this expectation by narrowing search space adaptively without trapping into local optimums. It also escapes from eliminating accidentally global optimum in multi-modal problems. For this reason, we configure the proposed algorithm on the principle of updating given upper-lower boundaries dynamically. It is worth mentioning that this procedure does not add an additional burden to existing solution methods; on the contrary, it contributes to problem-solving in terms of time and efficiency. To show its performance, we have incorporated with most frequently used unconstrained/bounded benchmarks and compared them with the solutions in the literature. In conclusion, the proposed algorithm converges solutions quickly and is applicable for later usage in further studies.
Keyword:
Metaheuristics
Initial solution methods
Adaptive random search
Unconstrained optimization problems
期刊
IF:
5.7
论文数:
3.4K
被引数:
1.2W
机构
引用论文
.png){kind=icon}
Enhanced colliding bodies optimization for design problems with continuous and discrete variables
PREAI
分享收藏Sources of perceived stress among American medical doctors: a cross‐cultural perspective美国医生感知压力的来源：一项跨文化视角研究
PREAI
分享收藏A multi-objective particle swarm optimization algorithm based on dynamic boundary search for constrained optimization基于动态边界搜索的多目标粒子群算法求解约束优化问题
PREAI
分享收藏
查看更多内容