Heuristics for Matrix Bandwidth Reduction

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...

Full description

Saved in:
Bibliographic Details
Main Authors: LIM, Andrew, RODRIGUES, Brian, XIAO, Fei
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2006
Subjects:
Matrix bandwidth
Genetic algorithm
Node adjustments
Hill climbing
Operations and Supply Chain Management
Online Access:https://ink.library.smu.edu.sg/lkcsb_research/562
https://doi.org/10.1016/j.ejor.2005.02.066
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
Description
Summary: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.

Similar Items