Paper #1100

Title:

Optimised search heuristic combining valid inequalities and tabu search

Authors:

Susana Fernandes and Helena Ramalhinho-Lourenço

Date:

July 2008

Abstract:

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.

Keywords:

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

JEL codes:

C61, M11

Area of Research:

Business Economics and Industrial Organization / Statistics, Econometrics and Quantitative Methods

Published in:

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

Download the paper in PDF format