期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
基于剪枝策略的改进TDCALT算法 被引量:2
1
作者 钟慧玲 章梦 +1 位作者 石永强 蔡文学 《同济大学学报(自然科学版)》 EI CAS CSCD 北大核心 2012年第8期1197-1203,共7页
针对大规模路网中求解最短路问题的低效性与非实时性,通过时间依赖性路网来刻画路网和交通状况信息,构造时间依赖性路网下的高效最短路算法.以目前效率较高的TDCALT(time dependent core-based A*landmarks triangleinequality)算法为基... 针对大规模路网中求解最短路问题的低效性与非实时性,通过时间依赖性路网来刻画路网和交通状况信息,构造时间依赖性路网下的高效最短路算法.以目前效率较高的TDCALT(time dependent core-based A*landmarks triangleinequality)算法为基础,提出动态优化上限值的改进措施,并首次引入和改进静态路网下最短路算法中的剪枝策略,形成ITDCALT(improved TDCALT)算法.在广州市路网上的试验表明:ITDCALT算法在算法运行时间和搜索空间上均优于TDCALT算法和TDIJKSTRA(time-dependent DIJKSTRA)算法;ITDCALT算法具有计算效率高、搜索空间小、性能稳定的优点. 展开更多
关键词 路网最短路算法 剪枝策略 时间依赖性 加速策略
下载PDF
A SYNTHETIC ALGORITHM FOR WAVELENGTH ROUTING IN OPTICAL NETWORK
2
作者 Xiao Chunxian Guo Ying Dai Jufeng 《Journal of Electronics(China)》 2007年第1期46-49,共4页
After analyzing the merits and shortcomings of Fixed-Alternated Routing algorithm (FAR) and Least Loaded Routing algorithm (LLR),we propose one novel dynamic optical routing algorithm. Having considered the influences... After analyzing the merits and shortcomings of Fixed-Alternated Routing algorithm (FAR) and Least Loaded Routing algorithm (LLR),we propose one novel dynamic optical routing algorithm. Having considered the influences of path’s length and path’s congestion just like in FAR and LLR,we take into account the network resource status-amount of free wavelengths in the network. Proposed algorithm sets up connections on three possible paths according to amount of available free wave-lengths in the network,which effectively decreases the blocking probability. The National Science Foundation (NSF) network and mesh-torus network simulation results show that the performance of this algorithm is better than that of FAR and LLR. 展开更多
关键词 Wavelength Division Multiplexing (WDM) Routing and Wavelength Assignment (RWA) Shortest path Poisson process
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部