Geometric determination of shared travel routes

Abstract

A method, computer program product, and computer system are provided for determining a convenient route. The method includes, for instance: obtaining, by a processor, a route that includes a starting point and an ending point; analyzing the route to determine whether at least one stored route is within a pre-defined acceptance zone of the route; and responsive to determining that at least one stored route is within a pre-defined acceptance zone, assigning a convenience factor of the at least one stored route relative to the route.

What is claimed is: 
     
         1 . A computer program product for determining a convenient route, the computer program product comprising:
 a storage medium readable by a processor and storing instructions for execution by the processor to perform a method comprising:
 obtaining a route wherein said route comprises a starting point and an ending point; 
 analyzing the route to determine whether at least one stored route is within a pre-defined acceptance zone of the route; and 
 responsive to determining that at least one stored route is within a pre-defined acceptance zone, assigning a convenience factor of the at least one stored route relative to the route. 
   
     
     
         2 . The computer program product of  claim 1 , wherein the assigning comprises obtaining a first distance between a first point in the route and a first point in the at least one stored route and a second distance between a second point in the route and a second point in the at least one stored route and comparing the first distance and the second distance with a third distance. 
     
     
         3 . The computer program product of  claim 2 , wherein the third distance comprises a distance between the starting point of the route and the ending point of the route. 
     
     
         4 . The computer program of  claim 1 , wherein the acceptance zone comprises a geographic area. 
     
     
         5 . The computer program product of  claim 4 , wherein the geographic zone is dynamic based upon a location of the obtained route. 
     
     
         6 . The computer program product of  claim 1 , further comprising:
 evaluating the convenience factor to determine whether the at least one route is a recommended route; and   responsive to determining that the at least one route is a recommended route, communicating the at least one route to a user.   
     
     
         7 . A computer system for determining a convenient route, the computer system comprising:
 a memory; and   a processor, in communications with the memory, wherein the computer system is configured to perform a method comprising:
 obtaining a route wherein said route comprises a starting point and an ending point; 
 analyzing the route to determine whether at least one stored route is within a pre-defined acceptance zone of the route; and 
 responsive to determining that at least one stored route is within a pre-defined acceptance zone, assigning a convenience factor of the at least one stored route relative to the route. 
   
     
     
         8 . The computer system of  claim 7 , wherein the assigning comprises obtaining a first distance between a first point in the route and a first point in the at least one stored route and a second distance between a second point in the route and a second point in the at least one stored route and comparing the first distance and the second distance with a third distance. 
     
     
         9 . The computer system of  claim 8 , wherein the third distance comprises a distance between the starting point of the route and the ending point of the route. 
     
     
         10 . The computer system of  claim 7 , wherein the acceptance zone comprises a geographic area. 
     
     
         11 . The computer system of  claim 10 , wherein the geographic zone is dynamic based upon a location of the obtained route. 
     
     
         12 . The computer system of  claim 7 , further comprising:
 evaluating the convenience factor to determine whether the at least one route is a recommended route; and   responsive to determining that the at least one route is a recommended route, communicating the at least one route to a user.   
     
     
         13 . A method for determining a convenient route comprising:
 obtaining, by a processor, a route wherein said route comprises a starting point and an ending point;   analyzing, by the processor, the route to determine whether at least one stored route is within a pre-defined acceptance zone of the route; and   responsive to determining that at least one stored route is within a pre-defined acceptance zone, assigning a convenience factor of the at least one stored route relative to the route.   
     
     
         14 . The method of  claim 13 , wherein the assigning comprises obtaining a first distance between a first point in the route and a first point in the at least one stored route and a second distance between a second point in the route and a second point in the at least one stored route and comparing the first distance and the second distance with a third distance. 
     
     
         15 . The method of  claim 14 , wherein the third distance comprises a distance between the starting point of the route and the ending point of the route. 
     
     
         16 . The method of  claim 13 , wherein the acceptance zone comprises a geographic area. 
     
     
         17 . The method of  claim 16 , wherein the geographic zone is dynamic based upon a location of the obtained route. 
     
     
         18 . The method of  claim 13 , further comprising:
 evaluating, by the processor, the convenience factor to determine whether the at least one route is a recommended route; and   responsive to determining that the at least one route is a recommended route, communicating the at least one route to a user.