Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search

被引：75

作者：

Mladenovic, N

Petrovic, J ^{[1
]}

Kovacevic-Vujcic, V

Cangalovic, M

机构：

[1] Univ Belgrade, Fac Organizat Sci, Lab Operat Res, Belgrade, Serbia

[2] Free Univ Brussels, SMG, Brussels, Belgium

[3] GERAD, Montreal, PQ H3T 2A7, Canada

[4] Ecole Hautes Etud Commerciales, Montreal, PQ H3T 2A7, Canada

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2003年 / 151卷 / 02期

关键词：

global optimization; min-max problems; heuristics; tabu search; variable neighbourhood search;

D O I：

10.1016/S0377-2217(02)00833-0

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

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. (C) 2003 Elsevier B.V. All rights reserved.

引用

页码：389 / 399

页数：11

共 15 条

[1]

[Anonymous], 1987, CONSTRAINED GLOBAL O

[2]

[Anonymous], OPTIKA

[3]

Asic M., 1996, P 23 YUG S OP RES, P401

[4]

CANGALOVIC M, 1996, YUGOSLAV J OPERATION, V6, P5