CAJ | 학술논문

在复杂网络的理论基础上,基于节点度和最小支撑聚类构造了一个阻抗函数,利用该阻抗函数提出了一种可应用于城市路网的启发式路径搜索算法,该算法搜索到的路径可以在总路径长度接近理论最短的同时,通过避免取径可能发生拥堵的路段,从而降低遭遇拥堵情况的风险;根据该算法编程实现了一个简易导航程序,通过实际路网数据验证了算法的有效性.
재복잡망락적이론기출상,기우절점도화최소지탱취류구조료일개조항함수,이용해조항함수제출료일충가응용우성시로망적계발식로경수색산법,해산법수색도적로경가이재총로경장도접근이론최단적동시,통과피면취경가능발생옹도적로단,종이강저조우옹도정황적풍험;근거해산법편정실현료일개간역도항정서,통과실제로망수거험증료산법적유효성.
According to the complex network theory, an impedance function based on node degree and infinite incipient percola-tion cluster and a path-finding heuristic algorithm for urban road network is presented. The heuristic algorithm proposed in this paper can find a path which can avoid the roads where congestion may occur so that the risk of encountering congestion can be reduced, while the total length of the path is close to the theoretical shortest. The algorithm is utilized to implement a simple nav-igation program and the feasibility of the algorithm is tested through a group of actual road network data.