Solving the Flight Radius Problem

Assia Kamal Idrissi, Arnaud Malapert, Rémi Jolin

Abstract

In this article, we present the flight radius problem on the condensed flight network. The problem is derived from a decision tool for airline managers to analyze and simulate a new market. It concerns the network design and visualization when allocating a new flight. The flight radius problem consists in finding routes passing through a specific flight that represent business opportunities regarding time and cost criteria. It is formulated as finding a maximal subgraph of nodes belonging to routes accepted by a regret function. The regret is defined as a function of the optimal values of the time and cost criteria. In practice, the condensed flight network is stored in a graph database Neo4j. First, we propose a query based on available procedures in the database. Second, we propose a method that uses the regret function to speed up the successive calls to Dijkstra algorithm. Results on a set of real-world instances with different flights (Hub & Spoke) and regret function parameters demonstrate that the algorithm is more efficient than the query and meets real-world response time constraints.

References

Download


Paper Citation


in Harvard Style

Idrissi A., Malapert A. and Jolin R. (2018). Solving the Flight Radius Problem.In Proceedings of the 7th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-285-1, pages 304-311. DOI: 10.5220/0006654003040311


in Bibtex Style

@conference{icores18,
author={Assia Kamal Idrissi and Arnaud Malapert and Rémi Jolin},
title={Solving the Flight Radius Problem},
booktitle={Proceedings of the 7th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2018},
pages={304-311},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006654003040311},
isbn={978-989-758-285-1},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 7th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Solving the Flight Radius Problem
SN - 978-989-758-285-1
AU - Idrissi A.
AU - Malapert A.
AU - Jolin R.
PY - 2018
SP - 304
EP - 311
DO - 10.5220/0006654003040311