Skip to Main content Skip to Navigation
Conference papers

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

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-01299751
Contributor : Jakob Puchinger <>
Submitted on : Friday, April 8, 2016 - 11:57:37 AM
Last modification on : Tuesday, June 15, 2021 - 4:23:08 PM
Long-term archiving on: : Monday, November 14, 2016 - 10:02:40 PM

File

pirkwieser_07.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Sandro Pirkwieser, Günther 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⟩

Share

Metrics

Record views

124

Files downloads

350