现代计算机(普及版)
現代計算機(普及版)
현대계산궤(보급판)
MODERN COMPUTER
2015年
5期
14-17
,共4页
毕孝儒%杨柳%张黎黎%贺拴
畢孝儒%楊柳%張黎黎%賀拴
필효유%양류%장려려%하전
人工蜂群算法%无等待柔性车间调度%混沌算子%搜索能力
人工蜂群算法%無等待柔性車間調度%混沌算子%搜索能力
인공봉군산법%무등대유성차간조도%혼돈산자%수색능력
Artificial Bee Colony Algorithm%NWFFSP%Chaotic Mechanism%Searching Ability
为了解决无等待柔性流水车间调度问题,提出一种改进人工蜂群算法。在算法初始阶段采用混沌算子初始化种群以增强其多样性;在蜜源搜索阶段运用自适应全局最优蜜源搜索策略以平衡人工蜂群算法的“探索与开发”能力,避免算法在搜索后期易于陷入局部最优。将改进算法用于求解无等待柔性流水车间调度问题,仿真实验验证改进算法的有效性和优越性。
為瞭解決無等待柔性流水車間調度問題,提齣一種改進人工蜂群算法。在算法初始階段採用混沌算子初始化種群以增彊其多樣性;在蜜源搜索階段運用自適應全跼最優蜜源搜索策略以平衡人工蜂群算法的“探索與開髮”能力,避免算法在搜索後期易于陷入跼部最優。將改進算法用于求解無等待柔性流水車間調度問題,倣真實驗驗證改進算法的有效性和優越性。
위료해결무등대유성류수차간조도문제,제출일충개진인공봉군산법。재산법초시계단채용혼돈산자초시화충군이증강기다양성;재밀원수색계단운용자괄응전국최우밀원수색책략이평형인공봉군산법적“탐색여개발”능력,피면산법재수색후기역우함입국부최우。장개진산법용우구해무등대유성류수차간조도문제,방진실험험증개진산법적유효성화우월성。
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.