This chapter first shows several very different approaches to the problem of optimizing the air route network. The proposed models for the air routes themselves can be classified in two general categories: 2D‐routes where only a top view of the airways is considered or 3D‐tubes where the airways are seen as geometric volumes in three dimensions. The 2D‐route network is modeled as a planar graph and it is completely redesigned, from scratch, using clustering methods and computational geometry. A basic clustering method is used to identify clusters of routes, which are then replaced each by a single 2D‐corridor. The solution is then refined by a genetic algorithm. The chapter then describes the simplified 3D‐trajectory model used to test different algorithms on the 3D‐tube separation problem. It also discusses the different problem formulations, the algorithms, and their results on a toy problem, using the simplified 3D‐trajectory model.
Air Route Optimization
2015-12-30
45 pages
Article/Chapter (Book)
Electronic Resource
English