A two-stage route optimization algorithm for light aircraft transport systems

•We develop a two-stage 3D routing problem for light aircraft.•We introduce a tailored pre-processing technique to create a map based on real data.•We present a mixed integer linear optimization to find the aircraft route.•This model finds the minimum travel time route taking wind forecast directly...

Full description

Saved in:
Bibliographic Details
Published inTransportation research. Part C, Emerging technologies Vol. 100; pp. 259 - 273
Main Authors Sharif Azadeh, Sh, Bierlaire, M., Maknoon, M.Y.
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.03.2019
Subjects
Heuristic
Light aircraft
MILP
Obstacle avoidance
Route optimization
MILP
Obstacle avoidance
Light aircraft
Route optimization
Heuristic
Online AccessGet full text

Cover

More Information
Summary:•We develop a two-stage 3D routing problem for light aircraft.•We introduce a tailored pre-processing technique to create a map based on real data.•We present a mixed integer linear optimization to find the aircraft route.•This model finds the minimum travel time route taking wind forecast directly into account.•We validate our proposed model using case studies in central Europe. This paper presents a route optimization algorithm for light aircraft operating under visual flight rules. The problem aims at finding a minimum-duration, collision-free route in three spatial dimensions with possible aircraft maneuvers. The optimal route takes into account the aircraft kinodynamic characteristics and its interaction with external wind. A data processing approach is presented to recast the flying environment as a series of polyhedrons based on which a mixed-integer linear model is formulated. A two-stage route optimization model is then introduced to solve real-life instances. Computational experiments depict the efficiency of this approach.
ISSN:0968-090X
1879-2359
DOI:10.1016/j.trc.2019.01.028