Efficient methods have been proposed in the literature for the management of a set of railway maintenance operations. However, these methods consider maintenance operations as deterministic and known a priori. In the stochastic tactical railway maintenance problem (STRMP), maintenance operations are not known in advance. In fact, since future track conditions can only be predicted, maintenance operations become stochastic. STRMP is based on a rolling horizon. For each month of the rolling horizon, an adaptive plan must be addressed. Each adaptive plan becomes deterministic, since it consists of a particular subproblem of the whole STRMP. Nevertheless, an exact resolution of each plan along the rolling horizon would be too time-consuming. Therefore, a heuristic approach that can provide efficient solutions within a reasonable computational time is required. Although STRMP has already been introduced in the literature, little work has been done in terms of solution methods and computational results. The main contributions of this paper include new methodology developments, a linear model for the deterministic subproblem, three efficient heuristics for the fast and effective resolution of each deterministic subproblem, and extensive computational results.

New heuristics for the stochastic tactical railway maintenance problem / Baldi, MAURO MARIA; Tadei, Roberto; Franziska, Heinicke; Axel, Simroth. - In: OMEGA. - ISSN 0305-0483. - 63:(2016), pp. 94-102. [10.1016/j.omega.2015.10.005]

New heuristics for the stochastic tactical railway maintenance problem

BALDI, MAURO MARIA;TADEI, Roberto;
2016

Abstract

Efficient methods have been proposed in the literature for the management of a set of railway maintenance operations. However, these methods consider maintenance operations as deterministic and known a priori. In the stochastic tactical railway maintenance problem (STRMP), maintenance operations are not known in advance. In fact, since future track conditions can only be predicted, maintenance operations become stochastic. STRMP is based on a rolling horizon. For each month of the rolling horizon, an adaptive plan must be addressed. Each adaptive plan becomes deterministic, since it consists of a particular subproblem of the whole STRMP. Nevertheless, an exact resolution of each plan along the rolling horizon would be too time-consuming. Therefore, a heuristic approach that can provide efficient solutions within a reasonable computational time is required. Although STRMP has already been introduced in the literature, little work has been done in terms of solution methods and computational results. The main contributions of this paper include new methodology developments, a linear model for the deterministic subproblem, three efficient heuristics for the fast and effective resolution of each deterministic subproblem, and extensive computational results.
File in questo prodotto:
File Dimensione Formato  
Omega_resubmission.pdf

accesso aperto

Descrizione: Articolo
Tipologia: 1. Preprint / submitted version [pre- review]
Licenza: PUBBLICO - Tutti i diritti riservati
Dimensione 142.05 kB
Formato Adobe PDF
142.05 kB Adobe PDF Visualizza/Apri
1-s2.0-S0305048315002091-main.pdf

non disponibili

Tipologia: 2a Post-print versione editoriale / Version of Record
Licenza: Non Pubblico - Accesso privato/ristretto
Dimensione 229.23 kB
Formato Adobe PDF
229.23 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2533892
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo