基于遺傳算法的最短路徑的計算

交通系統(tǒng)中的最優(yōu)路徑算法等同于圖論中的最短路徑算法,根據(jù)不同的具體要求可以
是長度最短或行駛時間最短。由于問題的特征、網(wǎng)絡(luò)特性等的紛繁復雜最短路徑算法表現(xiàn)出多樣性。除了經(jīng)典的方法外,近年來出現(xiàn)的模擬退火、Tabu 搜索和遺傳算法等在優(yōu)化問題中獲得了廣泛的應用,本文主要討論了用改進的遺傳算法求解最短路徑的方法。
關(guān)鍵字: 最短路徑, 遺傳算法, 隨機規(guī)則
Abstract: The most optimized path algorithm in the traffic system is equal to the shortest algorithm in the image theory, according to the specify requirement such as the need for shortest length or the shortest time. The difference and complexity of characteristic of the problem and the internet result in the varieties of the shortest path algorithm. Besides the classical method, the simulated annealing algorithm, Tabu search and Genetic Algorithm represented recently are common used. A new method to get the shortest path based on the improved Genetic Algorithm is analyzed in this paper.
Keywords: Most Short-path; Inherit Algorithm;