MILP for the Multi-objective VM Reassignment Problem

by   Takfarinas Saber, et al.

Machine Reassignment is a challenging problem for constraint programming (CP) and mixed-integer linear programming (MILP) approaches, especially given the size of data centres. The multi-objective version of the Machine Reassignment Problem is even more challenging and it seems unlikely for CP or MILP to obtain good results in this context. As a result, the first approaches to address this problem have been based on other optimisation methods, including metaheuristics. In this paper we study under which conditions a mixed-integer optimisation solver, such as IBM ILOG CPLEX, can be used for the Multi-objective Machine Reassignment Problem. We show that it is useful only for small or medium-scale data centres and with some relaxations, such as an optimality tolerance gap and a limited number of directions explored in the search space. Building on this study, we also investigate a hybrid approach, feeding a metaheuristic with the results of CPLEX, and we show that the gains are important in terms of quality of the set of Pareto solutions (+126.9 against the metaheuristic alone and +17.8 solutions (8.9 times more than CPLEX), while the processing time increases only by 6


page 1

page 2

page 3

page 4


Multi-Objective Mixed Integer Programming: An Objective Space Algorithm

This paper introduces the first objective space algorithm which can exac...

A Multi-Objective Degree-Based Network Anonymization Approach

Enormous amounts of data collected from social networks or other online ...

Lossy compression of matrices by black-box optimisation of mixed-integer non-linear programming

In edge computing, suppressing data size is a challenge for machine lear...

Mining a Sub-Matrix of Maximal Sum

Biclustering techniques have been widely used to identify homogeneous su...

A MIP Backend for the IDP System

The IDP knowledge base system currently uses MiniSAT(ID) as its backend ...

Complexity of cutting planes and branch-and-bound in mixed-integer optimization

We investigate the theoretical complexity of branch-and-bound (BB) and c...

Please sign up or login with your details

Forgot password? Click here to reset