.png){kind=icon}
返回
An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem
.png){kind=icon}
PRE
AI
DOI：10.1631/jzus.A0820284.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We extended an improved version of the discrete particle swarm optimization (DPSO) algorithm proposed by Liao et al. (2007) to solve the dynamic facility layout problem (DFLP). A computational study was performed with the existing heuristic algorithms, including the dynamic programming (DP), genetic algorithm (GA), simulated annealing (SA), hybrid ant system (HAS), hybrid simulated annealing (SA-EG), hybrid genetic algorithms (NLGA and CONGA). The proposed DPSO algorithm, SA, HAS, GA, DP, SA-EG, NLGA, and CONGA obtained the best solutions for 33, 24, 20, 10, 12, 20, 5, and 2 of the 48 problems from (Balakrishnan and Cheng, 2000), respectively. These results show that the DPSO is very effective in dealing with the DFLP. The extended DPSO also has very good computational efficiency when the problem size increases.
Keyword:
Dynamic facility layout problem (DFLP)
Particle swarm optimization (PSO)
Optimization
Heuristic method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.9
论文数:
2.1K
被引数:
4.6K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks
PREAI
分享收藏A discrete version of particle swarm optimization for flowshop scheduling problems用于流水车间调度问题的粒子群优化算法的离散版本
PREAI
分享收藏
查看更多内容