A new technique to solve minimum spanning tree (MST) problem using Modified Shuffled Frog-Leaping Algorithm (MSFLA) with GA cross-over

A minimum spanning tree (MST) of a connected, weighted (non-negative), undirected graph G = (V,E) is such that vertices of the graph G is connected by edges which have minimum weight and it forms a tree. Finding the MST from a graph is a NP-hard problem. In this paper a new technique is proposed to solve MST problem using Modified Shuffled Frog- Leaping Algorithm (MSFLA) with Genetic Algorithm (GA) cross-over. SFLA is a meta-heuristic search method inspired by natural memetics. It combines the benefits of both meme-based Memetic Algorithm (MA) and social behaviour based Particle Swarm Optimization (PSO). In this paper some modification of SFLA is done and applied it to MST problem. Extensive experimental results show that the algorithm performs very well compare to other algorithms and gives accurate results with minimum no of iterations.