.png){kind=icon}
返回
A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2007.04.096.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The particle swarm optimization (PSO) has been widely used to solve continuous problems. The discrete problems have just begun to be also solved by the discrete PSO. However, the combinatorial problems remain a prohibitive area to the PSO mainly in case of integer values. In this paper, we propose a combinatorial PSO (CPSO) algorithm that we take up challenge to use in order to solve a multi-mode resource-constrained project scheduling problem (MRCPSP). The results that have been obtained using a standard set of instances, after extensive experiments, prove to be very competitive in terms of number of problems solved to optimality. By comparing average deviations and percentages of optima found, our CPSO algorithm outperforms the simulated annealing algorithm and it is close to the PSO algorithm. (C) 2007 Elsevier Inc. All rights reserved.
Keyword:
combinatorial optimization
combinatorial particle swarm optimization
multi-mode resource-constrained project scheduling problem
local search
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm一种简单、通用、功能强大的排序算法实现多模式资源受限项目调度
PREAI
分享收藏A discrete version of particle swarm optimization for flowshop scheduling problems用于流水车间调度问题的粒子群优化算法的离散版本
PREAI
分享收藏Metabolism of bifenthrin, β-cyfluthrin, λ-cyhalothrin, cyphenothrin and esfenvalerate by rat and human cytochrome P450 and carboxylesterase enzymes.png)
Xenobiotica
XenobioticaIF0
PREAI
分享收藏
查看更多内容