NON-LINEAR MINI-MAX PROBLEM OF MULTI-STOP FLIGHT ROUTES

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25510%2F15%3A39901084" target="_blank" >RIV/00216275:25510/15:39901084 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.3846/16484142.2015.1091984" target="_blank" >http://dx.doi.org/10.3846/16484142.2015.1091984</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3846/16484142.2015.1091984" target="_blank" >10.3846/16484142.2015.1091984</a>

Jazyk výsledku

angličtina

Název v původním jazyce

NON-LINEAR MINI-MAX PROBLEM OF MULTI-STOP FLIGHT ROUTES

Popis výsledku v původním jazyce

The major change in trends of air transport development is to increase operating efficiency, productivity and profitability. Airline companies (air operators or carriers) can ensure significant fuel savings and better utilization of airplanes capacity. So they need better transport planning tool for costs minimization on a voyage route with multiple loading/unloading airports (multi-stop routes). The existing routes can be reoptimized (improved) or alternative routes can be offered instead. In this research the efficient heuristic algorithm for optimal transportation of N different loads (e.g. passenger contingent) for the airplane with limited capacity is being developed. The main goal of algorithm is to reduce the idle capacity on the route, to decrease expenses and to increase revenue. Through many test examples we can see that such approach functions very good and calculation complexity is under control.

Název v anglickém jazyce

NON-LINEAR MINI-MAX PROBLEM OF MULTI-STOP FLIGHT ROUTES

Popis výsledku anglicky

The major change in trends of air transport development is to increase operating efficiency, productivity and profitability. Airline companies (air operators or carriers) can ensure significant fuel savings and better utilization of airplanes capacity. So they need better transport planning tool for costs minimization on a voyage route with multiple loading/unloading airports (multi-stop routes). The existing routes can be reoptimized (improved) or alternative routes can be offered instead. In this research the efficient heuristic algorithm for optimal transportation of N different loads (e.g. passenger contingent) for the airplane with limited capacity is being developed. The main goal of algorithm is to reduce the idle capacity on the route, to decrease expenses and to increase revenue. Through many test examples we can see that such approach functions very good and calculation complexity is under control.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BB - Aplikovaná statistika, operační výzkum

OECD FORD obor

—

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2015

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Transport

ISSN

1648-4142

e-ISSN

—

Svazek periodika

30

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

LT - Litevská republika

Počet stran výsledku

11

Strana od-do

361-371

Kód UT WoS článku

000362223600015

EID výsledku v databázi Scopus

—