期刊文献+

Research on Flight First Service Model and Algorithms for the Gate Assignment Problem 被引量:3

下载PDF
导出
摘要 Aiming at the problem of gate allocation of transit flights,a flight first service model is established.Under the constraints of maximizing the utilization rate of gates and minimizing the transit time,the idea of“first flight serving first”is used to allocate the first time,and then the hybrid algorithm of artificial fish swarm and simulated annealing is used to find the optimal solution.That means the fish swarm algorithm with the swallowing behavior is employed to find the optimal solution quickly,and the simulated annealing algorithm is used to obtain a global optimal allocation scheme for the optimal local region.The experimental data show that the maximum utilization of the gate is 27.81%higher than that of the“first come first serve”method when the apron is not limited,and the hybrid algorithm has fewer iterations than the simulated annealing algorithm alone,with the overall passenger transfer tension reducing by 1.615;the hybrid algorithm has faster convergence and better performance than the artificial fish swarm algorithm alone.The experimental results indicate that the hybrid algorithm of fish swarm and simulated annealing can achieve higher utilization rate of gates and lower passenger transfer tension under the idea of“first flight serving first”.
出处 《Computers, Materials & Continua》 SCIE EI 2019年第9期1091-1104,共14页 计算机、材料和连续体(英文)
基金 This paper is supported by The National Nature Science Foundation of China(No.61703426).
  • 相关文献

参考文献7

二级参考文献55

共引文献149

同被引文献14

引证文献3

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部