An improved simulated annealing algorithm for bandwidth minimization - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2008

An improved simulated annealing algorithm for bandwidth minimization

, (1) ,
1
Eduardo Rodriguez-Tello
Jose Torres-Jimenez
  • Fonction : Auteur

Résumé

In this paper, a simulated annealing algorithm is presented for the bandwidth minimization problem for graphs. This algorithm is based on three distinguished features including an original internal representation of solutions, a highly discriminating evaluation function and an effective neighborhood. The algorithm is evaluated on a set of 113 well-known benchmark instances of the literature and compared with several state-of-the-art algorithms, showing improvements of some previous best results.

Dates et versions

hal-03255389 , version 1 (09-06-2021)

Identifiants

Citer

Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez. An improved simulated annealing algorithm for bandwidth minimization. European Journal of Operational Research, 2008, 185 (3), pp.1319 - 1335. ⟨10.1016/j.ejor.2005.12.052⟩. ⟨hal-03255389⟩

Collections

UNIV-ANGERS LERIA
6 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More