1. 郑州大学 西亚斯国际学院 计算机科学系, 河南 新郑,451150
2. 郑州轻工业学院 机构 计算机与通信工程学院,河南,郑州,450002
纸质出版:2017
移动端阅览
朱颢东, 何保锋. 面向柔性作业车间调度的变邻域搜索候鸟优化算法[J]. 微电子学与计算机, 2017, 34(4): 28-32, 38.
ZHU Hao-Dong, HE Bao-Feng. Migrating Birds Optimization Algorithm Used Variable Neighborhood Search for Flexible Job Shop Scheduling[J]. 2017, 34(4): 28-32.
分析柔性作业车间的生产特点
结合候鸟优化算法和变邻域搜索算法
提出了一种变邻域搜索候鸟优化算法(Migrating Birds Optimization Algorithm Used Variable Neighborhood Search
VNS_MBOA)求解该车间内的生产调度问题.该算法采用分段式编码方式
并分两阶段对算法种群进行初始化
以提高初始解的质量.根据问题的特性
设计了两种邻域结构
并引入一种变邻域搜索算法有效加强了VNS_MBOA的搜索能力.使用基准算例对本文算法进行测试
并将计算结果与其他文献中算法结果进行比较.仿真数据表明本文所提出的算法在解决柔性作业车间调度方面具有一定的有效性.
By analyzing the production features of the flexible job shop
a migrating birds optimization algorithm used variable neighborhood search(VNS_MBOA) was proposed by combining the migrating birds optimization and the variable neighborhood search algorithm to solve the production scheduling problem. A segment-based encoding approach is adopted
and a two-phase initialization of the population in the algorithm is performed to improve the quality of the initial solution. On the basis of the characteristics of the problem
two neighborhood structures are designed
based on which a variable neighborhood search algorithm is introduced to enhance the searching capability of VNS_MBOA effectively. Benchmark instances are adopted to test the proposed algorithm
and the simulation results are compared with other algorithms in literature. The computational data demonstrate that the proposed algorithm has certain degree effect for solving the flexible job shop scheduling problem.
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
Brandimarte P. Routing and scheduling in a flexible job shop by tabu search[J]. Annals of Operations Research, 1993, 41(3): 157-183. DOI: 157
Demir Y, Īşleyen 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
Ziaee M. A heuristic algorithm for solving flexible job shop scheduling problem[J]. The International Journal of Advanced Manufacturing Technology, 2014, 71(4): 519-528. DOI: 519
Duman E, Uysal M, Alkaya A F. Migrating birds optimization: a new metaheuristic approach and its performance on quadratic assignment problem[J]. Information Sciences, 2012, 217(24): 65-77. DOI: 65
Kacem I, Hammadi S, Borne P. Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems[J]. IEEE Transactions on Systems, Man and Cybernetics, Part C: Applications and Reviews, 2002, 32(1): 1-13. DOI: 1
Tongur V, Vlker E. Migrating birds optimization for flow shop sequencing problem[J]. Journal of Computer and Communications, 2014, 2(4): 142-147. DOI: 142
Chang H C, Tsai H T, Liu T K. Application of genetic algorithm to optimize unrelated parallel machines of flexible job-shop scheduling problem[C]//Proc of 11th IEEE International Conference on Control % Automation. USA: IEEE, 2014: 596-599.
张国辉, 高亮, 李培根, 等. 改进遗传算法求解柔性作业车间调度问题[J]. 机械工程学报, 2009, 45(7): 145-151. DOI: 145
张超勇, 饶运清, 李培根, 等. 柔性作业车间调度问题的两级遗传算法[J]. 机械工程学报, 2007, 43(4): 119-123. DOI: 119
石小秋, 石宇强, 袁雪娇. 离散多种群入侵杂草优化算法求解柔性作业车间调度问题[J]. 信息与控制, 2015, 44(2): 238-243. DOI: 238
0
浏览量
18
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010602201714号