Optimised Search Heuristic Combining Valid Inequalities and Tabu Search

29 Pages Posted: 8 Oct 2008

Date Written: October 8, 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 Classification: C61, M11

Suggested Citation

Ramalhinho Dias Lourenço, Helena and Fernandes, Susana I. M., Optimised Search Heuristic Combining Valid Inequalities and Tabu Search (October 8, 2008). Available at SSRN: https://ssrn.com/abstract=1280762 or http://dx.doi.org/10.2139/ssrn.1280762

Helena Ramalhinho Dias Lourenço (Contact Author)

Universitat Pompeu ( email )

Ramon Trias Fargas 25-27
Barcelona, 08005
Spain
+34 93 542 27 53 (Phone)
+34 93 542 17 46 (Fax)

Susana I. M. Fernandes

FCT University of Algarve ( email )

Faro, Algarve 8005-139
Portugal

Do you have negative results from your research you’d like to share?

Paper statistics

Downloads
57
Abstract Views
943
Rank
659,560
PlumX Metrics