.png){kind=icon}
返回
A real-integer-discrete-coded particle swarm optimization for design problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2011.01.034.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The successful application of particle swarm optimization (PSO) to various real-valued problems motivates to develop some integer-coded versions of PSO for working directly with integer and discrete variables of a problem. However, in most of such works, actually a real-valued solution is just converted into a desired integer-valued solution by applying some posterior decoding mechanisms, while some problem-specific integer-coded versions of PSO are proposed in others. In this article, a novel version of PSO of general form is proposed, which can work directly with real, integer and discrete variables of a problem without any conversion. Quite satisfactory performance is obtained by applying the proposed PSO to some classical mechanical design problems of different nature. (C) 2011 Elsevier B.V. All rights reserved.
Keyword:
Binary-coded particle swarm optimization
Real variable
Integer variable
Discrete variable
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
.png){kind=icon}
A discrete version of particle swarm optimization for flowshop scheduling problems用于流水车间调度问题的粒子群优化算法的离散版本
PREAI
分享收藏
查看更多内容