JP5527111B2 - Drive trip planning system - Google Patents

Description

  The present invention relates to a drive trip plan creation system for creating a drive trip plan based on information input by a user on a Web site.

  As a conventional device similar to the present invention, there is a travel planning assistance device described in Patent Document 1, for example. This travel planning assistance device includes a terminal device and a providing device that can exchange information with each other. The providing device has a database unit, and the database unit stores the number of hired cases classified by past classification age and classification time zone in association with the travel information including the destination. The larger the number of cases adopted, the higher the popularity of the destination indicated by the travel information in the classification age and the classification time zone.

  The user inputs from the terminal device a designated period that is one of the region to travel and the classification age and time zone desired by the user. Then, the providing device 4 selects at least one piece of travel information from the travel information including the destination in the area where the user intends to travel using the number of cases corresponding to the specified period, and displays the terminal device. Display on the device.

  In this way, even if the regions to be traveled are the same, the travel information to be output is changed only by changing the classification period.

JP2000-20598

  Here, when a user makes a travel plan for visiting a certain tourist spot, the degree of congestion of the tourist spot is important information. There are not a few users trying to avoid crowded tourist spots, and if you know in advance that the desired tourist spots are likely to be crowded, change your travel plan to visit tourist spots that are less crowded This is because the schedule can be changed.

  However, the apparatus of Patent Document 1 described above does not consider anything about the degree of congestion of such tourist spots, and simply classifies and saves past employment records of travel information according to age and time zone, It simply selects travel information recommended for users based on the classified and stored results.

  The present invention has been made in view of the above points, and when a user makes a travel plan, it is possible to provide information indicating the expected degree of congestion of each tourist spot to the user. An object is to provide a simple drive trip planning device.

In order to achieve the above object, a drive trip plan creation system according to claim 1 creates a drive trip plan based on information input by a user on a website,
A spot information provider that provides information on tourist spots,
A travel plan creation unit that creates a drive travel plan including a sightseeing spot selected by the user and presents it to the user;
The drive trip plan includes information on the planned date, and for each planned date of the drive trip plan and for each tourist spot, there is a built-in counting means for counting the number of times each tourist spot is incorporated in the drive travel plan. ,
Congestion prediction means for predicting the degree of congestion of tourist spots based on the number of times of incorporation counted by the number of times of incorporation for each planning day and each sightseeing spot of the drive travel plan,
The spot information providing unit provides detailed information of each tourist spot by the user's operation, and includes a browsing number counter that counts the number of times detailed information is browsed by the user for each tourist spot,
The congestion prediction means predicts the congestion degree of a tourist spot in consideration of the number of times counted by the browsing number counter .

  As described above, the number of times of incorporation counts the number of times that each tourist spot is incorporated into the drive travel plan for each planned day of the drive trip plan and for each tourist spot. Therefore, as the number of users of the drive travel plan creation device increases, the number of times of incorporation counted by the number of times of incorporation count becomes statistically correlated with the degree of congestion of each tourist spot on each planned date. For this reason, the congestion prediction means can predict the degree of congestion of each tourist spot in the future based on the number of times of incorporation counted by the number of times of incorporation count means. Since the predicted congestion degree of the tourist spot is presented to the user, the user can change the drive travel plan or change the schedule so as to visit a tourist spot with a low congestion degree. .

Further, the spot information providing unit provides detailed information of each tourist spot by the user's operation, and includes a browsing number counter that counts the number of times detailed information is browsed by the user for each tourist spot, The congestion prediction means predicts the congestion degree of the tourist spot in consideration of the number of times counted by the browsing number counter. When the user browses the detailed information of the tourist spot, it is considered that the user is interested in the tourist spot that browsed the detailed information. As described above, the number of times the detailed information of each tourist spot is viewed can be an index for evaluating the attention degree of each tourist spot. Since a tourist spot with a higher degree of attention is often crowded, it is possible to improve the accuracy of predicting the degree of congestion of each tourist spot by considering the number of times of browsing detailed information.

