Tesis de Postgrado Acceso Abierto

Browse

Now showing 1 - 1 of 1

ALGORITHMS BASED ON HEURISTICS FOR SOLVING THE TRAIN DEPARTURE MATCHING PROBLEM
(2018) Rojas Ruz, Alondra Valentina; Departamento de Informática; Riff Rojas, María Cristina; Castro Valdebenito, Carlos Miguel
The Train Departure Matching Problem (DMP) is a problem of train schedulingwhere the objective is find the best way to assign trains to scheduled departuressubject to a set of constraints related to railway management. It is a problem thatarises from the rolling stock units management on railway sites problem, presented inthe ROADEF/EURO Challenge 2014, which is usually treated as two sub-problems:The DMP and the routing problem. In this work the DMP is formally presented:the model of the DMP, a review of the literature of this problem and other trainscheduling problems, then present the GRASP algorithm (G-DMP) and theEvolutionaryAlgorithm (AE-DMP) capable of solving this problem and then evaluate itsperformance in different experiments.