DK - Routing
	FAQ Feed

Q10312 -  What support for routing is provided in the DK? This is a general question. Many associate routing with road/street routing of vehicles, but routing functionality can also be applied to any sort of network, such as liquid pipeline systems, electrical power grids, rail networks, etc. By default the ... (Modified: 2006-12-11)

Q10681 -  How do the TatukGIS DK and IS products support routing between two points on a vector map file? By default, routes are calculated base on the shortest path, with all segments (represented by vector lines) of all possible routes treated equally. The shortest path operation is based on the linier unit ... (Modified: 2006-02-24)

Q10588 -  How can I use the DK to calculate the distance in meters of a calculated optimal street/road route between two selected points on a vector map layer in the UTM48 geographic coordinate system? For calculating distance, first setup the projection. Starting with the DK Geocoding sample (located in DK ... (Modified: 2004-12-17)

Q10432 -  My map layer is unprojected, i.e. in lat/long coordinates, and I want to use the DK to calculate the distance between two points in meters. How? I believe that it must be possible because I am using the DK scale component and I see that it is showing distance in meters. Distances cannot be calculate ... (Modified: 2004-12-08)

Q10276 -  We are considering adapting the DK for our electrical utility and power outage management system for the purpose of a "switch planning solution" i. e. if I remove power from one node, which other nodes will go off as well; or if I restore power, which other nodes will go on. Grids must be organized ... (Modified: 2003-11-21)

Q10277 -  With your shortest path functionality, can a "cost" hierarchy system be applied to a road map? If so, are the costs attached to nodes or to the line links between nodes? Exactly. A cost or cost factor may be attached to any "link" A link is the shape (vector line representing a road segment) between ... (Modified: 2003-11-21)

Q10278 -  The DK documentation implies that a node file is required for routing functionality, which is logical to indicate directional capability. But do the nodes have to be created by me? Nodes are created automatically by the DK (or IS) at the intersections of vector line data. Nodes typically exist at ... (Modified: 2003-11-21)

Q10302 -  How do I calculate the Route length (ShortestPath) I am trying to do this using the follwing code, but the number being returned is not the correct distance. I tried unsuccessfully to set the units for the Shape file. Private Sub EventShortestPath_OnPath(translated As Boolean, ByVal Shape As Object, ... (Modified: 2004-11-26)

Q10308 -  Does your product handle the Traveling Salesman Problem, i.e. multiple waypoints? If so, how many stops could it potentially handle? The Traveling Salesman Problem is a complex routing problem requiring a specialized, and typically expensive, algorithm. At this time the support of multi-point routin ... (Modified: 2003-11-21)

Q10443 -  How can the DK handle the event of the crossing to two roads at a bridge or tunnel, in which there is no physical way to turn left or right at the apparent intersection? This situation can be handled by simply editing the vector file to remove the intersection node at a such crossing. Then the bridg ... (Modified: 2003-11-21)

Q10442 -  Does the DK support turn restrictions? Can costs be associated with turning, so that, for example, a left turn costs more than a right turn? The DK supports the blocking of specific turns in situations in which one-way or traffic forbidden streets are involved. So a left or right turn into the wrong ... (Modified: 2003-11-21)

Q10444 -  Does the DK routing functionality support one-way street situations? Yes. The cost of each vector representing a street/road segment between intersection nodes can be coded dependent on the order in which the nodes are traversed. Take, for instance, a link defined by nodes 99 and 100 at each end of ... (Modified: 2003-11-21)

Q10445 -  When using the OnLinkCost event to assign cost values (can also be referred to as weighting, preference, etc. values to vector links between nodes in a network, do the costs values only modify the lengths of the links, or can link values be set that are completely independent of the lengths? For exa ... (Modified: 2003-11-21)