应用于圆锥图的改进的发明层次Dijkstra算法
Modified Dijkstra Algorithm with Invention Hierarchies Applied to a Conic Graph
摘要：
提出了使用本发明的收缩层级的Dijkstra算法的修改版本。该算法考虑了一个有向无环图的圆锥或半圆结构，其中一对边是从多个源迭代选择。该算法通过使用比较过程来获得最小路径。比较过程遵循考虑向前和向后检查的数学构造例程，使得仅选择具有最小长度的路径。此外，该算法通过计算最小边缘对及其后续邻居的绝对边缘差，在O（n）时间内自动发明一条新的路径。发明的路径近似的隐藏路径使用健身标准。该算法扩展了多源多目的地问题，包括路径挖掘重定向从多个源到多个目的地是最小的路径。该算法已应用于医院定位系统中，取得了满意的效果。
英文摘要：
A modified version of the Dijkstra algorithm using an inventive contraction hierarchy is proposed. The algorithm considers a directed acyclic graph with a conical or semi-circular structure for which a pair of edges is chosen iteratively from multi-sources. The algorithm obtains minimum paths by using a comparison process. The comparison process follows a mathematical construction routine that considers a forward and backward check such that only paths with minimum lengths are selected. In addition, the algorithm automatically invents a new path by computing the absolute edge difference for the minimum edge pair and its succeeding neighbour in O (n) time. The invented path is approximated to the hidden path using a fitness criterion. The proposed algorithm extends the multi-source multi-destination problem to include those paths for which a path mining redirection from multi-sources to multi-destinations is a minimum. The algorithm has been applied to a hospital locator path finding system and the results were quite satisfactory.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
