CN103674049A  Method for obtaining shortest paths of compulsory nodes in navigation system  Google Patents
Method for obtaining shortest paths of compulsory nodes in navigation system Download PDFInfo
 Publication number
 CN103674049A CN103674049A CN 201310631719 CN201310631719A CN103674049A CN 103674049 A CN103674049 A CN 103674049A CN 201310631719 CN201310631719 CN 201310631719 CN 201310631719 A CN201310631719 A CN 201310631719A CN 103674049 A CN103674049 A CN 103674049A
 Authority
 CN
 Grant status
 Application
 Patent type
 Prior art keywords
 shortest path
 pass
 point
 nodes
 sub
 Prior art date
Links
Classifications

 G—PHYSICS
 G01—MEASURING; TESTING
 G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
 G01C21/00—Navigation; Navigational instruments not provided for in preceding groups
 G01C21/26—Navigation; Navigational instruments not provided for in preceding groups specially adapted for navigation in a road network
 G01C21/34—Route searching; Route guidance
 G01C21/3407—Route searching; Route guidance specially adapted for specific applications
 G01C21/343—Calculating itineraries, i.e. routes leading from a starting point to a series of categorical destinations using a global route restraint, round trips, touristic trips

 G—PHYSICS
 G01—MEASURING; TESTING
 G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
 G01C21/00—Navigation; Navigational instruments not provided for in preceding groups
 G01C21/26—Navigation; Navigational instruments not provided for in preceding groups specially adapted for navigation in a road network
 G01C21/34—Route searching; Route guidance
 G01C21/3446—Details of route searching algorithms, e.g. Dijkstra, A*, arcflags, using precalculated routes
