Adaptive memory search for Boolean optimization problems

被引：15

作者：

Hvattum, LM ^{[1
]}

Lokketangen, A

Glover, F

机构：

[1] Molde Coll, N-6411 Molde, Norway

[2] Univ Colorado, Leeds Sch Business, Boulder, CO 80309 USA

来源：

DISCRETE APPLIED MATHEMATICS | 2004年 / 142卷 / 1-3期

关键词：

Boolean optimization problem; adaptive memory search; tabu search;

D O I：

10.1016/j.dam.2003.06.006

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We describe a simple adaptive memory search method for Boolean Optimization Problems. The search balances the level of infeasibility against the quality of the solution, and uses a simple dynamic tabu search mechanism. Computational results on a portfolio of test problems taken from the literature are reported, showing very favorable results, both in terms of search speed and solution quality. (C) 2003 Elsevier B.V. All rights reserved.

引用

页码：99 / 109

页数：11