Optimised Search Heuristics: A Mapping of Procedures and Combinatorial Optimisation Problems
25 Pages Posted: 20 Jan 2016
Date Written: January 2006
Abstract
Recently hybrid metaheuristics have been design to find solutions for combinatorial optimisation problems. We focus on hybrid procedures that combine local search based metaheuristics with exact algorithms of the operations research field. We present a mapping that outlines the metaheuristic and exact procedures used, the way they are related and the problems they have been applied to.
Keywords: hybrid metaheuristics
Suggested Citation: Suggested Citation
Fernandes, Susana I. M. and Ramalhinho Dias Lourenço, Helena, Optimised Search Heuristics: A Mapping of Procedures and Combinatorial Optimisation Problems (January 2006). Available at SSRN: https://ssrn.com/abstract=2718137 or http://dx.doi.org/10.2139/ssrn.2718137
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.