By Topic

A centroid-based approach to solve the bandwidth minimization problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
A. Lim ; Dept. of Ind. Eng. & Eng. Manage., Hong Kong Univ. of Sci. & Technol., Hongkong, China ; B. Rodrigues ; Fei Xiao

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.

Published in:

System Sciences, 2004. Proceedings of the 37th Annual Hawaii International Conference on

Date of Conference:

5-8 Jan. 2004