An experimental analysis of five neighborhoods is presented. The analysis includes a hybrid structure comprised of one random pair, two random pairs, three random pairs or four random pairs. The efficiency and effectiveness of each structure was tested using the minimum spanning tree problem. As proposed in this research paper, the hybrid structure approach applied to the minimum spanning tree problem demonstrates superior effectiveness and competitive efficiency as compared to other structures.
Neighborhood Hybrid Structure for Minimum Spanning Tree Problem
2012-11-01
310297 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
New Models of the Generalized Minimum Spanning Tree Problem
British Library Online Contents | 2004
|Radar Data Tracking Using Minimum Spanning Tree-Based Clustering Algorithm
British Library Conference Proceedings | 2011
|On the probabilistic min spanning tree Problem
British Library Online Contents | 2012
|Widening the dynamic range of pictures using a minimum spanning tree algorithm
British Library Online Contents | 2000
|