A revised discrete particle swarm optimization algorithm for permutation flow-shop scheduling problem

文化大學機構典藏 CCUR > 理工學院 > 工學院 > 資訊工程學系 > 期刊論文 > Item 987654321/29130

Please use this identifier to cite or link to this item: https://irlib.pccu.edu.tw/handle/987654321/29130

Title:	A revised discrete particle swarm optimization algorithm for permutation flow-shop scheduling problem
Authors:	Chen, Chun-Lung Huang, Shin-Ying Tzeng, Yeu-Ruey Chen, Chuen-Lung
Contributors:	資工系
Keywords:	Permutation flow-shop scheduling problem Particle swarm optimization Makespan
Date:	2014-11
Issue Date:	2015-01-20 10:07:41 (UTC+8)
Abstract:	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.
Relation:	SOFT COMPUTING 卷: 18 期: 11 頁碼: 2271-2282
Appears in Collections:	[資訊工程學系] 期刊論文

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	408	View/Open

View Licence