Finding optimum fares and timetables in a monopoly rail market with heterogeneous passengers

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14560%2F14%3A00076580" target="_blank" >RIV/00216224:14560/14:00076580 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Finding optimum fares and timetables in a monopoly rail market with heterogeneous passengers

Popis výsledku v původním jazyce

This paper presents an agent-based model of passenger rail services. In the model, passengers are uniformly distributed on a circle representing the preferred departure times and passengers on each position of the circle have uniformly distributed reservation prices. The passengers choose the train with the lowest fare plus transport cost, given the sum of fare and transport cost is lower than their reser-vation prices. The paper provides algorithms which can be used for finding fares and timetable of amonopoly train operating company that maximizes its total profit and total welfare in realistic market settings. The efficiency of the algorithms is tested against the analytical solution of the model. The paper finds that the algorithm approximates thetheoretical fare, number of trains and their departure times efficiently.

Název v anglickém jazyce

Finding optimum fares and timetables in a monopoly rail market with heterogeneous passengers

Popis výsledku anglicky

This paper presents an agent-based model of passenger rail services. In the model, passengers are uniformly distributed on a circle representing the preferred departure times and passengers on each position of the circle have uniformly distributed reservation prices. The passengers choose the train with the lowest fare plus transport cost, given the sum of fare and transport cost is lower than their reser-vation prices. The paper provides algorithms which can be used for finding fares and timetable of amonopoly train operating company that maximizes its total profit and total welfare in realistic market settings. The efficiency of the algorithms is tested against the analytical solution of the model. The paper finds that the algorithm approximates thetheoretical fare, number of trains and their departure times efficiently.

Druh

D - Stať ve sborníku

CEP obor

AH - Ekonomie

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

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

32nd International Conference Mathematical Methods in Eocnomics Conference Proceedings

ISBN

9788024442099

ISSN

—

e-ISSN

—

Počet stran výsledku

5

Strana od-do

495-499

Název nakladatele

Palacký University

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

—