𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Tabu Search applied to global optimization

✍ Scribed by Rachid Chelouah; Patrick Siarry

Book ID
108445592
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
253 KB
Volume
123
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

TABU search methodology in global optimi
TABU search methodology in global optimization
✍ V.V. KovačeviΔ‡-VujčiΔ‡; M.M. ČangaloviΔ‡; M.D. AΕ‘iΔ‡; L. IvanoviΔ‡; M. DraΕΎiΔ‡ πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 553 KB

This paper investigates the application of TABU search methodology in global optimization. A general multilevel TABU search algorithm is proposed. The algorithm is applied to the problem of finding constrained global minima of a piecewise smooth function of the form β€’ (x) --max{~l(X) .... , ~om(x)}

Tabu search and design optimization
Tabu search and design optimization
✍ J.A. Bland; G.P. Dawson πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 629 KB
Tabu search method with random moves for
Tabu search method with random moves for globally optimal design
✍ Nanfang Hu πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 601 KB

Optimum engineering design problems are usually formulated as non-convex optimization problems of continuous variables. Because of the absence of convexity structure, they can have multiple minima, and global optimization becomes difficult. Traditional methods of optimization, such as penalty method

A combined global and local search metho
A combined global and local search method to deal with constrained optimization for continuous tabu search
✍ Xi Chen; Jing Yang; Zhaohua Li; Daqing Tian; Zhijiang Shao πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 269 KB

## Abstract Heuristic methods, such as tabu search, are efficient for global optimizations. Most studies, however, have focused on constraint‐free optimizations. Penalty functions are commonly used to deal with constraints for global optimization algorithms in dealing with constraints. This is some