BANDWIDTH MINIMIZATION PROBLEM - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

BANDWIDTH MINIMIZATION PROBLEM

Chen Wang
  • Fonction : Auteur
  • PersonId : 967387
Chuan Xu
Abdel Lisser

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."
Fichier principal
Vignette du fichier
paper_40.pdf (320.23 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01166658 , version 1 (23-06-2015)

Identifiants

  • HAL Id : hal-01166658 , version 1

Citer

Chen Wang, Chuan Xu, Abdel Lisser. BANDWIDTH MINIMIZATION PROBLEM. MOSIM 2014, 10ème Conférence Francophone de Modélisation, Optimisation et Simulation, Nov 2014, Nancy, France. ⟨hal-01166658⟩
115 Consultations
4121 Téléchargements

Partager

Gmail Facebook X LinkedIn More