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).
Type de document :
Pré-publication, Document de travail
10 pages ; submitted to ISMM 2011 conference. 2010
Liste complète des métadonnées

Littérature citée [3 références]  Voir  Masquer  Télécharger
Contributeur : Fernand Meyer <>
Soumis le : jeudi 16 décembre 2010 - 22:36:43
Dernière modification le : lundi 12 novembre 2018 - 10:58:56
Document(s) archivé(s) le : jeudi 17 mars 2011 - 02:42:14


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00547261, version 1


Fernand Meyer. Scheduling trains with delayed departures. 10 pages ; submitted to ISMM 2011 conference. 2010. 〈hal-00547261〉



Consultations de la notice


Téléchargements de fichiers