中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Self-adaptive cuckoo search algorithm for hybrid flowshop makespan problem

文献类型:会议论文

作者Han ZH(韩忠华); Dong XT(董晓婷); Lv XS(吕希胜)
出版日期2015
会议名称2015 IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems (CYBER)
会议日期June 8-12, 2015
会议地点Shenyang, China
关键词hybrid flow shop scheduling problem makespan SACS algorithm bottleneck heuristic elite learning strategies
页码1539-1545
中文摘要As a typical NP-hard combination optimization problem, the hybrid flow shop widely exists in manufacturing systems. In this paper, a mathematical model of hybrid flow shop is formulated, and then a new encoding and decoding method based on matrix is designed, together with Self-Adaptive Cuckoo Search(SACS) algorithm to minimize the makespan of this problem. The main contribution of this paper is to develop a new approach hybridizing CS with bottleneck heuristic method to fully exploit the bottleneck stage, and then bring in a self-adaptive parameter adjusting strategy along with iterations to enhance the ability to jump out of local extreme value and maintain the evolution energy. furthermore, elite learning strategies and some local search methods are applied to enhance the local search ability. The comparison between the proposed algorithm and several effective algorithms show that the SACS algorithm is feasible and practical.
收录类别EI ; CPCI(ISTP)
产权排序1
会议录2015 IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems (CYBER)
会议录出版者IEEE
会议录出版地Piscataway, NJ, USA
语种英语
ISSN号2379-7711
ISBN号978-1-4799-8730-6
WOS记录号WOS:000380502300281
源URL[http://ir.sia.cn/handle/173321/18526]  
专题沈阳自动化研究所_数字工厂研究室
推荐引用方式
GB/T 7714
Han ZH,Dong XT,Lv XS. Self-adaptive cuckoo search algorithm for hybrid flowshop makespan problem[C]. 见:2015 IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems (CYBER). Shenyang, China. June 8-12, 2015.

入库方式: OAI收割

来源:沈阳自动化研究所

浏览0
下载0
收藏0
其他版本

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