Iterative algorithms for the curfew planning problem / Bog, S. in Journal of the operational research society (JORS), Vol. 62 N° 4 (Avril 2011)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 62 N° 4 (Avril 2011) . - pp. 593–607 Titre : Iterative algorithms for the curfew planning problem Type de document : texte imprimé Auteurs : Bog, S., Auteur ; Nemani, A. K., Auteur ; Ahuja, R. K., Auteur Année de publication : 2011 Article en page(s) : pp. 593–607 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Rail track maintenance Scheduling Network disruptions Discrete optimization Heuristics Index. décimale : 001.424 Résumé : The curfew planning problem is to design an annual timetable for railway track maintenance teams. Each team is capable of handling certain types of repairs and replacement jobs. The jobs are combined into a set of projects according to their locations and types. The timetable shows which project should be worked on by each team on a weekly basis throughout an entire year. Our objective is to design a schedule with minimum network disruption due to ongoing maintenance projects that require absolute curfew. Absolute curfew projects are those that cause complete closure of the rail traffic. For tackling this problem, we develop four optimization-based iterative algorithms. We also present very promising computational results obtained within a few minutes using data provided by a major North American railroad. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n4/abs/jors20101a.html [article] Iterative algorithms for the curfew planning problem [texte imprimé] / Bog, S., Auteur ; Nemani, A. K., Auteur ; Ahuja, R. K., Auteur . - 2011 . - pp. 593–607. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 4 (Avril 2011) . - pp. 593–607 Mots-clés : Rail track maintenance Scheduling Network disruptions Discrete optimization Heuristics Index. décimale : 001.424 Résumé : The curfew planning problem is to design an annual timetable for railway track maintenance teams. Each team is capable of handling certain types of repairs and replacement jobs. The jobs are combined into a set of projects according to their locations and types. The timetable shows which project should be worked on by each team on a weekly basis throughout an entire year. Our objective is to design a schedule with minimum network disruption due to ongoing maintenance projects that require absolute curfew. Absolute curfew projects are those that cause complete closure of the rail traffic. For tackling this problem, we develop four optimization-based iterative algorithms. We also present very promising computational results obtained within a few minutes using data provided by a major North American railroad. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n4/abs/jors20101a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire