頁籤選單縮合
題名 | An Annealed Ant System to the Shortest-Path Network Problem= |
---|---|
作者 | Liu, Shao-han; Lin, Jzau-sheng; |
期刊 | International Journal of Electrical Engineering |
出版日期 | 20060800 |
卷期 | 13:3 民95.08 |
頁次 | 頁209-217 |
分類號 | 448.6 |
語文 | eng |
關鍵詞 | Ant algorithm; Annealed ant algorithm; Shortest-path problem; |
英文摘要 | This paper investigates a shortest-path network problem using an annealed ant system algorithm, in which an annealing strategy is embedded to calculate the probabilities to decide which path the ants will select next. The shortest-path problem is to determine the shortest route between a source and a destination in a network topology. In this approach, according to the concrete problems of shortest routing, we construct two globally optimizing annealed ant systems (Concentrated Model and Distributed Model) that are based on the ability of ants to find the shortest way between the source and destination. The Concentrated Model (CM) means all ants are initially concentrated in the source node while all ants randomly select a node except the destination as their starting point initially and at least one must appear in the source node for the Distributed Model (DM). The experimental results show that the proposed annealed ant algorithm with the roulette wheel (RW) selection can obtain better performance than that generated by the conventional ant system with the RW or maximal probability (MP) selections. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。