Optimised Search Heuristic Combining Valid Inequalities and Tabu Search

  • Susana Fernandes
  • Helena R. Lourenço
Conference paper

DOI: 10.1007/978-3-540-88439-2_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5296)
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

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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Susana Fernandes
    • 1
  • Helena R. Lourenço
    • 2
  1. 1.Universidade do AlgarveFaroPortugal
  2. 2.Univertitat Pompeu FabraBarcelonaSpain

Personalised recommendations