Google challenge: A hyperheuristic for the Machine Reassignment Problem

Rodolfo Hoffmann, Maria Cristina Riff, Elizabeth Montero, Nicolas Rojas

Producción científica: Contribución a los tipos de informe/libroContribución a la conferenciarevisión exhaustiva

3 Citas (Scopus)

Resumen

In this work we present a hyperheuristic based method to solve Google Machine Reassignment problem (MRP). MRP was proposed at ROADEF/EURO challenge 2012 competition. It is a NP-complete problem. In the competition, this hard constrained optimization problem must be solved within 5 minutes. Our hyperheuristic approach uses a self-adaptive strategy according to the instance to solve, in order to quickly obtain quality solutions. The results show that self-adaptation is a good option for hyperheuristic approaches that require to be efficient in a restricted amount of time. Moreover, the results obtained using our hyperheuristic are competitive compared to those from the best algorithms of the competition.

Idioma originalInglés
Título de la publicación alojada2015 IEEE Congress on Evolutionary Computation, CEC 2015 - Proceedings
EditorialInstitute of Electrical and Electronics Engineers Inc.
Páginas846-853
Número de páginas8
ISBN (versión digital)9781479974924
DOI
EstadoPublicada - 10 sep. 2015
EventoIEEE Congress on Evolutionary Computation, CEC 2015 - Sendai, Japón
Duración: 25 may. 201528 may. 2015

Serie de la publicación

Nombre2015 IEEE Congress on Evolutionary Computation, CEC 2015 - Proceedings

Conferencia

ConferenciaIEEE Congress on Evolutionary Computation, CEC 2015
País/TerritorioJapón
CiudadSendai
Período25/05/1528/05/15

Áreas temáticas de ASJC Scopus

  • Informática aplicada
  • Matemática computacional

Huella

Profundice en los temas de investigación de 'Google challenge: A hyperheuristic for the Machine Reassignment Problem'. En conjunto forman una huella única.

Citar esto