JP2008190899A - Meeting place determination system, meeting place determination method, and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To select a meeting place having the same degree of each moving load to all members. <P>SOLUTION: In the case of a necessary time, a candidate station selection part 31 selects a station having the same degree of each necessary time from all the members by using a retrieval service of a bus route retrieval 41, an electric train route retrieval 424 and position information retrieval 43. Then, a waiting station determination part 32 determines the optimum station by parameters such as the number of transfer times, a last train time, existence of entraining/detraining, the number of stores, and the number of ticket gates. Thereafter, a waiting place such as a ticket gate or a store is determined by a similar method. <P>COPYRIGHT: (C)2008,JPO&INPIT

Description

  The present invention selects a plurality of places where the load on each member's access is the same, and uses the plurality of parameters in consideration of the convenience of transportation to select the optimum station and its meeting place such as the ticket gate. It relates to the technology to be determined.

  Conventionally, when a representative determines a meeting place of a plurality of people (for example, a station), it takes time and effort to determine an appropriate place. To solve these problems,

  As in Patent Document 1 and Patent Document 2, a method of automatically determining a meeting place is considered.

  In Patent Document 1, the load until each member goes to the meeting place is measured by the required time and distance, and the meeting place is determined by dividing according to the priority.

In Patent Document 2, the number of times a member uses a station is used to select a candidate station for meeting. Here, the total number of times the station is used by all the members is summed up, and the station with the highest number of uses is set as a candidate station for meeting, and then the meeting station is determined in consideration of the fare and the like.
JP 2004-294342 A JP 2006-24194 A

However, the prior art of Patent Document 1 has the following problems.
The first problem is that the accessibility to the meeting place is not considered. The reason is that only the required time and distance are considered in determining the meeting place. For this reason, there arises a problem that the meeting place is set at a place far from the station.

  The second problem is that the total time required from the departure point to the destination is not considered. The reason is that only a single moving means is considered in calculating the required time. For this reason, even if the required time on the train is divided by priority, if there is a large difference in travel time from the departure place to the nearest station, the priority is not meaningful.

Further, the prior art of Patent Document 2 has the following problems.
The first problem is that the load for each member to go to the meeting station varies. The reason is that the number of times the station is used by each member varies. For example, it is assumed that the breakdown of each member of the station where the number of times of use of the station is maximized is 10 times for Mr. A, 9 times for Mr. B, and 1 time for Mr. C. In this case, a station that has been used only once for C will be determined as the meeting station. Since the number of times of use of the station is used at the time of selection of the candidate station, even if the fare is considered after that, the variation in the load remains.

  The second problem is that it is necessary to separately specify a meeting ticket gate and a meeting place. The reason is that only the meeting station is considered. Eventually, it is necessary to specify the ticket gate and meeting place.

  The present invention has been made to solve the above-described problems. The purpose is to select a meeting place with the same moving load for all members.

The present invention is a meeting place determination system that supports selection of meeting places of a plurality of members,
The time required from each member's departure point and / or transportation costs are used as parameters.
Furthermore, the present invention provides a meeting place determination system that supports selection of a meeting place using the convenience of each member as a parameter.

