基于混合蚁群算法的企业车间作业计划问题研究  

The Research of Enterprise Job-shop Scheduling Problem Based on Hybrid Ant Colony Optimization

作　　者：卢冰原[1] 程八一[2] 

机构地区：[1]南京工程学院经济管理学院,江苏南京211167 [2]中国科学技术大学管理学院,安徽合肥230026

出　　处：《华东经济管理》2010年第11期147-149,共3页East China Economic Management

基　　金：江苏省教育厅高校哲学社会科学基金项目(09SJD630036);国家自然科学基金项目(70671096)

摘　　要：文章研究了以最小化制造跨度为目标的,具有模糊加工时间的车间作业计划问题。针对该问题,采用三角模糊数来表征时间参数,并在此基础上构建问题目标函数。之后给出了一种混合蚁群求解算法,将模拟退火算法的全局优化特性嵌入蚁群算法来避免局部最优的问题。最后通过实例验证了算法的有效性。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.

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

分 类 号：F273[经济管理—企业管理]