计算机应用与软件2016，Vol.33Issue(11)：188-192,5.DOI:10.3969/j.issn.1000-386x.2016.11.044
应用混沌烟花算法求解置换流水车间问题
APPLYING CHAOTIC FIREWORKS ALGORITHM IN SOLVING PERMUTATION FLOW SHOP PROBLEM
摘要
Abstract
We improved the fireworks algorithm to solve PFSP.By encoding with maximum position method,we mapped the continuous variables onto discrete space.To strike a balance between global searching and local searching,we introduced dynamic radius factor.We further mined the individual information with elite individual chaotic search.We replaced original selection operator with champion contest strategy,and as a result,the excellent ones in population could be selected at a higher rate of probability.We chose right parameters through orthogonal experiment for solving the benchmark problems of Car class and Rec class.Comparative experiments on basic fireworks algorithm, firefly algorithm and particle swarm optimisation illustrated that the improved chaotic fireworks algorithm has certain advantage over other algorithms in searching rate and searching speed and is an effective tool of solving permutation flow shop problem.关键词
烟花算法/混沌搜索/置换流水车间问题Key words
Fireworks algorithm/Chaotic searching/Permutation flow shop problem分类
信息技术与安全科学引用本文复制引用
曹磊,叶春明,黄霞..应用混沌烟花算法求解置换流水车间问题[J].计算机应用与软件,2016,33(11):188-192,5.基金项目
国家自然科学基金项目（71271138）；上海市一流学科建设项目（S1201YLXK）；沪江基金项目（A14006）；上海理工大学人文社科攀登计划项目（14XPB01）。 （）
