Multi-objective routing and scheduling for airport ground movement
Multi-objective routing and scheduling for airport ground movement
复制标题
机场地面运动的多目标路由与调度
DOI：
10.1016/j.trc.2020.102734
复制
发表时间：
2020-10-01
影响因子：
8.3
通讯作者：
Chen, Jun
中科院分区：
文献类型：
--
作者：
Weiszer, Michal;Burke, Edmund K.;Chen, Jun
最近关于机场地面运动的研究引入了主动路由框架来支持基于多目标轨迹的操作。这导致机场滑行道图中的边缘具有多种成本，例如滑行时间、燃料消耗和排放。在这样的图中，两个节点之间存在多条边，反映了多种成本之间的不同权衡。飞机必须从多个边缘中选择最有效的边缘，以便在考虑各种操作限制的情况下从一个节点穿越到另一个节点。在本文中，我们介绍了一种基于枚举方法的多目标路由和调度算法，可用于解决此类多目标多图问题。给出了在一系列国际机场使用所提出的算法的结果。与其他路由和调度算法相比，当飞机序列固定时，该算法可以在单次运行中找到一组代表性的最优或接近最优解。为了加速搜索，引入了启发式函数和基于偏好的方法。我们分析了不同方法的性能，并讨论了多图的结构如何影响计算复杂性和解决方案的质量。
Recent research on airport ground movement introduced an Active Routing framework to support multi-objective trajectory-based operations. This results in edges in the airport taxiway graph having multiple costs such as taxi time, fuel consumption and emissions. In such a graph, multiple edges exist between two nodes reflecting different trade-offs among the multiple costs. Aircraft will have to choose the most efficient edge from multiple edges in order to traverse from one node to another respecting various operational constraints. In this paper, we introduce a multi-objective routing and scheduling algorithm based on the enumerative approach that can be used to solve such a multi-objective multi-graph problem. Results using the proposed algorithm for a range of international airports are presented. Compared with other routing and scheduling algorithms, the proposed algorithm can find a representative set of optimal or near optimal solutions in a single run when the sequence of aircraft is fixed. In order to accelerate the search, heuristic functions and a preference-based approach are introduced. We analyse the performance of different approaches and discuss how the structure of the multi-graph affects computational complexity and quality of solutions.