| 蚁群算法求解非等同并行机调度问题的研究 |
| |
| 引用本文： | 江贵松,苏丹,付新玥,李兵. 蚁群算法求解非等同并行机调度问题的研究[J]. 计算机工程与应用, 2012, 48(29): 225-229 |
| |
| 作者姓名： | 江贵松 苏丹 付新玥 李兵 |
| |
| 作者单位： | 对外经济贸易大学 信息学院，北京 100029 |
| |
| 基金项目： | 国家自然科学基金(No.60879020);对外经济贸易大学研究生科研创新基金(No.A201003006) |
| |
| 摘 要： | 针对非等同并行机服务调度问题，以机场除冰调度服务为背景并以最小化旅客延误数为目标，提出了一种改进的蚁群算法。该算法根据调度模型的特点，充分考虑模型的约束条件并运用了一种改进的信息素更新策略求解并行机调度问题。仿真结果表明，改进的蚁群算法收敛速度快且结果较优，明显优于FIFO算法，适合求解非等同并行机调度问题。
|
| 关 键 词： | 非等同并行机 现代服务业 蚁群算法 服务调度 |
Research for non-identical parallel machine schedule problem based on ant colony algorithm |
| |
| JIANG Guisong , SU Dan , FU Xinyue , LI Bing. Research for non-identical parallel machine schedule problem based on ant colony algorithm[J]. Computer Engineering and Applications, 2012, 48(29): 225-229 |
| |
| Authors: | JIANG Guisong SU Dan FU Xinyue LI Bing |
| |
| Affiliation: | School of Information Technology & Management, University of International Business and Economics, Beijing 100029, China |
| |
| Abstract: | Under the context of deicing in the airport and in order to solve a kind of non-identical parallel multi-machine schedule problem for minimizing the number of passengers delayed,an ant colony algorithm is suggested.Considering the characteristic of scheduling model and its’constraints,an improved pheromone update strategy is developed.The result is superior to that of traditional FIFO algorithm,indicates that the improved ant colony algorithm is valid and can fit for non-identical parallel multi-machine schedule problem. |
| |
| Keywords: | non-identical parallel machine schedule modern service ant colony algorithm schedule problem |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
