Variable neighborhood search for minimum linear arrangement problem - Université Polytechnique des Hauts-de-France Accéder directement au contenu
Article Dans Une Revue Yugoslav Journal of Operations Research Année : 2016

Variable neighborhood search for minimum linear arrangement problem

Résumé

This paper presents a general variable neighborhood search (GVNS) heuristic for solving the maximum diverse grouping problem. Extensive computational experiments performed on a series of large random graphs as well as on several instances of the maximum diversity problem taken from the literature show that the results obtained by GVNS consistently outperform the best heuristics from the literature.

Dates et versions

hal-03578687 , version 1 (17-02-2022)

Identifiants

Citer

Nenad Mladenovic, Dragan Urošević, Dionisio Pérez-Brit. Variable neighborhood search for minimum linear arrangement problem. Yugoslav Journal of Operations Research, 2016, 26 (1), pp.3-14. ⟨10.2298/YJOR140928038M⟩. ⟨hal-03578687⟩
12 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More