zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Tabu search for nonlinear and parametric optimization (with links to genetic algorithms). (English) Zbl 0799.90109

Summary: In spite of the widespread importance of nonlinear and parametric optimization, many standard solution methods allow a large gap between local optimality and global optimality, inviting consideration of metaheuristics capable of reducing such gaps. We identity ways to apply the tabu search metaheuristic to nonlinear optimization problems from both continuous and discrete settings.

The step beyond strictly combinatorial settings enlarges the domain of problems to which tabu search is typically applied. We show how tabu search can be coupled with directional search and scatter search approaches to solve such problems. In addition, we generalize standard weighted combinations (as employed in scatter search) to include structured weighted combinations capable of satisfying specified feasibility conditions (e.g., mapping weighted combinations of scheduling, partitioning and covering solutions into new solutions of the same type). The outcome suggests ways to exploit potential links between scatter search and genetic algorithms, and also provides a basis for integrating genetic algorithms with tabu search.

90C30Nonlinear programming
90C31Sensitivity, stability, parametric optimization
68T05Learning and adaptive systems
92D99Genetics and population dynamics