Abstract
We’ve discussed a few traditional problem-solving strategies. Some of them guarantee finding the global solution, others don’t, but they all share a common pattern. Either they guarantee discovering the global solution, but are too expensive (i.e., too time consuming) for solving typical real-world problems, or else they have a tendency of “getting stuck” in local optima. Since there is almost no chance to speed up algorithms that guarantee finding the global solution, i.e., there is almost no chance of finding polynomial-time algorithms for most real problems (as they tend to be NP-hard), the other remaining option aims at designing algorithms that are capable of escaping local optima.
O! for a horse with wings!
Shakespeare, Cymbeline
This is a preview of subscription content, log in via an institution to check access.
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). Escaping Local Optima. In: How to Solve It: Modern Heuristics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-07807-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-662-07807-5_6
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