Font Size: a A A

Genetic Algorithm’s Research And Application In The Problem Of Minimum Steiner Tree

Posted on:2013-06-01Degree:MasterType:Thesis
Country:ChinaCandidate:Z H ChenFull Text:PDF
GTID:2248330374989986Subject:Applied Mathematics
Abstract/Summary:PDF Full Text Request
Genetic Algorithm is a mock process of biological evolution that use the computers tosimulate Darwin’s biological evolution which is based on natural selection and genetics, and away that can search for the optimal solution. Genetic algorithms can solve not only mathproblems, but also more problems such as the problems of economy, biology, computer and soon.The first chapter describes genetic algorithm’s background, origins, development,advantages and disadvantages. And, genetic algorithm is in contrast to other algorithms. Inaddition, this article also describes the works to be done.The second chapter introduces the theoretical rationale of the genetic algorithm,and basicgenetic algorithm’s constituent, formalized definition and applied steps.And then it introducesthe current situation of genetic algorithm’s research.The third chapter introduces the concept and principle of the minimal steiner tree,severalrelated theorems, common solution and algorithm. Then this article describes two ways to solvethe problem in detailed.The fourth chapter mainly discusses genetic algorithm’s application in the problem of theminimum steiner tree. The actual problem is described, and then the mathematical model isestablished.At the end of this chap it uses the genetic algorithm to solve the praticalproblem,and gives two solutions.According to the two solutions to programming, twoexperimental results have been gotten effectively.This article comprehensively describes the background of the genetic algorithm,the origin,development, characteristics, theoretical foundation, research status, the elements, formalizeddefinition, application steps and other aspects. It gives the mathematical model of the problemof the minimum steiner tree based on genetic algorithm,and designs two solutions to solve theproblem. Then, according to the two solutions,the program is written,then which is run. Finally,according to the calculation results, the two solutions were compared, and gives suggestions forimprovement.
Keywords/Search Tags:genetic algorithm, minimum spanning tree, minimum Steiner spanning tree, convex hull
PDF Full Text Request
Related items