BANDWIDTH MINIMIZATION PROBLEM
Résumé
"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 Annealing(SA), Tabu Search(TS) and Variable Neighborhood Search(VNS). 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 compared
with which of meta-heuristic from the literature."
Domaines
Sciences de l'ingénieur [physics]
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...