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.

最近对机场地面运动的研究引入了主动路由框架来支持基于多目标轨迹的操作。这导致机场滑行道图中的边缘具有多种成本，例如滑行时间，燃料消耗和排放。在这样的图中，两个节点之间存在多个边，反映了多个成本之间的不同折衷。飞机将不得不从多个边沿中选择最有效的边沿，以便在遵守各种运行限制的前提下从一个节点穿越到另一个节点。在本文中，我们基于枚举方法介绍了一种多目标路由和调度算法，可用于解决这种多目标多图问题。提出了使用所提出的算法的一系列国际机场的结果。与其他路由和调度算法相比，当飞机序列固定时，所提出的算法可以在一次运行中找到一组代表性的最优解或接近最优解。为了加速搜索，引入了启发式功能和基于偏好的方法。我们分析了不同方法的性能，并讨论了多图的结构如何影响计算的复杂性和解决方案的质量。