Abstract: A method is disclosed for generating routes in an area covered by an electronic map. The map comprises a plurality of segments representing navigable segments of a navigable network in the area covered by the electronic map. A first route is generated between a first location and a second location in the area. A central portion of the first route is defined, wherein the central portion has an extent along the first route that is determined based on a distance between the first and second locations. The relative extent of the central portion along the first route is inversely related to the distance between the first and second locations. One or more navigable segments forming the defined central portion along the first route are identified, and a cost penalty applied to the identified navigable segment(s) so as to make the segment(s) less favourable when a route is generated through the navigable network. An alternative route is then generated between the first location and second location.

Abstract: A method and system for generating a route through a navigable network in a geographic area is disclosed, the navigable network being represented by an electronic map comprising a plurality of segments each having a traversal direction associated therewith. An area is defined around a location represented by the electronic map, and at least some of the outgoing segments from the area are determined. A first optimum cost route from an origin is determined to each of the determined outgoing segments, and these routes are ranked according to their cost. At least one of the first optimum cost routes is selected based on the ranking, and a second optimum cost route is determined from the outgoing segment from the area of the selected route to a destination. The generated route from the origin to the destination comprises the selected first optimum cost route and the second optimum cost route.

Abstract: Embodiments of the present invention provide a computer implemented method of route comparison, comprising receiving data indicative of first and second routes between a start location and a destination location wherein the first and second routes are generated using digital map data, determining nodes of the first and second routes having a minimum coupling distance, wherein the minimum coupling distance is determined based upon nodes of the first and second routes constrained to within a predetermined distance of a current node of each route, and determining a similarity index for the first and second routes based upon the minimum coupling distance and a threshold data coupling distance.

Abstract: A method and system for generating a route through a navigable network in a geographic area is disclosed, the navigable network being represented by an electronic map comprising a plurality of segments each having a traversal direction associated therewith. An area is defined around a location represented by the electronic map, and at least some of the outgoing segments from the area are determined. A first optimum cost route from an origin is determined to each of the determined outgoing segments, and these routes are ranked according to their cost. At least one of the first optimum cost routes is selected based on the ranking, and a second optimum cost route is determined from the outgoing segment from the area of the selected route to a destination. The generated route from the origin to the destination comprises the selected first optimum cost route and the second optimum cost route.

Abstract: A method is disclosed for generating routes in an area covered by an electronic map. The map comprises a plurality of segments representing navigable segments of a navigable network in the area covered by the electronic map. A first route is generated between a first location and a second location in the area. A central portion of the first route is defined, wherein the central portion has an extent along the first route that is determined based on a distance between the first and second locations. The relative extent of the central portion along the first route is inversely related to the distance between the first and second locations. One or more navigable segments forming the defined central portion along the first route are identified, and a cost penalty applied to the identified navigable segment(s) so as to make the segment(s) less favourable when a route is generated through the navigable network. An alternative route is then generated between the first location and second location.

Abstract: A route planning system comprising a routing engine is described in which data access to map data for selecting from a plurality of routes comprises means for receiving traffic data for a plurality of routes between two nodes and using the traffic data with map data to select an initial best route between the two nodes.

Abstract: Embodiments of the present invention provide a computer implemented method of route comparison, comprising receiving data indicative of first and second routes between a start location and a destination location wherein the first and second routes are generated using digital map data, determining nodes of the first and second routes having a minimum coupling distance, wherein the minimum coupling distance is determined based upon nodes of the first and second routes constrained to within a predetermined distance of a current node of each route, and determining a similarity index for the first and second routes based upon the minimum coupling distance and a threshold data coupling distance.