Authors: Alonso-Ayuso, Antonio
Escudero, Laureano
Martín-Campo, F. Javier
Mladenović, Nenad 
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: A VNS metaheuristic for solving the aircraft conflict detection and resolution problem by performing turn changes
Journal: Journal of Global Optimization
Volume: 63
Issue: 3
First page: 583
Last page: 596
Issue Date: 1-Nov-2015
Rank: M21
ISSN: 0925-5001
DOI: 10.1007/s10898-014-0144-8
The aircraft Conflict Detection and Resolution (CDR) problem in air traffic management consists of finding a new configuration for a set of aircraft such that conflict situations between them are avoided. A conflict situation arises if two or more aircraft violate the safety distances that they must maintain in flight. In this paper we propose a Variable Neighborhood Search approach for solving the CDR by turn changes. This metaheuristic compares favorably with previous best known methods for solving the Mixed Integer Nonlinear Programming (MINLP) model proposed elsewhere. It is worth pointing out the astonishingly short time in which the first feasible solution is obtained. This is crucial for this specific problem, where a response must be provided almost in real time if it is to be useful in a real-life problem. A comparative study between the performance of the new approach, a state-of-the-art MINLP solver and our Sequential Integer Linear Optimization approach proposed elsewhere is reported, using a testbed of instances with up to 25 aircraft.
Keywords: Air traffic management | Aircraft collision detection and resolution problem | Variable neighborhood search
Publisher: Springer Link
Project: Ministerio de Economía y Competitividad, Spain, grant MTM2012-36163-C06-06
Mathematical Modelas and Optimization Methods on Large-Scale Systems 

Show full item record


checked on Jul 22, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.