Abstract
Algorithms play an important role in computer science and are essential for several important applications. The term “algorithm” refers to a procedure to solve a given problem. Such a problem may have different features and structures, and in the case where the problem is well understood, specific algorithms may be designed that achieve good solutions for the problem at hand. The design and the analysis of such problem-specific algorithms has been widely studied for a wide range of problems (Cormen, Leiserson, Rivest, and Stein, 2001). The goal in this field of research is to obtain algorithms that are provably optimal with respect to the runtime and/or approximation ability for the studied problem. Studying a specific problem allows us to obtain knowledge about the problem at hand, which can be used for the development and the analysis of problem-specific algorithms. When looking at the results obtained in this field, the reader may observe the following. Often problem-specific algorithms are very complicated as they try to incorporate as much problem knowledge as possible so that good guarantees about the runtime and/or approximation quality can be proven. On the other hand, there are also many simple randomized algorithms available for which good performance guarantees can be given (Motwani and Raghavan, 1995). The proof that such simple algorithms work well is usually more complicated as knowledge about the problem is only implicitly present in the algorithm and is worked out in the analysis.
Keywords
- Particle Swarm Optimization
- Evolutionary Algorithm
- Combinatorial Optimization Problem
- Problem Knowledge
- Particle Swarm Optimiza
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
References
Cormen T, Leiserson C, Rivest R, Stein C (2001) Introduction to Algorithms. McGraw-Hill, 2nd edition
Motwani R, Raghavan P (1995) Randomized Algorithms. Cambridge University Press
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Neumann, F., Witt, C. (2010). Introduction. In: Bioinspired Computation in Combinatorial Optimization. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16544-3_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-16544-3_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16543-6
Online ISBN: 978-3-642-16544-3
eBook Packages: Computer ScienceComputer Science (R0)