Premium
Heuristics and matheuristics for a real‐life machine reassignment problem
Author(s) -
Lopes Ramon,
Morais Vinicius W.C.,
Noronha Thiago F.,
Souza Vitor A.A.
Publication year - 2015
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/itor.12063
Subject(s) - heuristics , iterated local search , swap (finance) , computer science , iterated function , integer programming , mathematical optimization , theoretical computer science , mathematics , local search (optimization) , algorithm , economics , mathematical analysis , finance
This paper addresses a real‐life machine reassignment problem proposed in the Google ROADEF/EURO Challenge ([, 2012]). In this paper, we propose a linear integer programming (IP) formulation and iterated local search (ILS) heuristics for approximately solving this problem. Different versions of the ILS heuristics are presented. Two of these versions rely on IP‐based perturbations, whereas the other two are based on randomized perturbations. We also propose efficient restricted versions of the classic perturbation and local search procedures based on the “shift” and “swap” neighborhoods. Computational experiments showed that the IP‐based heuristics are competitive with the best heuristics in the literature.