求解可重入作业车间调度问题的改进离散微粒群优化算法  

Improved discrete particle swarm optimization algorithm to solve the reentrant job-shop scheduling problem

作　　者：万婧[1] 

机构地区：[1]山东省科学院海洋仪器仪表研究所,山东省海洋仪器仪表科技中心,山东青岛26600

出　　处：《山东科学》2017年第6期105-109,共5页Shandong Science

基　　金：青岛市市南区科技发展基金(2016-2-012-ZH)

摘　　要：本文针对可重入作业车间调度问题,对离散微粒群算法的搜索方式进行改进,混合一种变异机制,并结合Interchange邻域局部搜索机制,设计与开发有效的混合离散微粒群算法。通过实验仿真结果的比较,有力地证明了所提算法的有效性。In this paper, by combining the existing discrete particle swarm optimization algorithm with a small but effective local search, an effective hybrid discrete particle swarm optimization algorithm was formed. This paper also discussed how to fuse the local search to optimize the discrete particle swarm. And the effectiveness of the proposed algorithm has been proved by the comparison of the simulation results.

关 键 词：离散微粒群算法 局部搜索 作业车间 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]