排序方式: 共有48条查询结果,搜索用时 31 毫秒
21.
5G通信时代的到来使城域波分系统从传统的环形向mesh形演进,OXC技术的引入让mesh形组网变得更加便捷。本文通过利用Dijkstra算法和偏离路径Yen算法解决城域mesh波分系统中最短路由和备用路由的规划选择问题,让业务在城域传送网中的时延得到优化以满足5G业务大带宽低时延的要求。 相似文献
22.
23.
24.
针对物流配送的关键技术进行分析讨论,阐述了物流配送实时监控的实现过程.分析了路径寻优中的传统Dijkstra算法,改变图的存储结构和搜索方法,采用二叉排序树减少搜索临时结点,减少了内存存储空间,缩短了查询时间,分析和实验表明该算法是有效的. 相似文献
25.
探讨供应链网络中供应方与链路破坏方在确定性可破坏链路遭受随机性破坏情况下双方的博弈.首先建立Dijkstra算法和模拟退火算法模型,把中国城市分布作为复杂网状结构,对复杂网状结构供应链问题进行了优化研究.然后在链路遭受有限破坏情况下,通过优化供求关系,使被破坏方损失降到最小.并研究了在确定性可破坏链路遭受随机性有限破坏时,破坏策略方与供应链方通过调整新的最优化路径,使博弈双方处于最优状态的方法. 相似文献
26.
Ireneusz Szczeniak Ireneusz Olszewski Boena Wo
na-Szczeniak 《Entropy (Basel, Switzerland)》2021,23(9)
We present a novel algorithm for dynamic routing with dedicated path protection which, as the presented simulation results suggest, can be efficient and exact. We present the algorithm in the setting of optical networks, but it should be applicable to other networks, where services have to be protected, and where the network resources are finite and discrete, e.g., wireless radio or networks capable of advance resource reservation. To the best of our knowledge, we are the first to propose an algorithm for this long-standing fundamental problem, which can be efficient and exact, as suggested by simulation results. The algorithm can be efficient because it can solve large problems, and it can be exact because its results are optimal, as demonstrated and corroborated by simulations. We offer a worst-case analysis to argue that the search space is polynomially upper bounded. Network operations, management, and control require efficient and exact algorithms, especially now, when greater emphasis is placed on network performance, reliability, softwarization, agility, and return on investment. The proposed algorithm uses our generic Dijkstra algorithm on a search graph generated “on-the-fly” based on the input graph. We corroborated the optimality of the results of the proposed algorithm with brute-force enumeration for networks up to 15 nodes large. We present the extensive simulation results of dedicated-path protection with signal modulation constraints for elastic optical networks of 25, 50, and 100 nodes, and with 160, 320, and 640 spectrum units. We also compare the bandwidth blocking probability with the commonly-used edge-exclusion algorithm. We had 48,600 simulation runs with about 41 million searches. 相似文献
27.
面向物流实时监测的移动GIS关键技术研究 总被引:1,自引:0,他引:1
姜代红 《微电子学与计算机》2011,28(10)
基于传统物流监测移动GIS在实际应用中存在的不可定制、查询时间长和占用内存存储空间大等缺点,构建了面向物流实时检测的移动GIS新型系统模型,详细阐述了支持该模型的数据采集发送终端、改进的Dijkstra算法和物流实时监测数据无线传输数据校验等三方面关键技术.在此基础上,实现了实时性能监测系统,实验结果表明:该系统满足实时监测各项要求,具有测量精度高,实时性好,配置灵活等优点. 相似文献
28.
29.
求解运输问题的一种新算法 总被引:7,自引:2,他引:5
本文将求解分派问题的标号算法成功地用于运输问题,并证明其中的非负处理可以省略,从而把Dijk-stra算法扩展到可能出现负边权的运输问题。与通常方法比较,这种方法具有直观、简单、计算量少、及易于推广等优点;最后证明该算法是多项式的,计算复杂性仅为o(n3)(当m≤n时)。 相似文献
30.