A chaotic local search based bacterial foraging algorithm and its application to a permutation flow-shop scheduling problem

doi:10.1080/0951192X.2015.1130240

	A chaotic local search based bacterial foraging algorithm and its application to a permutation flow-shop scheduling problem
	Zhao, Fuqing1 ; Liu, Yang 1; Shao, Zhongshi 1; Jiang, Xin 1; Zhang, Chuck 2; Wang, Junbiao 3
	2016-09-01
发表期刊	International Journal of Computer Integrated Manufacturing
ISSN	0951192X
卷号	29 期号:9 页码:962-981
摘要	The permutation flow-shop scheduling problem (PFSP) is a typical combinational and non-deterministic polynomial-hard problem, with discrete solution space. In this paper, a novel bacterial foraging optimisation algorithm (BFO) has been proposed to solve the PFSP. Difficulties such as slow convergent speeds and entrapment in the local optimum were incurred by the original BFO algorithm in solving a high-dimensional combinatorial optimisation problem. In order to deal with these difficulties, a differential evolution operator and a chaotic search operator were each introduced into the original BFO algorithm to enhance the activity levels of the individual bacterium and to extend the local searching space. Theoretical analysis showed that the improved algorithm obtained more motility in chemotaxis and could converge to the global optimum with a probability of 1. Simulation results and comparisons to both continuous and combinatorial benchmark problems were used to demonstrate the effectiveness of this novel optimisation algorithm. © 2015 Taylor & Francis.
关键词	Biochemistry Combinatorial optimization Evolutionary algorithms Local search (optimization) Machine shop practice Mathematical operators NP-hard Polynomials Scheduling Bacterial foraging Chaotic sequence Differential operators Local search Permutation flow-shop scheduling
DOI	10.1080/0951192X.2015.1130240
收录类别	EI ; SCIE
语种	英语
WOS研究方向	Computer Science ; Engineering ; Operations Research & Management Science
WOS类目	Computer Science, Interdisciplinary Applications ; Engineering, Manufacturing ; Operations Research & Management Science
WOS记录号	WOS:000382507500003
出版者	Taylor and Francis Ltd.
EI入藏号	20160101761732
EI主题词	Combinatorial mathematics
EI分类号	604.2 Machining Operations ; 801.2 Biochemistry ; 912.2 Management ; 921 Mathematics
引用统计	被引频次：19[WOS] [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	https://ir.lut.edu.cn/handle/2XXMBERH/150198
专题	国际合作处（港澳台办）
通讯作者	Zhao, Fuqing
作者单位	1.Lanzhou Univ Technol, Sch Comp & Commun, Lanzhou, Peoples R China; 2.Georgia Inst Technol, H Milton Stewart Sch Ind & Syst Engn, Atlanta, GA 30332 USA; 3.Northwestern Polytech Univ, Minist Educ, Key Lab Contemporary Design & Integrated Mfg Tech, Xian, Peoples R China
第一作者单位	兰州理工大学
通讯作者单位	兰州理工大学
第一作者的第一单位	兰州理工大学
推荐引用方式 GB/T 7714	Zhao, Fuqing,Liu, Yang,Shao, Zhongshi,et al. A chaotic local search based bacterial foraging algorithm and its application to a permutation flow-shop scheduling problem[J]. International Journal of Computer Integrated Manufacturing,2016,29(9):962-981.
APA	Zhao, Fuqing,Liu, Yang,Shao, Zhongshi,Jiang, Xin,Zhang, Chuck,&Wang, Junbiao.(2016).A chaotic local search based bacterial foraging algorithm and its application to a permutation flow-shop scheduling problem.International Journal of Computer Integrated Manufacturing,29(9),962-981.
MLA	Zhao, Fuqing,et al."A chaotic local search based bacterial foraging algorithm and its application to a permutation flow-shop scheduling problem".International Journal of Computer Integrated Manufacturing 29.9(2016):962-981.