The Merlin-Randell problem of train journeys (Q1062925): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 00:43, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Merlin-Randell problem of train journeys |
scientific article |
Statements
The Merlin-Randell problem of train journeys (English)
0 references
1986
0 references
The following synchronization problem is studied: ''There is a finite set of trains, a finite set of stations, and the engine house. Each station can hold only one train. Each train has a route to follow starting and ending at the engine house. The route may be repeated one or more times. A train may leave a station (or the engine house) only when its immediate destination is an empty station or the engine house. At the beginning all trains are placed at the engine house. The problem is to find a synchronization among train movements which allows parallel movements of trains where possible and enables the completion of each train journey.'' A formal model of the train system is proposed assuming that each train route is deterministic and contains no repeated stations. The model is based on the notion of a movement graph being a labeled directed multigraph, the nodes of which represent stations, the arcs of which represent possible train movements. The solution proposed is based on a characterization of inadmissible situations by means of some subgraphs of the movement graph. The properties of these subgraphs, called minimal critical patterns, are investigated. Optimal and suboptimal synchronization strategies are defined. A specification of the optimal strategy in the basic COSY notation is included, and its correctness is demonstrated.
0 references
Merlin-Randell problem of train journeys
0 references
synchronization
0 references
train system
0 references
movement graph
0 references
labeled directed multigraph
0 references
optimal strategy
0 references
train scheduling
0 references