.png){kind=icon}
返回
A simplex social spider algorithm for solving integer programming and minimax problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s12293-016-0180-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose a new hybrid social spider algorithm with simplex Nelder-Mead method in order to solve integer programming and minimax problems. We call the proposed algorithm a Simplex Social Spider optimization (SSSO) algorithm. In the the proposed SSSO algorithm, we combine the social spider algorithm with its powerful capability of performing exploration, exploitation, and the Nelder-Mead method in order to refine the best obtained solution from the standard social spider algorithm. In order to investigate the general performance of the proposed SSSO algorithm, we test it on 7 integer programming problems and 10 minimax problems and compare against 10 algorithms for solving integer programming problems and 9 algorithms for solving minimax problems. The experiments results show the efficiency of the proposed algorithm and its ability to solve integer and minimax optimization problems in reasonable time.
Keyword:
Social spider algorithm
Direct search algorithm
Simplex Nelder-Mead method
Integer programming problems
Minimax problems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.3
论文数:
453
被引数:
718
机构
引用论文
分享收藏
Asparagine Synthetase Activity in Malignant and Non-malignant Human Kidney and Prostate Specimens.png)
Nature
NatureIF0
PREAI
分享收藏分享收藏
查看更多内容