Multi-neighborhood local search optimization for machine reassignment problem

Abstract As the topic of the Google ROADEF/EURO Challenge 2012, machine reassignment problem (denoted as MRP) is an important optimization problem in load balance of cloud computing. Given a set of machines and a set of processes running on machines, the MRP aims at finding a best process-machine reassignment to improve the usage of machines while satisfying various hard constraints. In this paper, we present a metaheuristic algorithm based on multi-neighborhood local search (denoted as MNLS) for solving the MRP. Our MNLS algorithm consists of three primary and one auxiliary neighborhood structures, an efficient neighborhood partition search mechanism with respect to the three primary neighborhoods and a dynamic perturbation operator. Computational results tested on 30 benchmark instances of the ROADEF/EURO Challenge 2012 and comparisons with the results in the challenge and the literature demonstrate the efficacy of the proposed MNLS algorithm in terms of both effectiveness and efficiency. Furthermore, several key components of our MNLS algorithm are analyzed to gain an insight into it.

[1]  Ibrahim H. Osman,et al.  Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches , 1995 .

[2]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[3]  Lale Özbakir,et al.  Bees algorithm for generalized assignment problem , 2010, Appl. Math. Comput..

[4]  H. R. Lourenço,et al.  Adaptive Approach Heuristics for The Generalized Assignment Problem , 1998 .

[5]  Roberto Baldacci,et al.  A unified exact method for solving different classes of vehicle routing problems , 2009, Math. Program..

[6]  B. John Oommen,et al.  Solving Multiconstraint Assignment Problems Using Learning Automata , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[7]  G. Ross,et al.  Modeling Facility Location Problems as Generalized Assignment Problems , 1977 .

[8]  L. V. Wassenhove,et al.  A survey of algorithms for the generalized assignment problem , 1992 .

[9]  H. R. Lourenço,et al.  Adaptive search heuristics for the generalized assignment problem , 2002 .

[10]  Barry O'Sullivan,et al.  Tuning Parameters of Large Neighborhood Search for the Machine Reassignment Problem , 2013, CPAIOR.

[11]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[12]  Qingfu Zhang,et al.  Meta-Heuristic Combining Prior Online and Offline Information for the Quadratic Assignment Problem , 2014, IEEE Transactions on Cybernetics.

[13]  Ramon Lopes,et al.  Heuristics and matheuristics for a real-life machine reassignment problem , 2015, Int. Trans. Oper. Res..

[14]  Thibaut Vidal,et al.  An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems , 2013, Expert Syst. Appl..

[15]  John M. Wilson,et al.  A hybrid tabu search/branch & bound approach to solving the generalized assignment problem , 2010, Eur. J. Oper. Res..

[16]  T. Ibaraki,et al.  A variable depth search algorithm with branching search for the generalized assignment problem , 1998 .

[17]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[18]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[19]  Felix Brandt,et al.  Constraint-based large neighborhood search for machine reassignment , 2014, Annals of Operations Research.

[20]  Hacene Ouzia,et al.  Effective algorithm and heuristic for the generalized assignment problem , 2004, Eur. J. Oper. Res..

[21]  Randy H. Katz,et al.  A view of cloud computing , 2010, CACM.

[22]  Haris Gavranovic,et al.  Variable Neighborhood Search for Google Machine Reassignment problem , 2012, Electron. Notes Discret. Math..

[23]  Michael Racer,et al.  A hybrid heuristic for the generalized assignment problem , 1995 .

[24]  Mehmet Fatih Tasgetiren,et al.  Differential Evolution Algorithms for the Generalized Assignment problem , 2009, 2009 IEEE Congress on Evolutionary Computation.

[25]  Rajkumar Buyya,et al.  Energy-aware resource allocation heuristics for efficient management of data centers for Cloud computing , 2012, Future Gener. Comput. Syst..

[26]  Barry O'Sullivan,et al.  Comparing Solution Methods for the Machine Reassignment Problem , 2012, CP.

[27]  John E. Beasley,et al.  A genetic algorithm for the generalised assignment problem , 1997, Comput. Oper. Res..

[28]  Zuo-Jun Max Shen,et al.  The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms , 2011, INFORMS J. Comput..

[29]  T. Ibaraki,et al.  A Variable Depth Search Algorithm for the Generalized Assignment Problem , 1999 .

[30]  Regina Bastos Haro.  An Algorithmic Study of the Machine Reassignment Problem , 2012 .

[31]  Martin W. P. Savelsbergh,et al.  A Branch-and-Price Algorithm for the Generalized Assignment Problem , 1997, Oper. Res..

[32]  Fred W. Glover,et al.  An Ejection Chain Approach for the Generalized Assignment Problem , 2004, INFORMS J. Comput..

[33]  Robert M. Nauss.  The Generalized Assignment Problem , 2005 .

[34]  Fred W. Glover,et al.  A path relinking approach with ejection chains for the generalized assignment problem , 2006, Eur. J. Oper. Res..

[35]  Wei Jiang,et al.  An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions , 2013, Ann. Oper. Res..

[36]  Roberto Roberti,et al.  New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem , 2011, Oper. Res..

[37]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[38]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

[39]  Wojciech Jaskowski,et al.  A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem , 2015, Annals of Operations Research.

[40]  Luciana S. Buriol,et al.  Simulated annealing for the machine reassignment problem , 2016, Ann. Oper. Res..

[41]  Edward P. K. Tsang,et al.  The guided genetic algorithm and its application to the generalized assignment problem , 1998, Proceedings Tenth IEEE International Conference on Tools with Artificial Intelligence (Cat. No.98CH36294).

[42]  David W. Pentico,et al.  Assignment problems: A golden anniversary survey , 2007, Eur. J. Oper. Res..

[43]  Mauro Dell'Amico,et al.  Assignment Problems , 1998, IFIP Congress: Fundamentals - Foundations of Computer Science.

[44]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[45]  Richard M. Soland,et al.  A branch and bound algorithm for the generalized assignment problem , 1975, Math. Program..