Penyelesaian Masalah Generalized Minimum Spanning Tree dengan Metode Heuristik Local Search

Abstract

Generalized minimum spanning tree (GMST) is a minimum spanning tree of a graph with the nodes partitioned into some node-sets called cluster. GMST can be solved by using local search heuristic method which includes Prim algorithm in their steps to determine the minimum spanning tree. In this paper GMST problem is applied to the problem of determining the location of the primary electricity substations in every district in Palangkaraya. In each district, it will be decided a few number of villages as the location for the installation of electricity substations such that minimized the cable length