| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To calculates the shortest route satisfying delay restriction value by route calculation where an inclusive route is specified. <P>SOLUTION: A route calculating device 1 divides the delay restriction value of a route from a start point node 2A, to a terminal point node 2D by a section (the section defined by relay nodes 2B and 2C), defined by inclusive route specification. For each section, a route (shortest route) which satisfies a divided delay restriction value and has the least link cost is searched for. For a section for which a route satisfying a divided delay restriction value is not found, however the delay restriction value is changed into a delay restriction value of a section which satisfies the delay restriction value. Then a route satisfying the changed delay restriction value is searched for again to find the route satisfying the delay restriction value. <P>COPYRIGHT: (C)2008,JPO&INPIT</p> |
