TRAVEL PLAN APPARATUS, METHOD AND STORAGE MEDIA

• US 20150149229A1
• Filed: 12/12/2013
• Published: 05/28/2015
• Est. Priority Date: 11/28/2013
• Status: Abandoned Application

• Current Assignee: Institute For Information Industry
• Original Assignee: Institute For Information Industry
• Inventors: CHIA, Meng-Hsuan, LIN, Wei-Syun, HUNG, I-Chou, YU, Chan-Chien
• Application Number:
  US14/103,858
• Publication Number:
  US 20150149229A1
• Time in Patent Office: Days
• US Class Current: 705/7.18
• CPC Class Codes: G06Q 10/1093 Calendar-based scheduling for persons or groups
• CPC Class Codes: G06Q 50/14 Travel agencies

Abstract

A travel plan apparatus, method, and a storage media are provided. The travel plan method includes: providing tourist attractions, travel days and travel configurations; determining at least one candidate hotel according to hotel configuration of the travel configurations; determining groups according to at least one candidate hotel and the travel days; distributing each one of the tourist attractions to a corresponsive group of the groups by using a relation-clustering method; when a quantity of first groups including at least one tourist attraction of the groups is larger than a quantity of the travel days, distributing tourist attractions of a second group including the tourist attractions with the shortest traveling time to other groups of the first groups by using the relation-clustering method.

Claims

1. A travel plan method, comprising:

providing a plurality of tourist attractions, a plurality of travel days, and a plurality of travel configurations;

determining at least one candidate hotel according to a plurality of hotel configurations of the travel configurations;

determining a plurality of groups according to the at least one candidate hotel and the travel days, wherein each of the at least one candidate hotel comprises the groups corresponding to the travel days;

distributing each of the tourist attractions to a corresponding one of the groups by using a relation-clustering method; and

when the quantity of a plurality of first groups of the groups comprising at least one of the tourist attractions is larger than the quantity of the travel days, distributing the tourist attractions of a second group of the first groups to other groups of the first groups, wherein the second group comprising the tourist attractions with the shortest travel time.

2. The travel plan method as claimed in claim 1, wherein distributing the tourist attractions of the second group of the first groups to the other groups of the first groups comprises:

when a candidate hotel corresponding to the second group further comprises at least one third group of the other groups, distributing each of the tourist attractions of the second group to one of the at least one third group by using the relation-clustering method.

3. The travel plan method as claimed in claim 2, wherein distributing the tourist attractions of the second group of the first groups to the other groups of the first groups comprises:

when the candidate hotel corresponding to the second group does not comprise each of the other groups, distributing all the tourist attractions of the second group to one of the other groups by using the relation-clustering method.

4. The travel plan method as claimed in claim 1, wherein distributing the each of the tourist attractions to the corresponding one of the groups by using the relation-clustering method further comprises:

distributing the tourist attractions into a plurality of levels according to a plurality of tourist attraction configurations of the travel configurations, wherein the levels are corresponding to different threshold values;

according to the order of the threshold values corresponding to the levels, determining a relation value of each of the groups corresponding to a first tourist attraction by using the relation-clustering method, wherein the first tourist attraction is among non-distributed tourist attractions in a first level of the levels;

distributing the first tourist attraction to the corresponding one of the groups;

when the tourist attractions in the first level are distributed, determining the relation value of each of the groups corresponding to a second tourist attraction by using the relation-clustering method, wherein the second tourist attraction is among non-distributed tourist attractions in a second level of the levels; and

distributing the second tourist attraction to the corresponding one of the groups;

wherein the threshold value corresponding to the first level is larger than the threshold value corresponding to the second level.

5. The travel plan method as claimed in claim 4, wherein according to the order of the threshold values corresponding to the levels, determining the to relation value of the each of the groups corresponding to the first tourist attraction by using the relation-clustering method further comprises:

when the relation values of all of the groups corresponding to the first tourist attraction are smaller than the threshold value corresponding to the first level, distributing the first tourist attraction to the second level.

