BANDWIDTH MINIMIZATION PROBLEM Report as inadecuate




BANDWIDTH MINIMIZATION PROBLEM - Download this document for free, or read online. Document in PDF available to download.

1 LRI

Abstract : -Bandwidth minimization problem consists of finding a permutation of the rows and columns of a sparse matrix in order to keep the non-zero elements in a band that is as close as possible to the main diagonal. In the recent decades, meta-heuristics have become useful approaches for solving difficult combinatorial optimization problems. In this paper, we use three meta-heuristics to solve the bandwidth problem, including Simulated AnnealingSA, Tabu SearchTS and Variable Neighborhood SearchVNS. We combine the local search with basic VNS to improve the efficiency of the algorithm and solve bandwidth minimization problem. By the experiment results of 47 benchmark instances, the running time of the algorithm is reduced comparedwith which of meta-heuristic from the literature.-

Keywords : bandwidth meta-heuristic running time





Author: Chen Wang - Chuan Xu - Abdel Lisser -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents