Generation of location area boundaries

1. A method of generating location area boundaries to optimize the identification of routes, the method comprising:

utilizing at least one processor to execute computer code that performs the steps of:

receiving at least one location map comprising a plurality of possible routes;

identifying at least one location area configuration, wherein the location area configuration comprises a set of segments, relative to the at least one location map, of at least one location area boundary segment and wherein a location area boundary segment comprises a virtual boundary line between cellular network base station associations;

computing a utility of the at least one location area configuration, wherein the utility comprises an identification of a number of routes that can be identified using the location area configuration, wherein a route comprises at least one identified traversable sub-route and wherein the at least one traversable sub-route is identified using the at least one location area boundary segment;

identifying at least one prominent location area boundary segment, wherein a prominent location area boundary segment comprises a location area boundary segment having a computed utility exceeding a predetermined threshold; and

generating a location area map comprising a plurality of identified prominent location area boundary segments, wherein the location area map defines boundary segments of a location area and wherein the location area map provides identification of a plurality of sub-routes that have been identified as having a utility exceeding a predetermined threshold.

2. The method of claim 1 , wherein the computing a utility comprises computing a utility of one of the location area boundary segments contained within the location area configuration.

3. The method of claim 1 , wherein the computing a utility comprises identifying a unique route and sub-routes that can be identified using the at least one location area boundary.

4. The method of claim 1 , wherein the computing a utility comprises calculating entropy related to the at least one location area configuration, wherein the entropy relates to an uncertainty of route assignment.

5. The method of claim 1 , further comprising receiving at least one point having an identified coverage area.

6. The method of claim 5 , wherein the at least one sub-route is identified using the at least one location area boundary segment and the at least one point having an identified coverage area.

7. The method of claim 1 , further comprising receiving at least one starting point and one ending point of at least one traversed route within the plurality of possible routes.

8. The method of claim 7 , wherein the computing a utility comprises identifying a number of sub-routes of the traversed route that can be identified using the at least one location area boundary segment.

9. The method of claim 8 , wherein the identifying at least one prominent location area boundary segment comprises identifying a location area boundary segment in which the number of sub-routes of the traversed route that can be identified exceeds a predetermined threshold.

10. The method of claim 7 , wherein the identifying at least one prominent location area boundary segment comprises weighting sub-routes based upon an amount of traversal and identifying a sub-route that has an amount of traversal exceeding a predetermined threshold.

11. The method of claim 1 , wherein the generating a location area map comprises connecting the identified prominent location area boundary segments to define the boundaries of the location area.

12. The method of claim 1 , wherein the generating a location area map comprises using a coloring problem and assigning the same color to neighboring grids not separated by a prominent location area boundary segment.

13. An apparatus for generating location area boundaries to optimize the identification of routes, the apparatus comprising:

at least one processor; and

a non-transitory computer readable storage medium having computer readable program code embodied therewith and executable by the at least one processor, the computer readable program code comprising:

computer readable program code that receives at least one location map comprising a plurality of possible routes;

computer readable program code that identifies at least one location area configuration, wherein the location area configuration comprises a, relative to the at least one location map, of at least one location area boundary segment and wherein a location area boundary segment comprises a virtual boundary line between cellular network base station associations;

computer readable program code that computes a utility of the at least one location area configuration, wherein the utility comprises an identification of a number of routes that can be identified using the location area configuration, wherein a route comprises at least one identified traversable sub-route and wherein the at least one traversable sub-route is identified using the at least one location area boundary segment;

computer readable program code that identifies at least one prominent location area boundary segment, wherein a prominent location area boundary segment comprises a location area boundary segment having a computed utility exceeding a predetermined threshold; and

computer readable program code that generates a location area map comprising a plurality of identified prominent location area boundary segments, wherein the location area map defines boundary segments of a location area and wherein the location area map provides identification of a plurality of sub-routes that have been identified as having a utility exceeding a predetermined threshold.

14. A computer program product for generating location area boundaries to optimize the identification of routes, the computer program product comprising:

a non-transitory computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising:

computer readable program code that receives at least one location map comprising a plurality of possible routes;

computer readable program code that identifies at least one location area configuration, wherein the location area configuration comprises a, relative to the at least one location map, of at least one location area boundary segment and wherein a location area boundary segment comprises a virtual boundary line between cellular network base station associations;

computer readable program code that computes a utility of the at least one location area configuration, wherein the utility comprises an identification of a number of routes that can be identified using the location area configuration, wherein a route comprises at least one identified traversable sub-route and wherein the at least one traversable sub-route is identified using the at least one location area boundary segment;

computer readable program code that identifies at least one prominent location area boundary segment, wherein a prominent location area boundary segment comprises a location area boundary segment having a computed utility exceeding a predetermined threshold; and

computer readable program code that generates a location area map comprising a plurality of identified prominent location area boundary segments, wherein the location area map defines boundary segments of a location area and wherein the location area map provides identification of a plurality of sub-routes that have been identified as having a utility exceeding a predetermined threshold.

15. The computer program product of claim 14 , wherein the computer readable program code that computes a utility comprises identifying a unique route and sub-routes that can be identified using the at least one location area boundary.

16. The computer program product of claim 14 , further comprising computer readable program code that receives at least one point having an identified coverage area and wherein the at least one sub-route is identified using the at least one location area boundary segment and the at least one point having an identified coverage area.

17. The computer program product of claim 14 , further comprising computer readable program code that receives at least one starting point and one ending point of at least one traversed route within the plurality of possible routes and wherein the computing a utility comprises identifying a number of sub-routes of the traversed route that can be identified using the at least one location area boundary segment.

18. The computer program product of claim 17 , wherein the computer readable program code that identifies at least one prominent location area boundary segment comprises identifying a location area boundary segment in which the number of sub-routes of the traversed route that can be identified exceeds a predetermined threshold.

19. The computer program product of claim 14 , wherein the computer readable program code that generates a location area map comprises connecting the identified prominent location area boundary segments to define the boundaries of the location area.

20. A method of generating location area boundaries to optimize the identification of routes, the method comprising:

utilizing at least one processor to execute computer code that performs the steps of:

receiving at least one location map comprising a plurality of possible routes;

receiving at least one cellular base station having an identified coverage area associated with the at least one location map;

receiving at least one mobility record, wherein the at least one mobility record identifies at least one common route through the at least one location map, wherein the at least one common route comprises more than one possible sub-route;

identifying at least one location area configuration, wherein the location area configuration comprises a set of segments, relative to the at least one location map, of at least one location area boundary segment and wherein a location area boundary segment comprises a virtual boundary line between cellular network base station associations;

computing a utility of the at least one location area configuration, wherein the utility comprises an identification of a number of routes that can be identified using the location area configuration, wherein a route comprises at least one identified traversable sub-route and wherein the at least one traversable sub-route is identified using the at least one location area boundary segment and the at least one cellular base station;

the computing a utility comprising identifying a number of sub-routes of the common route that can be identified using the at least one location area boundary segment;

identifying at least one prominent location area boundary segment, wherein a prominent location area boundary segment comprises a location area boundary segment in which the number of sub-routes of the at least one common route that can be identified exceeds a predetermined threshold; and

generating a location area map comprising a plurality of identified prominent location area boundary segments, wherein the generating comprises connecting the identified prominent location area boundary segments to define the boundaries of a location area and wherein the location area map provides identification of a plurality of sub-routes that have been identified as having a utility exceeding a predetermined threshold.