Abstract
In this chapter we elaborate on meta-heuristics for optimization from a beginner’s perspective. Basically, we start from scratch to describe the different methodologies and provide the reader with the elements and strategies to build and implement them successfully. Although we describe the adaptation of these meth- ods to the linear ordering problem, we do not limit our descriptions to this problem. Instead, we present all methods in their generic form and then adapt them to the specific case of the LOP. This way, the reader can easily apply these methods to a wide range of combinatorial optimization problems.
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
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Martí, R., Reinelt, G. (2011). Meta-Heuristics. In: The Linear Ordering Problem. Applied Mathematical Sciences, vol 175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16729-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-16729-4_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16728-7
Online ISBN: 978-3-642-16729-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)