Further, the present invention is a meeting place determination method for supporting selection of meeting places of a plurality of members,
The time required from each member's departure point and / or transportation costs are used as parameters.
Furthermore, the present invention provides a meeting place determination method that supports selection of a meeting place using the convenience of each member as a parameter.

  According to the present invention, it is possible to select a meeting place with a similar moving load for all members.

  Hereinafter, a first embodiment of the present invention will be described in detail with reference to the drawings.

  Referring to FIG. 1, a meeting place determination system according to the present embodiment includes a representative mobile phone 1 having a right to determine a meeting place, a meeting place determination device 2, the Internet 5, and a member mobile phone 6. It is configured.

  The member's mobile phone 6 is used when obtaining member information such as boarding / exiting station history and receiving meeting information.

  The meeting place determination device 2 includes a meeting place determination server 3 and various search services 4 on the Web.

  The meeting place determination server 3 includes a candidate station selection unit 31, a meeting station determination unit 32, a ticket gate determination unit 33, member information 34, station information 35, and candidate station related information 36. The candidate station related information 36 is information created by the meeting station determination unit 32.

  In the candidate station selection unit 31, a station is selected that has the same required time from the departure point or load of transportation expenses. The selected candidate station is transmitted to the meeting station determination unit 32.

  In the member information 34, the nearest station (train) of the member, home position information, and boarding / exiting station history are recorded.

  The meeting station determination unit 32 determines an optimum meeting station using the information of the station information 35 and the candidate station related information 36. In the station information 35, the ticket gate name and the degree of congestion before the ticket gate are recorded. In the candidate station related information 36, in addition to the unique information for each member for the candidate station selected by the candidate station selection unit 31, the number of shops near the candidate station and the number of ticket gates are recorded.

  Thereafter, using the information of the station information 35 and the store information search 44, the ticket gate determination unit 33 determines an optimal ticket gate.

  The bus route search 41 is assumed to be a search engine that inputs a departure station, an arrival station (assuming a train station in the present embodiment), and a departure time, and outputs the arrival time to the arrival station and the transportation cost.

  The train route search 42 is assumed to be a search engine that outputs the arrival time at the arrival station, the number of transfers, the transportation cost, and the last train guidance if the departure station, arrival station, and estimated arrival time are input.

  The position information search 43 receives a bus stop, a station, an address, etc. and returns position information composed of latitude and longitude. In addition, it has a function of outputting the distance by inputting the position information between the two points.

  The store information search 44 is assumed to be a search engine that inputs the purpose, station name, and ticket gate and returns the number of surrounding stores as an output. In addition, various store information (budget, non-smoking / smoking, menu, presence / absence of signs, etc.) is provided.

  Next, the operation of the present embodiment will be described in detail with reference to FIG. In this embodiment, the load index from the departure place to the meeting station is described as the required time.

  First, a representative such as a secretary inputs a meeting date, a meeting time, a purpose, a candidate station selection condition and a member to be waited for on the initial screen as shown in FIG. 7, and presses a “candidate station search” button. In this embodiment, “drinking party” is selected for the purpose, and “required time” is selected as the candidate station selection condition. In this embodiment, it is assumed that Mr. Tanaka is the representative.

  Thereafter, the input content is transmitted to the meeting place determination server 3 through the Internet 5 of FIG. On the day of the meeting, it is assumed that the member will depart from his home, and the following talk will proceed. In addition, when it is written as the nearest station, it is assumed that it represents the nearest train station from the departure place of the member unless otherwise specified.

  Next, a process for selecting a waiting candidate station by the candidate station selection unit 31 of FIG. 1 will be described. FIG. 2 shows the flowchart of the candidate station selection unit 31 in detail.

  First, in S101, the set time input from the mobile phone is acquired.

  The member's home departure time is obtained by subtracting 20 minutes from the set time in S102. The drawing time may be changed according to the situation.

  Subsequently, in S103, the nearest station arrival time when leaving the home at the set departure time is calculated. It is assumed that the nearest station is stored in advance in the member information 34 and is referred to by the candidate station selection unit 31. As shown in FIG. 6, the member information 34 stores the name, the nearest station, home position information, and the boarding / exiting stations so far. In this embodiment, it is assumed that the member has a mobile phone with a bidding function, and when the member passes the ticket gate, the boarding / exiting history is accumulated in the mobile phone 6. It is assumed that this boarding / exiting history is periodically transmitted to the member information 34.

  FIG. 3 is a flowchart of the process in S103. First, in S201, it is determined whether the member can walk to the nearest station. For this determination, the travel distance between the member's home and the nearest station is checked by the position information search 44, and the required time on foot is calculated. The walking speed shown in FIG. 4 is used to calculate the required time. For example, if -10 minutes is considered as one guideline and you can walk to the nearest station within 10 minutes on foot, then add the required time to your home departure time and make it the nearest station arrival time. move on. Note that the criterion of 10 minutes may be changed.

  In S203, the bus route search 41 checks whether there is a bus to the nearest station. If not found, the process proceeds to S204, where the travel distance from the home to the nearest station is checked by the position information search 44, and the required time by bicycle is calculated. The required time is calculated using the speed of the bicycle shown in FIG. Here, as in the above case, the time obtained by adding the required time by bicycle to the departure time is taken as the nearest station arrival time.

  If there is a bus to the nearest station, the process proceeds to S205. First, the nearest bus stop is searched from the position information search 44. Then, the time of arrival from the home to the nearest bus stop is added to the home departure time to obtain the time of arrival at the bus stop. Then, a bus that can be ridden is determined from the bus route search 41 with the arrival time at the bus stop as the departure time, and the nearest station arrival time when the bus is taken is calculated. Thus, the nearest station arrival time is determined in step S103.

  Next, in S104 of FIG. 2, a train route search 42 is used to search for stations that can arrive between the set time −10 minutes and the set time. At this time, the train route search 42 is used with the nearest station arrival time as the departure time. At this time, the position information search 43 may be used to set a station within 100 km from the home as a survey target station. Of course, the value of 100 km may be changed.

  A search is sequentially performed using the train route search 42 with the survey target station as the meeting station and the nearest station as the departure station, and a meeting station that can arrive between the set time −10 minutes and the set time is searched.

  The above steps S103 to S104 are repeated by the number of members.

  Thereafter, in S105, a station where all members can arrive between the set time of -10 minutes and the set time is checked, and if there is, the station is set as a candidate station. If not found, the home departure time is advanced by 10 minutes in S107, and the process of S103 is performed again. If the nearest station arrival time> set time−10 minutes, the process exits the loop and proceeds to the processing of S107.

  As described above, a plurality of stations (or even one station) from which all members can come near the set time are selected and set as candidates for the meeting station. When the candidate station is decided, the representative mobile phone is switched to a screen as shown in FIG. Then, the selected candidate station is transmitted to the meeting station determination unit 32.

  Then, the process of the meeting station determination part 32 is demonstrated. The meeting station determination unit 32 uses a plurality of parameters to narrow down candidate stations to one.

  First, information on candidate stations and information depending on members are gathered, and station-related information 36 is created. As shown in FIG. 10, the contents are a summary of the number of transfer times of members when using candidate stations, the last train time, boarding / departure history, and the number of target stores and ticket gates around the station, which are station-specific information. is there. The train route search 42 is searched for the number of transfers and the last train time, the member information 34 is searched for the boarding history, and the store information search 44 is searched for the target number of stores.

  Here, a method of determining a meeting station from candidate stations will be described using the table of FIG. Here, the number of transfers, the last train time, boarding / exiting history, the number of stores, and the number of ticket gates were used as parameters for determining the meeting station. All parameters other than “number of stores” are parameters related to the convenience of transportation. In this embodiment, since the purpose of gathering is also conscious, the number of stores that meet the purpose is selected as one of the parameters. Indices should be small in terms of the number of transfers, preferably late at the last train, better with a boarding history, more stores, and fewer ticket gates from the standpoint of meeting. .

  The table of FIG. 11 summarizes the parameters for each station from the table of FIG. The upper table of FIG. 11 shows the case where each parameter is not superior or inferior. In this case, parameters were compared between candidate stations, and point 1 was given to the best station. Explaining the table, the number of transfers is the sum of the number of transfers of each member for each station, and Shinjuku is the fewest and the best. The last train time is the earliest time of each member at each station. As for the boarding / exiting history, the total was obtained for each station, with 1 when the member got on and off and 0 when no member got on or off.

  Since all the members (three people in this embodiment) have boarded / exited Shinjuku Station from the member information of FIG. 6, the numerical value of the Shinjuku boarding / exiting history of FIG. 11 is “3”. Incidentally, the shaded portions in FIG. 11 indicate that the values are the best. In the case of FIG. 11, based on the above-mentioned index, Shinjuku is the best in the “number of transfers”, “getting-on / off history”, and “number of stores”, and a total of 3 points are acquired, and Shinjuku Station is selected as the meeting station.

  Next, the case where the superiority or inferiority of the parameters is given in the lower table of FIG. 11 will be described. When the priority of a certain parameter is increased with the parameter selection radio button in the screen example of FIG. 8, 5 is assigned to the station with the best parameter instead of 1.

  FIG. 8 shows a case where priority is given to the last train time, and points are given as shown in the lower table of FIG. That is, the Jujo station with the best parameter for the last train time gets 5 points, and the total number of points for each station is the highest. Therefore, Jujo Station is selected as the meeting station. From then on, Jujo will proceed as a meeting station.

  Next, a method for determining the meeting place will be described. In this embodiment, a ticket gate is assumed as a meeting place. Therefore, here, the process of determining the ticket gate from the selected meeting station will be described.

