最短路徑算法的研究畢業(yè)設(shè)計(jì)

1、 本科畢業(yè)設(shè)計(jì)(論文)題目名稱： 題目名稱： 最短路徑算法的研究 學(xué) 院： 院： 計(jì)算機(jī)科學(xué)技術(shù) 專業(yè)年級(jí)： 專業(yè)年級(jí)： 計(jì)算機(jī)科學(xué)與技術(shù)（師范）08 級(jí) 學(xué)生姓名： 學(xué)生姓名： 指導(dǎo)教師： 指導(dǎo)教師： xx 二○一二 二○一二 年 六月 六月 八日 八日

2、IIAbstractIn this paper, the purpose is to collect the shortest path algorithm about common for the shortest path problem in some travel problems, management, engineering problems and practical application of life, for e

3、nterprise and individual with convenient selection method. At the same time, the students for the mathematical modeling provide some ideas and methods for problem solving, provide favorable resources for the game. At las

4、t, by use of ant colony algorithm to solve the zhejiang traveling salesman problem. Through the application of the shortest path algorithm of ant colony algorithm to solve the zhejiang traveling salesman proble

5、m in the city as the coordinates of initial conditions, through the MATLAB calculation shortest paths, and draw the shortest route mapKey words：The shortest path algorithm, The shortest path application, ant col