| 基于模拟退火的蚁群算法求解Job-Shop问题 |
| |
| 引用本文： | 张晓婧,高慧敏.基于模拟退火的蚁群算法求解Job-Shop问题[J].计算机应用与软件,2008,25(5):77-79. |
| |
| 作者姓名： | 张晓婧 高慧敏 |
| |
| 作者单位： | 太原科技大学计算机科学与技术学院,山西,太原,030024 |
| |
| 摘 要： | 引用蚁群算法来解决Job-Shop问题(简称JSP),但是由于蚁群算法本身的原理和Job-Shop问题之间的差异性,使得用基本的蚁群算法来解决Job-Shop问题存在一些缺陷.从蚁群算法的改进入手,采用了不同策略的信息素更新方法,并采用模拟退火算法对搜索到的解进行处理,不仅加快了算法的收敛速度,而且能收敛到更好的解,最后用实例对算法的有效性进行了验证.
|
| 关 键 词： | Job-Shop问题 蚁群算法 模拟退火算法 |
| 修稿时间： | 2006年5月22日 |
APPLICATION OF ANT COLONY OPTIMIZATION BASED ON SIMULATED ANNEALING TO JOG-SHOP PROBLEM |
| |
| Zhang Xiao-jing,Gao Hui-min.APPLICATION OF ANT COLONY OPTIMIZATION BASED ON SIMULATED ANNEALING TO JOG-SHOP PROBLEM[J].Computer Applications and Software,2008,25(5):77-79. |
| |
| Authors: | Zhang Xiao-jing Gao Hui-min |
| |
| Affiliation: | Zhang Xiaojing Gao Huimin(Institute of Computer Science , Technology,Taiyuan University of Science , Technology,Taiyuan 030024,Shanxi,China) |
| |
| Abstract: | Ant colony optimization method is applied to solve JobShop problem(JSP).But due to the discrepancy between the theory of ant colony optimization and the Job-Shop problem,there are some disadvantages to solve JobShop problem singly by basic ant colony optimization.The ant colony algorithm is improved.A method for pheromone updating of different policies is presented,and the simulated annealing algorithm is adopted.The converage speed is accelerated,and good value is achieved.Finally,the validity of the algor... |
| |
| Keywords: | Job-Shop problem Ant colony algorithm Simulated annealing algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
