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

Authors:
R. Patterson;H. Pirkul;E. Rolland
Affiliations:
School of Management, The University of Texas at Dallas, Richardson, Texas 75083-0688. rpatters@utdallas.edu;School of Management, The University of Texas at Dallas, Richardson, Texas 75083-0688. hpirkul@utdallas.edu;Fisher College of Business, Department of Accounting and MIS, The Ohio State University, Columbus, OH 43210. rolland.1@osu.edu
Venue:
Journal of Heuristics
Year:
1999

Citing 3
Cited 10

Heuristics with constant error guarantees for the design of tree networks

Management Science
Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem

Journal of the ACM (JACM)
Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory

INFORMS Journal on Computing

The capacitated minimum spanning tree problem: revisiting hop-indexed formulations

Computers and Operations Research
Savings based ant colony optimization for the capacitated minimum spanning tree problem

Computers and Operations Research
On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the Set Covering Problem

Computers and Industrial Engineering
Enhanced second order algorithm applied to the capacitated minimum spanning tree problem

Computers and Operations Research
Design of capacitated minimum spanning tree with uncertain cost and demand parameters

Information Sciences: an International Journal
Savings based ant colony optimization for the capacitated minimum spanning tree problem

Computers and Operations Research
Global access network evolution

IEEE/ACM Transactions on Networking (TON)
A filter-and-fan algorithm for the capacitated minimum spanning tree problem

Computers and Industrial Engineering
Leveraging saving-based algorithms by master-slave genetic algorithms

Engineering Applications of Artificial Intelligence
Seeking global edges for traveling salesman problem in multi-start search

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a hybrid memory adaptive heuristic forsolving the Capacitated Minimum Spanning Tree (CMST) problem. Weaugment the problem formulation with additional non-redundantconstraints via use of adaptive memory, to improve upon theperformance of an elementary heuristic (the Esau-Williamsheuristic). Our methodology is tested against many of thepreviously reported heuristics for the CMST. We conclude thatour generalized procedure performs on par with the best of theseapproaches in terms of solution quality, while expending a verymodest amount of computational effort.