A GRASP approach for the machine reassignment problem

Details our solution (team J19, qualified) to the EURO/ROADEF Challenge 2012, proposed by Google.International audienceWe describe our approach to solve the machine reassignment problem. The main idea is to combine different metaheuristics to find solutions. We first use a constructive heuristic inspired by vector bin packing problem to get a set of feasible solutions. Then we use a GRASP heuristic based on local search to improve these solutions. We take advantage of problem constraints structure to design moves that keep the solution feasible and are very fast to apply