6. The travel plan method as claimed in claim 1, wherein the relation-clustering method comprises:

determining a plurality of relation values of each of the groups corresponding to each of the tourist attractions, wherein the each of the tourist attractions comprises the relation values corresponding to the quantity of the groups; and

distributing the each of the tourist attractions to the corresponding one of the groups, wherein the corresponding one of the groups comprises the largest relation value among the relation values corresponding to the quantity of the groups.

7. The travel plan method as claimed in claim 1, wherein before distributing the each of the tourist attractions to the corresponding one of the groups by using the relation-clustering method further comprises:

configuring an original point, wherein the original point belongs to a fourth group of the groups;

configuring at least one transitional point, wherein each of the at least one transitional point belongs to at least one fifth group of the groups; and

configuring a destination point, wherein the destination point belongs to a sixth group of the groups;

wherein the candidate hotel corresponding to the at least one fifth group and the candidate hotel corresponding to the sixth group are different from the candidate hotel corresponding to the fourth group.

8. The travel plan method as claimed in claim 7, further comprising:

when the quantity of the first groups is equal to the quantity of the travel days, arranging the tourist attractions of the fourth group as a first day of a travel schedule, and arranging the tourist attractions of the sixth group as a last day of the travel schedule.

9. The travel plan method as claimed in claim 1, wherein determining the at least one candidate hotel according to the hotel configurations of the travel configurations comprises:

determining a plurality of hotels covered by a predetermined area for each of the tourist attractions;

determining a coverage area of each of the hotels according to the hotel configurations;

determining a coverage number of covered tourist attractions for the each of the hotels according to the coverage area of the each of the hotels; and

determining the at least one candidate hotel according to the coverage number of the each of the hotels, wherein the quantity of the at least one hotel is smaller than or equal to the quantity of the travel days minus one.

10. The travel plan method as claimed in claim 9, further comprising:

when the coverage number of a first hotel of the hotels is substantially equal to the coverage number of a second hotel of the hotels, providing the first hotel and the second hotel to an user for determining one of the first hotel and the second hotel as one of the at least one candidate hotels.

11. An travel plan apparatus, comprising:

an input interface, configured for receiving a plurality of tourist attractions, a plurality of travel days, and a plurality of travel configurations;

a database, configured for providing a plurality of data corresponding to the tourist attractions and a plurality of hotels;

a hotel-selection module, configured for analyzing the data corresponding to the tourist attractions and the hotels in the database according to a plurality of hotel configurations of the travel configurations to determine at least one candidate hotel;

a group-generation module, configured for determining a plurality of groups according to the at least one candidate hotel and the travel days, wherein each of the at least one candidate hotel comprises the groups corresponding to the travel days; and

a group-distribution module, configured for distributing each of the tourist attractions to a corresponding one of the groups by using a relation-clustering method, wherein when the quantity of a plurality of first groups of the groups comprising at least one of the tourist attractions is larger than the quantity of the travel days, the group-distribution module distributes the tourist attractions of a second group of the first groups to other groups of the first groups, wherein the second group comprising the tourist attractions with the shortest travel time.

12. The travel plan apparatus as claimed in claim 11, wherein when a candidate hotel corresponding to the second group further comprises at least one third group of the other groups, the group-distribution module distributes each of the tourist attractions of the second group to one of the at least one third group by using the relation-clustering method;

when the candidate hotel corresponding to the second group does not comprise each of the other groups, the group-distribution module distributes all the tourist attractions of the second group to one of the other groups by using the relation-clustering method.

13. The travel plan apparatus as claimed in claim 11, wherein the group-distribution module further comprises:

an attraction-distribution module, configured for distributing the tourist attractions into a plurality of levels according to a plurality of tourist attraction configurations of the travel configurations, wherein the levels are corresponding to different threshold values;

