A genetic algorithm for assigning train arrival dates at a maintenance centre

Publication Type:
Conference Proceeding
IFAC-PapersOnLine, 2019, 52 (13), pp. 957 - 962
Issue Date:
Full metadata record
© 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved. The paper is concerned with planning heavy maintenance of train-sets at a maintenance centre. The heavy maintenance process is complex and, for each train-set, the actual duration of maintenance is uncertain at the time of planning. The allocation of the dates when train-sets should arrive at the maintenance centre is crucial phase of the planning procedure. The objective function is a weighted sum of two components, the expected total penalty for not meeting the required number of train-sets in active service and the total cost for the deviation (earliness and tardiness) from the desired dates of arrival. A genetic algorithm is presented for the considered problem and its effectiveness is demonstrated by the computational experiments that used real-world data provided by a big maintenance centre.
Please use this identifier to cite or link to this item: