JP2018142250A - Visit spot proposal system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a visit spot proposal system that can propose widely variable visit spots suitable for the situation and preference of a user.SOLUTION: A server 10 comprises: a spot information acquisition part 15 that acquires spot information including information indicating an initial value of priority order; a visit spot list creation part 16 that creates a plurality of visit spot lists each including information indicating the priority order of a plurality of visit spots; and a visit spot determination part 17 that, for each of the plurality of visit spot lists, determines a visit spot to be proposed to a user on the basis of the information indicating the priority order. At least one of the visit spot lists to be created, the visit spot list creation part 16 classifies the plurality of visit spots into a plurality of groups according to the information indicating the initial value of the priority order, and updating the priority order in the group in at least one of the plurality of groups, thereby creating the plurality of visit spot lists including information indicating priority orders different from each other.SELECTED DRAWING: Figure 1

Description

  The present invention relates to a visit spot suggestion system for proposing spots to be visited by a user.

  Conventionally, a plurality of visit spots are obtained by acquiring spot information (for example, visit spot ID, position, or priority) of a plurality of visit spots (for example, a tourist spot such as A store, B park, or C art museum). There is known a system for proposing a route to the user to the user (see, for example, Patent Document 1).

JP 2010-32528 A

  In the system described in Patent Literature 1, a plurality of route patterns are created by creating a permutation pattern of all waypoints (visit spots), and a search for a route pattern that meets a condition such as a genre or arrival time or the above condition A transit point that conforms to is added. In this case, if the above conditions are the same, the same waypoint and route are proposed each time.

  When a visit spot is selected at random and a route is proposed, a different visit spot may be presented each time it is proposed. However, there is a possibility that a visit spot that does not match the user's situation and preference is presented.

  The present invention has been made in view of the above problems, and an object of the present invention is to provide a visit spot suggestion system that proposes a variety of visit spots that suit the user's situation and preferences.

  In order to achieve the above object, a visit spot suggestion system according to the present invention is a spot information acquisition unit that acquires information on a plurality of visit spots and includes spot information including information indicating an initial value of a priority order, A visit spot list creation unit for creating a plurality of visit spot lists each including information indicating a priority order of a plurality of visit spots, and a suggestion to a user based on information indicating a priority order for each of the plurality of visit spot lists A visit spot determination unit that determines a visit spot to be visited, and a visit spot output unit that outputs the determined proposed visit spot, the visit spot list creation unit having priority in at least one of the visit spot lists to be created Depending on the information indicating the initial value of the order, multiple visit spots are classified into multiple groups, and multiple By updating the priority order in the group at least one-loop, to create multiple visits spots list including information indicating the different priority from each other.

  In the visit spot proposal system according to the present invention, a visit spot to be proposed is determined based on information indicating a priority order included in a plurality of visit spot lists. The plurality of visit spot lists are created by classifying a plurality of visit spots into a plurality of groups according to the initial value of the priority order, and updating the priority order in the group in at least one of the plurality of groups. . Therefore, since the priority order based on the spot information (for example, the size or the degree of recognition of the visit spot) of each visit spot is reflected, a visit spot with a high user satisfaction can be proposed. Since the created plurality of visited spot lists include information indicating different priority orders, a variety of visited spots can be proposed.

  According to the present invention, it is possible to propose a variety of visiting spots that match the user's situation and preferences.

