Publication Type

Conference Proceeding Article

Version

acceptedVersion

Publication Date

2003

Abstract

We propose a Node Centroid method with Hill-Climbing to solve the well-known matrix band-width minimization problem, which is to permute rows and columns of the matrix to minimize its bandwidth. 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 have achieved significantly better solution quality than the CM and GPS algorithms. Experimentation shows that the Node Centroid method achieves the best solution quality when compared with these while being much faster than the newly-developed algorithms

Discipline

Operations and Supply Chain Management

Research Areas

Operations Management

Publication

18th International Joint Conference on Artificial Intelligence, ( IJCAI 2003, Acapulco, Mexico)

First Page

1544

Last Page

1545

Additional URL

https://ijcai.org/Past%20Proceedings/IJCAI-2003/PDF/269.pdf

Download

Share

COinS