Global optimizations and tabu search based on memory (Q702667)

From MaRDI portal
Revision as of 01:10, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Global optimizations and tabu search based on memory
scientific article

    Statements

    Global optimizations and tabu search based on memory (English)
    0 references
    0 references
    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

    Identifiers