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


https://hal.archives-ouvertes.fr/hal-00547261
Contributeur : Fernand Meyer <>
Soumis le : jeudi 16 décembre 2010 - 22:36:43
Dernière modification le : mardi 12 septembre 2017 - 11:41:20
Document(s) archivé(s) le : jeudi 17 mars 2011 - 02:42:14

Fichier

ismmminmax.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00547261, version 1

Collections

Citation

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

Partager

Métriques

Consultations de
la notice

128

Téléchargements du document

32