A Lagrangian Decomposition/Evolutionary Algorithm Hybrid 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
Chapitre D'ouvrage Année : 2008

A Lagrangian Decomposition/Evolutionary Algorithm Hybrid 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. Thorough experimental investigations, including a comparison to a previously suggested simpler Lagrangian relaxation based method, document the advantages of our approach. Most of the upper bounds derived by Lagrangian decomposition are optimal, and when additionally applying local search (LS) and combining it with the evolutionary algorithm, large and supposedly hard instances can be either solved to provable optimality or with a very small remaining gap in reasonable time.

Dates et versions

hal-01226565 , version 1 (09-11-2015)

Identifiants

Citer

Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger. A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem. Recent Advances in Evolutionary Computation for Combinatorial Optimization, 2008, 978-3-540-70806-3. ⟨10.1007/978-3-540-70807-0_5⟩. ⟨hal-01226565⟩

Collections

TDS-MACS
23 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More