| Job Shop调度问题自适应蚁群算法的研究 |
| |
| 引用本文： | 孔凡国,黄伟. Job Shop调度问题自适应蚁群算法的研究[J]. 新技术新工艺, 2006, 0(5): 40-42 |
| |
| 作者姓名： | 孔凡国 黄伟 |
| |
| 作者单位： | 五邑大学机电工程系,529020 |
| |
| 摘 要： | Job Shop问题是与实际生产相关的多约束组合优化问题,具有约束较多,计算量大的特点,一直以来是研究的热点.本文对利用自适应蚁群算法求解该问题进行了研究,并且进行了仿真试验,试验结果表明蚁群算法在求解类似Job Shop问题是非常有效的.
|
| 关 键 词： | 蚁群算法 信息素 生产调度 |
Research on Job Shop Problem Based on Self-adapt Ant Colony Algorithm |
| |
| Kong FanGuo;Huang Wei. Research on Job Shop Problem Based on Self-adapt Ant Colony Algorithm[J]. New Technology & New Process, 2006, 0(5): 40-42 |
| |
| Authors: | Kong FanGuo Huang Wei |
| |
| Abstract: | Job Shop is a problem of combination optimization which relates to actual production, and it has some features of multiple restriction and mass computation quantity. Job Shop has been a research hotspot continuously. The self-adapt ant colony algorithm of Job Shop problem is proposed, and the simulation experiment is carried on. The simulation results show that the ant colony algorithm in the solution of Job Shop question is extremely effective. |
| |
| Keywords: | ant colony algorithm pheromone manufacturing scheduling |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
