Design and implementation of optimization algorithm for traffic line selection based on genetic algorithm

The solution to traffic line selection problem was converted to minimum spanning tree(MST)problem.Based on the graphic theory,an improved genetic algorithm is introduced to search the minimum spanning trees.This algorithm uses binary code to represent the problem of minimum spanning trees and uses the depth first searching method to determine the connectivity of the graph.The corresponding fitness function,single parent transposition operator,single parent reverse operators and controlling evolutionary strategies are designed to improve its speed and efficiency.In comparison with traditional algorithms,it can acquire a set of minimum spanning trees during one genetic evolutionary process.