The drive trip plan creation system according to claim 2 creates a drive trip plan based on information input by a user on a website,
A spot information provider that provides information on tourist spots,
A travel plan creation unit that creates a drive travel plan including a sightseeing spot selected by the user and presents it to the user;
The drive trip plan includes information on the planned date, and for each planned date of the drive trip plan and for each tourist spot, there is a built-in counting means for counting the number of times each tourist spot is incorporated in the drive travel plan. ,
Congestion prediction means for predicting the degree of congestion of tourist spots based on the number of times of incorporation counted by the number of times of incorporation for each planning day and each sightseeing spot of the drive travel plan,
When a keyword search is performed by the user, the spot information providing unit extracts a tourist spot corresponding to the keyword and presents it to the user, and counts the number of times extracted by the keyword search for each tourist spot. A search frequency counter is provided, and the congestion prediction means predicts the congestion degree of a tourist spot in consideration of the number of times counted by the search frequency counter .
The tourist spots extracted by the keyword search by the user may be presented to the user as a search result, thereby arousing the user's interest. In addition, when the keyword is a seasonal or local event, the keyword itself is attracting attention, and the number of tourists who visit tourist spots related to the keyword may increase. Therefore, when a tourist spot is extracted by keyword search, the prediction accuracy of the degree of congestion can be further improved by considering the number of searches for each tourist spot.

As described in claim 3 , the drive travel plan includes time information for visiting a tourist spot, and the built-in count means divides a day into a plurality of time zones, and sets each time zone. When the tourist spot is incorporated in the drive travel plan, the number of times of incorporation may be counted as the number of incorporation corresponding to the time zone to which the time information for visiting the tourist spot belongs. Depending on the tourist spot, the average stay time of a traveler may be several hours. In such a case, even if the tourist spot is crowded, it is not crowded throughout the day, but only a certain time zone is particularly crowded, and other time zones may be relatively free. If the number of times of incorporation is counted for each time zone based on the time information for visiting a sightseeing spot included in the drive travel plan, the degree of congestion for each time zone can be predicted.

As described in claim 4, when the drive travel plan created by the travel plan creation unit includes a tourist spot whose congestion degree predicted by the congestion prediction means is higher than a predetermined threshold, for the user Further, a change recommendation means for presenting a comment recommending a change of the drive travel plan may be provided. Accordingly, it is possible to prompt the user to make a plan that avoids crowded tourist spots at the stage of creating the drive trip plan.

As described in claim 5 , the change recommendation means may include an alternative spot recommendation means for recommending an alternative tourist spot instead of a tourist spot where congestion is predicted. As a result, as an alternative sightseeing spot, the user has the same genre as the sightseeing spot around the driving route of the planned driving trip plan or the sightseeing spot where congestion is predicted, but the sightseeing spot that is relatively free It becomes possible to obtain the information.

As described in claim 6 , comprising a map information database storing map information, the travel plan creation unit displays the drive route and the location of the tourist spot on the map drawn based on the map information, A travel plan is presented to the user, and the travel plan creation unit preferably searches for a drive route while searching for a drive route so as to avoid roads around tourist spots where congestion is expected. . This is because when tourist spots are congested, it is generally expected that roads around the tourist spots will also be congested.

As described in claim 7 , the congestion predicting means also predicts the degree of congestion of the access road to the tourist spot, and the drive travel plan created by the travel plan creating unit is predicted by the congestion predicting means. Presenting means for presenting an alternative drive travel plan in which at least one of a planned date or a planned time zone, an access road, and a tourist spot is different to a user when an access road whose congestion degree is higher than a predetermined threshold is included May be provided. Accordingly, the user can select a drive plan that avoids congestion by referring to the alternative drive travel plan .

