政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/75471

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 113160/144130 (79%)
Visitors : 50760298 Online Users : 834

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

政大機構典藏 > 商學院 > 資訊管理學系 > 會議論文 > Item 140.119/75471

Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/75471

Title:	A hybrid particle swarm optimization algorithm with diversity for flow-shop scheduling problem
Authors:	Chen, Chuenlung 陳春龍
Contributors:	資訊管理學系
Keywords:	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)
Date:	2009-12
Issue Date:	2015-06-01 17:24:26 (UTC+8)
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.
Relation:	2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009,864-867
Data Type:	conference
DOI 連結:	http://dx.doi.org/10.1109/ICICIC.2009.21
DOI:	10.1109/ICICIC.2009.21
Appears in Collections:	[資訊管理學系] 會議論文

Files in This Item:

There are no files associated with this item.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

Loading...