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

id	sg-smu-ink.lkcsb_research-1561
record_format	dspace
spelling	sg-smu-ink.lkcsb_research-15612016-03-11T16:22:10Z Heuristics for Matrix Bandwidth Reduction LIM, Andrew RODRIGUES, Brian XIAO, Fei 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. 2006-10-01T07:00:00Z text https://ink.library.smu.edu.sg/lkcsb_research/562 info:doi/10.1016/j.ejor.2005.02.066 https://doi.org/10.1016/j.ejor.2005.02.066 Research Collection Lee Kong Chian School Of Business eng Institutional Knowledge at Singapore Management University Matrix bandwidth Genetic algorithm Node adjustments Hill climbing Operations and Supply Chain Management
institution	Singapore Management University
building	SMU Libraries
continent	Asia
country	Singapore Singapore
content_provider	SMU Libraries
collection	InK@SMU
language	English
topic	Matrix bandwidth Genetic algorithm Node adjustments Hill climbing Operations and Supply Chain Management
spellingShingle	Matrix bandwidth Genetic algorithm Node adjustments Hill climbing Operations and Supply Chain Management LIM, Andrew RODRIGUES, Brian XIAO, Fei Heuristics for Matrix Bandwidth Reduction
description	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.
format	text
author	LIM, Andrew RODRIGUES, Brian XIAO, Fei
author_facet	LIM, Andrew RODRIGUES, Brian XIAO, Fei
author_sort	LIM, Andrew
title	Heuristics for Matrix Bandwidth Reduction
title_short	Heuristics for Matrix Bandwidth Reduction
title_full	Heuristics for Matrix Bandwidth Reduction
title_fullStr	Heuristics for Matrix Bandwidth Reduction
title_full_unstemmed	Heuristics for Matrix Bandwidth Reduction
title_sort	heuristics for matrix bandwidth reduction
publisher	Institutional Knowledge at Singapore Management University
publishDate	2006
url	https://ink.library.smu.edu.sg/lkcsb_research/562 https://doi.org/10.1016/j.ejor.2005.02.066
_version_	1770569630098653184

Heuristics for Matrix Bandwidth Reduction

Similar Items