Adaptive memory programming for matrix bandwidth minimization

Adaptive memory programming for matrix bandwidth minimization

0.00 Avg rating0 Votes
Article ID: iaor20112328
Volume: 183
Issue: 1
Start Page Number: 7
End Page Number: 23
Publication Date: Mar 2011
Journal: Annals of Operations Research
Authors: , ,
Keywords: heuristics, adaptive processes, combinatorial optimization
Abstract:

In this paper we explore the influence of adaptive memory in the performance of heuristic methods when solving a hard combinatorial optimization problem. Specifically, we tackle the adaptation of tabu search and scatter search to the bandwidth minimization problem. It consists of finding a permutation of the rows and columns of a given matrix which keeps the non‐zero elements in a band that is as close as possible to the main diagonal. This is a classic problem, introduced in the late sixties, that also has a well‐known formulation in terms of graphs. Different exact and heuristic approaches have been proposed for the bandwidth problem. Our contribution consists of two new algorithms, one based on the tabu search methodology and the other based on the scatter search framework. We also present a hybrid method combining both for improved outcomes. Extensive computational testing shows the influence of the different elements in heuristic search, such as neighborhood definition, local search, combination methods and the use of memory. We compare our proposals with the most recent and advanced methods for this problem, concluding that our new methods can compete with them in speed and running time.

Reviews

Required fields are marked *. Your email address will not be published.