TABU search methodology in global optimization

被引：13

作者：

Kovacevic-Vujcic, VV

Cangalovic, MM

机构：

[1] Univ Belgrade, Fac Org Sci, Lab Operat Res, Belgrade, Yugoslavia

[2] Ohio State Univ, Dept Math, Newark, OH 43055 USA

[3] Univ Belgrade, Fac Math, Belgrade, Yugoslavia

来源：

COMPUTERS & MATHEMATICS WITH APPLICATIONS | 1999年 / 37卷 / 4-5期

关键词：

global optimization; heuristic methods; TABU search;

D O I：

10.1016/S0898-1221(99)00064-4

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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 Phi(x) = max{phi(1)(x),...,phi(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. (C) 1999 Elsevier Science Ltd. All rights reserved.

引用

页码：125 / 133

页数：9

共 8 条

[1] AN IMPLICIT ENUMERATION METHOD FOR GLOBAL OPTIMIZATION PROBLEMS [J].

ASIC, MD ;

KOVACEVICVUJCIC, VV .

COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1991, 21 (6-7) :191-201

[2] A METHOD OF A SPREAD-SPECTRUM RADAR POLYPHASE CODE DESIGN [J].

DUKIC, ML ;

DOBROSAVLJEVIC, ZS .

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1990, 8 (05) :743-749

[3]

DUKIC ML, IN PRESS EUROPEAN T

[4]

Garey M. R., 1979, Computers and intractability. A guide to the theory of NP-completeness

[5]

GLOVER F, 1993, DISCRET APPL MATH

[6]

PARDALOS PM, 1987, CONSTRAINED GLOBAL O, P268

[7]

Reeves, 1993, Modern Heuristic Techniques for Combinatorial Problems, P70

[8]

TOM A, 1987, GLOBAL OPTIMIZATION, P350

← 1 →