The ticket gate determination unit 33 determines a ticket gate from the degree of congestion before the ticket gate for each ticket gate and the number of target stores near the ticket gate. The degree of congestion before the ticket gate is acquired from the station information 35, and the number of target stores near the ticket gate is acquired from the store information search 44. As a reference example of the degree of congestion described in the station information, a reference as shown in FIG. 13 can be considered. A method of measuring the number of people per 1 m ² using a pressure sensor, a wide-angle camera, or the like is conceivable for measuring the congestion state. In this embodiment, it is assumed that the degree of congestion every hour is measured and updated to the station information 35.

  In this embodiment, since Jujo Station is selected as the meeting station, FIG. 12 shows the number of stores and the degree of congestion for each ticket gate of Jujo Station. In FIG. 12, the number of stores at the north exit is 4, the degree of congestion is 1, the number of stores at the south exit is 1, and the degree of congestion is 2. The value in parentheses beside the numerical value is the ratio when the sum of each parameter is 1. The number of stores and the percentage of congestion are added, and the ticket gate with the highest total is set as the waiting ticket gate.

  In FIG. 12, the north exit is “1.13” and the south exit is “0.86”, and the north exit is a meeting ticket gate. In addition, when determining a ticket gate, superiority or inferiority may be given between parameters in the same manner as when a meeting station is determined.

  The meeting station and the ticket gate are determined by the above method, and a screen as shown in FIG. 9 is displayed on the representative's mobile phone. Thereafter, by pressing the “Send to Member” button, the date of gathering, the gathering time, and the meeting place are sent to the e-mail address of the cellular phone 6 of the member input in FIG.

  In the above embodiment, the discussion has been made on the assumption that the representative uses a mobile phone. However, anything can be used as long as it is connected to the Internet.

  In this embodiment, the discussion was made on the assumption that the meeting member is at home. However, if each member has a mobile phone with a GPS reception function, the current position of the member can be grasped instantaneously. Therefore, it is possible to set the current position as the starting point. Another possible method is to acquire the position information and staying time of the member by GPS, and set the place where the member's staying time is the longest in one week as the departure place.

  Further, when notifying members of the meeting place, the route searched in FIG. 2 may be stored and the optimum route information to the meeting place may be transmitted for each member. As a result, the member can go to the meeting place only with the information received from the representative.

  In this embodiment, buses and trains are assumed as transportation means, but bullet trains, airplanes, and the like may be included.

  According to the present embodiment described above, it is possible to select a meeting place with the same moving load for all members. The reason is that there is no difference in load between a member who is far away from the nearest station and a member who is close to the departure place because the time required from the departure place and transportation costs are taken into consideration.

  In addition, it is possible to select a meeting station that is highly convenient for members. The reason is that the station was selected in consideration of the traffic convenience parameters such as the number of transfers, last train time, boarding / exit history, and number of ticket gates.

  In addition, it is possible to determine meeting places (ticket gates, shops, etc.) that are convenient for the members.

  Next, a second embodiment of the present invention will be described. In the present embodiment, the load index from the departure point to the meeting station is used as the transportation cost. In this embodiment, the departure place is assumed to be a home. The initial screen of the representative is the same as that shown in FIG. 7, and this time, the purpose is drinking and the candidate station selection conditions are transmitted to the meeting place determination server 3 as transportation expenses.

  A block diagram for explaining the present embodiment is shown in FIG. The ticket gate determining unit 33 in FIG. 1 is replaced with a meeting place determining unit 34. A map search 45 is added as a search service to be used. The map search 45 is assumed to be able to display a map around the position information as an input. If position information between two points is input, a route between the two points is displayed and the number of signals between the two points is also output.

  Since the processing up to the station candidate selection unit 31 is the same as that of the first embodiment, a description thereof will be omitted. In this embodiment, the candidate station selection unit 31 selects a candidate station using the transportation cost as an index. This process will be described with reference to the flowchart of FIG.

  First, in S301, the set date input from the mobile phone is acquired.

  In S302, the type of day of the meeting is specified. Then, the departure time is provisionally determined (for example, 18:00), and the cost to meet the candidate station when using the day of the week is calculated as the transportation cost.

  In S303, transportation cost A was initially set at 100 yen. This initial cost may be changed.

  Thereafter, in S304, the transportation cost to the nearest station is calculated (this cost is B). This process is the same as in FIG. 3, and has been described in the previous embodiment. In FIG. 3, the transportation cost is calculated by assuming the transportation cost when using a bus and the transportation cost as 0 yen when using a bicycle or walking. The cost calculated in this way is referred to as transportation cost B to the nearest station.

  In step S305, the train route search 42 is used to search for stations that can be reached within the set transportation expenses. AB in S305 represents the transportation cost of the train. In other words, a station that satisfies A−B <train transportation expenses <A−B + 50 is searched.

  The steps S304 and S305 are repeated for the number of members.

  In S306, if there is a station where all members can arrive within the designated transportation cost, that station is set as a candidate station. If not found, a value obtained by adding 50 yen to the current A value is executed as a new A value from S304 again.

  As a result, a plurality (or even one) of stations where all members can arrive at the same transportation cost are found and set as candidate stations for meeting. When the candidate station is determined, a screen as shown in FIG. 8 is displayed on the representative's mobile phone.

  Next, the candidate station selected by the candidate station selection unit 31 is transmitted to the waiting determination unit 32. Here, the candidate stations are narrowed down to one using the parameters. Since this process is the same as that in the first embodiment, a duplicate description is omitted. After the meeting station is narrowed down to one, the process moves to the meeting place determination unit 34.

  The meeting place determination unit 34 has a function of determining an optimum shop from shops that meet the purpose and transmitting map information of meeting points to the members. First, store information suitable for the purpose is acquired from the store information search 44 from stores around the meeting station. Finally, route information is acquired by the map search 45, and the route from the station to the meeting place is transmitted to the cellular phone 6 of each member.

  In this embodiment, since it is selected for the purpose of drinking party, first, information on drinking shops around the meeting station is acquired from the shop information search 44. A table as shown in FIG. 16 is created based on the acquired store information and the information of the location information search 43 and the map search 45.

  As shown in this table, three parameters were selected to determine the store. The “distance from the station” is acquired from the position information search 45, the “number of signals” is acquired from the map search 45, and the “presence / absence of signboard” is acquired from the store information search 44. The reason why these parameters are selected is that the purpose of the present invention is to determine a location that takes into account the convenience of traffic of members. Therefore, “distance from the station”, “number of signals”, “presence / absence of signboard” were selected from the viewpoint of convenience of transportation.

  The information about the bars around the station according to the present embodiment is as shown in FIG. 16, and each parameter is compared for each store, and point 1 is given to the store with the best value. The criterion for each parameter is that “distance from the station” should be short, “number of signals” should be small, and there should be signboards. In this embodiment, Kurokiya has the best value for “number of signals” and “presence / absence of signboard”, so 2 points are obtained and determined as a meeting place. Incidentally, the shaded portions in gray in FIG. 16 represent the best values. Note that superiority or inferiority may be provided between parameters as shown in the table below in FIG. In addition, “average budget”, “opening time”, etc. may be added as parameters for determining a store, regardless of the “number of intersections” or the convenience of transportation.

  Thereafter, the determined meeting place and map information are displayed on the representative's mobile screen as shown in FIG. Then, by pressing the “Send to Member” button, the meeting date, the meeting time, and the route from the station to the meeting place are transmitted to the e-mail address of the cellular phone 6 of the member input in FIG.

  The above-described embodiment is a preferred embodiment of the present invention, and various modifications can be made without departing from the gist of the present invention. For example, a process for realizing the function of each device may be performed by causing each device to read and execute a program for realizing the function of the meeting place determination device 2 or the meeting place determination server 3 or the like. Further, the program is transmitted to another computer system by a transmission wave via a CD-ROM or magneto-optical disk as a computer-readable recording medium, or via the Internet or a telephone line as a transmission medium. Also good.