Abstract
Description
导航系统中必经点最短路径的获取方法 Navigation system acquisition method will be the shortest path through point
技术领域 FIELD
[0001] 本发明属于线路导航技术领域，涉及一种导航系统，尤其涉及一种导航系统中必经点最短路径的获取方法。 [0001] The present invention belongs to the technical field of a navigation route, relates to a navigation system, a navigation system, more particularly to a method of obtaining necessary points through the shortest path.
背景技术 Background technique
[0002] 最短路径问题在计算机科学、交通工程、通信工程、控制理论等众多领域都有广泛的应用，是解决其它许多复杂网络优化问题的子问题之一。 [0002] The shortest path problem in many areas of computer science, engineering, communications engineering, control theory has a wide range of applications, it is one of subproblems to solve many other complex network optimization problems.
[0003] 随着车辆的广泛普及和交通网络的不断发展，智能交通诱导系统的作用将显得越为突出。 [0003] With the development and wide spread network of transportation vehicles, role of intelligent traffic guidance system will appear more prominent. 交通诱导系统可根据驾驶员的意愿为其提供最佳行驶路线来达到诱导出行行为、减少车辆在路上的逗留时间；同时，它还能避免因盲目行驶或凭经验行驶造成交通堵塞。 Traffic Guidance System according to the wishes of the driver can provide the best driving route to reach induced travel behavior, reduce the length of stay of the vehicle on the road; at the same time, it can avoid driving blind or empirically with traffic jams.
[0004] 作为用户来说，除了最优路线外，次优，再次优等路线也显得同样重要；这样可以使用户拥有更大的选择空间，同时为了进一步提供更人性化的服务，诱导系统还应设置多个必经点以满足用户在出行途中的需要，比如要途径超市、加油站等；还有军事人员及物资的运输中要必须考虑必经点，该必经点可能是一些重要的城市、桥梁、加油站、弹药库、中转站等；故必经点的考虑也必将是未来智能交通诱导系统的发展趋势。 [0004] As a user, in addition to the optimal route, suboptimal, again excellent route also appears equally important; so users can have greater choice, and in order to further provide a more personalized service, the system should induce must pass through a plurality of points in order to meet user needs in the way of travel, such as ways to supermarkets, gas stations and so on; there are transport of military personnel and supplies must be considered to be a necessary point, the point might be to go through some important cities , bridges, gas stations, ammunition depots, transit stations; it will be considered by the points will also be the future development trend of intelligent traffic guidance system. 随意智能手机的推广，越来越多的人，采用手机进行导航。 Casual promotion of smart phones, more and more people are using mobile phones to navigate.
[0005] 有鉴于此，如今迫切需要设计一种获取过K个必经点的N条最短路径的方法。 [0005] In view of this, now an urgent need to devise a method of the shortest path must pass through the K of the N points acquired before.
发明内容 SUMMARY
[0006] 本发明所要解决的技术问题是:提供一种导航系统中必经点最短路径的获取方法，可获取若干条过K个必经点的最短路径，方便用户根据需要选择。 [0006] The present invention solves the technical problem: the navigation system to provide a method of obtaining a necessary point in the shortest path, the shortest path can be obtained through the K point must pass through several pieces, according to user needs to select.
[0007] 为解决上述技术问题，本发明采用如下技术方案: [0007] To solve the above problems, the present invention adopts the following technical solution:
[0008] 一种导航系统中必经点最短路径的获取方法，所述方法获取过K个必经点的N条最短路径，其中，K、N为大于等于1的整数；所述方法包括: [0008] A navigation system via the acquisition method must point the shortest path, the method for obtaining the shortest path through the article number N K must pass through the points, wherein, K, N is an integer of 1; the method comprising:
[0009] 计算过第一条K个必经点的最短路径； [0009] The calculated shortest path first must pass through the K point;
[0010] 对每次找到的过K个必经点最短路径的子图进行再次分割，并且和已有子图存在的过K个必经点的最短路径的进行一一比较，找出最短路径，如此不断地重复执行，并在执行过程中去除重复的路径，直到路径条数达到满足或者已无路径为止。 [0010] on the subgraph through the K must pass through each point of the shortest path found split again, and had to go through the K point are the shortest path and existing subgraph comparing the presence of one by one, to find the shortest path , so repeatedly performed continuously, and removing duplicate paths during execution, until the number of paths reaches or no longer satisfy the path.
[0011] 作为本发明的一种优选方案，所述方法具体包括如下步骤: [0011] As a preferred embodiment of the present invention, the method includes the following steps:
[0012] 步骤S1、计算第1条过K个必经点的最短路径；根据Dijkstra算法,对起点、必经点和终点所有可能路径，分别按顺序求取每两个结点之间的最短路径，然后进行依次叠加，从而计算出过第一条K个必经点的最短路径； [0012] In step S1, the calculation of the shortest path through the K point must pass through a first article; according to the Dijkstra algorithm, for the starting point, and end point must pass through all possible paths, respectively, in order to strike the shortest distance between each two nodes path, then sequentially laminating, to calculate the shortest path through the first through the K points necessary;
[0013] 步骤S2、用第一数组类arrWebShortestPaths对第一条过K个必经点的最短路径进行添加；在该过K个必经点的最短路径对应的子图中，第1条最短路径对应的子图为原图，保持所有结点不变，按照该条路径进行分段断开，从而形成若干个对应的子图，计算每个子图对应的过K个必经点的最短路径，并把每个子图对应的最短路径的长度和从原图形成该子图所断开的某两个结点之间路段用第二数组类arrFormSubnetlnfo进行保存； [0013] Step S2, arrWebShortestPaths shortest path through the K point must pass through the first array of a first type add; FIG sub shortest path through the K must pass through the point corresponding to the article 1 Shortest Path original corresponding subgraph, maintaining unchanged all the nodes, in accordance with the trail segmented disconnected, thereby forming a plurality of subgraphs corresponding to calculated for each subgraph corresponding to the K through the shortest path must pass through the point, and the length of the shortest path to each subgraph formed corresponding to a link between the two nodes are disconnected from the subpicture of FIG arrFormSubnetlnfo save array with a second type;
[0014] 步骤S3、删除第二数组类arrFormSubnetlnfo此次中形成新子图的母图记录，比较第二数组类arrFormSubnetlnfo每个元素对应最短路径的长度，求最小长度，找出该元素，并从记录中可知其最短路径对应的子图是通过原图断开哪几段路段后形成的；故重新找出这条过K个必经点最短路径,与第一数组类arrWebShortestPaths中已存储的所有最短路径进行比较，若存在相同的，则不进行添加，反之，则添加； [0014] In step S3, the deletion of the second array class arrFormSubnetlnfo forming the master recording of the new subpicture, comparing each element of the second array class arrFormSubnetlnfo length corresponding to the shortest path, minimum length required to identify the elements, and from FIG understood recording sub shortest path is formed corresponding to the picture which is turned off by the link paragraphs; this so that reidentify the K through the shortest path must pass through the points, with the first array class already stored in all arrWebShortestPaths comparing the shortest path, if there is the same, not to add, on the contrary, is added;
[0015] 步骤S4、判断第一数组类arrWebShortestPaths中已有的最短路径是否有存在重复路段，把没有重复路段的用整型变量作一标记，返回执行步骤S2，直到该标记值和所需的最短路径条数N相等或者已无最短路径为止。 [0015] In step S4, it is determined already in the first array class arrWebShortestPaths shortest path whether a duplicate link, the link is not repeated with integer variables as a flag, return to perform step S2, until the flag value and the desired the shortest path until the number of N is equal to or no longer the shortest path.
[0016] 本发明的有益效果在于:本发明提出的导航系统中必经点最短路径的获取方法，可获取若干条过K个必经点的最短路径，方便用户根据需要选择。 [0016] Advantageous effects of the present invention is that: the navigation system of the present invention proposed acquisition method must go through the shortest path point, the shortest path can be obtained through the K point must pass through several pieces, according to user needs to select.
附图说明 BRIEF DESCRIPTION
[0017] 图1为26结点图的示意图。 [0017] FIG. 1 is a schematic nodes 26 of FIG.
[0018] 图2为本发明最短路径获取方法的流程图。 [0018] FIG. 2 flowchart of a method of obtaining the shortest path of the present invention.
具体实施方式 Detailed ways
[0019] 下面结合附图详细说明本发明的优选实施例。 [0019] The following detailed description of preferred embodiments of the present invention in conjunction with the accompanying drawings.
[0020] 实施例一 [0020] Example a
[0021] 本发明在带有导航的手机(当然也可以是其他电子设备)基础上，在求解最短路径问题的经典方法Dijkstra算法的基础上，提出一种导航系统中必经点最短路径的获取方法。 [0021] In the present invention, a mobile phone with a navigation (of course, other electronic devices may be) on the basis of the shortest path problem on the basis of the Dijkstra algorithm on classical methods, to provide a navigation system must obtain the shortest path through point method.
[0022] 设G=(V，E)是一个带权有向或无向图，例如图1，该图是由结点和相连的弧线组成，两个结点之间的不同连接方式组成了两点间所有的路径，每条路径都与其所在的子图相关，子图可以是原图断开某些结点之间的连接或去掉若干个结点以及与这些结点相关的连接组成。 [0022] The set G = (V, E) is a weighted directed or undirected graphs such as in FIG. 1, which is a node and the arcs are connected by the composition of the different connections between the two nodes consisting of all paths between two points, subgraph where each path associated therewith, may be subpicture FIG disconnect or remove a certain number of nodes and the connection nodes associated with those nodes composition . 在一个子图中求过K个必经点的最短路径，可通过分段求解每一种排列的路径后，去路径最小值来确定最终的最短路径。 After seeking a shortest path through K must pass through a point in the subfigures, each path can be solved through the arrangement of the segment, the path to the final minimum value to determine the shortest path.
[0023] 对于一个没有孤立结点的子图，每两个结点间存在最短路径；假设图中无孤立结点，那么从起始结点到目的结点之间存在若干条路径；对于每一条路径，该路径有多少段(不同结点之间的连接)就可以通过断开每一段形成多少个子图，这些子图中从起始结点到目的结点的路径集合相并再并上原图中被断开的这条路径所形成的集合，就等于原图中起始结点到目的结点之间的路径集合。 [0023] For a subgraph node is not isolated, the presence of between every two nodes shortest path; FIG assuming no isolated nodes, then there are several paths from the starting node to the destination node between; per a path that the number of segments (connections between different nodes) how many sub FIG form by opening of each segment, the subpath from the starting figures node to the destination node and reset the phase and Uehara FIG set is turned off in this path is formed, it is equal to the starting point of an original path between the destination node set. 根据以上原理可知，只要在子图中，起始结点和目的结点之间存在路径即是存在最短路径；故保持子图所有结点和原图一致，只是断开路径的不同，在原图找到两点之间的最短路径后，断开这条第一最短路径后形成的众子图都分别存在起始结点和目的结点之间的最短路径，倘若两结点之间还存在连接；对于原图来说第二最短路径便是这些形成子图的最短路径中最短的，如果所有子图中都不存在这两点间的路径时，表明只有第一最短路径这一条。 Based on the above principle known, as long as the subgraph, existing between the start node and the destination node exists a path that is the shortest path; it keeps the subpicture and all the nodes of FIG consistent disconnect different paths but in the original after finding the shortest path between two points, FIG sons formed after this first shortest path is disconnected there is the shortest path between the start node and the destination node, respectively, if there is a connection between two nodes ; picture is the second shortest path for the shortest path which is formed in the shortest subgraph, if the path does not exist between these two points all the subfigures, which show only a first shortest path.
[0024] 因此，求过K个必经结点的N条最短路径就是对每次找到的过K个必经点最短路径的子图进行再次分割，并且和已有子图存在的过K个必经点的最短路径的进行一一比较，找出最短的，这样不断地重复执行，并在执行过程中去除重复的路径直到路径条数达到满足或者已无路径为止。 [0024] Thus, one will desire a K through node N is the shortest paths through the K sub FIG must pass through each point of the shortest path found is divided once again, and the presence of existing subpicture through the K the shortest path for a necessary point toone comparison, identify the shortest possible, so that repeated continuously performed, and removing duplicate path until the path reaches the number of paths so far no longer met or during execution.
[0025] 对于过K个必经点的N条最短路径算法，必须先求得过第一条K个必经点的最短路径，然后再通过断开第一最短路径所形成的子图集对应的最短路径集合求第二最短路径，如此循环以致求得第N条最短路径。 [0025] For the N through the shortest path algorithm must pass through the K point, must be obtained through the first shortest path must pass through the K point, then the subportfolio by opening formed corresponding to the first shortest path a second set of shortest paths seek the shortest path, and so that the Nth shortest path is obtained.
[0026] 请参阅图2，本发明导航系统中必经点最短路径的获取方法具体包括如下步骤: [0026] Referring to FIG 2, the navigation system of the present invention, a necessary point of obtaining the shortest path method includes the following steps:
[0027]【步骤S1】求出第1条过K个必经点的最短路径。 [0027] [Step S1] obtained through the K Shortest path must pass through one point article. 根据Dijkstra算法,对起点、必经点和终点所有可能路径，分别按顺序求取每两个结点之间的最短路径，然后进行依次叠加，从而计算出过第一条K个必经点的最短路径。 According to Dijkstra's algorithm, on the starting point and end point must pass through all possible paths, respectively, in order to strike each shortest path between two nodes, and then successively superimposed, to calculate the first through the K must pass through points the shortest path. [0028]【步骤S2】用第一数组类arrWebShortestPaths对第一条过K个必经点的最短路径进行添加；在该过K个必经点的最短路径对应的子图中(第1条对应的子图为原图)，保持所有结点不变，按照该条路径进行分段断开，从而形成若干个对应的子图，计算每个子图对应的过K个必经点的最短路径，并把每个子图对应的最短路径的长度和从原图形成该子图所断开的某两个结点之间路段用第二数组类arrFormSubnetlnfo进行保存。 [0028] [Step S2] an array with a first type of arrWebShortestPaths the shortest path through the K must pass through the first point add; (article 1 corresponds to the shortest path through the subpicture must pass through a point K corresponding to the original subgrahs), maintaining unchanged all the nodes, in accordance with the trail segmented disconnected, thereby forming a plurality of corresponding subpicture, calculating the shortest path through the K must pass through the points in each subgraph corresponding to and the length of the shortest path to each subgraph corresponding to a second array and save arrFormSubnetlnfo type is formed between a segment of the two nodes are disconnected from the subpicture of FIG.
[0029]【步骤S3】删除第二数组类arrFormSubnetlnfo此次中形成新子图的母图记录，比较第二数组类arrFormSubnetlnfo每个元素对应最短路径的长度，求最小长度，找出该元素，并从记录中可知其最短路径对应的子图是通过原图断开哪几段路段后形成的。 Recording the master [0029] [Step S3] FIG deletion form a new subclass arrFormSubnetlnfo the second array, the second array class arrFormSubnetlnfo comparing each element corresponds to the length of the shortest path, minimum length required to identify the elements, and seen from FIG its subrecords corresponding to the shortest path which is formed after the link is disconnected by the original paragraphs. 故重新找出这条过K个必经点最短路径,与第一数组类arrWebShortestPaths中已存储的所有最短路径进行比较，若存在相同的，则不进行添加，反之，则添加。 Therefore, refind the K through this point must pass through the shortest path, the shortest path to all of the first array class arrWebShortestPaths alreadystored, if there is the same, not to add, on the contrary, is added.
[0030]【步骤S4】判断第一数组类arrWebShortestPaths中已有的最短路径是否有存在重复路段，把没有重复路段的用整型变量作一标记，返回执行步骤S2，直到该标记值和所需的最短路径条数N相等或者已无最短路径为止。 [0030] [Step S4] is determined in a first array class arrWebShortestPaths existing shortest path whether a duplicate link, the link is not repeated with integer variables as a flag, return to perform step S2, and the desired value until the tag the shortest path until the number of N is equal to or no longer the shortest path.
[0031] 综上所述，本发明提出的导航系统中必经点最短路径的获取方法，可获取若干条过K个必经点的最短路径，方便用户根据需要选择。 [0031] In summary, the navigation system of the present invention proposed acquisition method must go through the shortest path point, the shortest path can be obtained through the K point must pass through several pieces, according to user needs to select.
[0032] 这里本发明的描述和应用是说明性的，并非想将本发明的范围限制在上述实施例中。 [0032] The application of the present invention and described herein is illustrative, and not to limit the scope of the present invention, like in the above embodiment. 这里所披露的实施例的变形和改变是可能的，对于那些本领域的普通技术人员来说实施例的替换和等效的各种部件是公知的。 Modification herein disclosed embodiments and variations are possible in alternate embodiments to those of ordinary skill in the art that various equivalent components and are well known. 本领域技术人员应该清楚的是，在不脱离本发明的精神或本质特征的情况下，本发明可以以其它形式、结构、布置、比例，以及用其它组件、材料和部件来实现。 Those skilled in the art should appreciate that, without departing from the spirit or essential characteristics of the present invention, the present invention may be in other forms, structures, arrangements, proportions, and with other components, materials, and components to achieve. 在不脱离本发明范围和精神的情况下，可以对这里所披露的实施例进行其它变形和改变。 Without departing from the scope and spirit of the present disclosure, other variations and modifications may be made to the embodiments herein disclosed.
Claims (2)
 1.一种导航系统中必经点最短路径的获取方法，其特征在于，所述方法获取过K个必经点的N条最短路径，其中，K、N为大于等于1的整数；所述方法包括:计算过第一条K个必经点的最短路径；对每次找到的过K个必经点最短路径的子图进行再次分割，并且和已有子图存在的过K个必经点的最短路径的进行一一比较，找出最短路径，如此不断地重复执行，并在执行过程中去除重复的路径，直到路径条数达到满足或者已无路径为止。 1. A navigation system must go through the shortest path point acquisition method, wherein the method for obtaining the shortest path through the K must pass through the N points, where, K, N is an integer greater than or equal to 1; the a method comprising: calculating a first shortest path through the K point must pass through; through the K sub FIG must pass through each point of the shortest path found is divided once again, and the presence of subpicture, and has too must pass through the K It is the shortest path points one by one comparison, find the shortest path, so constantly repeated execution, and remove duplicate path in the implementation process until the number reaches paths meet or no longer path.
 2.根据权利要求1所述的导航系统中必经点最短路径的获取方法，其特征在于:所述方法具体包括如下步骤:步骤S1、计算第1条过K个必经点的最短路径；根据Dijkstra算法,对起点、必经点和终点所有可能路径，分别按顺序求取每两个结点之间的最短路径，然后进行依次叠加，从而计算出过第一条K个必经点的最短路径；步骤S2、用第一数组类对第一条过K个必经点的最短路径进行添加；在该过K个必经点的最短路径对应的子图中，第1条最短路径对应的子图为原图，保持所有结点不变，按照该条路径进行分段断开，从而形成若干个对应的子图，计算每个子图对应的过K个必经点的最短路径，并把每个子图对应的最短路径的长度和从原图形成该子图所断开的某两个结点之间路段用第二数组类进行保存；步骤S3、删除第二数组类此次中形成新子图的母图记录，比较第 The navigation system of claim 1, the method must be acquired by the shortest path points claim, characterized in that: said method includes the following steps: step S1, the calculation of the shortest path through the K point must pass through a first article; according to Dijkstra's algorithm, on the starting point and end point must pass through all possible paths, respectively, in order to strike each shortest path between two nodes, and then successively superimposed, to calculate the first through the K must pass through points shortest path; step S2, is added to the shortest path through the K point must pass through a first array of first class; in view of the child K through the shortest path must pass through the point corresponding to the article corresponding to the shortest path 1 the subgraph original, unchanged to keep all the nodes, in accordance with the trail segmented disconnected, thereby forming a plurality of subgraphs corresponding to calculated for each subgraph corresponding to the K through the shortest path must pass through the point, and the length of the shortest path to each subgraph corresponding to a second and save array type is formed by a link between the two nodes are disconnected from the subpicture picture; step S3, the deletion of the second array formed in this category FIG parent new child recording, Comparative 数组类每个元素对应最短路径的长度，求最小长度，找出该元素，并从记录中可知其最短路径对应的子图是通过原图断开哪几段路段后形成的；故重新找出这条过K个必经点最短路径，与第一数组类中已存储的所有最短路径进行比较，若存在相同的，则不进行添加，反之，则添加；步骤S4、判断第一数组类中已有的最短路径是否有存在重复路段，把没有重复路段的用整型变量作一标记，返回执行步骤S2，直到该标记值和所需的最短路径条数N相等或者已无最短路径为止。 Each array element corresponding to the class of the shortest path length, the minimum length required to identify the elements, and can be seen from FIG sub record which corresponds to the shortest path which is formed after the original paragraphs by link disconnection; find it again this point must pass through the K through the shortest path, the shortest path to all of the first category have been stored in the array is compared, if the same, not to add, on the contrary, the presence of added; step S4, it is determined in the first array class Are there exist duplicate shortest path segment, the segment is not repeated as a marker with integer variables, execution returns step S2, and the desired value until the tag shortest path until the article is no longer the number N is equal to or shortest route.