It is a block diagram which shows the whole structure of the drive trip plan creation system by embodiment. It is a figure which shows the information preserve | saved in the spot information database 70 in order to calculate the congestion degree of each tourist spot on the planned travel date. It is a flowchart which shows the main routine of a drive plan creation process. It is a flowchart which shows a custom plan creation process routine. It is a flowchart which shows a congestion degree calculation process routine. It is a flowchart which shows a recommendation process routine. It is a flowchart which shows the detailed display process routine of the whole process of a travel plan. It is a flowchart which shows the drive trip plan creation process routine using a recommendation plan. It is explanatory drawing explaining an example which displays the congestion degree of the searched tourist spot on a map. It is explanatory drawing which shows an example which displayed concretely the congestion level of each tourist spot by the numerical value etc., displaying the list about each searched tourist spot as a list. It is explanatory drawing for demonstrating recommendation processing. In recommendation processing, it is a figure which shows the example estimated that the congestion degree calculated regarding spot B is high and the congestion degree of the access road to the spot B is high. It is a figure which shows an example of the path | route set so that the access road which is crowded may be avoided. It is the figure which showed the example of a display of the detailed information of the whole process of a travel plan.

  Hereinafter, a drive trip planning system according to an embodiment of the present invention will be described with reference to the drawings.

  FIG. 1 is a configuration diagram showing the overall configuration of the drive trip plan creation system according to the present embodiment. As shown in FIG. 1, the drive trip plan creation system includes a drive trip plan creation server 10 and a terminal device as a client. The terminal device includes, for example, a personal computer (PC) 130, a mobile phone 140, a navigation device 150, or an Internet connection terminal 160. The terminal device and the drive travel plan creation server 10 are connected to each other so as to be able to communicate with each other via a communication network 120 such as the Internet. That is, the drive trip plan creation server 10 creates a drive trip plan based on user input information input via a terminal device in a so-called Web site.

  The terminal device transmits / receives various data to / from the drive travel plan creation server 10. For example, the terminal device includes a display device, and based on the display data received from the drive travel plan creation server 10, in addition to an information input screen such as a menu screen or an input reception screen for keywords, etc. A map screen showing the travel route is displayed. In the terminal device, on the displayed information input screen, the travel date and time of the drive trip, departure place, destination, stopover, etc. are input, or the travel plan is displayed on the screen where the information on the created drive travel plan is displayed. Can be instructed to save and bookmarks.

  Next, a detailed configuration of the drive travel plan creation server 10 will be described. FIG. 1 is a block diagram showing functions of the drive travel plan creation server 10.

  As shown in FIG. 1, the drive travel plan creation server 10 has a travel plan creation unit 20. The travel plan creation unit 20 is selected based on information input by the user, an information input screen that allows the user to input information necessary to create a travel plan, based on information from each processing unit and database to be described later. The list information and detailed information about the tourist spots, the detailed information of the entire travel plan, and the like are displayed on the terminal device used by the user. The travel plan creation unit 20 stores a large number of recommended drive trip plans including at least one tourist spot. When the user requests display of the recommended drive trip plan, the travel plan creation unit 20 stores the recommended drive trip plan on the user terminal device. , Display a list of recommended driving trip plans and detailed information of individual driving trip plans.

  The road map database 25 stores data for displaying road maps throughout the country. The travel plan creation unit 20 displays the road map on the terminal device used by the user using the road map display data stored in the road map database 25. The user can display tourist spots on the road map and select a tourist spot to be incorporated into the travel plan from the displayed tourist spots. The display range of the road map displayed on the terminal device can be changed by a user operation.

  In response to an instruction from the travel plan creation unit 20, the spot information processing unit 30 searches the spot information database 70 for a tourist spot corresponding to the user's request, and outputs the search result to the travel plan creation unit 20. In order to narrow down a desired information spot, the user can input a keyword or specify a genre or area to which the sightseeing spot belongs on the information input screen displayed on the terminal device.

  When the spot information processing unit 30 searches for a plurality of sightseeing spots, the travel plan creation unit 20 displays a list of the plurality of sightseeing spots on the terminal device. At this time, the travel plan creation unit 20 also displays the predicted congestion level of each tourist spot on the travel plan date using information from the congestion spot prediction processing unit 80 and the congestion display processing unit 90 described later.

  When a list of sightseeing spots is displayed on the terminal device, if the user gives an instruction to display detailed information about a specific sightseeing spot, the spot information processing unit 30 reads the details of the corresponding sightseeing spot from the spot information database. Information is extracted and provided to the terminal device via the travel plan creation unit 20.

  Here, the spot information database 70 will be described with reference to FIG. As described above, the spot information database 70 stores information related to tourist spots throughout the country. Stored information includes detailed information about each tourist attraction, such as address, telephone number, facility introduction comment, business hours, and fees, as well as information for calculating the degree of congestion of each tourist at the planned travel date. Is also included. FIG. 2 shows information stored in the spot information database 70 in order to calculate the degree of congestion of each tourist spot on the planned travel date.

  As shown in FIG. 2, each tourist spot is given a serial ID number. Based on the name for list display, the counter value of the incorporation counter W, the counter value of the browsing counter X, the counter value of the search counter Y, the counter value of the evaluation counter Z, and the counter value of each counter The predicted congestion level calculated in this way is stored. Note that the storage of the predicted congestion level is arbitrary.

  The built-in number counter W is counted up by the built-in number count processing unit 40 when the relevant sightseeing spot is incorporated in the drive travel plan. The browsing count counter X is counted up by the browsing count processing unit 50 when the detailed information of the tourist spot is browsed. The search frequency counter Y is counted up by the search frequency count processing unit 60 for tourist spots extracted by searching for tourist spots by keyword. Further, in the drive travel plan creation server 10, for each tourist spot, a page where a user who actually visited the tourist spot can write an evaluation is prepared. The evaluation counter counts the number of high evaluations when the user gives high evaluations.

  Each piece of information for calculating the degree of congestion shown in FIG. 2 is stored in the spot information database 70 for each travel plan date. In other words, when a keyword search, detailed information browsing, and incorporation into a travel plan are performed using a travel plan date input by the user, it is counted as a counter value of each counter of the corresponding travel plan date. . However, for the evaluation counter Z, a count value common to each travel plan date is stored based on the written evaluation result. Then, the congestion level is calculated by the congestion spot prediction processing unit 80 by multiplying the count value of each counter by a predetermined coefficient and adding it. In this way, the predicted congestion level of each tourist spot for each travel plan day can be calculated.

  Here, the number-of-incorporation counter W counts the number of times each tourist spot is incorporated into the drive travel plan for each planned date and for each tourist spot. Therefore, as the number of users who use the drive travel plan creation server 10 increases, the count value of the built-in number counter statistically correlates with the degree of congestion of each tourist spot on each planned date. For this reason, it is possible to accurately predict the degree of congestion indicating the degree of congestion of each future sightseeing spot based on the count value of the incorporation number counter.

  In addition, the browsing number counter X counts the number of times that detailed information on the sightseeing spot is browsed by the user. When the user browses the detailed information of the tourist spot, it is considered that the user is interested in the tourist spot that browsed the detailed information. For this reason, the frequency | count of browsing the detailed information of each tourist spot can be one index for evaluating the degree of attention of each tourist spot. Since a tourist spot with a higher degree of attention is often crowded, it is possible to improve the accuracy of predicting the degree of congestion of each tourist spot by considering the number of times the detailed information is viewed.

  Furthermore, the search frequency counter Y counts the number of times each tourist spot is extracted by performing a keyword search by the user. The tourist spots extracted by the keyword search by the user may be presented to the user as a search result, thereby arousing the user's interest. In addition, when the keyword is a seasonal or local event, the keyword itself is attracting attention, and the number of tourists who visit tourist spots related to the keyword may increase. Therefore, the accuracy of congestion degree prediction can be further improved by considering the number of times tourist spots are extracted by keyword search.

  Moreover, the evaluation by the user who actually visited the tourist spot is information to be referred to when another user creates a travel plan. Therefore, by considering the number of times of high evaluation, the prediction accuracy of the degree of congestion of tourist spots can be further improved.

  In the above-described example, the example in which the congestion spot prediction processing unit 80 calculates the congestion degree based on the counter values of the four counters has been described. However, at least one counter (particularly, the number-of-incorporation counter W) is described. It is also possible to calculate the degree of congestion based on the count value. In addition, when the congestion spot prediction processing unit 80 calculates the degree of congestion, information other than the count values of the four counters described above (reservation status of neighboring accommodation facilities, reservation status of restaurants, event holding information, The presence / absence of introduction in a TV program and the period from the introduction may also be considered.

  In the above-described example, each piece of information for calculating the degree of congestion shown in FIG. 2 is stored in the spot information database 70 for each travel plan day, but only the count value of the built-in number counter W is traveled. The counter values may be stored separately for each planned date, and the count values of other counters may be stored independently of the travel planned date, and the counter value common to each travel planned date may be stored. This is because the browsing number counter X, the search number counter Y, and the evaluation counter Z indicate the level of interest of the user and are not closely related to specific travel planning dates.

  The congestion display processing unit 90 creates data for displaying information indicating the congestion level together when presenting a tourist spot to the user based on the congestion level calculated by the congestion spot prediction processing unit 80, The data is output to the travel plan creation unit 20. Further, the recommendation processing unit 100 displays a case where a tourist spot where congestion is predicted is incorporated in the travel plan based on the degree of congestion calculated by the congestion spot prediction processing unit 80, or the entire process of the travel plan is displayed. In some cases, the user is notified of the congestion again (for example, the spot A on the day of xx △△ month ○○ is expected to be crowded), or recommended to change the date and time (for example, xx year △△ month XX day spot A is expected to be very crowded. It is recommended to change the outing date.), recommend another nearby spot in the same genre (for example, xx year △ The spot A on the day of the month XX is expected to be heavily congested, so we recommend the spot B.) and then output it to the travel plan creation unit 20.

  When the travel plan creation unit 20 receives display data of information indicating the degree of congestion from the congestion display processing unit 90 or receives a comment from the recommendation processing unit 100, the travel plan creation unit 20 displays the data on a terminal device used by the user.

  The route search processing unit 110 calculates a route from the departure point to the destination via the waypoint according to the travel plan being created and created by the user. At that time, the route search processing unit 110 determines whether the calculated route includes an access road to a tourist spot that is not included in the travel plan and is predicted to be congested. If the calculated route includes such an access road, the route avoiding the access road is recalculated.

  Based on the degree of congestion calculated by the congestion spot prediction processing unit 80, there is a high possibility that the access road to the tourist spot will be congested with respect to the tourist spot where the congestion is expected. Therefore, by avoiding an access road to a tourist spot where congestion is expected, it is possible to guide the user on a route that is likely to be able to move smoothly.

  Various processes in the drive trip plan creation server 10 having the above configuration and examples of display screens displayed on the user terminal device by the processes will be described in detail with reference to FIGS.

  FIG. 3 is a flowchart showing a main routine of the drive plan creation process. When the user accesses the drive trip plan creation server 10 with the terminal device, first, the processing shown in the flowchart of FIG. 3 is executed.

  In step S100, when a drive trip plan is made, a menu screen is displayed for inquiring whether the user makes a custom plan for making a trip plan independently or uses a recommended plan prepared in advance. If it is determined in step S110 that a custom plan has been selected based on user input information, the process proceeds to a custom plan creation process in step S120. If it is determined that the use of the recommended plan is selected, the process proceeds to a drive plan creation process using the recommended plan in step S130.

  The flowchart of FIG. 4 shows a custom plan creation processing routine. In step S200, a screen for inputting the travel plan date and time is displayed. When the travel plan date and time is input, the process proceeds to step S210. In step S210, an input reception screen for keywords and the like is displayed so that the user can narrow down the desired sightseeing spots. At this time, the user can input a keyword or input a genre or area of a sightseeing spot using the terminal device. The travel plan date and time input screen and the keyword input screen may be separate screens or common screens.

  In step S220, it is determined whether or not information on at least one of a keyword, a genre, and an area is input by the user via the terminal device, and execution of search is instructed. If it is determined that the execution of the search is instructed, the process proceeds to step S230, and the spot information database 70 is searched for a sightseeing spot corresponding to the input keyword or the like.

  In step S240, it is determined whether or not at least one sightseeing spot has been extracted by the search processing in step S230. If it is determined that there is no extracted sightseeing spot, the processing from step S210 is repeated again. On the other hand, if it is determined that at least one sightseeing spot has been extracted, the process proceeds to step S250.

  In step S250, the extracted sightseeing spot is displayed. At this time, the congestion degree calculated by the congestion degree calculation processing routine shown in FIG. 5 is also displayed. In this display process, for example, as shown in FIG. 9, when a road map is displayed on the user's terminal device and the searched tourist spot is displayed on the map, The tourist spot having a degree of congestion of a predetermined value or more (sight spot B in the example of FIG. 9) is turned on or blinked. Alternatively, as shown in FIG. 10, the congestion level of each tourist spot may be specifically displayed by a numerical value or the like while displaying a list of each searched tourist spot. Further, the display of FIGS. 9 and 10 may be performed simultaneously.

  Here, the congestion degree calculation processing routine of FIG. 5 will be described. In step S400, a tourist spot for calculating the degree of congestion is specified. When a tourist spot is extracted by the search, the extracted tourist spot is a tourist spot for which the degree of congestion is to be calculated.

  In step S410, the count value of each counter corresponding to the planned travel date is read from the spot information database 70 for the identified tourist spot. In step S420, the degree of congestion is calculated by multiplying the read count value of each counter by a predetermined coefficient and adding the result.

  Returning to the flowchart of FIG. 4 again, the description will be continued. When the sightseeing spot extracted by the search is displayed in step S250, the count value of the search frequency counter Y on the planned date input in step S200 is counted up for the extracted sightseeing spot in the following step S260.

  Then, in step S270, it is determined whether or not the user has instructed to display detailed information about a specific tourist spot through the terminal device among the displayed tourist spots, and the detailed information has been browsed. When the detailed information is browsed, in step S280, the count value of the browsing count counter X on the planned date input in step S200 is counted up with respect to the tourist spot where the detailed information is browsed.

  In step S290, it is determined whether or not an operation for incorporating a specific tourist spot into the travel plan as a departure point, a destination, or a stop-off is performed among the displayed tourist spots. If it is determined that it is incorporated in the travel plan, in step S300, the count value of the incorporation number counter W on the planned date input in step S200 is counted up for the sightseeing spot incorporated in the travel plan.

  In step S310, a recommendation process is executed. The flowchart of FIG. 6 shows a recommendation processing routine.

  In step S500, it is determined whether or not the congestion level of the tourist spot incorporated in the travel plan is greater than or equal to a predetermined value. At this time, if it is determined that the degree of congestion is less than the predetermined value, the recommendation process is terminated, and the process proceeds to step S320 in the flowchart of FIG. On the other hand, if it is determined that the degree of congestion is greater than or equal to a predetermined value, the process proceeds to step S510. In step S510, a comment for notifying the crowd again, recommending a change in date and time, or recommending another tourist spot in the same or the same genre is created and displayed on the user terminal device. At this time, a search instruction switch for an alternative spot is also displayed on the user terminal device.

  In step S520, it is determined whether an alternative spot search instruction has been given by the user. When the alternative spot search instruction is not given (when an operation indicating that the incorporated tourist spot is maintained as it is is performed), the process proceeds to step S320 of the flowchart of FIG. On the other hand, if an alternative spot search instruction is given by the user, the process proceeds to step S530 to search for alternative spots. At this time, the user may be instructed to search for alternative spot search conditions (neighboring spots, spots of the same genre, etc.). In the subsequent step S540, the searched alternative spot is displayed. Thereafter, the process returns to step S270 in the flowchart of FIG.

  By the recommendation process described above, it is possible to prompt the user to make a plan that avoids crowded tourist spots at the stage of creating a drive trip plan. For example, as shown in FIG. 11, it is assumed that the user originally planned a drive trip around spot A → spot B → spot C → spot D. However, it is assumed that the degree of congestion at spot B is very high on the planned date when the trip is planned. In this case, the user is prompted to change the spot B by the recommendation process. Thereby, the user is provided with a motivation to change the travel plan so as not to stop at the spot B, for example, so that the travel plan can be easily changed.

  Note that the above-described recommendation process may be performed after the display process of the entire travel plan to be described later and before the travel plan is determined. Furthermore, when the detailed information of the tourist spot is displayed, the recommendation process may be performed.

  In step S320 of the flowchart of FIG. 4, a detailed display process for the entire travel plan is executed. The flowchart of FIG. 7 shows a detailed display processing routine of the entire travel plan.

  In step S600, an area of the map that includes all the departure point, waypoints, and destination in the travel plan is determined. In the subsequent step S610, the degree of congestion on the travel planning date of all sightseeing spots included in the map area is calculated.

  In step S620, the degree of congestion on the access road to each tourist spot is predicted from the degree of congestion of each tourist spot. In this case, the congestion degree (congestion state) of each access road is predicted on the assumption that the congestion degree (congestion degree) of the access road increases as the congestion degree of the tourist spot increases. As for access roads to each tourist spot, a road that is often used when a tourist visits a tourist spot is usually determined in advance as an access road for each tourist spot and stored in the road map database 25. Has been.

  In step S630, a route from the departure point to the destination via the waypoint is calculated based on the road map database 25. In step S640, it is determined whether the route calculated in step S630 includes an access road to a tourist spot that is not included in the travel plan and is predicted to be congested. If it is determined that such an access road is not included in the calculated route, the process proceeds to step S660. On the other hand, if it is determined that the calculated route includes an access road to a tourist spot that is not included in the travel plan but is predicted to be crowded, the process proceeds to step S650. In step S650, a route avoiding an access road to a tourist spot that is not included in the travel plan and is predicted to be crowded is recalculated.

  For example, FIG. 12 shows an example in which the degree of congestion calculated for the spot B is high in step S610 and the degree of congestion on the access road to the spot B is predicted to be high in step S620. Then, in the route calculation step of step S630, when a travel plan that follows each spot in the order of spot A → spot C → spot D is made, from the viewpoint of travel distance and required time, from the X interchange in FIG. Assume that the route to the spot A has been calculated.

  However, the route from the X interchange to the spot A includes an access road to the spot B that is predicted to be crowded. Therefore, in step S650, the route avoiding the access road to the spot B is recalculated. In this case, for example, as shown in FIG. 13, get off at the Y interchange next to the X interchange and avoid the access road to the spot B for the route to the spot A and the route from the spot A to the spot C. The rerouted route is recalculated.

  Here, based on the degree of congestion calculated by the congestion spot prediction processing unit 80, there is a high possibility that the access road to the tourist spot will be congested with respect to the tourist spot where congestion is expected. Therefore, as described above, by recalculating a route that avoids an access road to a tourist spot where congestion is expected, a route that is likely to move smoothly can be presented to the user.

  In step S660, the entire process of the calculated route is displayed. For example, as shown in FIG. 14, the departure point, each waypoint, and the destination are displayed, the departure time from the departure point, the arrival time at each waypoint, the staying time at each waypoint, and each route The departure time of the place, the arrival time at the destination, and the travel time between the spots are displayed. At this time, the stay time at each waypoint may be set automatically as a standard stay time for each spot, or may be a time input by the user. Further, not only information related to time but also position information such as a moving distance and an address of each spot may be displayed. Further, a map showing the moving route of each spot as shown in FIG. 13 may be displayed together.

  Subsequent to the above-described detailed display process for the entire travel plan, the process of step S330 in the flowchart of FIG. 4 is executed. In step S330, it is determined whether or not the user has determined the travel plan in which the entire process is displayed in detail as the final travel plan. When the user wants to change the travel plan displayed in detail, the user performs an instruction operation according to the information to be changed. As a result, it is possible to change from the planned date and time, to change the search keyword, and to add a spot to be incorporated into the travel plan. At this time, it is preferable that the tourist spot once incorporated can be deleted.

  On the other hand, if it is determined by the user's instruction operation that the final travel plan has been determined, the process proceeds to step S340. In step S340, the travel plan determined as the final travel plan is saved, and a bookmark is arranged in which the user can easily view the travel trip. The bookmark can be displayed on a terminal device used by the user or printed.

  Next, based on the flowchart of FIG. 8, the drive trip plan creation process using the recommended plan will be described.

  In step S700, a list of recommended drive plans that are set in advance and stored in the drive travel plan creation server 10 is displayed. In step S710, it is determined whether any plan is selected by the user. If it is determined that any plan has been selected, the process proceeds to step S720.

  In step S720, first, a screen for allowing the user to input the planned date and time when the drive trip is planned is displayed. When the travel plan date and time is input, the process proceeds to step S730. In step S730, information on the entire process of the recommended plan selected by the user is displayed. This display is performed according to the display shown in FIG. However, in this case, the congestion degree of each spot calculated by the congestion degree calculation processing routine shown in FIG. 5 is also displayed. Thereby, the user can grasp | ascertain the congestion degree of each spot in a travel planning day. Then, in step S740, it is determined whether or not the detailed information is instructed for the specific tourist spot among the displayed tourist spots and the detailed information is browsed. When the detailed information is browsed, in step S750, the count value of the browsing count counter X on the planned date input in step S720 is counted up for the tourist spot where the detailed information is browsed.

  In step S760, it is determined whether a recommended drive plan has been determined as the user's travel plan. When the user is interested in another recommended plan, the user performs an instruction operation to that effect on the terminal device. Thereby, the process returns to step S700. On the other hand, if it is determined by the user's operation that the recommended drive plan has been determined as the user's travel plan, the process proceeds to step S770, where the determined travel plan is stored and bookmark creation processing is performed.

  In step S780, the count value of the incorporation number counter W on the planned date input in step S720 is counted up for the sightseeing spots included in the determined travel plan.

  The preferred embodiments of the present invention have been described above. However, the present invention is not limited to the above-described embodiments, and various modifications can be made without departing from the spirit of the present invention.

  For example, in the drive travel plan creation process using the recommended plan, the recommended plan may be arranged not only as the user's travel plan but also according to the user's preference. Specifically, based on the recommended plan, an operation for deleting a part of tourist spots or adding a new tourist spot may be performed.

  In addition, in the menu screen display, a screen for displaying event information at each tourist spot or a screen for displaying rankings of popular driving trip plans may be selected. This makes it easier for the user to make a drive trip plan.

  Further, in the above-described example, the values of the respective counters for calculating the degree of congestion are tabulated and stored for each travel plan day, that is, for each day. However, one day may be divided into a plurality of time zones, and the values of the respective counters (particularly, the built-in number counter) may be aggregated for each time zone. In this case, the number of times of incorporation is counted as the number of times of incorporation corresponding to the time zone to which the time information (arrival time, staying time zone, etc.) visiting each tourist spot in the travel plan belongs.

  Depending on the tourist spot, the average stay time of the traveler may be several hours. In such a case, even if the tourist spot is crowded, it is not crowded throughout the day, but only a certain time zone is particularly crowded, and other time zones may be relatively free. If the number of times of incorporation is counted for each time zone based on the time information for visiting a sightseeing spot included in the drive travel plan, the degree of congestion for each time zone can be predicted.

  In the embodiment described above, the degree of congestion of each tourist spot is calculated, and when the calculated degree of congestion is equal to or greater than a predetermined value, it is recommended to change the date and time or recommend another tourist spot in the same or the same genre Recommended processing to do.

  However, when the driving route from the departure point to the destination is calculated according to the planned driving trip plan, the degree of congestion on the access road to the tourist spot included in the driving route exceeds the predetermined value. In such a case, the user may be presented with an alternative drive travel plan in which at least one of the planned date or the planned time zone, the access road, and the spot is different. The congestion level of the access road is calculated according to the congestion level of the tourist spot.

  As described above, regarding the degree of congestion, the degree of congestion of the access road included in the drive route may be evaluated in addition to the thing related to the sightseeing spot. And when the degree of congestion on the access road exceeds a predetermined value, an alternative to the drive travel plan itself may be presented. As a result, the user can select a drive plan that avoids congestion by referring to the alternative drive trip plan.

10 drive travel plan creation server, 20 travel plan creation unit, 25 road map database, 30 spot information processing unit, 40 incorporation count processing unit, 50 browsing count processing unit, 60 search count counting unit, 70 spot information database 80 congestion spot prediction processing unit, 90 congestion display processing unit, 100 recommendation processing unit, 110 route search processing unit

Claims (7)

A drive trip plan creation device for creating a drive trip plan based on information input by a user on a website,
A spot information provider that provides information on tourist spots,
A travel plan creation unit that creates a drive travel plan including the tourist spot selected by the user and presents it to the user;
The drive trip plan includes plan date information, and for each planned date of the drive trip plan and for each tourist spot, the number of times that each tourist spot is incorporated in the drive trip plan is counted. Counting means,
Congestion prediction means for predicting the degree of congestion of the tourist spot based on the number of incorporations counted by the incorporation count counting means for each planned date of the drive trip plan and for each tourist spot ,
The spot information providing unit provides detailed information of each tourist spot by a user operation, and includes a browsing number counter that counts the number of times detailed information is browsed by the user for each tourist spot,
The congestion prediction means predicts the congestion degree of the tourist spot in consideration of the number of times counted by the browsing number counter . A drive trip plan creation device for creating a drive trip plan based on information input by a user on a website,
A spot information provider that provides information on tourist spots,
A travel plan creation unit that creates a drive travel plan including the tourist spot selected by the user and presents it to the user;
The drive trip plan includes plan date information, and for each planned date of the drive trip plan and for each tourist spot, the number of times that each tourist spot is incorporated in the drive trip plan is counted. Counting means,
Congestion prediction means for predicting the degree of congestion of the tourist spot based on the number of times of incorporation counted by the number of times of incorporation for each planned date of the drive trip plan and for each tourist spot, the spot information When the keyword search is performed by the user, the providing unit extracts a tourist spot corresponding to the keyword and presents it to the user, and the number of searches for counting the number of times the keyword search is extracted for each tourist spot. With a counter,
The congestion prediction means, the number of searches of times counted by the counter be considered, drive itinerary preparing apparatus you characterized in that predicting the congestion degree of the sights. The drive travel plan includes time information for visiting the tourist spot,
The incorporation count counting means divides a day into a plurality of time zones and counts the number of incorporations for each time zone, and when the tourist spot is incorporated in the drive travel plan, The drive trip plan creation device according to claim 1 or 2 , wherein the drive trip plan creation device counts as the number of times of incorporation corresponding to a time zone to which time information for visiting a tourist spot belongs. When the travel plan created by the travel plan creation unit includes a tourist spot whose degree of congestion predicted by the congestion prediction means is higher than a predetermined threshold, the drive travel plan is changed for the user. The drive travel plan creation device according to any one of claims 1 to 3 , further comprising change recommendation means for presenting a recommended comment. 5. The drive travel plan creation device according to claim 4 , wherein the change recommendation unit includes an alternative spot recommendation unit that recommends an alternative tourist spot instead of a tourist spot where congestion is predicted. It has a map information database that stores map information,
The travel plan creation unit presents the drive travel plan to the user by displaying the drive route and the location of the tourist spot on the map drawn based on the map information,
The itinerary creation unit, when searching the drive path, congestion of claims 1 to 5, characterized in that searching for a drive path so as to avoid as much as possible the road near attractions expected The drive travel plan creation apparatus as described in any one of Claims. The congestion prediction means predicts the degree of congestion of the access road to the tourist spot,
When the travel plan created by the travel plan creation unit includes an access road whose degree of congestion predicted by the congestion prediction means is higher than a predetermined threshold, a plan date or a plan time zone is given to the user. The drive travel plan creation device according to claim 1, further comprising a presentation unit that presents an alternative drive travel plan in which at least one of the access road and the tourist spot is different .

Images