.png){kind=icon}
返回
Hybrid improved sine cosine algorithm for mixed-integer nonlinear programming problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-023-08578-y.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Aiming at the shortcomings of existing algorithms in solving mixed-integer programming problems, such as local convergence and poor solution accuracy, this paper presents a hybrid improved sine and cosine algorithm. The improved position update formula is introduced to enhance the global and local search abilities of the algorithm, and combined mutation is further given to avoid local convergence. The performance of proposed algorithm is validated by the high-dimensional modified CEC 2017 COPs and two complex engineering optimization problems. The experimental findings indicate that the hybrid mechanism of improved sine and cosine algorithm and combined mutation is demonstrably effective, and the proposed algorithm provides a satisfactory solution for addressing high-dimensional complicated mixed-integer programming problems.
Keyword:
Improved sine cosine algorithm
Combined mutation
Mixed-integer nonlinear programming
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
.png){kind=icon}
查看更多内容