Priority Applications (1)
Application Number  Priority Date  Filing Date  Title 

CN 201310631719 CN103674049A (en)  20131129  20131129  Method for obtaining shortest paths of compulsory nodes in navigation system 
Applications Claiming Priority (1)
Application Number  Priority Date  Filing Date  Title 

CN 201310631719 CN103674049A (en)  20131129  20131129  Method for obtaining shortest paths of compulsory nodes in navigation system 
Publications (1)
Publication Number  Publication Date 

CN103674049A true true CN103674049A (en)  20140326 
Family
ID=50312317
Family Applications (1)
Application Number  Title  Priority Date  Filing Date 

CN 201310631719 CN103674049A (en)  20131129  20131129  Method for obtaining shortest paths of compulsory nodes in navigation system 
Country Status (1)
Country  Link 

CN (1)  CN103674049A (en) 
Cited By (2)
Publication number  Priority date  Publication date  Assignee  Title 

CN104142151A (en) *  20140731  20141112  上海闻泰电子科技有限公司  Navigation method 
CN104933248A (en) *  20150616  20150923  中国科学技术大学  Road network approximate shortest path calculation method on multicore platform 
Citations (2)
Publication number  Priority date  Publication date  Assignee  Title 

US5272638A (en) *  19910531  19931221  Texas Instruments Incorporated  Systems and methods for planning the scheduling travel routes 
DE19519107C1 (en) *  19950524  19960404  Daimler Benz Ag  Travel route guidance device for electric vehicle 
Patent Citations (2)
Publication number  Priority date  Publication date  Assignee  Title 

