Overview of Heuristic Optimization

Patrick Bangert
Additional contact information
Patrick Bangert: algorithmica technologies GmbH

Chapter Chapter 1 in Optimization for Industrial Problems, 2012, pp 1-11 from Springer

Abstract: Abstract 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).

Keywords: Genetic Algorithm; Simulated Annealing; Global Optimum; Heuristic Method; Travel Salesman Problem (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-24974-7_1

Ordering information: This item can be ordered from
http://www.springer.com/9783642249747

DOI: 10.1007/978-3-642-24974-7_1

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().