A Fast Bandwidth Minimization Algorithm

Publication Type

Journal Article

Publication Date

6-2007

Abstract

We propose a simple and direct node shifting method with hill climbing for the well-known matrix bandwidth minimization problem. Many heuristics have been developed for this NP-complete problem including the Cuthill-McKee (CM) and the Gibbs, Poole and Stockmeyer (GPS) algorithms. Recently, heuristics such as Simulated Annealing, Tabu Search and GRASP have been used, where Tabu Search and the GRASP with Path Relinking achieved significantly better solution quality than the CM and GPS algorithms. Experimentation shows that our method achieves the best solution quality when compared with these while being much faster than newly-developed algorithms.

Keywords

Sparse matrices, bandwidth, heuristics

Discipline

Operations and Supply Chain Management

Research Areas

Operations Management

Publication

International Journal of Artificial Intelligence Tools

Volume

16

Issue

3

First Page

537

Last Page

544

ISSN

0218-2130

Identifier

10.1142/S0218213007003394

Publisher

World Scientific

Additional URL

https://doi.org/10.1142/S0218213007003394

Link to Full Text

Share

COinS