Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem
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.
KeywordsLocal Search Planar Graph Knapsack Problem Lagrangian Relaxation Steiner Tree Problem
Unable to display preview. Download preview PDF.
- 1.Yamamato, Y., Kubo, M.: Invitation to the Traveling Salesman’s Problem (in Japanese). Asakura, Tokyo (1997)Google Scholar
- 3.Pirkwieser, S.: A Lagrangian Decomposition Approach Combined with Metaheuristics for the Knapsack Constrained Maximum Spanning Tree Problem. Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms (October 2006)Google Scholar
- 7.Fisher, M.L.: An application oriented guide to Lagrangean Relaxation. Interfaces 15, 10–21 (1985)Google Scholar
- 8.Beasley, J.E.: Lagrangian relaxation. In: Reeves, C.R. (ed.) Modern Heuristic Techniques for Combinatorial Problems, pp. 243–303. John Wiley & Sons Inc., New York (1993)Google Scholar
- 10.Prim, R.C.: Shortest connection networks and some generalizations. Bell Systems Technology Journal 36, 1389–1401 (1957)Google Scholar
- 16.Magnanti, T.L., Wolsey, L.A.: Optimal trees. In: Ball, M.O., et al. (eds.) Handbooks in Operations Research and Management Science, vol. 7, pp. 503–615. Elsevier Science, North-Holland, Amsterdam (1995)Google Scholar