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

Result code in 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>

Result on the web

<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>

Result language

angličtina

Original language name

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

Original language description

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.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BB - Applied statistics, operational research

OECD FORD branch

—

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2015

Confidentiality

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

Name of the periodical

Transport

ISSN

1648-4142

e-ISSN

—

Volume of the periodical

30

Issue of the periodical within the volume

3

Country of publishing house

LT - LITHUANIA

Number of pages

11

Pages from-to

361-371

UT code for WoS article

000362223600015

EID of the result in the Scopus database

—