Session: Real-World Applications I (06/07, 14:30-16:30, Room 7)

G-DMP: An algorithm without Constraint Relaxation to solve the Train Departure Matching Problem



In this work we present a GRASP based approach for solving the departure matching problem, an important subproblem of the Rolling Stock Units Management problem. Our approach implements a constructive and a Local Search steps that are able to deal with all the constraints and costs related to the problem. We evaluate our approach using two sets of instances: a set of randomly generated instances and the set of instances used in ROADEF/EURO Challenge 2014.