Abstract
We present a local search method combined with noising strategy to efficiently solve the Google Machine Reassignment problem (GMRP), proposed at the ROADEF/EURO Challenge 2012 competition. The GMRP is a challenging and novel optimization problem, aimed at maximizing the usage of a set of machines by reallocating processes among those machines in a cost-efficient manner, while respecting a set of technological constraints. The search explores three different neighborhoods. Intensification and diversification of the search is achieved through the noising strategy, sorting the processes and search restarts. The noising is done by simple and suitable change of the objective function. The method is tested on 30 instances proposed by Google and used challenge evaluation. Most of the numerical results obtained here are proven to be optimal, near optimal, or the best known. The presented method was ranked first at ROADEF/EURO Challenge 2012 competition.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Charon, I., & Hurdy, O. (2001). The noising methods: A generalization of some metaheuristics. European Journal of Operational Research, 135, 86–101.
Diaz, J. A., & Fernandez, E. (1998). A tabu search heuristic for the generalized assignment problem. European Journal of Operational Research, 132, 22–38.
Google roadef/euro challenge 2011–2012: Machine reassignment. (2012). http://challenge.roadef.org/2012/files/problem_definition_v1.
Masson, R., Vidal, T., Michallet, J., Penna, P. H. V., Petrucci, V., Subramanian, A., et al. (2012). An iterated local search heuristic for multicapacity bin packing and machine reassignment problems. Expert Systems with Applications, 40 (13), 5266–5275.
Mehta, D., O’Sullivan, B., & Simonis, H. (2012). Comparing solution methods for the machine reassignment problem. Principles and practice of constraint programming. Lecture Notes in Computer Science 2012 (pp. 782–797). Proceedings of 18th International Conference, CP 2012, October 8–12, Québec City, QC, Canada.
Mitrovic-Minic, S., & Punnen, A. P. (2009). Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem. Discrete Optimization, 6(4), 370–377.
Yagiura, M., Yamaguchi, T., & Ibaraki, T. (1998). A variable depth search algorithm with branching search for the generalized assignment problem. Optimization Methods and Software, 10, 419–441.
Yagiura, M., Ibaraki, T., & Glover, F. (2004). An ejection chain approach for the generalized assignment problem. INFORMS Journal on Computing, 16, 133–151.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gavranović, H., Buljubašić, M. An efficient local search with noising strategy for Google Machine Reassignment problem. Ann Oper Res 242, 19–31 (2016). https://doi.org/10.1007/s10479-014-1686-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-014-1686-3