The Community for Technology Leaders
2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI) (2015)
Vietri sul Mare, Italy
Nov. 9, 2015 to Nov. 11, 2015
ISSN: 1082-3409
ISBN: 978-1-5090-0162-0
pp: 41-48
ABSTRACT
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% against CPLEX alone) and number of solutions (8.9 times more than CPLEX), while the processing time increases only by 6% in comparison to CPLEX for execution times larger than 100 seconds.
INDEX TERMS
Reliability, Optimization, Electronic mail, Context, Transient analysis, Programming, Servers
CITATION

T. Saber, A. Ventresque, J. Marques-Silva, J. Thorburn and L. Murphy, "MILP for the Multi-objective VM Reassignment Problem," 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI), Vietri sul Mare, Italy, 2015, pp. 41-48.
doi:10.1109/ICTAI.2015.20
96 ms
(Ver 3.3 (11022016))