| dc.contributor | 資訊管理學系 | |
| dc.creator (作者) | Chen, Chuenlung | |
| dc.creator (作者) | 陳春龍 | zh_TW |
| dc.date (日期) | 2009-12 | |
| dc.date.accessioned | 1-六月-2015 17:24:26 (UTC+8) | - |
| dc.date.available | 1-六月-2015 17:24:26 (UTC+8) | - |
| dc.date.issued (上傳時間) | 1-六月-2015 17:24:26 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/75471 | - |
| dc.description.abstract (摘要) | This paper proposed a hybrid particle swarm optimization algorithm (Shadow hybrid PSO, SHPSO) to solve the flow-shop scheduling problem (FSSP). SHPSO adopts the idea of Kuoa`s HPSO model[4] by not only combines the random-key (RK) encoding scheme, individual enhancement (IE) scheme, but also adds the diversification mechanism such as ARPSO model and competitive shadow particles to prevent premature convergence. Computation experiments results of Taillard`s [10] seven representative instances of FSSP show that the SHPSO perform close to HPSO for FSSP to minimize makespan. Further recommendations and improved ideas will be discussed later in this paper. © 2009 IEEE. | |
| dc.relation (關聯) | 2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009,864-867 | |
| dc.subject (關鍵詞) | Attractive and repulsive particle swarm optimization (ARPSO); Diversity-guided search; Encoding schemes; Flow shop scheduling problem; Guided search; Hybrid particle swarm optimization algorithm; Hybrid PSO; Makespan; Premature convergence; Scheduling algorithms; Particle swarm optimization (PSO) | |
| dc.title (題名) | A hybrid particle swarm optimization algorithm with diversity for flow-shop scheduling problem | |
| dc.type (資料類型) | conference | en |
| dc.identifier.doi (DOI) | 10.1109/ICICIC.2009.21 | |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1109/ICICIC.2009.21 | |
