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

An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem

Abstract :

In this paper, an improved two-stage simulated annealing algorithm is presented for the minimum linear arrangement problem for graphs. This algorithm integrates several distinguished features including an efficient heuristic to generate good quality initial solutions, a highly discriminating evaluation function, a special neighborhood function and an effective cooling schedule. The algorithm is evaluated on a set of 30 well-known benchmark instances of the literature and compared with several state-of-the-art algorithms, showing improvements of 17 previous best results.

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

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

Identifiants

Collections

Citation

Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez. An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem. Computers and Operations Research, Elsevier, 2008, 35 (10), pp.3331 - 3346. ⟨10.1016/j.cor.2007.03.001⟩. ⟨hal-03255393⟩

Partager

Métriques

Consultations de la notice

10