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

基于混合蚁群算法的企业车间作业计划问题研究
引用本文:卢冰原, 程八一,.基于混合蚁群算法的企业车间作业计划问题研究[J].华东经济管理,2010,24(11):147-149.
作者姓名:卢冰原  程八一  
作者单位:1. 南京工程学院,经济管理学院,江苏,南京,211167
2. 中国科学技术大学,管理学院,安徽,合肥,230026
基金项目:江苏省教育厅高校哲学社会科学基金项目,国家自然科学基金项目 
摘    要:文章研究了以最小化制造跨度为目标的,具有模糊加工时间的车问作业计划问题。针对该问题,采用三角模糊数来表征时间参数,并在此基础上构建问题目标函数。之后给出了一种混合蚁群求解算法,将模拟退火算法的全局优化特性嵌入蚁群算法来避免局部最优的问题。最后通过实例验证了算法的有效性。

关 键 词:车间作业计划  蚁群算法  模拟退火算法  组合优化

The Research of Enterprise Job-shop Scheduling Problem Based on Hybrid Ant Colony Optimization
LU Bing-yuan; CHENG Ba-yi.The Research of Enterprise Job-shop Scheduling Problem Based on Hybrid Ant Colony Optimization[J].East China Economic Management,2010,24(11):147-149.
Authors:LU Bing-yuan; CHENG Ba-yi
Institution:1.School of Economics and Management; Nanjing Institute of Technology; Nanjing 211167; China; 2.School of Management; University of Science and Technology of China; Hefei 230026; China
Abstract:This paper studies the job-shop scheduling problem which has fuzzy operation time and which aims at minimized makespan.For this problem,it introduces triangle fuzzy number to denote time parameters,on which the aim function is constructed.After that,a hybrid ant colony optimization is proposed to get perfect scheduling scheme,which can prevent premature optimization by inserting the global optimization ability of SA into ACO.Moreover,some examples are described to approve its effectiveness.
Keywords:job-shop scheduling  ant colony optimization  simulated annealing  combinatorial optimization
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《华东经济管理》浏览原始摘要信息
点击此处可从《华东经济管理》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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