Abstract
There are many classic algorithms that are designed to search spaces for an optimum solution. In fact, there are so many algorithms that it’s natural to wonder why there’s such a plethora of choices. The sad answer is that none of these traditional methods is robust. Every time the problem changes you have to change the algorithm. This is one of the primary shortcomings of the well-established optimization techniques. There’s a method for every problem the problem is that most people only know one method, or maybe a few. So they often get stuck using the wrong tool to attack their problems and consequently generate poor results.
... are all alike in their promises. It is only in their deeds that they differ.
Molière, The Miser
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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). Traditional Methods — Part 1. In: How to Solve It: Modern Heuristics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-07807-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-662-07807-5_4
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