Global optimizations and tabu search based on memory
type: Item
instance of: scholarly article
title: Global optimizations and tabu search based on memory
zbMATH Open document ID: 1057.65036
author: Mingjun Ji
author: Huanwen Tang
published in: Applied Mathematics and Computation
publication date: 2005-01-17T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 2128842
zbMATH Keywords: memory tabu search
zbMATH Keywords: convergence in probability one
zbMATH Keywords: multiple-minima problem
zbMATH Keywords: numerical results
zbMATH Keywords: algorithm
reviewed by: Nada Djuranović-Miličić
MaRDI profile type: Publication
full work available at URL: j.amc.2003.10.028
OpenAlex ID: W2075294594
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Taboo Search: An Approach to the Multiple Minima Problem
cites work: A novel metaheuristics approach for continuous global optimization
cites work: A tabu search Hooke and Jeeves algorithm for unconstrained optimization
cites work: TABU search methodology in global optimization
cites work: On the convergence of tabu search
cites work: Tabu search and finite convergence
cites work: Q4197095
cites work: Global optimization
cites work: Q4060901
cites work: Global optimization and simulated annealing
DOI: 10.1016/J.AMC.2003.10.028
description: scientific article; zbMATH DE number 2128842