SIA OpenIR  > 数字工厂研究室
Improved imperialist competitive algorithm for flexible flow shop scheduling
Sun Y(孙越)1; Lin S(林硕)2; Tan, Li; Ma, Xiaofu
Department数字工厂研究室
Conference Name9th International Conference on Modelling, Identification and Control, ICMIC 2017
Conference DateJuly 10-12, 2017
Conference PlaceKunming, China
Source PublicationProceedings of 2017 9th International Conference On Modelling, Identification and Control, ICMIC 2017
PublisherIEEE
Publication PlaceNew York
2017
Pages169-174
Indexed ByEI
EI Accession number20183105627255
ISBN978-1-5090-6573-8
KeywordFlexible flow-shop problem imperialist Competitive Algorithm Hamming distance makespan
AbstractIn this paper, we investigate the flexible flow-shop scheduling problem (FFSP). The mathematical model is established to minimize the makespan. Improved Imperialist Competitive Algorithm (IICA) is proposed as the global searching mechanism for this optimization problem. Based on the standard imperialist competitive algorithm, two improvements, reform operation and elite individual retention strategy have been introduced. At the same time, to improve the diversity of solutions, the Hamming distance has also been introduced to select the individuals. Through the standard instance tests, the proposed IICA outperforms the genetic algorithm and the standard imperialist competitive algorithm in terms of the convergence speed and global optimum searching for the flexible flow-shop scheduling problem1.
Language英语
Document Type会议论文
Identifierhttp://ir.sia.cn/handle/173321/22362
Collection数字工厂研究室
Corresponding AuthorSun Y(孙越)
Affiliation1.Master Students in Shenyang Jianzhu University, Shenyang, China; Faculty of Information and Control Engineering, Shenyang Jianzhu University, China; Chinese Academy of Sciences in Shenyang Institute of Automation of PhD, Shenyang, China; Municipal and Environmental Engineering Institute in Shenyang Jianzhu University, Shenyang Jianzhu University, China;
2.Department of Electrical and Computer Engineering, Virginia Tech, Blacksburg; VA; 24060, United States
Recommended Citation
GB/T 7714
Sun Y,Lin S,Tan, Li,et al. Improved imperialist competitive algorithm for flexible flow shop scheduling[C]. New York:IEEE,2017:169-174.
Files in This Item: Download All
File Name/Size DocType Version Access License
Improved imperialist(426KB)会议论文 开放获取CC BY-NC-SAView Download
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Sun Y(孙越)]'s Articles
[Lin S(林硕)]'s Articles
[Tan, Li]'s Articles
Baidu academic
Similar articles in Baidu academic
[Sun Y(孙越)]'s Articles
[Lin S(林硕)]'s Articles
[Tan, Li]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Sun Y(孙越)]'s Articles
[Lin S(林硕)]'s Articles
[Tan, Li]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: Improved imperialist competitive algorithm for flexible flow shop scheduling.pdf
Format: Adobe PDF
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.