Global optimizations and tabu search based on memory

DOI10.1016/j.amc.2003.10.028zbMath1057.65036OpenAlexW2075294594MaRDI QIDQ702667

Huanwen Tang, Mingjun Ji

Publication date: 17 January 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2003.10.028

zbMATH Keywords

algorithmnumerical resultsconvergence in probability onememory tabu searchmultiple-minima problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (9)

Solving the unconstrained optimization problem by a variable neighborhood search ⋮ Evolutionary neighborhood discovery algorithm for agricultural routing planning in multiple fields ⋮ Convergence of taboo search in continuous global optimization ⋮ Multicanonical jump walk annealing assisted by tabu for dynamic optimization of chemical engineering processes ⋮ Improving genetic algorithms' performance by local search for continuous function optimization ⋮ A heuristic approach to find the global optimum of function ⋮ A novel hybrid algorithm based on particle swarm and ant colony optimization for finding the global minimum ⋮ Two effective hybrid metaheuristic algorithms for minimization of multimodal functions ⋮ Efficient hybrid methods for global continuous optimization based on simulated annealing

Cites Work

• Unnamed Item
• Unnamed Item
• Global optimization and simulated annealing
• A tabu search Hooke and Jeeves algorithm for unconstrained optimization
• Tabu search and finite convergence
• A novel metaheuristics approach for continuous global optimization
• TABU search methodology in global optimization
• Taboo Search: An Approach to the Multiple Minima Problem
• Tabu Search—Part I
• Tabu Search—Part II
• Global optimization
• On the convergence of tabu search

This page was built for publication: Global optimizations and tabu search based on memory