Skip to main content
SpringerLink
Log in

Simulated annealing for the machine reassignment problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Given an initial assignment of processes to machines, the machine reassignment problem is to find an assignment that improves the machine usage, subject to several resource and allocation constraints, and considering reassignment costs. We propose a heuristic based on simulated annealing for solving this problem. It uses two neighborhoods, one that moves a process from one machine to another, and a second one that swaps two processes on different machines. We present data structures that permit to validate and execute a move in time \(O(r+d)\) where \(r\) is the number of resources and \(d\) the number of dependencies of the service the process belongs to. The heuristic runs with two different sets of parameters in parallel until a convergence criterion is satisfied. The machine reassignment problem was subject of the ROADEF/EURO challenge in 2012, and the proposed algorithm ranked fourth in the final round of the senior category of the competition.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Brandt, F., Völker, M., & Speck, J. (2012). Constraint-based large neighborhood search for machine reassignment. In 25th European conference on operational research, Vilnius.

  • Burke, E. K., & Bykov, Y. (2012). The late acceptance hill-climbing heuristic. Tech. Rep. CSM-192, Computing Science and Mathematics, University of Stirling.

  • Cerny, V. (1985). Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications, 45, 41–51.

    Article  Google Scholar 

  • Gavranović, H., Buljubasić, M., & Demirović, E. (2012). Variable neighborhood search for google machine reassignment problem. Eletronic Notes in Discrete Mathematics, 39, 209–216. doi:10.1016/j.endm.2012.10.028.

    Article  Google Scholar 

  • Google Inc. (2011). Google ROADEF/EURO challenge 2011–2012: Machine reassignment. http://challenge.roadef.org/2012/files/problem_definition_v1.pdf, version 1

  • Hajek, B. (1988). Cooling schedules for optimal annealing. Mathematics of Operations Research, 13, 311–329.

    Article  Google Scholar 

  • Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1989). Optimization by simulated annealing. Part I, Graph partitioning. Operations Research, 37, 865–892.

    Article  Google Scholar 

  • Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220, 671–680.

    Article  Google Scholar 

  • Lopes, R., Morais, V. W., Noronha, T. F., & Souza, V. A. A. (2014). Heuristics and matheuristics for a real-life machine reassignment problem. International Transactions in Operational Research, 1–19.

  • Malitsky, Y., Mehta, D., O’Sullivan, B., Simonis, H. (2013). Tuning parameters of large neighborhood search for the machine reassignment problem. In Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, pp. 176–192.

  • Masson, R., Vidal, T., Michallet, J., Penna, P. H. V., Petrucci, V., Subramanian, A., et al. (2012). An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems. Expert Systems with Applications, 40, 5266–5275.

    Article  Google Scholar 

  • Matsumoto, M., & Nishimura, T. (1998). Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Transactions on Modeling and Computer Simulation, 8, 3–30.

    Article  Google Scholar 

  • Mehta, D., OSullivan, B., & Simonis, H. (2012a). Comparing solution methods for the machine reassignment problem. In Principles and practice of constraint programming, pp. 782–797.

  • Mehta, D., O’Sullivan, B., & Simonis, H. (2012b). Team S38 Google ROADEF challenge 2012. In European conference on operational research.

  • Pécot, M. (2012). Team S34 Google ROADEF challenge 2012.

  • Sansottera, A., Ferrucci, L., Sironi, F., & Calcavecchia, N. (2012). Team J33 Google ROADEF challenge 2012. Italy: Politecnico di Milano.

    Google Scholar 

  • Teypaz, N. (2012). Team S14 Google ROADEF challenge 2012. France: Probayes SAS.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Google Inc., Belo Horizonte, Minas Gerais, Brazil

    Gabriel M. Portal

  2. Instituto de Informática, Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil

    Marcus Ritt, Leonardo M. Borba & Luciana S. Buriol

Authors
  1. Gabriel M. Portal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcus Ritt
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Leonardo M. Borba
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Luciana S. Buriol
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Luciana S. Buriol.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Portal, G.M., Ritt, M., Borba, L.M. et al. Simulated annealing for the machine reassignment problem. Ann Oper Res 242, 93–114 (2016). https://doi.org/10.1007/s10479-014-1771-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-014-1771-7

Keywords

Search

Navigation