Abstract
The first step of building a public transport timetable is usually the creation of a timetable for one or more
hours, which is repeated during the day in order to get a regular timetable which is easy to remember.
When designing a timetable pattern, we should already take the cost and quality into account. This cost
consist of vehicle cost and crew cost, which both consist of a fixed cost per vehicle or employee and a
variable cost per kilometer or hour. The quality of a timetable and timetable pattern is determined by the
163TE-07
travel times and reliability of this travel times of the passengers. In literature, we see that the vehicle cost
and quality of a timetable pattern are investigated thoroughly, but we cannot find any work on crew cost of
timetable patterns. We introduce the Cyclic Duty, this is a crew duty with cyclic nature, it repeats every n
hours. This Cyclic Duty has infinite length, but has meal breaks so that when we cut out a part of it, it will
give a valid duty. We developed an algorithm to determine the optimal set of Cyclic Duties and hence the
minimal cost. Computational experiments show that the algorithm is capable of determining the crew cost
of real-life timetable patterns in tens of seconds
hours, which is repeated during the day in order to get a regular timetable which is easy to remember.
When designing a timetable pattern, we should already take the cost and quality into account. This cost
consist of vehicle cost and crew cost, which both consist of a fixed cost per vehicle or employee and a
variable cost per kilometer or hour. The quality of a timetable and timetable pattern is determined by the
163TE-07
travel times and reliability of this travel times of the passengers. In literature, we see that the vehicle cost
and quality of a timetable pattern are investigated thoroughly, but we cannot find any work on crew cost of
timetable patterns. We introduce the Cyclic Duty, this is a crew duty with cyclic nature, it repeats every n
hours. This Cyclic Duty has infinite length, but has meal breaks so that when we cut out a part of it, it will
give a valid duty. We developed an algorithm to determine the optimal set of Cyclic Duties and hence the
minimal cost. Computational experiments show that the algorithm is capable of determining the crew cost
of real-life timetable patterns in tens of seconds
| Original language | English |
|---|---|
| Pages | 163 |
| Publication status | Published - 2013 |
| Event | International Conference on Operations Research 2013 - Rotterdam Duration: 5 Jan 2013 → … |
Other
| Other | International Conference on Operations Research 2013 |
|---|---|
| City | Rotterdam |
| Period | 5/01/13 → … |
Keywords
- algorithms
- public transportation