改进人工蜂群算法求解无等待柔性流水车间调度问题
Improved ArtificiaI Bee CoIony AIgorithm for SoIving No-wait FIexibIe FIow Shop ScheduIing ProbIem
毕孝儒 1杨柳 1张黎黎 1贺拴1
作者信息
- 1. 四川外国语大学重庆南方翻译学院管理学院，重庆 401120
- 折叠
摘要
为了解决无等待柔性流水车间调度问题，提出一种改进人工蜂群算法。在算法初始阶段采用混沌算子初始化种群以增强其多样性；在蜜源搜索阶段运用自适应全局最优蜜源搜索策略以平衡人工蜂群算法的“探索与开发”能力，避免算法在搜索后期易于陷入局部最优。将改进算法用于求解无等待柔性流水车间调度问题，仿真实验验证改进算法的有效性和优越性。
Abstract
To solve NWFFSP, proposes an improved artificial bee colony algorithm. Adopts chaotic mechanism to initialize each individual of the swarm for it's diversity; in the phase of search for nectar source, applies self-adaptive global searching strategy to balance ability of the algorithm for exploring and development for avoiding local optimization of end phase of search. Uses improved artificial bee colony algo-rithm for solving NWFFSP and proves the validity and superiority of the algorithm by simulation experiment.
关键词
人工蜂群算法/无等待柔性车间调度/混沌算子/搜索能力Key words
Artificial Bee Colony Algorithm/NWFFSP/Chaotic Mechanism/Searching Ability引用本文复制引用
基金项目
四川外国语大学重庆南方翻译学院科研项目(ky2014004)
出版年
2015
NETL
NSTL
维普
万方数据