Scheduling trains with delayed departures - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Scheduling trains with delayed departures

Fernand Meyer


A number of image transformations may be expressed as shortes paths algorithms in various algebras We introduce a general framework where a graph is considered as a railway network on which the trains follow shortest paths. Given a fixed traveling time on each edge and an arbitrary distribution of departure times, one searches the first arrival time of a train at each node. This formulation leads to interesting filters and image decomposition in the (min,+) algebra and sheds new light on flooding and razing algorithms in the algebras (min,max) and (max,min).
Fichier principal
Vignette du fichier
ismmminmax.pdf (477.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00547261 , version 1 (16-12-2010)


  • HAL Id : hal-00547261 , version 1


Fernand Meyer. Scheduling trains with delayed departures. 2010. ⟨hal-00547261⟩
4665 View
35 Download


Gmail Facebook Twitter LinkedIn More