| Solving Job-shop Scheduling Problem with an Ant Colony Optimization Algorithm Based on Mutation and Dynamic Pheromone Updating |
| |
| 作者姓名： | Jia Na |
| |
| 作者单位： | Systems Engineering Research Institute, Southeast University, Nanjing 210096, China |
| |
| 摘 要： |
|
| 关 键 词： | 蚂蚁集群优化 作业调度 突变算法 信息素 |
| 收稿时间： | 2005-04-06 |
Solving Job-shop Scheduling Problem with an Ant Colony Optimization Algorithm Based on Mutation and Dynamic Pheromone Updating |
| |
| Jia Na.Solving Job-shop Scheduling Problem with an Ant Colony Optimization Algorithm Based on Mutation and Dynamic Pheromone Updating[J].Journal of Sysytems Science and Information,2006,4(3):443-450. |
| |
| Authors: | Jia;Na |
| |
| Abstract: | The validity of the ant colony algorithm has been demonstrated as a powerful tool solving the optimization. An ant colony optimization algorithm based on mutation and dynamic pheromone updating in this paper was applied to settle job shop scheduling problem. Result of computer simulation shows that this method is effective. |
| |
| Keywords: | ant colony optimization job shop scheduling mutation algorithm |
| 本文献已被 维普 等数据库收录！ |
