Study Of Intelligent Algorithm And Application In Transportation System

The communication network is a critical part in lifelines system. They are essential for sustaining the normal operation of a community. Especilly, after a destructive earthquake or other disasters , transportation system plays the importation effection in post-earthquake disaster relief system in modern cities.In the paper,several algorithms including Ant Colony Algorithm,Genetic Algorithm,Simulated Annealing Algorithm,etc were used in real transportation system to find out the best way for distaster relief. And in the improvement on Ant Colony Algorithm, penalty and straitening zigzag were produced. They updated the quality of the solution. They were feasible in Travelling Saleman Problem (TSP). All these solved problems proved the updated methods effective. Aiming at the real problem (problem 1 in appendix A) and combining the development of these algorithms,there are several assignments in the paper:(l) The algorithms are run in the Visual Basic 6.0 program;among the algorithms, the improvement in Ant Colony Algorithm is an emphasis. (2) All these results are shown in the Visual Basic 6.0 program. (3)These algorthms were used effective in problem 1 and 2 to prove the improvement is valid .Corresponding to the assignments ,this thesis include three parts as follows:First,investigate the development of the lifeline project and clarify the importance of looking for the best way in transportation system.Visual Basic 6.0 program provides the videotex for the problem.Using the program,the algorithms are correlated with transportation problems. And then, all of them are vivid.Second, investigate these algorithm principles , carry out them and bring out a new improved ant colony algorithm:penalty and straighting zigzag . They were managed in problem 1 and 2.The paper attempted to combind ant colony algorithm with genetic algorithm .It is useful for the performance of the algorithm.Third, the program carried out other algorithms such as simulated annealing algorithm, dyanmic layout algorithm and Dijkstra algorithm. The contrast between them were achieved in program. The paper gives the arithmetic operators characteristic. All of them were validated in problem 1 and 2 (in appendix A).It proved reasonable for ant colony and genetic algorithm and its improvement.