SIA OpenIR  > 数字工厂研究室
Improved imperialist competitive algorithm for flexible flow shop scheduling
Sun Y(孙越)1; Lin S(林硕)2; Tan, Li; Ma, Xiaofu
作者部门数字工厂研究室
会议名称9th International Conference on Modelling, Identification and Control, ICMIC 2017
会议日期July 10-12, 2017
会议地点Kunming, China
会议录名称Proceedings of 2017 9th International Conference On Modelling, Identification and Control, ICMIC 2017
出版者IEEE
出版地New York
2017
页码169-174
收录类别EI
EI收录号20183105627255
ISBN号978-1-5090-6573-8
关键词Flexible flow-shop problem imperialist Competitive Algorithm Hamming distance makespan
摘要In 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.
语种英语
文献类型会议论文
条目标识符http://ir.sia.cn/handle/173321/22362
专题数字工厂研究室
通讯作者Sun Y(孙越)
作者单位1.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
推荐引用方式
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.
条目包含的文件 下载所有文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
Improved imperialist(426KB)会议论文 开放获取CC BY-NC-SA浏览 下载
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Sun Y(孙越)]的文章
[Lin S(林硕)]的文章
[Tan, Li]的文章
百度学术
百度学术中相似的文章
[Sun Y(孙越)]的文章
[Lin S(林硕)]的文章
[Tan, Li]的文章
必应学术
必应学术中相似的文章
[Sun Y(孙越)]的文章
[Lin S(林硕)]的文章
[Tan, Li]的文章
相关权益政策
暂无数据
收藏/分享
文件名: Improved imperialist competitive algorithm for flexible flow shop scheduling.pdf
格式: Adobe PDF
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。