基于自适应蚁群算法的柔性作业车间调度问题

作者：亓凌，杨建栋，李保，于涵诚 日期：2010-03-26/span> 浏览：3830 查看PDF文档

基于自适应蚁群算法的柔性作业车间调度问题

亓凌，杨建栋，李保，于涵诚
(浙江省机电设计研究院有限公司，浙江 杭州 310003)

摘要：针对经典作业车间调度问题的局限性,结合实际生产情况,提出了具有路径柔性的作业车间调度模型,给出了求解模型的自适应蚁群算法的具体实现过程。在搜索解路径的过程中，该算法首先确定下一步可供选择加工的工件在哪台机器上加工最好；接着在选择机器后再确定该加工哪个工件；当所有蚂蚁爬行完毕后，针对算法是否陷入局部收敛，分别对各路径上的信息素进行了自适应调整，有助于快速得到全局最优解；最后，通过实例仿真验证了算法的有效性。
关键词：蚁群算法；柔性作业车间调度；自适应
中图分类号：TM383.5文献标识码：A文章编号：1001-4551(2010)02-0046-04

Flexible jobshop scheduling problem based on adaptive ant colony algorithm
QI Ling, YANG Jiandong, LI Bao, YU Hancheng
(Zhejiang Institute of Mechanical & Electrical Engineering Co., Ltd., Hangzhou 310003, China)
Abstract: Aiming at flexible jobshop scheduling on analyzing the weakness of classical jobshop, an adaptive ant colony algorithm was developed to solve the model. An adaptive ant colony algorithm was advanced, in the course of searching solution route, this algorithm first choose which machine process procedure is the best, then choose process which workpieces procedure. After all ants crawl, adjust pheromone arm at whether algorithm get into part convergence, this can help to get best solution faster. In the end the simulation results show that the algorithm has good performance.
Key words: ant colony algorithm; flexible jobshop scheduling; adaptive
参考文献(References):
［1］DORIGO M, MANIEZZO V, COLORNI A. The ant system: optimization by a colony of cooperating agents［J］. IEEE Transactions on Systems, Man, and Cybernetics： Part B,1996,26(1):29-41.
［2］王常青，操云甫，戴国忠.用双向收敛蚁群算法解作业车间调度问题［J］.计算机集成制造系统，2004，10(7):820-824.
［3］杨阿莉.一种改进蚁群算法在车间作业调度问题中的研究与应用［J］.机械与电子，2005(4):9-12.
［4］CHAMBERS J B, BARNES J W. Tabu Search for the FlexibleRouting Job Shop Problem［R］. Austin: Technical Report Series ORP 96－10, Department of Mechanical Engineering, the University of Texas at Austin,1996.
［5］JANSEN K, SOLISOBA R, SVIRIDENKO M I. A Linear Time Approximation Scheme for the Job Shop Scheduling Problem［C］. Dorit S Hochbaum, Klaus Jansen, Jose D P Rolin, Alistair Sinclair, eds. Proceedings of the Second International Workshop on Approximation Algorithms(APPROX 99). Berkeley: Springer,1999.
［6］庞哈利.柔性jobshop集成化计划调度模型及其求解算法［J］.控制与决策，2003,18(1):34-39.
［7］LENG Sheng, WEI Xiaobin, ZHANG Weny. Improved aco scheduling algorithm based on flexible process［J］. Transactions of Nanjing University of Aeronautics & Atronautics,2006,23(2):154-160.
［8］HISAO I, SHINA M, HIDES T. Modified simulated annealing algorithms for the flow shop S equencing problem［J］. Euro J. of Operation Research,1995,81(2):388-398.
［9］赵巍，王万良.改进遗传算法求解柔性jobshop调度问题［J］.东南大学学报:自然科学版,2003,33（z1）:120-123.
［10］余琦玮，赵亮，潘双夏.基于遗传算法的柔性作业车间调度优化［J］.组合机床与自动化加工技术，2004(4):34-36.