wherein according to the order of the threshold values corresponding to the levels, the group-distribution module determines a relation value of each of the groups corresponding to a first tourist attraction by using the relation-clustering method and distributes the first tourist attraction to the corresponding one of the groups, wherein the first tourist attraction is among non-distributed tourist attractions in a first level of the levels, when the tourist attractions in the first level are distributed, the group-distribution module determines the relation value of each of the groups corresponding to a second tourist attraction by using the relation-clustering method, wherein the second to tourist attraction is among non-distributed tourist attractions in a second level of the levels and distributes the second tourist attraction to the corresponding one of the groups, wherein the threshold value corresponding to the first level is larger than the threshold value corresponding to the second level.

14. The travel plan apparatus as claimed in claim 13, wherein when the relation values of all of the groups corresponding to the first tourist attraction are smaller than the threshold value corresponding to the first level, the group-distribution module distributes the first tourist attraction to the second level.

15. The travel plan apparatus as claimed in claim 11, wherein the relation-clustering method comprises:

determining a plurality of relation values of each of the groups corresponding to each of the tourist attractions, wherein the each of the tourist attractions comprises the relation values corresponding to the quantity of the groups; and

distributing the each of the tourist attractions to the corresponding one of the groups, wherein the corresponding one of the groups comprises the largest relation value among the relation values corresponding to the quantity of the groups.

16. A storage media for storing a travel plan program, wherein the travel plan program comprises a plurality of program codes to be loaded onto a computer system so that a travel plan method is executed by the computer system, and the travel plan method comprises:

providing a plurality of tourist attractions, a plurality of travel days, and a plurality of travel configurations;

determining at least one candidate hotel according to a plurality of hotel configurations of the travel configurations;

determining a plurality of groups according to the at least one candidate hotel and the travel days, wherein each of the at least one candidate hotel comprises the groups corresponding to the travel days;

distributing each of the tourist attractions to a corresponding one of the groups by using a relation-clustering method; and

when the quantity of a plurality of first groups of the groups comprising at least one of the tourist attractions is larger than the quantity of the travel days, distributing the tourist attractions of a second group of the first groups to other groups of the first groups, wherein the second group comprising the tourist attractions with the shortest travel time.

17. The storage media as claimed in claim 16, wherein the travel plan method comprises:

when a candidate hotel corresponding to the second group further comprises at least one third group of the other groups, distributing each of the tourist attractions of the second group to one of the at least one third group by using the relation-clustering method; and

when the candidate hotel corresponding to the second group does not comprise each of the other groups, distributing all the tourist attractions of the to second group to one of the other groups by using the relation-clustering method.

18. The storage media as claimed in claim 16, wherein the travel plan method further comprises:

distributing the tourist attractions into a plurality of levels according to a plurality of tourist attraction configurations of the travel configurations, wherein the levels are corresponding to different threshold values;

according to the order of the threshold values corresponding to the levels, determining a relation value of each of the groups corresponding to a first tourist attraction by using the relation-clustering method, wherein the first tourist attraction is among non-distributed tourist attractions in a first level of the levels;

distributing the first tourist attraction to the corresponding one of the groups;

when the tourist attractions in the first level are distributed, determining the relation value of each of the groups corresponding to a second tourist attraction by using the relation-clustering method, wherein the second tourist attraction is among non-distributed tourist attractions in a second level of the levels; and

distributing the second tourist attraction to the corresponding one of the groups;

wherein the threshold value corresponding to the first level is larger than the threshold value corresponding to the second level.

19. The storage media as claimed in claim 18, wherein the travel plan method further comprises:

when the relation values of all of the groups corresponding to the first tourist attraction are smaller than the threshold value corresponding to the first level, distributing the first tourist attraction to the second level.

20. The storage media as claimed in claim 18, wherein the relation-clustering method comprises:

determining a plurality of relation values of each of the groups corresponding to each of the tourist attractions, wherein the each of the tourist attractions comprises the relation values corresponding to the quantity of the groups; and

distributing the each of the tourist attractions to the corresponding one of the groups, wherein the corresponding one of the groups comprises the largest relation value among the relation values corresponding to the quantity of the groups.