Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/915| Title: | TABU search methodology in global optimization | Authors: | Kovačević-Vujčić, V. V. Čangalović, M. M. Ašić, M. D. Ivanović, L. Dražić, Milan |
Affiliations: | Numerical Mathematics and Optimization | Keywords: | Global optimization;Heuristic methods;TABU search | Issue Date: | 1-Jan-1999 | Journal: | Computers and Mathematics with Applications | Abstract: | 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{φ1(x), . . . ,φm(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. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/915 | ISSN: | 08981221 | DOI: | 10.1016/s0898-1221(99)00064-4 |
| Appears in Collections: | Research outputs |
Show full item record
SCOPUSTM
Citations
19
checked on Nov 8, 2024
Page view(s)
12
checked on Nov 15, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.