A simulation model of a monopoly passenger rail service with two?way traffic: testing the optimization algorithm
The result's identifiers
Result code in 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>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
A simulation model of a monopoly passenger rail service with two?way traffic: testing the optimization algorithm
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
AH - Economics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
New Economic Challenges: 5th International PhD Student Conference
ISBN
9788021071407
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
191-200
Publisher name
Masarykova univerzita
Place of publication
Brno
Event location
Brno
Event date
May 29, 2014
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—