Paper #1100

Título:

Optimised search heuristic combining valid inequalities and tabu search

Autores:

Susana Fernandes y Helena Ramalhinho-Lourenço

Data:

Julio 2008

Resumen:

This paper presents an Optimised Search Heuristic that combines a tabu search method with the verification of violated valid inequalities. The solution delivered by the tabu search is partially destroyed by a randomised greedy procedure, and then the valid inequalities are used to guide the reconstruction of a complete solution. An application of the new method to the Job-Shop Scheduling problem is presented.

Palabras clave:

Optimised Search Heuristic, Tabu Search, GRASP, Valid Inequalities, Job Shop Scheduling

Códigos JEL:

C61, M11

Área de investigación:

Economía de la Empresa y Organización Industrial / Estadística, Econometría y Métodos Cuantitativos

Publicado en:

Hybrid Metaheuristics, M.J. Blesa, C. Blum, C. Cotta, A.J. Fernández, J.E. Gallardo, A. Roli, M.Sampels (Eds.), Lecture Notes in Computer Science 5296: 87-101. ISBN: 978-3-540-88438-5

Descargar el paper en formato PDF