|Title:||Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search||Journal:||European Journal of Operational Research||Volume:||151||Issue:||2||First page:||389||Last page:||399||Issue Date:||1-Dec-2003||Rank:||M22||ISSN:||0377-2217||DOI:||10.1016/S0377-2217(02)00833-0||Abstract:||
A basic variable neighbourhood search (VNS) heuristic is applied for the first time to continuous min-max global optimization problems. The method is tested on a class of NP-hard global optimization problems arising from the synthesis of radar polyphase codes that has already been successfully treated by tabu search. The computational results show that VNS in average outperforms tabu search.
|Keywords:||Global optimization | Heuristics | Min-max problems | Tabu search | Variable neighbourhood search||Publisher:||Elsevier|
Show full item record
checked on Oct 1, 2022
checked on Oct 4, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.