US5272638A (en) *  19910531  19931221  Texas Instruments Incorporated  Systems and methods for planning the scheduling travel routes 
DE19519107C1 (en) *  19950524  19960404  Daimler Benz Ag  Travel route guidance device for electric vehicle 
NonPatent Citations (2)
Title 

柴登峰等: "前N条最短路径问题的算法及应用", 《浙江大学学报（工学版）》, vol. 36, no. 5, 30 September 2002 (20020930) * 
王峰等: "Dijkstra及基于Dijkstra的前N条最短路径算法在智能交通系统中的应用", 《计算机应用研究》, vol. 23, no. 9, 30 September 2006 (20060930) * 
Cited By (3)
Publication number  Priority date  Publication date  Assignee  Title 

CN104142151A (en) *  20140731  20141112  上海闻泰电子科技有限公司  Navigation method 
CN104933248A (en) *  20150616  20150923  中国科学技术大学  Road network approximate shortest path calculation method on multicore platform 
CN104933248B (en) *  20150616  20180703  中国科学技术大学  Road network on a multicore platform approximate shortest path calculating method 
Similar Documents
Publication  Publication Date  Title 

US6594581B2 (en)  Route guidance apparatus and method  
Aslam et al.  Optimal roadside units placement in urban areas for vehicular networks  
US20140062790A1 (en)  Method and apparatus for providing location sharing via simulation  
US20100145608A1 (en)  Navigation based on popular userdefined paths  
US20110207446A1 (en)  Method and apparatus for providing tiles of dynamic content  
JP2005283575A (en)  Movement destination prediction device and movement destination prediction method  
US20140005924A1 (en)  Method and apparatus for route selection based on recorded and calculated routes  
Schnaufer et al.  Positionbased unicast routing for city scenarios  
Hu et al.  Urban traffic from the perspective of dual graph  
Chu et al.  Visualizing hidden themes of taxi movement with semantic transformation  
Xue et al.  Trafficknown urban vehicular route prediction based on partial mobility patterns  
Shihsien et al.  Estimation of a trip table and the θ parameter in a stochastic network  
Cavalcante et al.  Roadside unit deployment for information dissemination in a VANET: An evolutionary approach  
JP2000258184A (en)  Method and device for searching traffic network route  
Bastani et al.  A greener transportation mode: flexible routes discovery from GPS trajectory data  
CN101788999A (en)  Binary chop tracking method of shortest paths in network map  
CN102044163A (en)  Method, device and system for providing road condition information  
CN102622880A (en)  Traffic information data recovery method and device  
CN101900565A (en)  Path determining method and device  
CN102136192A (en)  Method for identifying trip mode based on mobile phone signal data  
US20130150087A1 (en)  Method and apparatus for generating realtime map and locationbased data  
Yu et al.  A multimodal route planning approach with an improved genetic algorithm  
Eisner et al.  Algorithms for matching and predicting trajectories  
Strano et al.  Multiplex networks in metropolitan areas: generic features and local effects  
CN102175252A (en)  Method for planning dynamic merging and united path of distributed multistage road network 
Legal Events
Date  Code  Title  Description 

C10  Request of examination as to substance 