A simulation model of a monopoly passenger rail service with two?way traffic: testing the optimization algorithm

Kód výsledku v IS VaVaI

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

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

A simulation model of a monopoly passenger rail service with two?way traffic: testing the optimization algorithm

Popis výsledku v původním jazyce

We present an agent?based model of a long?distance passenger rail service. The model contains two terminal stations and a monopoly train operating company whose aim is to set the fare and departure times from both stations so that its profit is maximized. The paper introduces an algorithm that combines three different elimination strategies which are used for finding the optimum timetable. Starting from the maximum possible number of departures, the strategies might sequentially eliminate either one random pair of departures, each from a different terminal station, two pairs of departures, or a number of departures necessary to significantly reduce capital costs of the operating company. The strategies might be combined in different proportions. In order to find out whether all strategies should be used and what is the optimal proportion in which the strategies should be applied, we analyze data from 10,800 runs of the model. We find that all strategies are useful.

Název v anglickém jazyce

A simulation model of a monopoly passenger rail service with two?way traffic: testing the optimization algorithm

Popis výsledku anglicky

We present an agent?based model of a long?distance passenger rail service. The model contains two terminal stations and a monopoly train operating company whose aim is to set the fare and departure times from both stations so that its profit is maximized. The paper introduces an algorithm that combines three different elimination strategies which are used for finding the optimum timetable. Starting from the maximum possible number of departures, the strategies might sequentially eliminate either one random pair of departures, each from a different terminal station, two pairs of departures, or a number of departures necessary to significantly reduce capital costs of the operating company. The strategies might be combined in different proportions. In order to find out whether all strategies should be used and what is the optimal proportion in which the strategies should be applied, we analyze data from 10,800 runs of the model. We find that all strategies are useful.

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

New Economic Challenges: 5th International PhD Student Conference

ISBN

9788021071407

ISSN

—

e-ISSN

—

Počet stran výsledku

10

Strana od-do

191-200

Název nakladatele

Masarykova univerzita

Místo vydání

Brno

Místo konání akce

Brno

Datum konání akce

29. 5. 2014

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

EUR - Evropská akce

Kód UT WoS článku

—