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: 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
Do you have negative results from your research you’d like to share?
Feedback
Feedback to SSRN
If you need immediate assistance, call 877-SSRNHelp (877 777 6435) in the United States, or +1 212 448 2500 outside of the United States, 8:30AM to 6:00PM U.S. Eastern, Monday - Friday.