首页 | 本学科首页   官方微博 | 高级检索  
     

基于自适应蚁群算法的柔性作业车间调度问题
引用本文:亓凌,杨建栋,李保,于涵诚.基于自适应蚁群算法的柔性作业车间调度问题[J].机电工程,2010,27(2):46-49.
作者姓名:亓凌  杨建栋  李保  于涵诚
作者单位:浙江省机电设计研究院有限公司,浙江,杭州,310003
摘    要:针对经典作业车间调度问题的局限性,结合实际生产情况,提出了具有路径柔性的作业车间调度模型,给出了求解模型的自适应蚁群算法的具体实现过程。在搜索解路径的过程中,该算法首先确定下一步可供选择加工的工件在哪台机器上加工最好;接着在选择机器后再确定该加工哪个工件;当所有蚂蚁爬行完毕后,针对算法是否陷入局部收敛,分别对各路径上的信息素进行了自适应调整,有助于快速得到全局最优解;最后,通过实例仿真验证了算法的有效性。

关 键 词:蚁群算法  柔性作业车间调度  自适应

Flexible job-shop scheduling problem based on adaptive ant colony algorithm
QI Ling,YANG Jian-dong,LI Bao,YU Han-cheng.Flexible job-shop scheduling problem based on adaptive ant colony algorithm[J].Mechanical & Electrical Engineering Magazine,2010,27(2):46-49.
Authors:QI Ling  YANG Jian-dong  LI Bao  YU Han-cheng
Affiliation:Zhejiang Institute of Mechanical & Electrical Engineering Co.;Ltd.;Hangzhou 310003;China
Abstract:Aiming at flexible job-shop scheduling on analyzing the weakness of classical job-shop,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 workpiece's 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 simul...
Keywords:ant colony algorithm  flexible job-shop scheduling  adaptive  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号