A Differential-Based Harmony Search Algorithm with Variable Neighborhood Search for Job Shop Scheduling Problem and Its Runtime Analysis

doi:10.1109/ACCESS.2018.2877791

	A Differential-Based Harmony Search Algorithm with Variable Neighborhood Search for Job Shop Scheduling Problem and Its Runtime Analysis
	Zhao, Fuqing 3; Qin, Shuo 3; Yang, Guoqiang 3; Ma, Weimin 1; Zhang, Chuck 2; Song, Houbin 3
刊名	IEEE Access
	2018
卷号	6 页码:76313-76330
关键词	Benchmarking Global optimization Intelligent systems Learning algorithms Machine shops Manufacture Scheduling Combinational optimization Global optimization problems Harmony search Harmony search algorithms Job shop scheduling problems Run-time analysis State-of-the-art algorithms Variable neighborhood search
ISSN号	2169-3536
DOI	10.1109/ACCESS.2018.2877791
英文摘要	Job shop scheduling problem (JSSP) has drawn a lot of attention as it is one of the vital combinational optimization problems in manufacturing systems. In this paper, a differential-based harmony search (DHS) algorithm with variable neighborhood search (VNS) is proposed for solving JSSP with the objective of minimized makespan. Since the standard harmony search algorithm is constructed for global optimization problems, the smallest position value is introduced to map a harmony vector to an active schedule. The active decoding scheme is employed to improve the search efficiency of DHS. In the pitch-adjustment process, the best individual of the current harmony memory is employed to accelerate the convergence speed. After the pitch-adjustment process, the differential-based enhanced mechanism is designed to maintain the diversity of the population. The modified VNS, which is based on the blocks on the critical path, is embedded into DHS to search for a better solution around the current harmony vector. Besides, the runtime of DHS is analyzed according to the level-based theorem. Compared with various HS-based algorithms and other state-of-the-art algorithms on a set of typical benchmark instances, the DHS is superior to the compared algorithms in terms of solution quality, convergence speed, and stability. The DHS lays a solid foundation for solving optimization problems of expert and intelligent systems. © 2013 IEEE.
资助项目	Science Foundation for Distinguished Youth Scholars of Lanzhou University of Technology[2012M521802] ; Science Foundation for Distinguished Youth Scholars of Lanzhou University of Technology[2013T60889] ; Science Foundation for Distinguished Youth Scholars of Lanzhou University of Technology[J201405]
WOS研究方向	Computer Science ; Engineering ; Telecommunications
语种	英语
出版者	Institute of Electrical and Electronics Engineers Inc.
WOS记录号	WOS:000454485700001
状态	已发表
内容类型	期刊论文
源URL	[http://ir.lut.edu.cn/handle/2XXMBERH/114814]
专题	国际合作处（港澳台办）研究生院
通讯作者	Zhao, Fuqing
作者单位	1.Tongji Univ, Sch Econ & Management, Shanghai 200092, Peoples R China 2.Georgia Inst Technol, H Milton Stewart Sch Ind & Syst Engn, Atlanta, GA 30332 USA 3.Lanzhou Univ Technol, Sch Comp & Commun Technol, Lanzhou 730050, Gansu, Peoples R China
推荐引用方式 GB/T 7714	Zhao, Fuqing,Qin, Shuo,Yang, Guoqiang,et al. A Differential-Based Harmony Search Algorithm with Variable Neighborhood Search for Job Shop Scheduling Problem and Its Runtime Analysis[J]. IEEE Access,2018,6:76313-76330.
APA	Zhao, Fuqing,Qin, Shuo,Yang, Guoqiang,Ma, Weimin,Zhang, Chuck,&Song, Houbin.(2018).A Differential-Based Harmony Search Algorithm with Variable Neighborhood Search for Job Shop Scheduling Problem and Its Runtime Analysis.IEEE Access,6,76313-76330.
MLA	Zhao, Fuqing,et al."A Differential-Based Harmony Search Algorithm with Variable Neighborhood Search for Job Shop Scheduling Problem and Its Runtime Analysis".IEEE Access 6(2018):76313-76330.