Abstract
Almost every practical heuristic search algorithm is controlled by some set of parameters. In simulated annealing, for example, there’s a temperature parameter, and what’s more, you have to decide the schedule for reducing the temperature over time. In hill-climbing, there’s a parameter that controls the size of the local neighborhood in which you’ll look for improvements. In tabu search, you must determine how to implement the rules for the memory structure. None of these algorithms comes neatly wrapped in a gift box where all you have to do is open the box and receive your nice surprise!
He who wishes to be rich in a day will be hanged in a year.
Leonardo da Vinci, Notebooks
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Michalewicz, Z., Fogel, D.B. (2004). Tuning the Algorithm to the Problem. In: How to Solve It: Modern Heuristics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-07807-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-07807-5_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-06134-9
Online ISBN: 978-3-662-07807-5
eBook Packages: Springer Book Archive