Integrated Genetic Algorithm with Hill Climbing for the Bandwidth Minimization Porblem
In this paper, we propose an integrated Genetic Algorithm with Hill Climbing to solve the matrix bandwidth minimization problem, which is to reduce bandwidth by permuting rows and columns resulting in the nonzero elements residing in a band as close as possible to the diagonal. Experiments show that...
Saved in:
Main Authors: | LIM, Andrew, RODRIGUES, Brian, XIAO, Fei |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2003
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/2068 https://doi.org/10.1007/3-540-45110-2_41 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Ant Colony Optimization with Hill Climbing for the Bandwidth Minimization Problem
by: LIM, Andrew, et al.
Published: (2006) -
An Evolutionary Approach to Bandwidth Minimization
by: LIM, Andrew, et al.
Published: (2003) -
A Fast Bandwidth Minimization Algorithm
by: LIM, Andrew, et al.
Published: (2007) -
A New Heuristic Method for the Bandwidth Minimization Problem
by: LIM, Andrew, et al.
Published: (2003) -
A Simulated Annealing with Hill Climbing Algorithm for the Traveling Tournament Problem
by: LIM, Andrew, et al.
Published: (2006)