A discrete gravitational search algorithm for the blocking flow shop problem with total flow time minimization

doi:10.1007/s10489-019-01457-w

	A discrete gravitational search algorithm for the blocking flow shop problem with total flow time minimization
	Zhao, Fuqing1 ; Xue, Feilong 1; Zhang, Yi 2; Ma, Weimin 3; Zhang, Chuck 4; Song, Houbin1
	2019-09
发表期刊	APPLIED INTELLIGENCE
ISSN	0924-669X
卷号	49 期号:9 页码:3362-3382
摘要	The blocking flow shop problem (BFSP) is one of the key models in the flow shop scheduling problem in the manufacturing systems. Gravitational Search Algorithm (GSA) is an algorithm based on the population for solving various optimization problems. However, GSA is scarcely applied to solve the BFSP as it is designed to solve the continuous problems. In this paper, a Discrete Gravitational Search Algorithm (DGSA) is presented for solving the BFSP with the total flow time minimization. A new variable profile fitting (VPF) combined with NEH heuristic, named VPF _ NEH(n), is introduced for balancing the quality and the diversity of the initial population to configure the DGSA. The three operators including the variable neighborhood operators (VNO), the path relinking and the plus operator are implemented during the location updating of the candidates. The objective of the operation is to prevent the premature convergence of the population and to balance the exploration and exploitation in the process of optimization. The expected runtime of the DGSA is analyzed by the level-based theorem. The simulated results indicate that the effectiveness and superiority of the DGSA.
关键词	Gravitational search algorithm Blocking flow shop problem Total flow time Constructive heuristic Variable neighborhood search
DOI	10.1007/s10489-019-01457-w
收录类别	SCI ; SCIE
语种	英语
资助项目	Wenzhou Public Welfare Science and Technology project[G20170016]
WOS研究方向	Computer Science
WOS类目	Computer Science, Artificial Intelligence
WOS记录号	WOS:000482434300013
出版者	SPRINGER
EI入藏号	20193407347576
EI主题词	Machine shop practice
EI分类号	537.1 Heat Treatment Processes - 604.2 Machining Operations - 921.5 Optimization Techniques
引用统计	被引频次：13[WOS] [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	https://ir.lut.edu.cn/handle/2XXMBERH/31619
专题	国际合作处（港澳台办）研究生院
通讯作者	Zhao, Fuqing
作者单位	1.Lanzhou Univ Technol, Sch Comp & Commun Technol, Lanzhou 730050, Gansu, Peoples R China; 2.Xijin Univ, Sch Mechn 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,Xue, Feilong,Zhang, Yi,et al. A discrete gravitational search algorithm for the blocking flow shop problem with total flow time minimization[J]. APPLIED INTELLIGENCE,2019,49(9):3362-3382.
APA	Zhao, Fuqing,Xue, Feilong,Zhang, Yi,Ma, Weimin,Zhang, Chuck,&Song, Houbin.(2019).A discrete gravitational search algorithm for the blocking flow shop problem with total flow time minimization.APPLIED INTELLIGENCE,49(9),3362-3382.
MLA	Zhao, Fuqing,et al."A discrete gravitational search algorithm for the blocking flow shop problem with total flow time minimization".APPLIED INTELLIGENCE 49.9(2019):3362-3382.

条目包含的文件		下载所有文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
Zhao-2019-A discrete（3253KB）	期刊论文	出版稿	开放获取	CC BY-NC-SA	浏览下载