郑州轻工业学院 机构 计算机与通信工程学院,河南,郑州,450002
纸质出版:2017
移动端阅览
姚妮, 李红婵. 基于混合蝙蝠算法的多目标柔性作业车间调度问题[J]. 微电子学与计算机, 2017, 34(3): 25-29, 34.
YAO Ni, LI Hong-Chan. Hybrid Bat Algorithm for Multi-objective Flexible Job Shop Scheduling Problem[J]. 2017, 34(3): 25-29.
该文对基本蝙蝠算法进行了改进
并将其与变邻域搜索算法相结合提出了一种新的混合蝙蝠算法(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.
Yuan Y, Xu H, Yang J. A hybrid harmony search algorithm for the flexible job shop scheduling problem[J]. Applied Soft Computing, 2013, 13(7): 3259-3272. DOI: 3259
Demir Y, Īsleyen S K. An effective genetic algorithm for flexible job-shop scheduling with overlapping in operations[J]. International Journal of Production Research, 2014, 52(13): 3905-3921. DOI: 3905
Yang X S. A new metaheuristic bat-inspired algorithm[C]//Nature inspired cooperative strategies for optimization (NICSO 2010). Germany: Springer, Berlin Heidelberg, 2010: 65-74.
Marichelvam M K, Prabaharan T, Yang X S, et al. Solving hybrid flow shop scheduling problems using bat algorithm[J]. International Journal of Logistics Economics and Globalisation, 2013, 5(1): 15-29. DOI: 15
Xia W, Wu Z. An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems[J]. Computers % Industrial Engineering, 2005, 48(2): 409-425. DOI: 409
Luo Q, Zhou Y, Xie J, et al. Discrete bat algorithm for optimal problem of permutation flow shop scheduling[J]. The Scientific World Journal, 2014, 25(1): 1-15. DOI: 1
Brandimarte P. Routing and scheduling in a flexible job shop by tabu search[J]. Annals of Operations Research, 1993, 41(1): 157-183 DOI: 157
张国辉, 高亮, 李培根, 等. 改进遗传算法求解柔性作业车间调度问题[J]. 机械工程学报, 2009, 45(7): 145-151. DOI: 145
Kacem I, Hammadi S, Borne P. Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic[J]. Mathematics and computers in simulation, 2002, 60(3): 245-276. DOI: 245
马邦雄, 叶春明. 基于蝙蝠退火算法的无等待流水线调度问题研究[J]. 数学理论与应用, 2014, 34(1): 92-101. DOI: 92
0
浏览量
6
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010602201714号