Optimised Search Heuristic Combining Valid Inequalities and Tabu Search
- Cite this paper as:
- Fernandes S., Lourenço H.R. (2008) Optimised Search Heuristic Combining Valid Inequalities and Tabu Search. In: Blesa M.J. et al. (eds) Hybrid Metaheuristics. HM 2008. Lecture Notes in Computer Science, vol 5296. Springer, Berlin, Heidelberg
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.
KeywordsOptimised Search Heuristic Tabu Search GRASP Valid Inequalities Job-shop Scheduling
Unable to display preview. Download preview PDF.