南京理工大学学报（自然科学版）2019，Vol.43Issue(1)：48-53,62,7.DOI:10.14177/j.cnki.32-1397n.2019.43.01.007
一种求解置换流水车间调度问题的多策略粒子群优化
Multi-strategy particle swarm optimization for solving permutation flow-shop scheduling problem
摘要
Abstract
In order to improve the search performance of combinatorial optimization problem for particle swarm optimization, a multi-strategy particle swarm optimization method is proposed for solving permutation flow-shop scheduling problems based on various combinatorial optimization strat- egies. The proposed method uses information entropy to measure the population diversity of particle group through the sub interval of gravitational value partition. At the same time,the global optimal particle selection is selected by ant routing selection strategy and considering the distance between particles and the mass of inertia. In addition,a novel mutation is designed to guide particle swarm to jump out of the local optimal solution area and enhance the global search ability of particle swarm. The simulation results of test problems show that the multi-strategy particle swarm optimization can effectively accelerate the search performance and convergence speed of the optimal solution,and it can be effectively applied to solve the permutation flow-shop scheduling problem.关键词
粒子群优化/置换流水车间调度问题/多策略粒子群优化方法/多样性Key words
particle swarm optimization/ permutation flow-shop scheduling problem/ multi-strategy particle swarm optimization method/diversity分类
信息技术与安全科学引用本文复制引用
汤可宗,詹棠森,李佐勇,舒云..一种求解置换流水车间调度问题的多策略粒子群优化[J].南京理工大学学报（自然科学版）,2019,43(1):48-53,62,7.基金项目
国家自然科学基金(61662037 （）
71763013) （）
江西省教育厅科技项目(GJJ170764) （GJJ170764）
江西省杰出青年人才计划资助(20171bc b23069) （20171bc b23069）
福建省高校青年自然基金重点项目(JZ160467) （JZ160467）
工业机器人应用福建省高校工程研究中心开放基金资助(MJUKF-IRA201808) （MJUKF-IRA201808）
