一种异步蚁群算法求解柔性作业车间调度问题

发布时间：2018-04-27 13:51

本文选题：蚁群算法 + 柔性作业车间调度　；参考：《天津大学学报(自然科学与工程技术版)》2016年09期

【摘要】：调度问题广泛存在于资源共享型系统中,大多数的调度问题都属于混合整数规划问题.大规模混合整数规划问题是计算科学领域中的NP-hard经典问题之一,一般认为无法用精确计算求解.生产调度是调度的一个重要分支,是实现智能制造关键环节之一.针对多品种变批量柔性作业车间调度问题,以最小制造期为优化目标,设计了一种基于Petri网的异步并行蚁群算法,其中:提出了一种基于Petri网的步可达图构造方法,用于蚁群算法解空间的构造;探讨了传统蚁群算法搜索机制,并给出了一种基于异步仿真时钟的蚁群并行搜索方法;仿真结果表明,多线程控制方法可以有效地避免算法的早熟收敛问题.将所提出的算法应用于某安防件智能制造系统的柔性作业车间调度中,降低了系统的总制造时间,获得较好工程效果的同时验证了算法的有效性.
[Abstract]:Scheduling problems exist widely in resource-sharing systems, and most scheduling problems belong to mixed integer programming problems. The large-scale mixed integer programming problem is one of the classical NP-hard problems in the field of computational science. Production scheduling is an important branch of scheduling and one of the key links to realize intelligent manufacturing. Aiming at the flexible job shop scheduling problem with multiple varieties and variable batches, an asynchronous parallel ant colony algorithm based on Petri nets is designed with the minimum manufacturing period as the optimization objective. Among them, a step Datuk construction method based on Petri nets is proposed. It is used to construct the solution space of ant colony algorithm. The traditional search mechanism of ant colony algorithm is discussed, and an ant colony parallel search method based on asynchronous simulation clock is presented. The simulation results show that, Multithread control method can effectively avoid the problem of premature convergence of the algorithm. The proposed algorithm is applied to the flexible job shop scheduling of an intelligent manufacturing system for a security component, which reduces the total manufacturing time of the system, obtains better engineering results and verifies the effectiveness of the algorithm.
【作者单位】：天津大学机械工程学院;天津大学机构理论与装备设计教育部重点实验室;天津市数控系统技术工程中心;福州大学机械工程及自动化学院;
【基金】：国家自然科学基金资助项目(51475324);国家自然科学基金青年基金资助项目(51105269)
【分类号】：TP18;TB497

【相似文献】