Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/73498
題名: | A revised discrete particle swarm optimization algorithm for permutation flow-shop scheduling problem | 作者: | 陳春龍 Chen, Chun-Lung;Huang, Shin-Ying;Tzeng, Yeu-Ruey;Chen, Chuen-Lung |
貢獻者: | 資管系 | 關鍵詞: | Permutation flow-shop scheduling problem ;Particle swarm optimization ; Makespan | 日期: | 十二月-2013 | 上傳時間: | 12-二月-2015 | 摘要: | This research proposes a revised discrete particle swarm optimization (RDPSO) to solve the permutation flow-shop scheduling problem with the objective of minimizing makespan (PFSP-makespan). The candidate problem is one of the most studied NP-complete scheduling problems. RDPSO proposes new particle swarm learning strategies to thoroughly study how to properly apply the global best solution and the personal best solution to guide the search of RDPSO. A new filtered local search is developed to filter the solution regions that have been reviewed and guide the search to new solution regions in order to keep the search from premature convergence. Computational experiments on Taillard’s benchmark problem sets demonstrate that RDPSO significantly outperforms all the existing PSO algorithms. | 關聯: | Soft Computing,18(11),2271-2282 | 資料類型: | article | DOI: | http://dx.doi.org/10.1007/s00500-013-1199-z |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
2271-1187.pdf | 456.51 kB | Adobe PDF2 | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.