摘要
针对非等同并行机服务调度问题,以机场除冰调度服务为背景并以最小化旅客延误数为目标,提出了一种改进的蚁群算法。该算法根据调度模型的特点,充分考虑模型的约束条件并运用了一种改进的信息素更新策略求解并行机调度问题。仿真结果表明,改进的蚁群算法收敛速度快且结果较优,明显优于FIFO算法,适合求解非等同并行机调度问题。
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.
出处
《计算机工程与应用》
CSCD
2012年第29期225-229,共5页
Computer Engineering and Applications
基金
国家自然科学基金(No.60879020)
对外经济贸易大学研究生科研创新基金(No.A201003006)
关键词
非等同并行机
现代服务业
蚁群算法
服务调度
non-identical parallel machine schedule
modem service
ant colony algorithm
schedule problem