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

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

Author(s): Ondřej Krčál, Rostislav Staněk
Subject(s): Evaluation research, Transport / Logistics
Published by: Masarykova univerzita
Keywords: agent–based model; rail; monopoly; fare; timetable;
Summary/Abstract: 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.

  • Page Range: 191-200
  • Page Count: 10
  • Publication Year: 2014
  • Language: English