OPTIMIZATION OF PARKING PUBLIC TRANSPORT VEHICLES IN OSTRAVA

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27230%2F15%3A86093539" target="_blank" >RIV/61989100:27230/15:86093539 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.fpz.unizg.hr/traffic/index.php/PROMTT/issue/view/158" target="_blank" >http://www.fpz.unizg.hr/traffic/index.php/PROMTT/issue/view/158</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.7307/ptt.v27i1.1593" target="_blank" >10.7307/ptt.v27i1.1593</a>

Jazyk výsledku

angličtina

Název v původním jazyce

OPTIMIZATION OF PARKING PUBLIC TRANSPORT VEHICLES IN OSTRAVA

Popis výsledku v původním jazyce

A typical trait of public transport is a spatially scattered demand. A route net that is operated by a carrier (or several carriers) has to be adapted to the demand. Public transport vehicles that are not used during a period of a day are usually parkedin defined parking lots that have a given capacity. When the vehicle goes from the place where its schedule ends (usually a terminus of the last connection served by the vehicle) to the place where the vehicle should be parked, a non-productive journey occurs. The same occurs at the beginning of the vehicle schedule as well. The main goal of the paper is to present a mathematical model that enables minimization of the total length of all the non-productive journeys. Functionality of the proposed mathematical model was tested in the conditions of a real bus public transport network.

Název v anglickém jazyce

OPTIMIZATION OF PARKING PUBLIC TRANSPORT VEHICLES IN OSTRAVA

Popis výsledku anglicky

A typical trait of public transport is a spatially scattered demand. A route net that is operated by a carrier (or several carriers) has to be adapted to the demand. Public transport vehicles that are not used during a period of a day are usually parkedin defined parking lots that have a given capacity. When the vehicle goes from the place where its schedule ends (usually a terminus of the last connection served by the vehicle) to the place where the vehicle should be parked, a non-productive journey occurs. The same occurs at the beginning of the vehicle schedule as well. The main goal of the paper is to present a mathematical model that enables minimization of the total length of all the non-productive journeys. Functionality of the proposed mathematical model was tested in the conditions of a real bus public transport network.

Druh

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

CEP obor

JO - Pozemní dopravní systémy a zařízení

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

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

Promet - Traffic - Traffico

ISSN

0353-5320

e-ISSN

—

Svazek periodika

27

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

HR - Chorvatská republika

Počet stran výsledku

7

Strana od-do

69-75

Kód UT WoS článku

000352253600007

EID výsledku v databázi Scopus

—