文章摘要
Nie Tongtong (聂彤彤)*,Wu Wenjun*,He Qichang*,Zhang Xuanyi**,Sun Yang*,Zhang Yanhua*.[J].高技术通讯(英文),2020,26(4):417~423
A greedy algorithm based on joint assignment of airport gates and taxiways in large hub airports
  
DOI:10.3772/j.issn.1006-6748.2020.04.009
中文关键词: 
英文关键词: greedy algorithm, airport gate, taxiway, resources assignment
基金项目:
Author NameAffiliation
Nie Tongtong (聂彤彤)* (*Faculty of Information Technology, Beijing University of Technology, Beijing 100124, P.R.China) 
Wu Wenjun* (*Faculty of Information Technology, Beijing University of Technology, Beijing 100124, P.R.China) 
He Qichang* (*Faculty of Information Technology, Beijing University of Technology, Beijing 100124, P.R.China) 
Zhang Xuanyi** (**Beijing Capital International Airport Co., Ltd, Beijing 100621, P.R.China) 
Sun Yang* (*Faculty of Information Technology, Beijing University of Technology, Beijing 100124, P.R.China) 
Zhang Yanhua* (*Faculty of Information Technology, Beijing University of Technology, Beijing 100124, P.R.China) 
Hits: 1713
Download times: 1521
中文摘要:
      
英文摘要:
      With the rapid development of civil aviation in recent years, the management and assignment of airport resources are becoming more and more difficult. Among the various airport resources, gates and taxiways are very important, therefore, many researchers focus on the airport gate and taxiway assignment problem. However, the joint assignment algorithm of airport gates and taxiways with realistic airport data has not been well studied. A greedy algorithm based on joint assignment of airport gates and taxiways using the data of a large hub airport in China is proposed. The objective is maximizing the ratio of fixed gates and minimizing the ratio of taxiway collisions. Simulation results show that it outperforms other assignment schemes.
View Full Text   View/Add Comment  Download reader
Close

分享按钮