Optimal Scheduling of Vehicles for Wheelchair Users in Public Transport

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25510%2F14%3A39898555" target="_blank" >RIV/00216275:25510/14:39898555 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Optimal Scheduling of Vehicles for Wheelchair Users in Public Transport

Popis výsledku v původním jazyce

Public transportation operates on the network according to the given timetable. I.e. the set of regular vehicle journeys is given. Each journey is determined by vertices it passes and by departure and arrival times. However, only a minor part of vehiclesare wheelchair friendly (abb. WFV). During one day, a WFV can be assigned to a sequence of journeys called a daily duty of the WFV. The demand of a WCU is called covered by a WCV journey without transfer, if a WCV is assigned to the journey and the journey connects the origin and the destina-tion of the WCU in the demanded time. It is called covered by a pair of WCV jour-neys with one transfer if the first journey of the pair connects the origin of the WCU with the transfer stop and the second journeyof the pair connects the transfer stop with the destination of the WCU, both in the demanded time. The problem P1 is to find the minimum set of VCV daily duties covering the de-mand of all WCU's. If such a solution does not exist, then th

Název v anglickém jazyce

Optimal Scheduling of Vehicles for Wheelchair Users in Public Transport

Popis výsledku anglicky

Public transportation operates on the network according to the given timetable. I.e. the set of regular vehicle journeys is given. Each journey is determined by vertices it passes and by departure and arrival times. However, only a minor part of vehiclesare wheelchair friendly (abb. WFV). During one day, a WFV can be assigned to a sequence of journeys called a daily duty of the WFV. The demand of a WCU is called covered by a WCV journey without transfer, if a WCV is assigned to the journey and the journey connects the origin and the destina-tion of the WCU in the demanded time. It is called covered by a pair of WCV jour-neys with one transfer if the first journey of the pair connects the origin of the WCU with the transfer stop and the second journeyof the pair connects the transfer stop with the destination of the WCU, both in the demanded time. The problem P1 is to find the minimum set of VCV daily duties covering the de-mand of all WCU's. If such a solution does not exist, then th

Druh

D - Stať ve sborníku

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í

2014

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 statě ve sborníku

Mathematical Methods in Economics MME 2014

ISBN

978-80-244-4209-9

ISSN

—

e-ISSN

—

Počet stran výsledku

4

Strana od-do

85-88

Název nakladatele

Univerzita Palackého v Olomouci

Místo vydání

Olomouc

Místo konání akce

Olomouc

Datum konání akce

10. 9. 2014

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

000356417900015