𝔖 Bobbio Scriptorium
✦   LIBER   ✦

TABU search methodology in global optimization

✍ Scribed by V.V. Kovačević-Vujčić; M.M. Čangalović; M.D. Ašić; L. Ivanović; M. Dražić


Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
553 KB
Volume
37
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

✦ Synopsis


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)} subject to box constraints. The tests are performed on a special class of problems of this type arising from the synthesis of radar polyphase codes. It is shown that problems of this type are NP-hard. (~) 1999 Elsevier Science Ltd. All rights reserved.


📜 SIMILAR VOLUMES


Tabu search method with random moves for
✍ 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
✍ 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

New Tabu Search based global optimizatio
✍ Svetlana Stepanenko; Bernd Engels 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 381 KB

## Abstract The study presents two new nonlinear global optimization routines; the Gradient Only Tabu Search (GOTS) and the Tabu Search with Powell's Algorithm (TSPA). They are based on the Tabu‐Search strategy, which tries to determine the global minimum of a function by the __steepest descent–mil