A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem

Abstract

We present a hybrid metaheuristic approach for the machine reassignment problem, which was proposed for ROADEF/EURO Challenge 2012. The problem is a combinatorial optimization problem, which can be viewed as a highly constrained version of the multidimensional bin packing problem. Our algorithm, which took the third place in the challenge, consists of two… (More)
DOI: 10.1007/s10479-014-1780-6

13 Figures and Tables

Topics

  • Presentations referencing similar topics