Skip to Main Content
We propose a node centroid method with Hill-Climbing to solve the well-known matrix bandwidth 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. 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. Also, the new algorithm achieves better solutions than the GPS algorithm in comparable time.