loading
Documents

Research.Publish.Connect.

Paper

Authors: Assia Idrissi 1 ; Arnaud Malapert 2 and Rémi Jolin 3

Affiliations: 1 Milanamos, 1047 route des Dolines, Sophia Antipolis, France, Université Côte d’Azur, CNRS, I3S, France ; 2 Université Côte d’Azur, CNRS, I3S, France ; 3 Milanamos, 1047 route des Dolines, Sophia Antipolis, France

ISBN: 978-989-758-352-0

Keyword(s): Flight Radius Problem, Time-independent Model, Graph Database, Shortest Path Algorithms.

Abstract: In this article, we present the flight radius problem (FRP) on the condensed flight network (CFN). Then, giving a specific flight that is defined by an origin and destination (OD) pair, the problem consists in finding routes that connect the OD pair and satisfy a regret constraint on time, distance or cost. The found routes help airline manager to find business opportunities. This problem arises in the real world, for instance in some air transportation companies. The FRP is formulated as finding a maximal subgraph of nodes belonging to routes satisfying a regret constraint. Such routes can be found using shortest paths algorithms (SPA). The CFN is generated using a time-independent approach and stored in the graph database Neo4j. Implementing SPA in Neo4j is challenging since the graph database stores the weights of the graph in a separate data structure. In this paper, we propose four methods to solve the FRP: these methods combine parallel and sequential processing with more optimi zation to overcome time and memory costs. The experimental evaluation demonstrates that the best algorithm is the extended Dijkstra algorithm which meets the real-time constraints of the targeted industrial application. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.196.116.3

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Kamal Idrissi, A.; Malapert, A. and Jolin, R. (2019). Flight Radius Algorithms.In Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-352-0, pages 370-377. DOI: 10.5220/0007388503700377

@conference{icores19,
author={Assia Kamal Idrissi. and Arnaud Malapert. and Rémi Jolin.},
title={Flight Radius Algorithms},
booktitle={Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2019},
pages={370-377},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007388503700377},
isbn={978-989-758-352-0},
}

TY - CONF

JO - Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Flight Radius Algorithms
SN - 978-989-758-352-0
AU - Kamal Idrissi, A.
AU - Malapert, A.
AU - Jolin, R.
PY - 2019
SP - 370
EP - 377
DO - 10.5220/0007388503700377

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.