基于双向收敛蚁群算法在车间作业调度上的应用  

Application of two-way convergence ant colony algorithm in job shop scheduling

作　　者：朱福珍[1] 陆静[1] 毛文娟[2] 许郡[1] 蔡娟[1] 

机构地区：[1]扬州市职业大学,江苏扬州225009 [2]南京工业职业技术学院,江苏南京210046

出　　处：《长沙通信职业技术学院学报》2012年第1期57-59,共3页Journal of Changsha Telecommunications and Technology Vocational College

摘　　要：合理搭配车间中生产环节的各种资源,减少零部件的准备工作,可以提高设备使用率与生产效率。提出双向收敛蚁群算法,并通过实例跟基本蚁群算法相比较,实验结果证明采用双向收敛蚁群算法可以提高搜索过程的挥发系数,加快收敛速度。Reasonable configuration of all kinds of resources in the machining process and the reduction of the preparation of the parts can improve the equipment utilization and the production efficiency.The two-way convergence ant colony algorithm is put forward and through the comparison with the basic ant colony algorithm,the experimental results show that by using the two-way convergence ant colony algorithm,the volatile coefficient in the search process can be improved and the convergence speed can be fastened.

关 键 词：车间作业调度 双向收敛蚁群算法 信息素 

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