Name
Abstract | ||
|---|---|---|
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 this approach achieves the best solution quality when compared with the GPS [1] algorithm, Tabu Search [3], and the GRASP with Path Relinking methods [4], while being faster than the latter two newly-developed heuristics. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/3-540-45110-2_41 | GECCO |
Keywords | DocType | Volume |
best solution quality,integrated genetic algorithm,permuting row,matrix bandwidth minimization problem,tabu search,newly-developed heuristics,nonzero element,hill climbing,information system,operations management,genetic algorithm | Conference | 2724 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-40603-4 | 8 |
PageRank | References | Authors |
0.69 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrew Lim | 1 | 937 | 89.78 |
| Brian Rodrigues | 2 | 311 | 22.31 |
| Fei Xiao | 3 | 73 | 7.11 |