Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
477865 | European Journal of Operational Research | 2006 | 23 Pages |
Abstract
In this work, we provide two heuristic algorithms for the matrix bandwidth reduction problem. The first is a genetic algorithm and the second uses node label adjustments. Experiments show these heuristics improve solution quality when compared with the well-known GPS algorithm and recently-developed methods using tabu search and GRASP with Path Relinking. Further, the node adjustment approach obtains solutions at speeds comparable to the fast GPS algorithm.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Andrew Lim, Brian Rodrigues, Fei Xiao,