Global optimizations and tabu search based on memory (Q702667)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2128842
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Global optimizations and tabu search based on memory |
scientific article; zbMATH DE number 2128842 |
Statements
Global optimizations and tabu search based on memory (English)
0 references
17 January 2005
0 references
The authors present a new tabu search, named memory tabu search (MTS), for solving the multiple-minima problem of continuous functions. MTS is based on the idea of tabu search (TS) originally developed by Glover and it presents an adaption of TS to continuous optimization problem. Two convergence theorems, which show that MTS asymptotically converges to the global optimal solutions in probability one, are given. Numerical results illustrate that this algorithm is efficient, robust and easy to implement.
0 references
memory tabu search
0 references
convergence in probability one
0 references
multiple-minima problem
0 references
numerical results
0 references
algorithm
0 references
0.8779646754264832
0 references
0.8779646754264832
0 references
0.8420851230621338
0 references
0.8253430128097534
0 references
