.png){kind=icon}
.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Dynamic facility layout problem (DFLP)
Particle swarm optimization (PSO)
Optimization
Heuristic method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.9
Papers:
2.1K
Citations:
4.6K
Organization
No organization information available