HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Scheduling trains with delayed departures

Abstract : 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).
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [3 references]  Display  Hide  Download

Contributor : Fernand Meyer Connect in order to contact the contributor
Submitted on : Thursday, December 16, 2010 - 10:36:43 PM
Last modification on : Wednesday, November 17, 2021 - 12:27:11 PM
Long-term archiving on: : Thursday, March 17, 2011 - 2:42:14 AM


Files produced by the author(s)


  • HAL Id : hal-00547261, version 1


Fernand Meyer. Scheduling trains with delayed departures. 2010. ⟨hal-00547261⟩



Record views


Files downloads