Accéder directement au contenu Accéder directement à la navigation
Article dans une revue

An improved simulated annealing algorithm for bandwidth minimization

Abstract :

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.

Type de document :
Article dans une revue
Liste complète des métadonnées

https://hal.univ-angers.fr/hal-03255389
Contributeur : Okina Université d'Angers <>
Soumis le : mercredi 9 juin 2021 - 15:04:19
Dernière modification le : jeudi 10 juin 2021 - 03:39:57

Identifiants

Collections

Citation

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

Partager

Métriques

Consultations de la notice

3