Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem

Résumé

We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is further combined with an evolutionary algorithm to a sequential hybrid approach. Experimental investigations, including a comparison to a previously suggested simpler Lagrangian relaxation based method, document the advantages of the new approach. Most of the upper bounds derived by Lagrangian decomposition are optimal, and together with the evolutionary algorithm, large instances with up to 12000 nodes can be either solved to provable optimality or with a very small remaining gap in reasonable time.
Fichier principal
Vignette du fichier
pirkwieser_07.pdf (170.71 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01299751 , version 1 (08-04-2016)

Identifiants

Citer

Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger. Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem. Evolutionary Computation in Combinatorial Optimization, 7th European Conference, EvoCOP 2007, Apr 2007, Valencia, Spain. pp.Pages 176-187, ⟨10.1007/978-3-540-71615-0_16⟩. ⟨hal-01299751⟩
63 Consultations
175 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More