A Memory Adaptive Reasoning Technique for Solving the Capacitated Minimum Spanning Tree Problem

Journal of Heuristics, No. 5, 1999, pp. 159-180

University of Alberta School of Business Research Paper No. 2013-1083

Posted: 2 Jul 2013

Date Written: June 1, 1998

Abstract

In this paper we propose a hybrid memory adaptive heuristic for solving the Capacitated Minimum Spanning Tree (CMST) problem. We augment the problem formulation with additional non-redundant constraints via use of adaptive memory, to improve upon the performance of an elementary heuristic (the Esau-Williams heuristic). Our methodology is tested against many of the previously reported heuristics for the CMST. We conclude that our generalized procedure performs on par with the best of these approaches in terms of solution quality, while expending a very modest amount of computational effort.

Keywords: capacitated minimum spanning tree, heuristic search, telecommunications network design

Suggested Citation

Patterson, Raymond and Rolland, Erik and Pirkul, Hasan, A Memory Adaptive Reasoning Technique for Solving the Capacitated Minimum Spanning Tree Problem (June 1, 1998). Journal of Heuristics, No. 5, 1999, pp. 159-180, University of Alberta School of Business Research Paper No. 2013-1083, Available at SSRN: https://ssrn.com/abstract=2282095

Erik Rolland

Ohio State University ( email )

2100 Neil Avenue
Columbus, OH 43210
United States
614-292-7692 (Phone)
614-292-2118 (Fax)

Hasan Pirkul

Independent ( email )

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Abstract Views
360
PlumX Metrics