| 基于智能算法的制造系统通用作业调度方法 |
| |
| 引用本文： | 胡燕海,严隽琪,马登哲,叶飞帆.基于智能算法的制造系统通用作业调度方法[J].上海交通大学学报,2008,42(10):1608-1612. |
| |
| 作者姓名： | 胡燕海 严隽琪 马登哲 叶飞帆 |
| |
| 作者单位： | (1. 上海交通大学 CIM研究所， 上海 200240； 2. 宁波大学 工学院， 宁波 315211) |
| |
| 基金项目： | 国家自然科学基金，国家自然科学基金，国家自然科学基金 |
| |
| 摘 要： | 通过生产实际情况分析，提出了制造系统通用作业调度问题(USP)概念，开发了混杂蚁群算法(HACO)，对USP进行求解，并与采用遗传算法所得解进行了对比.算例研究采用75×20个标准算例，以工件的加工流程时间最小化为目标函数，分别运用运算代数和解集收敛度为结束条件.计算结果表明，在计算代数相同时，HACO算法更容易使解域集中；在得到同等收敛度时，HACO算法的计算时间更短.
|
| 关 键 词： | 通用作业调度问题 智能算法 遗传算法 蚁群算法 |
| 收稿时间： | 2007-11-24 |
Universal Shop Scheduling Method for Manufacturing System with Evolution Algorithm |
| |
| HU Yan-hai,YAN Jun-qi,MA Deng-zhe,YE Fei-fan.Universal Shop Scheduling Method for Manufacturing System with Evolution Algorithm[J].Journal of Shanghai Jiaotong University,2008,42(10):1608-1612. |
| |
| Authors: | HU Yan-hai YAN Jun-qi MA Deng-zhe YE Fei-fan |
| |
| Institution: | (1. Institute of CIM, Shanghai Jiaotong University, Shanghai 200240, China；
2. Faculty of Engineering, Ningbo University, Ningbo 315211, China) |
| |
| Abstract: | The concept of universal shop scheduling problem (USP) was proposed based on the analysis of a real production system. A hybrid ant colony optimization (HACO) was developed to be applied to the USP. The results were compared with those of genetic algorithm. The numerical experiments make use of several benchmark instances whose scale is up to 75×20. Minimizing makespan is taken as the objective function. Both termination conditions of computation generation and solution convergence are tested for the computation. From the numerical experiments, it can be seen that when the computation generation is kept the same, HACO will make the solutions more convergent, and when the convergency is kept the same, HACO will consume less time. |
| |
| Keywords: | |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《上海交通大学学报》浏览原始摘要信息 |
| 点击此处可从《上海交通大学学报》下载免费的PDF全文 |
