Heuristic Approach to Train Rescheduling
Yugoslav journal of operations research, Tome 17 (2007) no. 1, p. 9
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
Starting from the defined network topology and the timetable assigned
beforehand, the paper considers a train rescheduling in respond to disturbances that have
occurred. Assuming that the train trips are jobs, which require the elements of
infrastructure – resources, it was done by the mapping of the initial problem into a special
case of job shop scheduling problem. In order to solve the given problem, a constraint
programming approach has been used. A support to fast finding “enough good”
schedules is offered by original separation, bound and search heuristic algorithms. In
addition, to improve the time performance, instead of the actual objective function with a
large domain, a surrogate objective function is used with a smaller domain, if there is
such.
Classification :
90B35 90C59 68T20 90B06
Keywords: Train rescheduling, job shop scheduling, constraint programming, heuristics.
Keywords: Train rescheduling, job shop scheduling, constraint programming, heuristics.
@article{YJOR_2007_17_1_a1,
author = {Sne\v{z}ana Mladenovi\'c and Mirjana \v{C}angalovi\'c},
title = {Heuristic {Approach} to {Train} {Rescheduling}},
journal = {Yugoslav journal of operations research},
pages = {9 },
year = {2007},
volume = {17},
number = {1},
zbl = {1265.90120},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_2007_17_1_a1/}
}
Snežana Mladenović; Mirjana Čangalović. Heuristic Approach to Train Rescheduling. Yugoslav journal of operations research, Tome 17 (2007) no. 1, p. 9 . http://geodesic.mathdoc.fr/item/YJOR_2007_17_1_a1/