信息与控制Issue(2)：238-243,6.DOI:10.13976/j.cnki.xk.2015.0238
离散多种群入侵杂草优化算法求解柔性作业车间调度问题
Invasive Weed Optimization Algorithm with Discrete Multi-population for the Flexible Job-shop Scheduling Problem
石小秋 1石宇强 1袁雪娇1
作者信息
- 1. 西南科技大学制造科学与工程学院，四川 绵阳 621000
- 折叠
摘要
Abstract
After analyzing the characteristics of the flexible job-shop scheduling problem (FJSP),we propose an invasive weed optimization algorithm with discrete multi-population based on the basic invasive weed optimiza-tion to solve the FJSP.The proposed algorithm uses the multi-population without population exchange at the early stage,while the weeds use the crossover operator to communicate with each other within their own popu-lation.Self-adaptive mutation and local search are used in the space diffusion to improve the global search ability at the early stage of the algorithm and the local search ability at the later stage of the algorithm.At the later stage of the algorithm,the convergence rate and the optimization accuracy of the algorithm are improved through population exchange.This algorithm is used in FJSP and a matrix-decoding method is proposed when decoding.The effectiveness and the advantage of the algorithm are demonstrated using some examples.关键词
入侵杂草优化算法/柔性作业车间调度/多种群/矩阵解码法Key words
invasive weed optimization/flexible job-shop scheduling problem/multi-population/matrix-decoding method分类
信息技术与安全科学引用本文复制引用
石小秋,石宇强,袁雪娇..离散多种群入侵杂草优化算法求解柔性作业车间调度问题[J].信息与控制,2015,(2):238-243,6.
