METHOD OF ROUTE SCHEDULING AND DEVICES THEREOF

• US 20150106006A1
• Filed: 10/14/2014
• Published: 04/16/2015
• Est. Priority Date: 10/11/2013
• Status: Abandoned Application

• Current Assignee: Kevin Najafi
• Original Assignee: Kevin Najafi
• Inventors: NAJAFI, Kevin
• Application Number:
  US14/513,470
• Publication Number:
  US 20150106006A1
• Time in Patent Office: Days
• US Class Current: 701/400
• CPC Class Codes: G01C 21/343 Calculating itineraries, i.e. routes leading from a starting point to a series of categorical destinations using a global route restraint, round trips, touristic trips travelling salesman problem G06Q10/04; optimisation of routes G06Q10/047
• CPC Class Codes: G01C 21/36 Input/output arrangements for on-board computers

Abstract

A method of planning a route for a plurality of destinations, including: a mobile device receiving information about a plurality of destinations for a day, the information including an address, a time and a duration; the mobile device calculating a start time and a stop time for each of the destinations based on the time received and the duration; the mobile device ordering the destinations in sequence based on the time associated with the destination and displaying a route to said destination in the order to the user; and the mobile device determining a time necessary to travel from each of the destinations to the following destination in the sequence, and if the start time for the following destination exceeds the travel time added to the departure time of the destination, then alerting the user.

Claims

1. A method of planning a route for a plurality of destinations comprising:

receiving, by a route management computing device, information about a plurality of destinations for a day, the information including an address, a time, and a duration for each destination;

calculating, by the route management computing device, an arrival time and a departure time for each of the destinations based on the time and the duration associated with each of the destinations;

ordering, by the route management computing device, the destinations in a sequence based on the time associated with the destinations;

displaying, by the route management computing device, a route to said destinations in the sequence to a user; and

determining, by the route management computing device, a time necessary to travel from each of the destinations to a following destination in the sequence, and when the arrival time for the following destination exceeds the travel time added to the departure time of the destination, then providing an alert to the user.

2. The method of claim 1, wherein the information about the plurality of destinations is selected from a database of historical routes.

3. The method of claim 2, wherein the historical route selected is amended.

4. The method of claim 1, wherein the duration for at least one of the plurality of destinations is predetermined prior to the mobile device receiving the information.

5. The method of claim 1, wherein the information about the plurality of destinations is received from a calendar program.

6. A route management computing device, comprising a processor and a memory coupled to the processor which is configured to be capable of executing programmed instructions comprising and stored in the memory to:

receive information about a plurality of destinations for a day, the information including an address, a time, and a duration for each destination;

calculate an arrival time and a departure time for each of the destinations based on the time and the duration associated with each of the destinations;

order the destinations in a sequence based on the time associated with the destinations;

display a route to said destinations in the sequence to a user; and

determine a time necessary to travel from each of the destinations to a following destination in the sequence, and when the arrival time for the following destination exceeds the travel time added to the departure time of the destination, then provide an alert to the user.

7. The device of claim 6, wherein the information about the plurality of destinations is selected from a database of historical routes.

8. The device of claim 7, wherein the historical route selected is amended.

9. The device of claim 6, wherein the duration for at least one of the plurality of destinations is predetermined prior to the mobile device receiving the information.

10. The device of claim 6, wherein the information about the plurality of destinations is received from a calendar program.

11. A non-transitory computer readable medium having stored thereon instructions for planning a route for a plurality of destinations comprising executable code which when executed by a processor, causes the processor to perform steps comprising:

receiving information about a plurality of destinations for a day, the information including an address, a time, and a duration for each destination;

calculating an arrival time and a departure time for each of the destinations based on the time and the duration associated with each of the destinations;

ordering the destinations in a sequence based on the time associated with the destinations;

displaying a route to said destinations in the sequence to a user; and

determining a time necessary to travel from each of the destinations to a following destination in the sequence, and if the arrival time for the following destination exceeds the travel time added to the departure time of the destination, then providing an alert to the user.

12. The medium of claim 11, wherein the information about the plurality of destinations is selected from a database of historical routes.

13. The medium of claim 12, wherein the historical route selected is amended.

14. The medium of claim 11, wherein the duration for at least one of the plurality of destinations is predetermined prior to the mobile device receiving the information.

15. The medium of claim 11, wherein the information about the plurality of destinations is received from a calendar program.

16. A method of planning a route for a plurality of destinations, comprising:

receiving, by a route management computing device, information about the plurality of destinations for a day, the information including a location for each destination and a time for at least one of the destinations, wherein at least another one of the destinations is not associated with an arrival time or a departure time;

calculating, by the route management computing device, an arrival time and a departure time for each of the destinations for which a time was received;

ordering, by the route management computing device, the destinations for which a time was received in a sequence based on the time associated with each of the destinations;

calculating, by the route management computing device, a spare time period between the departure time of the destinations in the sequence and the arrival time of a following destination, including a travel time associated with traveling from the destination to the following destination;

determining, by the route management computing device, if the destination not associated with a time fits within the spare period, including the travel time from the destination to the destination not associated with a time and the destination not associated with a time to the following destination; and

when the destination not associated with a time fits within the spare period;

adding, by the route management computing device, the destination to the sequence of destinations within the spare period;

generating, by the route management computing device, a route from each destination to the following destination; and

displaying, by the route management computing device, the route.