loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

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

Affiliations: 1 Université Côte d'Azur and Milanamos, France ; 2 Université Côte d'Azur, France ; 3 Milanamos, France

Keyword(s): Flight Radius Problem, Route Network Development, Airline Schedule Design, Shortest Path Algorithm.

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. (More)

CC BY-NC-ND 4.0

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 3.145.40.121

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:
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 - ICORES; ISBN 978-989-758-285-1; ISSN 2184-4372, SciTePress, pages 304-311. DOI: 10.5220/0006654003040311

@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 - ICORES},
year={2018},
pages={304-311},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006654003040311},
isbn={978-989-758-285-1},
issn={2184-4372},
}

TY - CONF

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

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic