Comparison of Genetic Algorithm and Dijkstra Algorithm in Dynamic Weight System

Used a comparative approach to compare the performance of the genetic algorithm with the Dijkstra algorithm when solve the shortest path problem in the dynamic weight system.Did an experiment in the actual model with these two algorithms in order to test their stability,intelligence and time complexity.The game model makes many kinds of dynamic weight system.In order to make the genetic algorithm more reliable,the new algorithm gets a way to optimize the process of mutation to make the speed of the genetic algorithm faster and the reliability better.The experiment data shows that most data of the genetic algorithm is higher than the Dijkstra algorithm.The experiment makes a conclusion that the stability and expected result of the genetic algorithm is better than the Dijkstra algorithm in the dynamic weight system,but the time complexity of algorithm is higher than the Dijkstra algorithm.