计算机应用 ›› 2016, Vol. 36 ›› Issue (10): 2940-2944.DOI: 10.11772/j.issn.1001-9081.2016.10.2940

• 行业与领域应用 • 上一篇    

基于可变禁忌长度的优化停机位分配

李亚玲, 李毅   

  1. 四川大学 计算机学院, 成都 610065
  • 收稿日期:2016-03-25 修回日期:2016-04-07 发布日期:2016-10-10
  • 通讯作者: 李亚玲,E-mail:610911739@qq.com
  • 作者简介:李亚玲(1990—),女,山西朔州人,硕士研究生,CCF会员,主要研究方向:空管自动化系统;李毅(1967—),男,四川成都人,副教授,博士,主要研究方向:空管自动化系统。
  • 基金资助:
    国家空管委科研项目(GKG201403004)。

Aircraft stands assignment optimization based on variable tabu length

LI Yaling, LI Yi   

  1. College of Computer, Sichuan University, Chengdu Sichuan 610065, China
  • Received:2016-03-25 Revised:2016-04-07 Published:2016-10-10
  • Supported by:
    BackgroundThis work is partially supported by the National Aviation Scientific Research Project of China (GKG201403004).

摘要: 针对机场"最大化停机位利用率"以及"最小化旅客行走路程"问题,提出了一种动态、灵活分配停机位的禁忌搜索算法。首先介绍了基本禁忌搜索算法的相关设计,然后引出了改进后的动态禁忌搜索算法(DTS算法),最后利用实际数据对改进后的禁忌搜索算法进行演算。通过几组数据的对比可看出,突出可变禁忌长度能够缩短全局寻优的循环次数。而与相关文献的演算结果进行对比显示:在资源不受限情况下,旅客行走总时间减少了15.75%;在资源受限情况下,旅客行走总时间减少了22.84%。实验结果表明,采用动态禁忌搜索算法能够得到更小的旅客行走路程的分配方案。

关键词: 停机位分配, 禁忌搜索, 可变禁忌长度, 禁忌频率, 全局最优

Abstract: Aiming at the problem of maximizing the utilization of aircraft stands and minimizing the passengers' total walking distance in air transport, a new dynamic and flexible algorithm was proposed. Firstly, a simple and basic tabu search algorithm was introduced; then a modified method called Dynamic Tabu Search (DTS) was recommended; finally, comparison of several groups of data was given to verify that the variable length of tabu can reduce cycle times of global optimization. Moreover, the comparison with algorithms from references showed that the total walking time was decreased by 15.75% under sufficient resources and 22.84% under limited resources respectively. Experimental results indicate that the dynamic tabu search algorithm can get distribution solutions with smaller passenger walking distance.

Key words: aircraft stands assignment, tabu search, variable tabu length, tabu frequency, global optimum

中图分类号: