Abstract
Many problems that arise in practice are concerned with finding a good or even the best configuration or parameter set from a large set of feasible options. Feasible means that the option has to satisfy a number of rigid requirements. An example of such an optimization problem is to find a minimum weight cylindrical can that must hold a given quantity of liquid. Assuming the weight of the empty can to be proportional to its area, the problem can be formulated as finding the dimensions of a cylinder with a volume c, and the smallest possible perimeter: minimize
while
and r > 0 The formulation consists of a function to be minimized, the objective function, and a number of constraints. These constraints specify the set of feasible options, in this case the parameter pairs (r,h) that represent cylinders with radius r, height h, and volume c. Feasibility requirements are not always given as explicit constraints. In this example the volume constraint could have been substituted into the objective function.
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
© 1989 Kluwer Academic Publishers
About this chapter
Cite this chapter
Otten, R.H.J.M., van Ginneken, L.P.P.P. (1989). The Annealing Algorithm: A Preview. In: The Annealing Algorithm. The Kluwer International Series in Engineering and Computer Science, vol 72. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1627-5_1
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1627-5_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8899-2
Online ISBN: 978-1-4613-1627-5
eBook Packages: Springer Book Archive