Thesis ALGORITHMS BASED ON HEURISTICS FOR SOLVING THE TRAIN DEPARTURE MATCHING PROBLEM
Loading...
Date
2018
Authors
ROJAS RUZ, ALONDRA VALENTINA
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
El problema de asignación de salidas de trenes (DMP por sus siglas en inglés)es un problema de planificación de trenes, donde el objetivo es encontrar la mejormanera de asignar trenes a salidas programadas, sujetas a un conjunto de restriccionesrelacionadas con la gestión ferroviaria. Este es un problema que surge delrolling stock units management on railway sites problem presentado en el DesafíoROADEF/EURO 2014, el cual se suele tratar como dos sub-problemas: El DMP yun problema de planificación de rutas. En este trabajo se presenta formalmente elDMP, indicando su modelo, los estudios realizados a la fecha sobre este problema yotros problemas de gestión de trenes relacionados, para luego presentar la propuestade un algoritmo tipo GRASP (G-DMP) y un Algoritmo Evolutivo (AE-DMP)para resolver este problema y luego evaluar su desempeño por medio de diferentesexperimentos.
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.
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.
Description
Catalogado desde la version PDF de la tesis.
Keywords
ALGORITMO EVOLUTIVO , DEPARTURE MATCHING PROBLEM , GRASP
