Using branch & bound concepts in construction-based metaheuristics: exploiting the dual problem knowledge

Authors:
Christian Blum;Monaldo Mastrolilli
Affiliations:
ALBCOM research group, Universitat Politècnica de Catalunya, Barcelona, Spain;IDSIA, Manno, Switzerland
Venue:
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
Year:
2007

Citing 11
Cited 2

Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
The Complexity of Some Problems on Subsequences and Supersequences

Journal of the ACM (JACM)
An Ants heuristic for the frequency assignment problem

Future Generation Computer Systems
Data Structures and Algorithms

Data Structures and Algorithms
ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification

ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
An Ant-Based Framework for Very Strongly Constrained Problems

ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem

INFORMS Journal on Computing
Ant Colony Optimization

Ant Colony Optimization
Beam-ACO: hybridizing ant colony optimization with beam search: an application to open shop scheduling

Computers and Operations Research
A probabilistic beam search approach to the shortest common supersequence problem

EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
The hyper-cube framework for ant colony optimization

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

On the use of different types of knowledge in metaheuristics based on constructing solutions

Engineering Applications of Artificial Intelligence
The travelling salesman problem with time windows: Adapting algorithms from travel-time to makespan optimization

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent years it has been shown by means of practical applications that the incorporation of branch & bound concepts within construction-based metaheuristics can be very useful. In this paper, we attempt to give an explanation of why this type of hybridization works. First, we introduce the concepts of primal and dual problem knowledge, and we show that metaheuristics only exploit the primal problem knowledge. In contrast, hybrid metaheuristic that include branch & bound concepts exploit both the primal and the dual problem knowledge. After giving a survey of these techniques, we conclude the paper with an application example that concerns the longest common subsequence problem.