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, Fuqing 1; Liu, Yang 1; Shao, Zhongshi 1; Jiang, Xin 1; Zhang, Chuck 3; Wang, Junbiao 2
刊名	International Journal of Computer Integrated Manufacturing
	2016-09-01
卷号	29 期号:9 页码:962-981
关键词	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
ISSN号	0951192X
DOI	10.1080/0951192X.2015.1130240
英文摘要	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.
WOS研究方向	Computer Science ; Engineering ; Operations Research & Management Science
语种	英语
出版者	Taylor and Francis Ltd.
WOS记录号	WOS:000382507500003
内容类型	期刊论文
源URL	[http://ir.lut.edu.cn/handle/2XXMBERH/150198]
专题	国际合作处（港澳台办）
作者单位	1.School of Computer and Communication, Lanzhou University of Technology, Lanzhou, China; 2.Key Laboratory of Contemporary Design and Integrated Manufacturing Technology, Ministry of Education, Northwestern Polytechnical University, Xi’an, China 3.H. Milton Stewart School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, United States;
推荐引用方式 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.