基于混合蝙蝠算法的多目标柔性作业车间调度问题  

Hybrid Bat Algorithm for Multi-objective Flexible Job Shop Scheduling Problem

作　　者：姚妮[1] 李红婵[1] YAO Ni LI Hong-Chan(School of Computer and Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, Chin)

机构地区：[1]郑州轻工业学院计算机与通信工程学院,河南郑州450002

出　　处：《微电子学与计算机》2017年第3期25-29,34,共6页Microelectronics & Computer

基　　金：河南省科技攻关项目(122102210492)

摘　　要：该文对基本蝙蝠算法进行了改进,并将其与变邻域搜索算法相结合提出了一种新的混合蝙蝠算法(Hybrid bat algorithm,HBA).算法中设计了个体位置向量的表示方法以及位置向量与调度解间的转换机制.此外,给出了种群初始化方法和两种邻域结构,并引入变邻域搜索算法增强算法搜索能力.最后,通过对基准算例仿真验证了所提算法的有效性.In this paper, the multi-objective flexible job shop scheduling problem （FJSP） and the basic bat algorithm are introduced at first. Secondly, the basic bat algorithm is improved and combined with the variable neighborhood search algorithm to obtain a new hybrid bat algorithm （HBA）. In HBA, an individual position vector representation method and the conversion mechanism between the individual position vector and the scheduling solution are designed. In addition, a population initialization scheme and two neighborhood structures are given, and a variable neighborhood algorithm is introduced to enhance the searching ability. Finally, benchmark instances are simulated to demonstrate the effectiveness of the proposed algorithm.

关 键 词：柔性作业车间调度 多目标优化 蝙蝠算法 变邻域搜索算法 

分 类 号：TH165[机械工程—机械制造及自动化]