It is a figure for demonstrating the structure of the visit spot proposal system which concerns on one Embodiment. (A) It is a figure which shows the example of spot information. (B) It is a figure which shows the example of a conversion table. (C) It is a figure which shows the example of the score conversion by a genre. It is a figure for demonstrating the data produced by prior preparation. It is a figure for demonstrating the data produced by prior preparation. It is a figure for demonstrating the data produced by prior preparation. It is a figure for demonstrating the data produced by prior preparation. It is a figure for demonstrating the screen displayed on the display of a user terminal. It is a figure which shows the example of user input information. It is a figure which shows the example of a station list. It is a figure which shows the example of the read movement cost information. It is a flowchart which shows the process performed with the visit spot proposal system which concerns on one Embodiment. It is a flowchart which shows the process performed with the visit spot proposal system which concerns on one Embodiment. It is a flowchart which shows the process performed with the visit spot proposal system which concerns on one Embodiment. It is a flowchart which shows the process performed with the visit spot proposal system which concerns on one Embodiment. It is a flowchart which shows the process performed with the visit spot proposal system which concerns on one Embodiment. It is a flowchart which shows the process performed with the visit spot proposal system which concerns on one Embodiment. It is a flowchart which shows the process performed with the visit spot proposal system which concerns on one Embodiment. It is a figure which shows the example of spot information. It is a figure which shows the example of the classification | category of a visit spot. It is a figure which shows the example of the shuffle of a visit spot. (A) It is a figure which shows the method of a shuffle when priority evaluation is three steps and there is no genre designation | designated. (B) It is a figure which shows the method of a shuffle when priority evaluation is a three-step and there is a genre designation | designated. (C) It is a figure which shows the method of a shuffle when priority evaluation is 10 steps | paragraphs and there is no genre designation | designated. (D) It is a figure which shows the method of a shuffle in case priority evaluation is 10 steps | paragraphs and a genre designation | designated. It is a figure which shows the hardware constitutions of the visit spot proposal system which concerns on one Embodiment.

  Hereinafter, an embodiment of a visit spot proposal system according to the present invention will be described in detail with reference to the drawings. In the description of the drawings, the same elements are denoted by the same reference numerals, and redundant description is omitted.

  FIG. 1 shows a server 10 which is a visited spot proposal system according to the present embodiment. The visited spot suggestion system may be composed of a plurality of servers. The server 10 receives information input to the user terminal 20 by the user, and based on the information acquired from the user terminal 20 and spot information, etc., a plurality of visit spots that suit the user's situation and preferences are suggested Determine as a spot. The server 10 determines a plurality of visited spots proposed for each route for a plurality of routes. For this reason, a route that visits a visit spot that suits the user's situation and preferences can be proposed. In the following description, the server 10 is described as proposing three routes of route 1, route 2, and route 3, but the number of routes proposed by the server 10 is not limited to this.

  A user terminal 20 shown in FIG. 1 is a device operated by a user, and has a display for displaying information. Specifically, the user terminal 20 corresponds to a mobile phone, a smartphone, or the like. The user terminal 20 has a function of performing wireless communication by connecting to a network N such as a mobile communication network. The user terminal 20 and the server 10 can communicate via the network N, and can transmit and receive information to and from each other. The user terminal 20 and the server 10 may transmit and receive information via a network such as the Internet other than the network N. The user terminal 20 has a function of receiving content transmitted from the server 10 and using (for example, displaying) the content.

  The user terminal 20 has a positioning function of its own terminal 20 such as a GPS (global positioning system) positioning function. The user terminal 20 transmits information indicating a positioning point, which is the position of the terminal 20 obtained by the positioning function, to the server 10 as user position information indicating the user's position. The position information is, for example, latitude / longitude information indicating the latitude / longitude of the position. The user who owns the user terminal 20 is given a user ID that is information for specifying the user in advance, and the user ID is stored in the user terminal 20 in advance. The user terminal 20 transmits the position information together with the user ID to the server 10.

  The user terminal 20 is configured to include hardware such as a CPU (Central Processing Unit), a memory, and a wireless communication module, like an ordinary mobile phone or smartphone.

  As shown in FIG. 1, the server 10 includes a user input information acquisition unit 11, a visited site information acquisition unit 12, a visited site list creation unit 13, a visited site determination unit 14, and a spot information acquisition unit 15. The visiting spot list creating unit 16, the visiting spot determining unit 17, and the visiting spot output unit 18 are provided.

  In the server 10, spot information related to a target area, a visit spot that is located in the target area and may be visited by the user (for example, a tourist spot such as a store A, a park B, or a C art museum), And visiting base information related to visiting bases located in the target area are stored in association with each other. The target area is an area where a route can be proposed by the server 10 and is selected by the user.

  The target area is stored in association with latitude / longitude information indicating the latitude / longitude corresponding to the target area. The target area may be a national unit, a prefectural unit, or a municipal unit such as Tokyo 23 wards, Kamakura city, Kyoto city. A visiting base is a point of transit (for example, a station or a highway toll) that switches to a different transportation (eg, walking, car, or train) or traffic rules when the user moves between different visiting spots. For example, when the user selects a train and a walk as the moving means, the visited base hits a station. Hereinafter, a case where the user selects a train as the moving means and the visiting base is a station will be described as an example, but the types of the moving means and the visiting base are not limited thereto.

  The spot information includes, for example, the visit spot ID, the name of the visit spot, latitude / longitude information indicating the latitude / longitude of the visit spot, the priority of the visit spot, and the genre of the visit spot. FIG. 2A shows an example of spot information. In FIG. 2A, the visit spot ID, the nearest station of the visit spot, the genre, and the priority are associated with each other. In FIG. 2A, the latitude / longitude information indicating the name of the visited spot and the latitude / longitude of the visited spot is not drawn. The server 10 also stores the name of the visited spot and the latitude / longitude information indicating the latitude / longitude of the visited spot in association with the visited spot ID, the nearest station of the visited spot, the genre, and the priority.

  The priority of the visit spot is a value indicating the value to be visited by the user, and is determined in advance according to the size of the visit spot, the degree of prominence, the satisfaction of people who have visited the visit spot in the past, and the like. In this embodiment, the priority value of each visit spot is composed of three types, “1”, “2”, and “3”, and the smaller the number, the higher the value that the user should visit (higher priority). Means that. The priority value is not limited to these values.

  The server 10 treats the priority of the visit spot as the original data of the priority order for proposing the visit spot to the user (information indicating the initial value of the priority order of the plurality of visit spots). The genre of the visit spot is, for example, an attribute (classification) of the visit spot such as nature, a temple / church, a building / historic site, and an animal / botanical garden / park.

  The visited base information is information indicating a station, and includes, for example, a station ID, a station name, latitude / longitude information indicating the latitude / longitude of the station, a moving cost between stations, a total evaluation score of the station, and an evaluation score by station genre. It is out. The movement cost is a cost required for the user to move, and includes at least one of a distance, a movement time, a charge for movement, the number of transfers, and the like. For example, the server 10 treats the overall evaluation score of the station or the evaluation score according to the genre of the station as the original data of the priority order for proposing the station to the user (information indicating the initial value of the priority order of the plurality of visiting bases).

  The overall evaluation score of a station is a value indicating the high value that the user should visit, and the higher the number of visited spots with higher priority among the visited spots closest to the station, the higher the value. Hereinafter, an area where a plurality of visit spots associated with one station by a method described later is located is referred to as a station block. The station score by genre is a value that indicates the high value that a user should visit for each genre. It is a high value. In this embodiment, the total evaluation score is a total value of evaluation scores by genre of all genres of the station. In the server 10 of this embodiment, the visiting base information is stored as a station evaluation table, a movement cost table, and a station master table at the time of environment construction.

  The station evaluation table is a table in which a station ID, a station name, an overall evaluation score, and an evaluation score for each genre are associated with each of all stations belonging to each target area. The visited base evaluation table is stored, for example, in the format shown in FIG. 3, and the spot information shown in FIG. 2 (a) and the priority shown in FIG. 2 (b). It is created from the conversion table with which the score is associated.

  FIG. 2C shows that the visit spot having spot IDs a, b, c, d, e, f, and g belongs to “Nature” and station A is the closest. In this case, the genre evaluation score for station A is 49 for the genre “Nature” based on the conversion table shown in FIG.

  By the above method, the evaluation score for each genre is calculated for each genre for each of the stations belonging to each target area, thereby creating a visit base evaluation table as shown in FIG.

  The movement cost table is a table showing the movement cost between stations in the target area for each target area. FIG. 4 shows an example of the movement cost table when the target area is Kamakura City. In FIG. 4, the travel time is shown as the travel cost. The travel time in FIG. 4 is the total travel time including the boarding time and the transfer time. For example, if the route from station A to station B is a route that changes from station A to station C, such as station A → station C → station B, and the required time is 30 minutes including the transfer time, station A to station B The travel time is 30 minutes.

  The station master table is a table showing the relationship between the station ID, the station name, and the latitude and longitude of the station. FIG. 5 shows an example of the station master table.

  The server 10 stores station parameters that define various conditions for determining a station at the time of environment construction. As shown in FIG. 6, for example, the station parameter is data associating the target area, the sightseeing time, the upper limit of the number of stations, the lower limit of the distance between stations, and the upper limit of the distance between stations. Sightseeing time is a value entered by the user, and the time that the user wants to leave from the departure location until arrival at the arrival location, i.e., all suggested times including the departure location and the arrival location by the user. Allowable time allowed to visit the spot. The upper limit of the number of stations indicates the upper limit of the number of stations proposed to the user. The inter-station distance lower limit and the inter-station distance upper limit indicate an allowable range of distance as a moving cost between stations proposed to the user.

  The user input information acquisition unit 11 acquires information input to the user terminal 20 by the user and information corresponding thereto. Specifically, on the information input screen shown in FIG. 7 displayed on the display of the user terminal 20, after the user inputs basic information, user preferences, transportation means, etc., “route search” Is selected, the basic information input by the user and the information indicating the sticking condition or information corresponding thereto are transmitted to the server 10. As a result, the user input information acquisition unit 11 receives and acquires basic information and information indicating the sticking condition input by the user, or information corresponding thereto.

  The basic information includes items of “departure place”, “arrival place”, and “tourism time”. Information indicating the departure point and the arrival point is input to each item of the basic information, and the sightseeing time is input, and information indicating the departure point and the arrival point is transmitted from the user terminal 20 to the server 10 by selecting “Route Search”. The information indicating the sightseeing time and the information indicating the preset transportation means are transmitted.

  When “route search” is selected before the basic information is input, information indicating the departure and arrival points set in advance and information indicating the sightseeing time are transmitted from the user terminal 20 to the server 10. Is done. In this case, the information indicating the departure point and the arrival point transmitted to the server 10 may be information indicating the departure point and the arrival point associated with the target area selected in advance by the user.

  When “route search” is selected before the basic information is input, the user terminal 20 does not transmit the information indicating the departure point and the arrival point and the information indicating the sightseeing time to the server 10. Each piece of information stored in advance may be used, or error processing may be performed.

  The information indicating the departure place and the arrival place is information indicating the name or latitude / longitude of the departure place and the arrival place. When the names of the departure place and the arrival place are input, even if the user terminal 20 converts the latitude and longitude information stored in advance and transmits it to the server 10, the server 10 converts each name into latitude and longitude information. May be. The latitude / longitude information of the departure place may be information indicating a positioning point that is the position of the terminal 20 obtained by the positioning function of the user terminal 20.

  The information indicating the sticking conditions includes departure time, user preference, and transportation. Information indicating the sticking condition is information that is arbitrarily input. For this reason, even if “route search” is selected without inputting the preference condition, the error screen is not displayed if the basic information is input.

  In the item of “departure time”, a desired time at which the user departs from the departure place (hereinafter referred to as “departure time”) can be input. When the departure time is not input by the user, the current time may be transmitted to the server 10 as the departure time. The departure time may be used to determine whether or not the visit is appropriate according to the travel time of the train or the business hours of the visited spot.

  The user's preference includes items of “journey genre” and “spot to be sure to go”. One or a plurality of genres that the user wants to visit can be input in the “travel genre” item. In the “spot to be surely visited” item, a name of a visit spot that the user always wants to visit (hereinafter referred to as “essential spot”) can be input. The information input here is transmitted to the server 10 along with the basic information.

  The transportation means includes items of “walk only”, “train”, “car”, and “bicycle”. From each item of transportation means, the transportation means desired by the user can be selected. The moving means selected here is transmitted to the server 10 instead of the preset moving means. In this embodiment, when “walk only”, “car”, and “bicycle” are selected, the visited base information acquisition unit 12, the visited base list creation unit 13, and the visited base determination unit 14 are not used. The spot information acquisition unit 15, the visit spot list creation unit 16, the visit spot determination unit 17, and the visit spot output unit 18 propose routes for visiting a plurality of visit spots.

  When “area spot list” is selected, information requesting spot information of visited spots located in the target area previously selected by the user is transmitted to the server 10. When the server 10 receives the information, the server 10 transmits, to the user terminal 20, spot information on a visit spot that is requested by the user terminal 20 and is located in the target area selected by the user in advance. When the user terminal 20 receives from the server 10 the spot information of the visiting spots located in the target area previously selected by the user, a list of the received spot information is displayed on the display. The user can examine the essential spots and genres with reference to the displayed list of visited spots.

  The visiting base information acquisition unit 12 reads all the visiting base information stored in association with a target area (hereinafter referred to as an acquisition target area) previously selected by the user. The acquisition target area may be a target area associated in advance with the latitude and longitude information of the departure place and the arrival place input by the user. The visited base information acquisition unit 12 reads out and acquires the visited base information including information indicating the travel costs between a plurality of stations from the travel cost table. The visiting base information acquisition unit 12 compares the latitude / longitude information of the departure point and the arrival point acquired by the user input information acquisition unit 11 with the information indicating the latitude / longitude of each station in the station master table. The stop station (hereinafter referred to as the departure station) and the nearest station of the arrival place (hereinafter referred to as the arrival station) are determined, and the visit base information of the departure station and the arrival station is acquired.

  For example, when the basic information shown in FIG. 8 is input by the user, the visited base information acquisition unit 12 reads out information indicating the travel cost shown in FIG. 10 from the travel cost table, By comparing the latitude and longitude information of the arrival place with the station master table, the departure station and the arrival station are obtained. In this case, since the nearest station near Tsurugaoka Hachimangu Shrine, which is the departure place, is Kamakura Station, and the nearest station near Haseji, which is the arrival place, is Hase Station, the visiting base information acquisition unit 12 is the departure station, Kamakura. Acquire station visit base information and obtain visit base information of Hase Station, which is the arrival station.

  The visited base list creating unit 13 creates a plurality of station lists for determining the proposed station based on the information acquired by the visited base information acquiring unit 12. The plurality of station lists are used when determining stations to be proposed on different routes. One station list corresponds to one route. In this embodiment, since three routes are proposed, three station lists are created. Each of the plurality of station lists includes information indicating the priority order of the stations, which are different from each other.

  Specifically, the visited base list creating unit 13 includes, in at least one station list to be created, a plurality of stations based on a total evaluation score or a genre-based evaluation score (information indicating an initial value of the priority order of visited bases). And the priority order of the stations is updated by shuffling the stations in the group in at least one of the plurality of groups. As a result, a plurality of station lists each including information indicating the priority order updated from the initial values is created for each route.

  Rules (criteria) for classifying stations are determined in advance. In the present embodiment, the visited base list creation unit 13 classifies a plurality of stations arranged by the total evaluation score or the genre evaluation score into a plurality of groups by dividing the plurality of stations into a plurality of groups. The visited base list creation unit 13 may perform the above-described classification based on different criteria depending on the station list to be created. For example, the division range may vary depending on the station list. That is, the visiting base list creation unit 13 may vary the number of stations classified into a predetermined group (first group) depending on the station list that creates the number of stations. In addition, shuffle means changing the order at random.

  When the “travel genre” is not input by the user, the visited base list creation unit 13 creates a plurality of station lists using the total evaluation score at each station as information indicating the initial value of the priority order of the stations. The higher the overall evaluation score, the higher the initial priority order of stations.

  When the “journey genre” is input by the user, the visited base list creation unit 13 sets the evaluation score for each genre associated with the input “travel genre” as the initial value of the priority order of the stations. A plurality of station lists are created as information indicating The higher the visit score, the higher the evaluation score for each genre related to the “travel genre”, the higher the initial value of the priority order of the stations.

  For example, when the basic information shown in FIG. 8 is input by the user, the station list creation unit 13 creates the station list shown in FIG. 9 by the method described above.

  The visiting base determination unit 14 includes basic information input by the user, a travel cost table between stations, visiting base information of departure and arrival stations, and a plurality of stations included in each of the plurality of station lists. The station to be proposed to the user is determined from the information indicating the priority order and the temporary stay time stored in advance. The temporary stay time may be stored in association with each station in advance. The temporary stay time is a temporary time that is allowed for the user to visit the visiting spot associated with the station. That is, the temporary stay time is a temporary time during which the user is allowed to stay in the station block. More specific description will be given below.

  First, the visited base determination unit 14 determines the departure place, departure station, arrival station, arrival place from the latitude / longitude information of the departure place and arrival place, the latitude / longitude information of the departure station and arrival station, and the travel cost table between the stations. The shortest travel time is determined by a linear distance that moves in the following order. The travel time by foot from the departure place to the departure station can be obtained by dividing the linear distance between the departure place and the departure station by the walking speed stored in advance. Similarly, the travel time from the arrival place to the arrival station can be obtained by dividing the linear distance between the arrival place and the arrival station by the walking speed stored in advance. In order to make the travel time or distance more accurate, information indicating the travel time or distance along the road when the user travels on foot is obtained from a map application or a map service on the network. You may use it. The travel time from the departure station to the arrival station is acquired from the travel cost table between the stations. The shortest travel time is the sum of the travel time from the departure point to the departure station, the travel time from the arrival point to the arrival station, and the travel time from the departure station to the arrival station.

  When the required spot is input by the user, the visited site determination unit 14 creates a pattern of a route that visits all of the stations associated with the departure station, the arrival station, and the required spot. A route pattern (station visit order) that provides the shortest travel time is obtained from the travel cost table. The visited site determination unit 14 obtains the order in the route of the station associated with the essential spot, which is the shortest travel time, by the tabu search method. The shortest travel time here is only the target place (departure place, departure station, station associated with the required spot (nearest station), arrival station, arrival place, and station determined later). This is the travel time of the route to be visited, and is the shortest travel time that cannot be shortened any longer. The route pattern with the shortest travel time is the base of the route proposed to the user.

  Next, the visiting base determination unit 14 assigns the temporary stay time described above to the departure station, the arrival station, and the station associated with the essential spot, and the travel time and the temporary stay time from the departure place to the arrival place. The provisional sightseeing time that is the sum of When the departure station and the arrival station are the same, the temporary stay time for the departure station is given, and the temporary stay time for the arrival station is not given. That is, the temporary stay time is not repeatedly given to the same station. If there are no spots to visit at the departure station and arrival station, no temporary stay time is given.

  Next, the visiting base determination unit 14 obtains the remaining sightseeing time by subtracting the provisional sightseeing time from the sightseeing time input by the user. In principle, the visited base determination unit 14 adds stations in the priority order according to the information indicating the priority order included in the station list until the remaining sightseeing time becomes zero. The visited base determination unit 14 obtains the order in the route of the station to be added, which is the shortest travel time by the tabu search method, and gives a temporary stay time to the added station. In this way, the visiting site determination unit 14 determines the station (station included in the route) proposed to the user and the route of the station according to the information indicating the priority order included in each of the plurality of station lists. Determine the order.

  As described above, when the “journey genre” is not input by the user, the information indicating the priority order included in the station list indicates the total evaluation score at each station (the initial value of the station priority order). Information) is updated information. When the “travel genre” is input by the user, the information indicating the priority order included in the station list is an evaluation score by genre associated with the “travel genre” input by the user ( Information indicating the initial value of the priority order of stations) is updated information.

  When the station to be proposed to the user is determined, the visiting base determination unit 14 resets the temporary stay time to 0, and the ratio of the total evaluation points in the station evaluation table of the determined station, that is, the total of the determined station The block stay time is allocated to each station at a distribution rate obtained by dividing the overall evaluation score of the station by the total of the evaluation points. Block stay time is the time allowed for a user to visit a visit spot associated with the station. That is, the block stay time is a time when the user is allowed to stay in the station block.

  The visiting base determination unit 14 prohibits a station that exceeds a predetermined number associated with the sightseeing time (allowable time) input by the user from being included in the station proposed to the user. Specifically, the visiting base determination unit 14 reads out station parameters, reads out the upper limit of the number of stations associated with the sightseeing time input by the user, and stations exceeding the upper limit of the number of stations are included in the stations proposed to the user. Prohibit that.

  For example, in the station parameter shown in FIG. 6, when the sightseeing time is 3 hours (180 minutes), the upper limit of the number of stations is 3, and when the sightseeing time is 5 hours (300 minutes) The upper limit of the number is 4. For this reason, when the sightseeing time is 3 hours, the visiting base determination unit 14 sets the upper limit to 3 for the number of proposed stations, and when the sightseeing time is 5 hours, The upper limit is four.

  The visiting base determination unit 14 prohibits the distance between the stations (movement cost) proposed to the user from being out of the predetermined range associated with the target area and the sightseeing time. Specifically, the visiting site determination unit 14 reads out the station parameters, reads out the lower limit of the distance between stations and the upper limit of the distance between stations, and the distance between the stations with all other stations included in the station proposed to the user is the station. Only stations that fall between the lower distance limit and the upper station distance upper limit are stations that are proposed to the user.

  For example, when the information shown in FIG. 8 is input by the user, the visiting base determination unit 14 firstly uses the visiting base information stored in advance from the information shown in FIGS. We ask that the nearest station of departure is Kamakura Station and the nearest station of arrival is Hase Station. Next, the visiting base determination unit 14 determines the route where the departure point is near Tsurugaoka Hachimangu Shrine, the nearest departure station is Kamakura Station, the nearest arrival station is Hase Station, and the arrival point is near Hase-ji Temple. Find the shortest travel time. Next, the visiting base determination unit 14 gives a temporary stay time of 30 minutes to Kamakura Station and Hase Station, and obtains a temporary sightseeing time required for traveling the route in consideration of the temporary stay time. Since the shortest travel time is 30 minutes, the visiting base determination unit 14 determines that the provisional sightseeing time is 90 minutes and the remaining sightseeing time is 90 minutes.

  In the station list, the visited base determination unit 14 adds Kita-Kamakura having the highest priority among the stations not yet included in the route to the route, and obtains the shortest travel time of the new route. The visiting base determination unit 14 also gives a temporary stay time of 30 minutes to Kita-Kamakura and obtains the remaining sightseeing time. Since the shortest travel time for the new route was 40 minutes, the remaining sightseeing time is 50 minutes. Although the remaining sightseeing time remains, since the upper limit of the number of stations when the sightseeing time is 3 hours is 3, the visiting base determination unit 14 ends the addition of the station.

  In the station parameters shown in FIG. 6, when the target area is Kamakura, the lower limit of the distance between stations is 1.8 km, and the upper limit of the distance between stations is 10 km. For this reason, the station outside the range whose distance between stations is 1.8 km-10 km is not added. In other words, when the target area is Kamakura, all the stations included in the station proposed to the user fall within the range of 1.8 km to 10 km between the stations.

  Next, the visiting base determination unit 14 resets the temporary stay time to 0, and allocates the block stay time to each station at a distribution rate previously associated with the overall evaluation score of the station evaluation table. The visiting base determination unit 14 sets the block stay time in Kamakura and Kita-Kamakura to 50 minutes and the block stay time in Hase to 40 minutes. Since Kamakura and Kita-Kamakura have a higher overall score than Hase, a longer block stay time than Hase is given to Kamakura and Kita-Kamakura. The station list determination method is not limited to the one shown here.

  In each station, a point where the user first visits (hereinafter referred to as a start point) and a point where the user visits last (hereinafter referred to as an end point) are set. At the departure station, the start point is the departure place input by the user, and the end point is the departure station. At the arrival station, the start point is the arrival station, and the end point is the arrival point input by the user. In a station visited between a departure station and an arrival station, the start point and the end point are the corresponding stations. A visit spot that is located in a square area with a side of X km centering on an intermediate point between the start point and the end point is associated with the station proposed to the user. That is, Xkm square is a station block of the station centering on an intermediate point between the start point and the end point.

  The side Xkm of the station block described above is set to a larger value as the sightseeing time input by the user is longer. For example, X is set to 1.3 when the sightseeing time input by the user is 3 hours or less, and X is set to 2.0 when the sightseeing time input by the user exceeds 3 hours. The

  The spot information acquisition unit 15 acquires spot information related to a plurality of visited spots associated with a station proposed to the user. That is, the spot information acquisition unit 15 acquires spot information related to a plurality of visited spots located in an area (station block) associated with the sightseeing time. The spot information acquisition part 15 may acquire in order from the visit spot close | similar to a station, when the number of the visit spots located in the station block mentioned above is less than 200. The spot information acquisition part 15 may acquire in order from a high priority among the visit spots in an area | region, when the number of the visit spots located in the station block mentioned above exceeds 200.

  The visited spot list creating unit 16 creates a plurality of visited spot lists for determining the proposed visited spot based on the information acquired by the spot information acquiring unit 15. The plurality of visit spot lists are used when determining the visit spots to be proposed in different routes. One visited spot list corresponds to one route. In this embodiment, since a visit spot is proposed for three routes, three visit spot lists are proposed. Each of the plurality of visited spot lists includes information indicating the priority order of the plurality of visited spots located in the area associated with the sightseeing time.

  Specifically, the visit spot list creation unit 16 assigns a plurality of visit spots to at least one of the visit spot lists to be created with the visit spot priority (information indicating the initial value of the visit spot priority order). The priority order of the visit spots is updated by classifying them into groups and shuffling the visit spots in the group in at least one of the plurality of groups. As a result, a plurality of visited spot lists each including information indicating the priority order updated from the initial values is created for each route.

  The visit spot list creation unit 16 classifies the visit spot having a higher priority than any of the visit spots classified into another group (second group) into a predetermined group (first group). That is, the priority order of the visit spots classified in groups is different.

  Rules (criteria) for classifying visited spots are determined in advance. In the present embodiment, the visit spot list creation unit 16 classifies a plurality of visit spots arranged by visit spot priority into a plurality of groups by dividing the visit spots into a plurality of groups. The visited spot list creation unit 16 may perform the above-described classification based on different criteria depending on the created visit spot list. For example, the division range may be different depending on the visited spot list. In other words, the visit spot list creation unit 16 may make the visit spot list different depending on the visit spot list that creates the number of visit spots classified into a predetermined group (first group). In addition, shuffle means changing the order at random.

  In the present embodiment, the visited spot list creating unit 16 creates a plurality of station lists by using the priority set in advance for each visited spot as information indicating the initial value of the priority order of the visited spots. When the “journey genre” is input by the user, the visited spot list creation unit 16 sets the initial value of the priority order of the visited spots corresponding to the input “travel genre” from the uncorresponding visited spots. The plurality of visiting spots are classified into the above-described groups. For example, after subtracting 0.5 from the priority value of the corresponding visited spot, the plurality of visited spots are classified into the plurality of groups described above.

  That is, when the “journey genre” is input by the user, the visited spot list creation unit 16 adds the “travel genre” and the visited spot entered by the user to at least one of the created visit spot lists. By classifying multiple visit spots into multiple groups according to the priority (information indicating the initial order of visit spot priority), and shuffling the visit spots within the group in at least one of the multiple groups, Update priority order of visited spots.

  The visit spot determination part 17 determines the visit spot proposed to a user from the visit spot corresponding to this station for every station to propose. At this time, the visit spot determination unit 17 determines a visit spot to be proposed to the user based on information indicating the priority order of the plurality of visit spots included in each of the plurality of visit spot lists. Specifically, it is as follows.

  The visit spot determination unit 17 determines the visit spots to be associated with each of the stations determined by the visit base determination unit 14 in order from the station with the lowest priority in the station list. In addition, even if it is not the priority order in a station list, you may determine the visit spot linked | related with each station in order with a low comprehensive evaluation score or the evaluation score according to genre.

  For example, when the information shown in FIG. 8 is input by the user, the overall evaluation score is higher at Kita-Kamakura Station than at Hase Station, and the overall evaluation score is higher at Kamakura Station than at Kita-Kamakura Station. Then, the visit spot to visit in the block is determined from the block to which Hase Station belongs.

  The visit spot determination part 17 calculates | requires the order in the path | route of the said essential spot used as the shortest movement time by the tabu search method, when the several essential spot is input by the user in the station which determines a visit spot. The shortest travel time required here is the travel time of a route that circulates only the start point, the end point, and the essential spot, and is the shortest travel time that cannot be shortened any further. The walking time between the start point, the end point, and the essential spot is obtained by dividing the distance between these positions by the walking speed stored in advance.

  The visited spot determination unit 17 gives a spot stay time stored in advance to the essential spot. The visit spot determination unit 17 obtains a provisional sightseeing time that is the sum of the travel time from the start point to the end point and the spot stay time. That is, the temporary sightseeing time calculated | required here is time which visits all the visit spots proposed to a user already determined about the said station. Here, the spot stay time given to each visit spot is a time when the user is allowed to stay at the visit spot.

  Next, the visit spot determination part 17 calculates | requires remaining block stay time by deducting temporary sightseeing time from the block stay time provided to the station. In principle, the visit spot determination unit 17 determines the visit spots in the priority order according to the information indicating the priority order included in the visit spot list until the remaining block stay time reaches a predetermined value stored in advance. Add as a proposed visit spot. The visit spot determination unit 17 obtains the order in the route of the visit spot to be added, which is the shortest travel time, by the tabu search method. The shortest travel time here is the travel time of a route that circulates only the target location (start point, end point, and visit spot suggested to the user), and is the shortest travel time that cannot be shortened any longer. . The visit spot determination unit 17 assigns a spot stay time to the added visit spot.

  When the remaining block stay time is less than the above-mentioned predetermined value and the remaining block stay time is surplus, the remaining block stay time is the block stay associated with the station with the highest priority in the station list. Added to time. The remaining remaining block stay time may be added to the block stay time associated with the station having the highest total evaluation score or genre-based evaluation score (initial value of priority order). The remaining remaining block stay time may be distributed at a distribution rate determined in advance according to the priority order. If the departure station, arrival station, and the station with the highest priority are the same, the remaining block stay time remaining at the departure station is added.

  In other words, when the proposed station includes the first station and the second station having a higher priority order than the first station, the visited spot determining unit 17 visits all the proposed visited spots determined for the first station. Based on the time obtained by subtracting the remaining block stay time from the block stay time determined for the first station and adding the remaining block stay time to the block stay time determined for the second station , To determine a proposed visit spot for the second station.

  For example, in the example described above, Kita-Kamakura Station has a higher overall score than Hase Station, and Kamakura Station has a higher overall score than Kita-Kamakura Station. The remaining block stay time remaining in determining the visiting spot in the block to which the block belongs is added to the block stay time given to Kamakura Station.

  The visit spot output unit 18 outputs a plurality of visit spots proposed to the user determined by the visit spot determination unit 17 and information related thereto. The visit spot output unit 18 may draw a route around a plurality of visit spots proposed to the user determined by the visit spot determination unit 17 on a map and output the route to the user terminal 20. The information output by the visit spot output unit 18 includes, for example, information indicating the order of the station to get on and off and the visit spot to visit for each of a plurality of routes. In addition, the information may include information indicating the order in which the positions of the station and the visit spot are moved on the map.

  A plurality of visit spots proposed to the user determined by the visit spot determination unit 17 may be drawn on a map by an external map application or the like. In this case, the visit spot output unit 18 transmits information regarding a plurality of visit spots proposed to the user determined by the visit spot determination unit 17 to an external map application, and receives the processing result of the map application.

  Next, processing performed by the server 10 according to the present embodiment will be described using the flowcharts of FIGS. First, an outline of processing executed by the server 10 will be described with reference to FIG. For the sake of simplicity, a description will be mainly given of a case where a location (essential spot) that the user wants to go to is not input. A case where an essential spot is input will be described in an appendix.

  First, information indicating a departure place and an arrival place, information input by a user such as a sightseeing time, and information corresponding thereto are acquired by the user input information acquisition unit 11 (step S1). Subsequently, the visited base information acquisition unit 12 acquires the target area where the guidance of the visited spot is performed (step S2). Hereinafter, the target area acquired in step S2 is referred to as an acquisition target area.

  Steps S3 to S8 are repeated by the number of routes proposed by the server 10. In the present embodiment, the server 10 repeats step S3 to step S8 three times in order to propose three routes.

  From the comparison of the latitude and longitude information of the departure place and arrival place acquired in step S1 by the visited base information obtaining unit 12 and the station master table, the nearest station (departure station and arrival station) for each departure place and arrival place. Is obtained, and the visiting base information of the departure station and arrival station is acquired (step S3). When the essential spot is input by the user, the visiting base information of the nearest station of the essential spot is also acquired.

  Next, the visiting base information acquisition unit 12 acquires visiting base information other than the visiting base information acquired in step S3 in the acquisition target area (step S4). Subsequently, the visited site list creating unit 13 performs a visited site list creating process (step S5).

  Next, the travel base information acquisition unit 12 acquires the travel cost between the stations acquired in steps S3 and S4 from the travel cost table (step S6). When the essential spot is input by the user, the travel cost for the station closest to the essential spot is also acquired. Subsequently, the visited site determining unit 14 performs a visited site determining process (step S7).

  Next, a visit spot suggestion process is performed for each station determined in step S7 by the spot information acquisition unit 15, the visit spot list creation unit 16, and the visit spot determination unit (step S8). Step S8 is repeated for the number of stations determined in step S7.

  As described above, steps S3 to S8 are repeated by the number of routes proposed by the server 10. Subsequently, a visit spot suggested to the user is output by the visit spot output unit 18 (step S9).

  Next, with reference to the flowcharts of FIGS. 12 and 13, the visited base list creation process in step S5 will be specifically described. First, the process when the genre is not input by the user will be described using the flowchart of FIG.

  The visited base list creation unit 13 determines what the route type is (which route is generated among the three routes) (step S11). If it is route 1, the process proceeds to step S12. If it is route 2, the process proceeds to step S19. If it is route 3, the process proceeds to step S26. The visited base list creation unit 13 performs processing for each route.

  When the route type is route 1 (route 1 in step S11), the visited base list creation unit 13 obtains the above-mentioned overall evaluation score of 0 in the area where the server 10 is used in descending order with respect to the overall evaluation score. (Step S12). Subsequently, the visited base list creation unit 13 shuffles the top 10% of the stations acquired in step S12 (step S13).

  Next, the visited base list creation unit 13 determines whether 10 or more stations are included in the top 10% of the stations acquired in step S12 (step S14). If it is determined that there are 10 or more stations included in the upper 10% group, the process proceeds to step S18. If it is determined that the number of stations included in the upper 10% group is less than 10, the process proceeds to step S15.

  When it is determined that the number of stations included in the top 10% group is less than 10 (NO in step S14), the visited base list creation unit 13 uses the top 30% group of stations acquired in step S12. Shuffle is performed except for the stations shuffled in step S13 (step S15).

  Next, the visited base list creation unit 13 determines whether 10 or more stations are included in the top 30% of the stations acquired in step S12 (step S16). If it is determined that there are 10 or more stations included in the upper 30% group, the process proceeds to step S18. If it is determined that the number of stations included in the upper 30% group is less than 10, the process proceeds to step S17. When it is determined that the number of stations included in the upper 30% group is less than 10 (NO in step S16), the visited base list creation unit 13 shuffles the remaining lower 70% groups (step S17). ).

  If it is determined in step S14 that there are 10 or more stations included in the top 10% group (YES in step S14), or if it is determined in step S26 that there are 10 or more stations included in the top 30% group ( When the processing is performed in step S16 and YES in step S17, the top 10 stations after the last shuffle are performed by the visiting base list creation unit 13 are numbered in order from the top. It is included in the list (step S18).

  When the route type is route 2 (route 2 in step S11), the visited base list creation unit 13 obtains the above-mentioned stations whose overall evaluation score is not 0 in the area where the server 10 is used in descending order with respect to the overall evaluation score. (Step S19). Subsequently, the visited base list creation unit 13 shuffles the top 10% of the stations acquired in step S19 (step S20).

  Next, the visited base list creation unit 13 determines whether 10 or more stations are included in the top 10% of the stations acquired in step S19 (step S21). If it is determined that there are 10 or more stations included in the upper 10% group, the process proceeds to step S25. If it is determined that the number of stations included in the upper 10% group is less than 10, the process proceeds to step S22.

  When it is determined that the number of stations included in the top 10% group is less than 10 (NO in step S21), the visited base list creation unit 13 uses the top 30% group of stations acquired in step S19. Shuffle is performed except for the stations shuffled in step S20 (step S22).

  Next, the visited base list creation unit 13 determines whether 10 or more stations are included in the top 30% of the stations acquired in step S19 (step S23). If it is determined that there are 10 or more stations included in the upper 30% group, the process proceeds to step S25. If it is determined that the number of stations included in the upper 30% group is less than 10, the process proceeds to step S24. When it is determined that the number of stations included in the upper 30% group is less than 10 (NO in step S23), the visited base list creation unit 13 shuffles the remaining lower 70% groups (step S24). ).

  If it is determined in step S21 that there are 10 or more stations included in the top 10% group (YES in step S21), or if it is determined in step S23 that there are 10 or more stations included in the top 30% group ( If the process is performed in step S23 and YES in step S24, the top ten stations after the last shuffle are performed by the visiting base list creation unit 13 are numbered in order from the top. It is included in the list (step S25).

  When the route type is route 3 (route 3 in step S11), the visited base list creation unit 13 obtains the above-mentioned stations whose overall evaluation score is not 0 in the area where the server 10 is used in descending order with respect to the overall evaluation score. (Step S26). Subsequently, the visiting base list creation unit 13 shuffles the top 30% of the stations acquired in step S26 (step S27).

  Next, the visited base list creation unit 13 determines whether 10 or more stations are included in the top 30% of the stations acquired in step S26 (step S28). If it is determined that there are 10 or more stations included in the upper 30% group, the process proceeds to step S30. If it is determined that the number of stations included in the upper 30% group is less than 10, the process proceeds to step S29.

  When it is determined that the number of stations included in the upper 30% group is less than 10 (NO in step S28), the visited base list creation unit 13 shuffles the remaining lower 70% groups (step S29). ). If it is determined in step S28 that there are 10 or more stations included in the top 30% group (YES in step S28), and if the process is performed in step S29, the visited base list creation unit 13 finally performs shuffle. The top 10 stations after having been performed are numbered sequentially from the top and included in the station list (step S30).

  Next, processing when a genre is input by the user will be described using the flowchart of FIG.

  The visited base list creation unit 13 determines what the route type is (step S31). If it is route 1, the process proceeds to step S32. If route 2, the process proceeds to step 34, and if it is route 3, the process proceeds to step S41.

  When the route type is route 1 (route 1 in step S31), the visited base list creation unit 13 uses the genre of the genre input by the user when the above-described overall evaluation score is 0 in the area where the server 10 is used. Another evaluation score is acquired in descending order (step S32). When there are a plurality of genres input by the user, the visit base list creation unit 13 evaluates each genre for each genre input by the user for a station whose overall evaluation score is not 0 in the area where the server 10 is used. The total score is acquired in descending order. When there is a station having the same genre evaluation score of the genre input by the user, superiority or inferiority is given by the total evaluation score.

  Next, the top 10 stations of the stations acquired in step S32 are numbered sequentially from the top by the visited base list creation unit 13, and are included in the station list (step S33). If there is a station with the same genre evaluation score and overall evaluation score among the top 10 stations acquired in step S32, shuffling is performed for stations with the same genre evaluation score and overall evaluation score.

  When the route type is route 2 (route 2 in step S31), the visited base list creation unit 13 uses the genre of the genre input by the user when the station whose overall evaluation score is not 0 in the area where the server 10 is used. Another evaluation score is acquired in descending order (step S34). When there are a plurality of genres input by the user, the visit base list creation unit 13 evaluates each genre for each genre input by the user for a station whose overall evaluation score is not 0 in the area where the server 10 is used. The total score is acquired in descending order. When there is a station having the same genre evaluation score of the genre input by the user, superiority or inferiority is given by the total evaluation score.

  Next, the visited base list creation unit 13 shuffles the top 10% of the stations acquired in step S34 (step S35). Subsequently, the visited base list creation unit 13 determines whether 10 or more stations are included in the top 10% of the stations acquired in step S34 (step S36). If it is determined that there are 10 or more stations included in the upper 10% group, the process proceeds to step S40. If it is determined that the number of stations included in the upper 10% group is less than 10, the process proceeds to step S37.

  When it is determined that the number of stations included in the top 10% group is less than 10 (NO in step S36), the visited base list creation unit 13 uses the top 30% group of stations acquired in step S34. Shuffle is performed except for the stations shuffled in step S35 (step S37). Subsequently, the visited base list creation unit 13 determines whether 10 or more stations are included in the top 30% of the stations acquired in step S35 (step S38). If it is determined that there are 10 or more stations included in the upper 30% group, the process proceeds to step S40. If it is determined that the number of stations included in the upper 30% group is less than 10, the process proceeds to step S39.

  When it is determined that the number of stations included in the upper 30% group is less than 10 (NO in step S38), the visited base list creation unit 13 shuffles the remaining lower 70% groups (step S39). ). If it is determined in step S36 that there are 10 or more stations included in the top 10% group (YES in step S36), or if it is determined in step S38 that there are 10 or more stations included in the top 30% group ( When the processing is performed in step S38 and YES in step S39, the top 10 stations after the last shuffle are performed by the visiting base list creation unit 13 are numbered in order from the top. It is included in the list (step S40).

  When the route type is route 3 (route 3 in step S31), the visited base list creation unit 13 uses the genre of the genre input by the user when the station whose overall evaluation score is not 0 in the area where the server 10 is used. Another evaluation score is acquired in descending order (step S41). When there are a plurality of genres input by the user, the visit base list creation unit 13 evaluates each genre for each genre input by the user for a station whose overall evaluation score is not 0 in the area where the server 10 is used. The total score is acquired in descending order. When there is a station having the same genre evaluation score of the genre input by the user, superiority or inferiority is given by the total evaluation score.

  Subsequently, the visiting base list creation unit 13 shuffles the top 30% of the stations acquired in step S41 (step S42).

  Next, the visited base list creation unit 13 determines whether 10 or more stations are included in the top 30% of the stations acquired in step S41 (step S43). If it is determined that there are 10 or more stations included in the upper 30% group, the process proceeds to step S45. If it is determined that the number of stations included in the upper 30% group is less than 10, the process proceeds to step S44.

  When it is determined that there are less than 10 stations included in the upper 30% group (NO in step S43), the visited base list creation unit 13 shuffles the remaining lower 70% groups (step S44). ).

  If it is determined in step S43 that there are 10 or more stations included in the top 30% group (YES in step S43), and if the process is performed in step S44, the visited base list creation unit 13 finally performs shuffle. The top 10 stations after having been performed are numbered sequentially from the top and are included in the station list (step S45).

  That is, except for the case where the route type is route 1 when the genre is input by the user, the visited base list creation unit 13 is information indicating the initial value of the priority order with different rules (standards) for each station list. Depending on the situation, a plurality of stations are classified into a plurality of groups, and the priority order is updated by shuffling stations within the group.

  Next, the visited site determination process in step S7 will be specifically described with reference to the flowchart of FIG.

  Next, the shortest travel time is obtained from the latitude and longitude information of the departure place and the arrival place and the latitude and longitude information of the departure station and the arrival station by the visited base determination unit 14 (step 51). Next, the temporary base time stored in advance is given to the departure station and the arrival station by the visiting base determination unit 14 (step S52). Next, the remaining sightseeing time is obtained by subtracting the value obtained by adding the temporary stay time to the shortest travel time (temporary sightseeing time) from the sightseeing time input by the user by the visiting base determination unit 14, It is determined whether or not there is (step S53). If the remaining sightseeing time is left, the process proceeds to step S54. If there is no remaining sightseeing time, the process proceeds to step S55.

  When the remaining sightseeing time is surplus (YES in step S53), the visiting site determination unit 14 refers to the station parameter and determines whether or not the number of stations proposed to the user has reached the upper limit of the number of stations ( Step S54). If the station number upper limit has not been reached, the process proceeds to step S56. If the station number upper limit has been reached, the process proceeds to step S57.

  If the number of stations proposed to the user has not reached the upper limit of the number of stations (NO in step S54), the visited base determination unit 14 adds the station to the station proposed to the user based on the station list ( Step S55). A predetermined temporary stay time is given to the added station, and the process proceeds to step S53. In step S <b> 55, the visited base determination unit 14 adds one station with a higher priority in the station list to stations proposed to the user.

  If there is no remaining sightseeing time (NO in step S53) and the number of stations proposed to the user has reached the upper limit of the number of stations (YES in step S54), the visiting base determination unit 14 causes the remaining sightseeing time to be exceeded. Then, distribution is performed at a distribution rate that is associated in advance with the priority order of the proposed stations (step S56).

  Next, the visit spot proposal process in step S8 will be specifically described with reference to the flowchart of FIG.

  The spot information acquisition unit 15 and the visit spot list creation unit 16 perform a visit spot list creation process (step S61). Subsequently, the visit spot determining unit 17 performs a visit spot determining process (step S62).

  The visit spot list creation process in step S61 will be specifically described with reference to the flowchart of FIG. Hereinafter, an example in which a visited spot list is created based on the spot information shown in FIG. 18 when a genre is not input by the user will be described.

  First, the spot information acquisition unit 15 acquires spot information related to a visit spot corresponding to a station proposed to the user (step S71).

  Next, as shown in FIG. 19, the visited spot list creation unit 16 classifies the visited spots according to the priority of the visited spots (information indicating the initial value of the priority order) (step S72). Subsequently, as shown in FIG. 20, the visited spot list creation unit 16 creates a plurality of visited spot lists by rearranging by changing the shuffle range for each route (step S73). . Subsequently, the visit spot list creation unit 16 passes the created plurality of visit spot lists to the visit spot determination unit 17 (step S74).

  As a result, the top spot in the visited spot list is sequentially extracted as visited spots. For example, if it is route 1, the visited spot determination unit 17 extracts spot ID1 first, spot ID3 second, and spot ID2 third.

  Next, an example of a rule when changing the range for shuffling for each route will be described in detail. Since the shuffle range can be changed flexibly, it can also be changed. In the following, the rules for shuffling are “no genre designation in an area with 3 priority evaluations”, “genre designation in an area with 3 priority evaluations”, and “10 priority evaluations”. The description will be divided into four categories: “no genre designation in a certain area” and “with genre designation in an area with 10 priority evaluations”.

  In “No genre designation in an area with three priority evaluations”, as shown in FIG. 21A, the visit spots are classified into (1) to (3) for each priority. . In route 1 and route 2, the visiting spots belonging to (1) to (3) are classified as separate groups, and shuffle is performed within each group. In route 3, the visiting spots belonging to (1) and (2) are classified into the same group, and the visiting spots belonging to (3) are classified into different groups, so that shuffling is performed within each group. Is called.

  In “There is a genre designation in an area where priority evaluation is in three stages”, as shown in FIG. 21B, the visit spot has the same priority as the genre input by the user. If they match, they are classified one level higher. That is, the visit spot is classified into (1) to (6) based on the genre input by the user. In route 1, the visiting spots belonging to (1) to (6) are classified into different groups, and shuffling is performed within each group. In route 2, the visit spots belong to (1), (2) visit spots belonging to (3), (4) visit spots belonging to (5), and (6) A combination of visiting spots is classified into four groups, and shuffling is performed within each group. In route 3, a visit spot is a combination of a visit spot belonging to (1), (2) and (3), a visit spot belonging to (4) and (5), and a visit spot belonging to (6). It is classified into three groups, and shuffle is performed within each group.

  In “no genre designation in an area with 10 priority evaluations”, as shown in FIG. 21C, the visit spots are classified into (1) to (10) for each priority. . In route 1, the visiting spots belonging to (1) to (10) are classified as different groups, and shuffle is performed within each group. In route 2, (1) Visit spots belonging to (2), (3) Visit spots belonging to (4), Visit spots belonging to (5) to (9), belonging to (10) A combination of visiting spots is classified into four groups, and shuffling is performed within each group. In route 3, visit spots belonging to (1) to (3), visit spots belonging to (4) to (6), visit spots belonging to (7) to (9), and (10) The combinations of the visiting spots belong to each group are classified into four groups, and shuffling is performed within each group.

  In “There is a genre designation in an area where the priority evaluation is in 10 stages”, as shown in FIG. 21D, the visit spot has the same priority as the genre input by the user. If they match, they are classified two levels higher. That is, the visit spot is classified into (1) to (20) based on the genre input by the user. In route 1, the visiting spots belonging to (1) to (20) are classified as separate groups, and shuffle is performed within each group. In route 2, a visit spot belonging to (1), a visit spot belonging to (2) and (3), a visit spot belonging to (4) to (7), and belonging to (8) to (11) A combination of a visit spot belonging to (12) to (15), a visit spot belonging to (16) to (19), and a visit spot belonging to (20). Classified and shuffled within each group. In route 3, visit spots belonging to (1) to (5), visit spots belonging to (6) to (11), visit spots belonging to (12) to (19), and (20) The combinations of the visiting spots belong to each group are classified into four groups, and shuffling is performed within each group.

  That is, the visit spot list creation unit 16 classifies a plurality of visit spots into a plurality of groups according to information indicating the initial value of the priority order according to different rules for each visit spot list to be created. The priority order is updated by shuffling.

  Next, the visit spot determination process in step S62 will be specifically described with reference to the flowchart of FIG.

  First, the departure spot and the arrival place associated with the station are determined by the visit spot determination unit 17 (step S81). Subsequently, a spot stay time and the like at each visit spot are determined by the visit spot determination unit 17 (step S82). The visit spot determining unit 17 determines the order of movement of the visit spots that have the shortest travel time by the tabu search method (step S83). The remaining block is obtained by subtracting, from the block stay time given to the station, a value (temporary sightseeing time) obtained by adding the total spot stay time of the visit spots already determined by the visit spot determining unit 17 to the shortest travel time. The stay time is obtained, and it is determined whether or not the remaining block stay time is greater than a predetermined value (step S84).

  If the remaining block stay time is greater than the predetermined value (YES in step S84), the visited spot determination unit 17 adds the visited spot to the visited spot proposed to the user based on the visited spot list (step S85). ). A predetermined spot stay time is given to the added station, and the process proceeds to step S83. If the remaining block stay time is less than the predetermined value (NO in step S84), the visited spot determination process ends.

  Next, the operation and effect of the server 10 according to the present embodiment will be described.

  The server 10 determines the station to be proposed to the user based on the information indicating the travel cost, and the visiting site determination unit 14 that determines the station to be proposed to the user. And a visit spot determining unit 17 for determining a proposed visit spot.

  For this reason, a station to be proposed to the user is determined based on the information indicating the movement cost, and a visit spot to be proposed to the user is determined for each proposed station from the visit spot corresponding to the station. Therefore, when a plurality of moving means different from each other for movement between a plurality of stations and movement between a plurality of visit spots are used, it is possible to make a proposal that incorporates a plurality of visit spots at a plurality of stations in a balanced manner. For example, when a user selects a train and a walk as a means of transportation, guidance can be realized such that the user moves between stations by train and also moves from the station to a visit spot on foot. That is, in consideration of a case where a plurality of moving means having different action ranges are used, it is possible to propose a variety of visiting spots.

  The visited base determination unit 14 proposes a station to the user based on the comprehensive evaluation score or genre evaluation score (information indicating the initial value of the priority order) of the plurality of stations stored in advance and the information indicating the movement cost. Is determined. Therefore, since the visit spot is proposed reflecting the overall evaluation score of the station or the evaluation score by genre, a route with high user satisfaction can be proposed. For example, when the user selects a train and a walk as a means of transportation, guidance can be realized in which the user moves on foot to a visit spot associated with each station after moving to a station with a high overall evaluation score. Stations with many high-value visit spots are selected.

  The visiting base determining unit 14 determines a station to be visited by the user based on information indicating the priority order of the stations included in the station list created by the visiting base list creating unit 13. For each station list to be created, the visited base list creation unit 13 classifies the plurality of stations into a plurality of groups according to the total evaluation score of the plurality of stations or the evaluation score by genre (information indicating the initial value of the priority order). By updating the priority order of a plurality of stations in the group in at least one of the plurality of groups, a plurality of station lists including information indicating the priority order of a plurality of different stations are created. For this reason, a station rich in variations can be proposed without special setting by the user while reflecting the overall evaluation score of the station or the evaluation score by genre. That is, a variety of visiting spots that match the user's situation and preferences can be proposed.

  The visited base determination unit 14 prohibits the distance between the stations included in the proposed station (movement cost) from being outside the predetermined range. For this reason, the frequency | count of a change of a moving means and a user's moving distance can be made into an appropriate value. For example, even when a visit spot that can be walked from the departure point or arrival point is guided to use the station, or a station that is far from the departure point and arrival point is selected by using the full allowable time. Can be resolved.

  The visited base determination unit 14 prohibits a station that exceeds a predetermined number associated with the above-described allowable time from being included in the proposed station. For this reason, the frequency | count of a change of a moving means can be made into the appropriate value corresponding to permissible time.

  The visiting base determination unit 14 determines a station to be proposed based on information indicating the initial values of the priority order of a plurality of stations associated with the attribute input by the user. For this reason, the station reflecting the user's preference can be selected for the genre of the visited spot and the like. For example, when the user selects a genre of an art museum, Roppongi with many art museums may be selected as a station that is proposed to the user with priority.

  When the proposed station includes the first station and the second station having a higher priority order than the first station, the visit spot determining unit 17 determines the first station from the block stay time determined for the first station. The remaining block stay time is calculated by subtracting the time to visit all the proposed visit spots. Furthermore, the visit spot determination part 17 determines the visit spot proposed about the 2nd station based on the time which added the remaining block stay time to the block stay time determined with respect to the 2nd station. That is, the remaining block stay time in the determination of the visit spot in the block belonging to the station with the lower priority order is added to the block stay time for visiting the visit spot in the block belonging to the station with the higher priority order. Therefore, a highly satisfactory route guidance using time effectively can be realized.

  The server 10 generates a plurality of visit spot lists each including information indicating the priority order of a plurality of visit spots, and information indicating the priority order for each of the plurality of visit spot lists. And a visit spot determining unit 17 for determining a visit spot to be proposed to the user. The visited spot list creation unit 16 classifies a plurality of visited spots into a plurality of groups according to information indicating the initial value of the priority order for each visited spot list to be created, and includes at least one of the plurality of groups within the group. By updating the priority order, a plurality of visited spot lists including information indicating different priority orders are created.

  Since the priority set in advance is reflected in the visit spot, a spot having a high value as a visit spot such as a visit spot that the user has heard can be proposed. Since the priority order is updated, even if the user inputs the same condition, the search results are not always the same. That is, even if the user searches under the same conditions, it is possible to propose a variety of visiting spots. Since a plurality of visited spot lists including information indicating different priority orders are created, a plurality of routes having diversity can be proposed at a time. That is, a variety of visiting spots that match the user's situation and preferences can be proposed.

  The visit spot list creation unit 16 classifies visit spots having higher priority than any of the visit spots classified into another group into a predetermined group. That is, since the priority order of the visit spots classified in groups is different, even if the priority order is updated in each group, the priority of the visit spots set in advance is easily reflected. For this reason, there is a high possibility that a spot having a high value as a visit spot, such as a visit spot that the user has heard, is proposed.

  The visiting spot list creation unit 16 classifies the plurality of visiting spots into a plurality of groups according to information indicating the initial value of the priority order according to different criteria depending on the visiting spot list to be created. In other words, the visited spot list creating unit 16 changes a group for classifying a plurality of visited spots according to the created visited spot list. For example, the visit spot list creation unit 16 varies the number of visit spots classified into a predetermined group (first group) depending on the visit spot list to be created. In this case, since the combinations of visit spots classified into groups differ depending on the visit spot list, visit spots with more variations can be proposed at a time.

  The visiting spot list creation unit 16 updates the priority order by randomly replacing the visiting spots in the group in at least one of the plurality of groups. For this reason, even under the same conditions, it is possible to propose a variety of visiting spots with a simple configuration.

  The visiting spot determination unit 17 classifies the plurality of visiting spots into the plurality of groups described above based on the information input by the user and the information indicating the initial value of the priority order of the visiting spots. For example, the visiting spot list creation unit 16 sets the initial value of the priority order of visiting spots corresponding to the attribute input by the user higher than the initial value of the priority order of visiting spots not corresponding to the attribute input by the user. The plurality of visiting spots are classified into the plurality of groups described above according to the information indicating the initial value of the priority order. For this reason, the visit spot reflecting the user's preference can be proposed for the genre and the like of the visit spot.

  Each of the plurality of visited spot lists includes information indicating the priority order of the plurality of visited spots located in the area associated with the above-described allowable time. That is, a visit spot that is too far from the departure point and the arrival point is excluded from the target to be proposed to the user. Thus, a visit spot located at a distance that matches the allowable time entered by the user may be proposed. For example, even if there are a plurality of medium-priority visit spots in the vicinity, only one high-priority visit spot that can be visited in the shortest allowable time is proposed. That is, a route that can visit a plurality of visited spots within a range that the user can walk within an allowable time input by the user can be proposed.

  In addition, the block diagram used for description of the said embodiment has shown the block of the functional unit. These functional blocks (components) are realized by any combination of hardware and / or software. Further, the means for realizing each functional block is not particularly limited. That is, each functional block may be realized by one device physically and / or logically coupled, and two or more devices physically and / or logically separated may be directly and / or indirectly. (For example, wired and / or wireless) and may be realized by these plural devices.

  For example, the server in one embodiment of the present invention may function as a computer that performs the processing of the present invention. FIG. 22 is a diagram illustrating an example of a hardware configuration of a server according to an embodiment of the present invention. The server 10 described above may be physically configured as a computer device including a processor 1001, a memory 1002, a storage 1003, a communication device 1004, an input device 1005, an output device 1006, a bus 1007, and the like.

  In the following description, the term “apparatus” can be read as a circuit, a device, a unit, or the like. The hardware configuration of the server 10 may be configured to include one or a plurality of devices illustrated in the figure, or may be configured not to include some devices.

  Each function in the server 10 is performed by reading predetermined software (program) on hardware such as the processor 1001 and the memory 1002, so that the processor 1001 performs an operation and performs communication by the communication device 1004 and in the memory 1002 and the storage 1003. This is realized by controlling reading and / or writing of data.

  For example, the processor 1001 controls the entire computer by operating an operating system. The processor 1001 may be configured by a central processing unit (CPU) including an interface with peripheral devices, a control device, an arithmetic device, a register, and the like. For example, the visiting site determination unit 14 may be realized by the processor 1001.

  Further, the processor 1001 reads a program (program code), software module, and data from the storage 1003 and / or the communication device 1004 to the memory 1002, and executes various processes according to these. As the program, a program that causes a computer to execute at least a part of the operations described in the above embodiments is used. For example, the visit spot determination unit 17 of the server 10 may be realized by a control program stored in the memory 1002 and operated by the processor 1001, and may be realized similarly for other functional blocks. Although the above-described various processes have been described as being executed by one processor 1001, they may be executed simultaneously or sequentially by two or more processors 1001. The processor 1001 may be implemented by one or more chips. Note that the program may be transmitted from a network via a telecommunication line.

  The memory 1002 is a computer-readable recording medium and includes, for example, at least one of ROM (Read Only Memory), EPROM (Erasable Programmable ROM), EEPROM (Electrically Erasable Programmable ROM), RAM (Random Access Memory), and the like. May be. The memory 1002 may be called a register, a cache, a main memory (main storage device), or the like. The memory 1002 can store a program (program code), a software module, and the like that can be executed to perform the method according to the embodiment of the present invention.

  The storage 1003 is a computer-readable recording medium such as an optical disk such as a CD-ROM (Compact Disc ROM), a hard disk drive, a flexible disk, a magneto-optical disk (for example, a compact disk, a digital versatile disk, a Blu-ray (Registered trademark) disk, smart card, flash memory (for example, card, stick, key drive), floppy (registered trademark) disk, magnetic strip, and the like. The storage 1003 may be referred to as an auxiliary storage device. The storage medium described above may be, for example, a database, server, or other suitable medium including the memory 1002 and / or the storage 1003.

  The communication device 1004 is hardware (transmission / reception device) for performing communication between computers via a wired and / or wireless network, and is also referred to as a network device, a network controller, a network card, a communication module, or the like. For example, the user input information acquisition unit 11 and the like may be realized by the communication device 1004.

  The input device 1005 is an input device (for example, a keyboard, a mouse, a microphone, a switch, a button, a sensor, or the like) that accepts an external input. The output device 1006 is an output device (for example, a display, a speaker, an LED lamp, etc.) that performs output to the outside. The input device 1005 and the output device 1006 may have an integrated configuration (for example, a touch panel).

  Each device such as the processor 1001 and the memory 1002 is connected by a bus 1007 for communicating information. The bus 1007 may be configured with a single bus or may be configured with different buses between apparatuses.

  The server 10 includes hardware such as a microprocessor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a programmable logic device (PLD), and a field programmable gate array (FPGA). Some or all of the functional blocks may be realized by the hardware. For example, the processor 1001 may be implemented by at least one of these hardware.

  Although the present invention has been described in detail above, it will be apparent to those skilled in the art that the present invention is not limited to the embodiments described herein. The present invention can be implemented as modified and changed modes without departing from the spirit and scope of the present invention defined by the description of the scope of claims. Therefore, the description of the present specification is for illustrative purposes and does not have any limiting meaning to the present invention.

  The server 10 may not include the visited site information acquisition unit 12, the visited site list creation unit 13, and the visited site determination unit 14. In this case, the server 10 does not determine the station, the spot information acquisition unit 15 acquires spot information of the visit spots located in a predetermined range associated with the sightseeing time input by the user, and creates a visit spot list The part 16 and the visit spot determination part 17 determine a plurality of visit spots to be proposed to the user by the method described above. For example, when a train is not included in the means of transportation input by the user, a plurality of visiting spots proposed to the user may be determined as described above.

  The user terminal 20 may be a computer connected to the Internet. In this case, the current location is not acquired by GPS, and a plurality of visiting spots are proposed based on the departure point or arrival point input by the user.

  The determination method of the station and the visit spot proposed to the user is not necessarily limited to the above, and any determination method may be used as long as the priority order of the station and the visit spot is used.

  Each aspect / embodiment described herein includes LTE (Long Term Evolution), LTE-A (LTE-Advanced), SUPER 3G, IMT-Advanced, 4G, 5G, FRA (Future Radio Access), W-CDMA. (Registered trademark), GSM (registered trademark), CDMA2000, UMB (Ultra Mobile Broadband), IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20, UWB (Ultra-WideBand), The present invention may be applied to a Bluetooth (registered trademark), a system using another appropriate system, and / or a next generation system extended based on the system.

  As long as there is no contradiction, the order of the processing procedures, sequences, flowcharts, and the like of each aspect / embodiment described in this specification may be changed. For example, the methods described herein present the elements of the various steps in an exemplary order and are not limited to the specific order presented.

  Input / output information and the like may be stored in a specific location (for example, a memory) or may be managed by a management table. Input / output information and the like can be overwritten, updated, or additionally written. The output information or the like may be deleted. The input information or the like may be transmitted to another device.

  Information, signals, etc. described herein may be represented using any of a variety of different technologies. For example, data, commands, commands, information, signals, bits, symbols, chips, etc. that may be referred to throughout the above description are voltages, currents, electromagnetic waves, magnetic fields or magnetic particles, light fields or photons, or any of these May be represented by a combination of

  As used herein, the terms “system” and “network” are used interchangeably.

  In addition, information, parameters, and the like described in this specification may be represented by absolute values, may be represented by relative values from a predetermined value, or may be represented by other corresponding information. . For example, the radio resource may be indicated by an index.

  As used herein, the terms “determining” and “determining” may encompass a wide variety of actions. “Judgment”, “decision” can be, for example, calculating, computing, processing, deriving, investigating, looking up (eg, table, database or another (Searching in the data structure), and confirming (ascertaining) what has been confirmed may be considered as “determining” or “determining”. In addition, “determination” and “determination” include receiving (for example, receiving information), transmitting (for example, transmitting information), input (input), output (output), and access. (accessing) (e.g., accessing data in a memory) may be considered as "determined" or "determined". In addition, “determination” and “decision” means that “resolving”, “selecting”, “choosing”, “establishing”, and “comparing” are regarded as “determining” and “deciding”. May be included. In other words, “determination” and “determination” may include considering some operation as “determination” and “determination”.

  As used herein, the phrase “based on” does not mean “based only on,” unless expressly specified otherwise. In other words, the phrase “based on” means both “based only on” and “based at least on.”

  Any reference to elements using the designations "first", "second", etc. as used herein does not generally limit the amount or order of those elements. These designations can be used herein as a convenient way to distinguish between two or more elements. Thus, a reference to the first and second elements does not mean that only two elements can be employed there, or that in some way the first element must precede the second element.

  As long as the terms “include”, “including”, and variations thereof, are used in the specification or claims, these terms are inclusive of the term “comprising”. Intended to be Furthermore, the term “or” as used herein or in the claims is not intended to be an exclusive OR.

  Throughout this disclosure, the plural is included unless the context clearly indicates one.

DESCRIPTION OF SYMBOLS 10 ... Server, 11 ... User input information acquisition part, 15 ... Spot information acquisition part, 16 ... Visit spot list preparation part, 17 ... Visit spot determination part, 18 ... Visit spot output part

Claims (8)

A spot information acquisition unit for acquiring spot information including information on a plurality of visited spots and including information indicating an initial value of a priority order;
A visit spot list creation unit for creating a plurality of visit spot lists each including information indicating a priority order of the plurality of visit spots;
For each of the plurality of visited spot lists, based on information indicating the priority order, a visited spot determining unit that determines a visited spot proposed to the user;
A visit spot output unit that outputs the determined proposed visit spot, and
The visiting spot list creating unit classifies the plurality of visiting spots into a plurality of groups according to information indicating an initial value of the priority order in at least one of the visiting spot lists to be created, A visited spot suggestion system that creates a plurality of visited spot lists including information indicating the different priority orders by updating the priority order in the group in at least one. The plurality of groups includes first and second groups;
Each of the visited spots classified in the first group has a higher priority order than the visited spots classified in the second group;
The visited spot list creation unit creates a plurality of visited spot lists including information indicating the different priority orders by updating the priority order in the group in at least one of the first and second groups. The visiting spot suggestion system according to claim 1.   The visit spot list creation unit classifies the plurality of visit spots into a plurality of groups according to information indicating an initial value of the priority order according to a criterion different depending on the visit spot list to be created. Visit spot suggestion system described.   The visited spot suggestion system according to claim 2 or 3, wherein the visited spot list creation unit varies the number of the visited spots classified into the first group depending on the created visit spot list.   5. The visit spot list creation unit updates the priority order by randomly replacing the visit spots in the group in at least one of the plurality of groups. 6. Visit spot suggestion system. A user input information acquisition unit for acquiring an attribute input by the user;
The spot information includes attributes of the plurality of visited spots,
The visit spot list creation unit assigns the plurality of visit spots to the plurality of groups according to information indicating an attribute input by the user and an initial value of the priority order in at least one of the visit spot lists to be created. The visit spot suggestion system according to any one of claims 1 to 5, which is classified into: The visited spot list creating unit sets an initial value of the priority order of visited spots corresponding to an attribute input by the user to an initial value of the priority order of visited spots not corresponding to the attribute input by the user. Increase
The visit spot suggestion system according to claim 6, wherein, in at least one of the visit spot lists to be created, the plurality of visit spots are classified into the plurality of groups according to information indicating an initial value of the priority order. A user input information acquisition unit configured to acquire information indicating an allowable time allowed for the user to visit the plurality of visited spots, which is input by the user;
The spot information includes position information of the visited spot,
The visit according to any one of claims 1 to 7, wherein each of the plurality of visit spot lists includes information indicating a priority order of a plurality of visit spots located in an area associated with the allowable time. Spot suggestion system.

Images