It is a block diagram which shows the system configuration | structure of the 1st Embodiment of this invention. It is a flowchart which shows the processing operation of the candidate station selection part of the 1st Embodiment of this invention. It is a flowchart which shows the processing operation of nearest station arrival time calculation of the 1st Embodiment of this invention. It is a speed standard table for every moving means of the 1st embodiment of the present invention. It is a figure which shows the station information of the 1st Embodiment of this invention. It is a figure which shows the member information of the 1st Embodiment of this invention. It is a figure which shows the example of an initial screen of the 1st Embodiment of this invention. It is a figure which shows the example of a screen after candidate station determination of the 1st Embodiment of this invention. It is a figure which shows the example of a waiting place search result display screen of the 1st Embodiment of this invention. It is a figure which shows the candidate station relevant information of the 1st Embodiment of this invention. It is a figure which shows the value of the parameter for every candidate station of the 1st Embodiment of this invention, and an acquisition point. It is a figure which shows the value of the parameter for every ticket gate and the acquisition point of the 1st Embodiment of this invention. It is a figure which shows the congestion degree reference | standard example of the 1st Embodiment of this invention. It is a block diagram which shows the system configuration | structure of the 2nd Embodiment of this invention. It is a flowchart which shows the processing operation of the candidate station selection part of the 2nd Embodiment of this invention. It is a figure which shows the value of the parameter for every shop of the 2nd Embodiment of this invention, and an acquisition point. It is a figure which shows the example of a screen after the waiting place determination of the 2nd Embodiment of this invention.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1, 6 Mobile phone 2 Waiting place determination apparatus 3 Waiting place determination server 4 Search service 5 Internet 31 Candidate station selection part 32 Waiting station determination part 33 Ticket gate determination part 34 Member information 35 Station information 36 Candidate station related information 41 Bus route search 42 Train route search 43 Location information search 44 Store information search

Claims (6)

A meeting place determination system for supporting selection of meeting places of a plurality of members,
The time required from each member's departure point and / or transportation costs as parameters,
Furthermore, the meeting place determination system characterized by supporting selection of the meeting place by using the convenience of each member as a parameter.   2. The meeting place determination system according to claim 1, wherein the convenience of each member is at least one of the number of transfers, the last train time, whether to get on and off, the number of stores, and the number of ticket gates. A meeting place determination method for supporting selection of meeting places of a plurality of members,
The time required from each member's departure point and / or transportation costs are used as parameters.
Furthermore, a meeting place determination method characterized by supporting selection of a meeting place using the convenience of each member as a parameter.   4. The meeting place determination method according to claim 3, wherein the convenience of each member is at least one of the number of times of transfer, the last train time, the presence / absence of boarding / exiting, the number of shops, and the number of ticket gates.   A program for causing a computer system to realize the function according to claim 1.   A program for causing a computer system to realize the function according to claim 2.

Images