A hybrid biogeography-based optimization with variable neighborhood search mechanism for no-wait flow shop scheduling problem
Zhao, Fuqing1; Qin, Shuo1; Zhang, Yi2; Ma, Weimin3; Zhang, Chuck4; Song, Houbin1
2019-07-15
发表期刊EXPERT SYSTEMS WITH APPLICATIONS
ISSN0957-4174
卷号126页码:321-339
摘要The no-wait flow shop scheduling problem (NWFSP) plays an essential role in the manufacturing industry. Inspired by the overall process of biogeography theory, the standard biogeography-based optimization (BBO) was constructed with migration and mutation operators. In this paper, a hybrid biogeography-based optimization with variable neighborhood search (HBV) is implemented for solving the NWFSP with the makespan criterion. The modified NEH and the nearest neighbor mechanism are employed to generate a potential initial population. A hybrid migration operator, which combines the path relink technique and the block-based self-improvement strategy, is designed to accelerate the convergence speed of HBV. The iterated greedy (IG) algorithm is introduced into the mutation operator to obtain a promising solution in exploitation phase. A variable neighbor search strategy, which is based on the block neighborhood structure and the insert neighborhood structure, is designed to perform the local search around the current best solution in each generation. Furthermore, the global convergence performance of the HBV is analyzed with the Markov model. The computational results and comparisons with other state-of-art algorithms based on Taillard and VRF benchmark show that the efficiency and performance of HBV for solving NWFSP. (C) 2019 Elsevier Ltd. All rights reserved.
关键词Biogeography-based optimization No-wait flow shop scheduling problem Block neighborhood structure Markov model Path relink technique
DOI10.1016/j.eswa.2019.02.023
收录类别SCI ; SCIE
语种英语
资助项目Wenzhou Public Welfare Science and Technology project[G20170016]
WOS研究方向Computer Science ; Engineering ; Operations Research & Management Science
WOS类目Computer Science, Artificial Intelligence ; Engineering, Electrical & Electronic ; Operations Research & Management Science
WOS记录号WOS:000464486100025
出版者PERGAMON-ELSEVIER SCIENCE LTD
EI入藏号20191006599950
EI主题词Optimization
EI分类号454.3 Ecology and Ecosystems - 604.2 Machining Operations - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.1 Computer Programming - 912.2 Management - 921.5 Optimization Techniques - 922.1 Probability Theory
引用统计
被引频次:60[WOS]   [WOS记录]     [WOS相关记录]
文献类型期刊论文
条目标识符https://ir.lut.edu.cn/handle/2XXMBERH/31724
专题国际合作处(港澳台办)
研究生院
通讯作者Zhao, Fuqing
作者单位1.Lanzhou Univ Technol, Sch Comp & Commun Technol, Lanzhou 730050, Gansu, Peoples R China;
2.Xijin Univ, Sch Mech Engn, Xian 710123, Shaanxi, Peoples R China;
3.Tongji Univ, Sch Econ & Management, Shanghai 200092, Peoples R China;
4.Georgia Inst Technol, H Milton Stewart Sch Ind & Syst Engn, Atlanta, GA 30332 USA
第一作者单位兰州理工大学
通讯作者单位兰州理工大学
第一作者的第一单位兰州理工大学
推荐引用方式
GB/T 7714
Zhao, Fuqing,Qin, Shuo,Zhang, Yi,et al. A hybrid biogeography-based optimization with variable neighborhood search mechanism for no-wait flow shop scheduling problem[J]. EXPERT SYSTEMS WITH APPLICATIONS,2019,126:321-339.
APA Zhao, Fuqing,Qin, Shuo,Zhang, Yi,Ma, Weimin,Zhang, Chuck,&Song, Houbin.(2019).A hybrid biogeography-based optimization with variable neighborhood search mechanism for no-wait flow shop scheduling problem.EXPERT SYSTEMS WITH APPLICATIONS,126,321-339.
MLA Zhao, Fuqing,et al."A hybrid biogeography-based optimization with variable neighborhood search mechanism for no-wait flow shop scheduling problem".EXPERT SYSTEMS WITH APPLICATIONS 126(2019):321-339.
条目包含的文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
Zhao-2019-A hybrid b(1142KB)期刊论文出版稿开放获取CC BY-NC-SA浏览 请求全文
个性服务
查看访问统计
谷歌学术
谷歌学术中相似的文章
[Zhao, Fuqing]的文章
[Qin, Shuo]的文章
[Zhang, Yi]的文章
百度学术
百度学术中相似的文章
[Zhao, Fuqing]的文章
[Qin, Shuo]的文章
[Zhang, Yi]的文章
必应学术
必应学术中相似的文章
[Zhao, Fuqing]的文章
[Qin, Shuo]的文章
[Zhang, Yi]的文章
相关权益政策
暂无数据
收藏/分享
文件名: Zhao-2019-A hybrid biogeography-based optimiza.pdf
格式: Adobe PDF
所有评论 (0)
暂无评论
 

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