A Multi-heuristic Algorithmic Skeleton for Hard Combinatorial Optimization Problems

被引：1

作者：

Melnikov, B. F. ^{[1
]}

Tsyganov, A. V. ^{[1
,2
]}

Bulychov, O. I. ^{[2
]}

机构：

[1] Togliatti State Univ, Tolyatti, Russia

[2] Ulyanovsk State Pedagog Univ, Ulyanovsk, Russia

来源：

INTERNATIONAL JOINT CONFERENCE ON COMPUTATIONAL SCIENCES AND OPTIMIZATION, VOL 1, PROCEEDINGS | 2009年

关键词：

PARALLEL;

D O I：

10.1109/CSO.2009.321

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In the present paper we discuss a multi-heuristic optimization technique for hard combinatorial optimization problems and outline its algorithmic skeleton. The proposed technique is based on a combination of heuristics commonly used in the area of combinatorial optimization and two branch-and-bound methods. Preliminary results show that this approach can be applied to different hard combinatorial optimization problems and is suitable for the construction of anytime algorithms.

引用

页码：33 / +

页数：2

共 5 条

[1] Efficient parallel LAN/WAN algorithms for optimization.: The MALLBA project [J].