Paper Info
Title
Fast machine reassignment
Abstract
Abstract This paper proposes a new method for solving the Machine Reassignment Problem in a very short computational time. The problem has been proposed by Google as subject of the Challenge ROADEF/EURO 2012. The Machine Reassignment Problem consists in looking for a reassignment of processes to machines in order to minimize a complex objective function, subject to a rich set of constraints including multidimensional resource, conflict and dependency constraints. In this study, a cooperative search approach is presented for machine reassignment. This approach uses two components: Adaptive Variable Neighbourhood Search and Simulated Annealing based Hyper-Heuristic, running in parallel on two threads and exchanging solutions. Both algorithms employ a rich set of heuristics and a learning mechanism to select the best neighborhood/move type during the search process. The cooperation mechanism acts as a multiple restart which gets triggered whenever a new better solution is achieved by a thread and then shared with the other thread. Computational results on the Challenge instances as well as instances of a Generalized Assignment-like problem are given to show the relevance of the chosen methods and the high benefits of cooperation.
Year
DOI
Venue
2016
https://doi.org/10.1007/s10479-015-2082-3
Annals of Operations Research
Keywords
DocType
Volume
Generalized Assignment,Adaptive Variable Neighborhood Search,Simulated Annealing,Hyper-Heuristic,Cooperative Parallel Search
Journal
242
Issue
ISSN
Citations 
1
0254-5330
0
PageRank 
References 
Authors
0.34
0
9
Name
Order
Citations
PageRank
Franck Butelle112614.55
Laurent Alfandari2487.85
Camille Coti36611.45
Lucian Finta4525.23
Lucas Létocart511512.37
Gérard Plateau615617.40
Frédéric Roupin715611.79
Antoine Rozenknop8103.30
Roberto Wolfler Calvo982348.28