Scheduling trains with delayed departures - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2010

Scheduling trains with delayed departures

Fernand Meyer

Résumé

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
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

  • HAL Id : hal-00547261 , version 1

Citer

Fernand Meyer. Scheduling trains with delayed departures. 2010. ⟨hal-00547261⟩
4701 Consultations
41 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More