Travel route planner system and method

• US 6,622,084 B2
• Filed: 02/01/2002
• Issued: 09/16/2003
• Est. Priority Date: 06/02/2000
• Status: Active Grant

• Current Assignee: Sg Gaming, Inc. (Scientific Games Corporation)
• Original Assignee: Compudigm International Ltd.
• Inventors: Cardno, Andrew John, Mulgan, Nicholas John
• Primary Examiner(s): Beaulieu, Yonel
• Application Number:
  US10/061,762
• Publication Number:
  US 20020128767A1
• Time in Patent Office: 592 Days
• Field of Search: 701/200, 701/201, 701/202, 701/25, 701/26, 705/5, 705/6, 705/13
• US Class Current: 701/202
• CPC Class Codes: G06Q 10/02 Reservations, e.g. for tickets, services or events
• CPC Class Codes: G06Q 10/025 Coordination of plural reservations, e.g. plural trip segments, transportation combined with accommodation
• CPC Class Codes: G06Q 10/04 Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" market predictions or forecasting for commercial activities G06Q30/0202

Abstract

The present invention provides a method of planning a travel route including maintaining in a memory a reference database comprising one or more travel data sets, each travel data set representing a travel option from a travel origin to a travel destination and including an origin identifier and a destination identifier, obtaining one or more travel preferences for a travel route from a user, retrieving one or more travel data sets from the reference database to construct one or more candidate travel plans, calculating a plurality of penalty values based on the user travel preferences, each penalty value associated with a corresponding travel data set, and selecting one or more candidate travel plans so as to minimize the sum of penalty values associated with the travel data sets of a candidate travel plan. The present invention encompasses hardware, software and firmware suitable to accomplish the method.

Claims

1. A method of planning a travel route, comprising the steps of:

maintaining in computer memory a reference database comprising a plurality of travel data sets, at least one travel data set representing a travel option from a travel origin to a travel destination and comprising an origin identifier and a destination identifier;

obtaining one or more travel preferences for a travel route from a user, at least one travel preference including a user significance value;

retrieving one or more travel data sets from the reference database to construct one or more candidate travel plans substantially complying with the travel preference(s);

calculating penalty values based on the user travel preferences for respective travel data sets in the candidate travel plans;

ranking the candidate travel plans based on the sum of the penalty values associated with the travel data sets of respective candidate travel plans; and

displaying the ranked candidate travel plans to a user.

2. A method of planning a travel route as claimed in claim 1, wherein the step of calculating the penalty values further comprises the steps of calculating each penalty value as a function of the user significance value for each travel preference.

3. A method of planning a travel route as claimed in claim 1, further comprising the step of maintaining in computer memory a user preferences database comprising one or more user preference data sets representing one or more user preferences for a user travel route.

4. A method of planning a travel route as claimed in claim 3, further comprising the step of storing the travel preferences obtained from a user as one or more user preference data sets in the user preference database.

5. A method of planning a travel route as claimed in claim 1 wherein the travel preferences include an origin and a destination.

6. A method of planning a travel route as claimed in claim 1 wherein the travel preferences include a stopover site.

7. A method of planning a travel route as claimed in claim 1 wherein the travel preferences include a maximum stopover time.

8. A method of planning a travel route as claimed in claim 1 wherein the travel preferences include maximum number of stopovers.

9. A method of planning a travel route as claimed in claim 1 wherein the travel preferences include a time preference for one or more stopovers.

10. A method of planning a travel route as claimed in claim 1 wherein the travel preferences include a disability requirement.

11. A travel route planner, comprising:

a reference database maintained in computer memory, the reference database comprising a plurality of travel data sets, at least one travel data set representing a travel option from a travel origin to a travel destination and comprising an origin identifier and a destination identifier;

a data entry component configured to obtain one or more travel preferences for a travel route from a user, at least one travel preference including a user significance value;

a retrieval component configured to retrieve one or more travel data sets from the reference data base to construct one or more candidate travel plans substantially complying with the travel preference(s);

a penalty calculator configured to calculate a plurality of penalty values based on the user travel preferences for respective travel data sets in the candidate travel plans; and

a display configured to rank the candidate travel plans based on the sum of the penalty values associated with the travel data sets of respective candidate travel plans and to display the ranked candidate travel plans to a user.

12. A travel route planner as claimed in claim 11 wherein the penalty calculator is configured to calculate each penalty value as a function of the user significance value for each travel preference.

13. A travel route planner as claimed in claim 11 further comprising a user preferences database maintained in computer memory, the user preferences database comprising one or more user preference data sets representing one or more user preferences for a user travel route.

14. A travel route planner as claimed in claim 13 wherein the data entry component is configured to store the travel preferences obtained from a user as one or more user preference data sets in the user preference database.

15. A travel route planner as claimed in claim 11 wherein the travel preferences include an origin and a destination.

16. A travel route planner as claimed in claim 11 wherein the travel preferences include a stopover site.

17. A travel route planner as claimed in claim 11 wherein the travel preferences include a maximum stopover time.

18. A travel route planner as claimed in claim 11 wherein the travel preferences include maximum number of stopovers.

19. A travel route planner as claimed in claim 11 wherein the travel preferences include time preference for one or more stopovers.

20. A travel route planner as claimed in claim 11 wherein the travel preferences include a disability requirement.

21. A travel route planner computer program, comprising:

a reference database maintained in computer memory, the reference database comprising a plurality of travel data sets, at least one travel data set representing a travel option from a travel origin to a travel destination and comprising an origin identifier and a destination identifier;

a data entry form programmed to obtain one or more travel preferences for a travel route from a user, at least one travel preference including a user significance value;

a retrieval query programmed to retrieve one or more travel data sets from the reference database to construct one or more candidate travel plans substantially complying with a travel preference(s);

a penalty calculation function programmed to calculate a plurality of penalty values based on the user travel preferences for respective travel data sets in the candidate travel plans; and

a display programmed to rank the candidate travel plans based on the sum of the penalty values associated with the travel data sets of respective candidate travel plans and to display the ranked candidate travel plans to a user.

22. A travel route planner computer program as claimed in claim 21 wherein the penalty calculation function is programmed to calculate each penalty value as a function of the user significance value for each travel preference.

23. A travel route planner computer program as claimed in claim 21 further comprising a user preferences database maintained in computer memory, the user preferences database comprising one or more user preference data sets representing one or more user preferences for a user travel route.

24. A travel route planner computer program as claimed in claim 23 wherein the data entry form is programmed to store the travel preferences obtained from a user as one or more user preference data sets in the user preference database.

25. A travel route planner computer program as claimed in claim 21 wherein the travel preferences include an origin and a destination.

26. A travel route planner computer program as claimed in claim 21 wherein the travel preferences include a stopover site.

27. A travel route planner computer program as claimed in claim 21 wherein the travel preferences include a maximum stopover time.

28. A travel route planner computer program as claimed in claim 21 wherein the travel preferences include maximum number of stopovers.

29. A travel route planner computer program as claimed in claim 21 wherein the travel preferences include a time preference for one or more stopovers.

30. A travel route planner computer program as claimed in claim 21 wherein the travel preferences include a disability requirement.

31. A travel route planner computer program as claimed in claim 21, embodied on a computer readable medium.