1) constrained K-shortest paths
带约束K则最优路径
1.
For a better solution of the congestion shifting problem in DDVGS(Distributed Dynamic Route Guidance System),this paper develops a constrained K-shortest paths algorithm within a dynamic restricted searching area in consideration of a real city road net spatial distribution features which is suitable for the travelers and realizes its program on the basis of MAPX Control.
为了有效解决分布式动态诱导系统中存在的拥挤漂移问题,有针对性地根据城市交通网络的空间分布特性提出了适合于导航用户使用的动态限制搜索区域的带约束K则最优路径算法。
2) multi-constrained optimal path
多约束最优路径
1.
This paper proposed a mixed intelligence algorithm to solve multi-constrained optimal path and QoS routing that was based on the combination of ant colony algorithm,genetic algorithm and particle swarm optimization.
提出了一种将蚁群算法、遗传算法和粒子种群优化融合的混合智能算法来解决多约束最优路径和QoS路由问题。
3) Kth shortest path algorithm
K则最优路径算法
1.
A new Kth shortest path algorithm based on bidirectional search is set forward in this paper.
提出了一种基于双向搜索策略的K则最优路径算法,以改进的Dijkstra最优路径算法为基础,从起点和终点同时搜索,分别构造正序和逆序最优路径树,计算网络中两点之间的多条参考K则最优路径。
4) K-optimal paths
K最优路径
5) CSPF
约束最短路径优先
1.
For the most important topic-how to map traffic trunk into the actual topological network by LSP,the paper provides an algorithm called CSPF.
论述了 MPLS 网络的架构及其对流量工程的支持,研究了基于 MPLS 流量工程要解决的几个主要问题：如何把数据包映射为转发等价类等,并对其中最重要的一个——通过 LSP 把流量中继映射到实际网络拓扑,提出了一种约束最短路径优先算法的实现方法。
2.
Firstly, the paper briefly introduces the TE mechanism in MPLS network, then emphasizes on the extensions of routing protocol of GMPLS and two different path algorithms, such as online CSPF and offline Desing-Based routing.
本文首先简要介绍MPLS网络的流量工程机制,然后重点介绍GMPLS路由协议的流量工程扩展,以及两种不同约束路由计算机制,分别是在线进行路径计算的基于约束最短路径优先算法和离线路径计算的基于设计路由算法。
6) algorithm for the dynamic K best paths with multiple aims and constraints
有约束多目标优化动态K最优路算法
补充资料：带约
1.比喻众水汇聚一溪。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条