Overview of Heuristic Optimization

  • Patrick Bangert


Suppose we have a function f (x) where the variable x may be a vector of many dimensions. We seek the point x * such that f (x *) is the maximum value among all possible f (x). This point x * is called the global optimum of the function f (x). It is possible that x * is a unique point but it is also possible that there are several points that share the maximal value f (x *). Optimization is a field of mathematics that concerns itself with finding the point x * given the function f (x).


Genetic Algorithm Simulated Annealing Global Optimum Heuristic Method Travel Salesman Problem 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Patrick Bangert
    • 1
  1. 1.algorithmica technologies GmbHBremenGermany

Personalised recommendations