Title :
A Multi-heuristic Algorithmic Skeleton for Hard Combinatorial Optimization Problems
Author :
Melnikov, B.F. ; Tsyganov, A.V. ; Bulychov, O.I.
Author_Institution :
Togliatti State Univ., Russia
Abstract :
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.
Keywords :
optimisation; tree searching; branch-and-bound method; hard combinatorial optimization problem; multiheuristic algorithmic skeleton; Automata; Joints; Large-scale systems; Optimization methods; Skeleton; Traveling salesman problems; algorithmic skeleton; combinatorial optimization; hard problem; multi-heuristic approach;
Conference_Titel :
Computational Sciences and Optimization, 2009. CSO 2009. International Joint Conference on
Conference_Location :
Sanya, Hainan
Print_ISBN :
978-0-7695-3605-7
DOI :
10.1109/CSO.2009.321
