Heuristics for Matrix Bandwidth Reduction
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.
Matrix bandwidth, Genetic algorithm, Node adjustments, Hill climbing
Operations and Supply Chain Management
European Journal of Operational Research
LIM, Andrew; RODRIGUES, Brian; and XIAO, Fei.
Heuristics for Matrix Bandwidth Reduction. (2006). European Journal of Operational Research. 174, (1), 69-91. Research Collection Lee Kong Chian School Of Business.
Available at: http://ink.library.smu.edu.sg/lkcsb_research/562