JP7410470B2 - Programs and information processing equipment - Google Patents

Description

The present invention relates to a program and an information processing device.

BACKGROUND ART Systems have been known in the past in which transportation agencies determine operation plans (operation schedules).

Regarding this, Patent Document 1 discloses a technology that simulates the operation pattern of each commercial vehicle and determines the optimal operation plan based on the location information and schedule of the commercial vehicle, and reservation information from users. .

Japanese Patent Application Publication No. 10-011628

However, the technology described in Patent Document 1 does not take into account the user's travel cost, and cannot provide transportation services (for example, route search services and transportation operation plans) that take the travel cost into consideration. There wasn't.

The present invention has been made in view of the above problems, and an object thereof is to provide a program and an information processing device that can provide transportation services that take into consideration the travel costs of users.

In order to solve the above-mentioned problems, a program according to a first aspect of the present invention includes a computer for receiving input information including at least a departure point and an arrival point from a user; a search means for searching a travel route from a point to the arrival point; a calculation means for calculating a travel cost corresponding to each of the searched travel routes; and a calculation means for calculating one or more travel routes for the user based on the calculated travel costs. Function as a means of making suggestions.

Further, in a second aspect of the present invention, the search means searches for each travel route using a plurality of means of transportation from the departure point to the arrival point.

Further, in a third aspect of the present invention, the input information includes an arrival time, and the search means searches for each travel route that arrives at the arrival point before the arrival time.

In a fourth aspect of the present invention, the input information includes a departure time, and the search means searches for each travel route departing from the departure point after the departure time.

Further, in a fifth aspect of the present invention, the user is a user who plans to use transportation.

Further, in a sixth aspect of the present invention, the user is an operation planner related to a transportation service, and the proposing means is configured to provide a method in which the travel cost corresponding to the calculated certain travel route exceeds the target cost. If so, a travel plan that reduces the travel cost is proposed to the user.

Further, in a seventh aspect of the present invention, the operation plan includes a means of transportation to be newly set.

Moreover, in the eighth aspect of the present invention, the target cost is included in the input information.

Moreover, in the ninth aspect of the present invention, the target cost is a cost according to the distance of the certain movement route.

Moreover, in the tenth aspect of the present invention, the target cost is a cost according to the statistics of each of the calculated movement costs.

Furthermore, in the eleventh aspect of the present invention, the movement cost includes at least one of the following elements: required time, required amount of money, and congestion rate.

Further, the program according to the twelfth aspect of the present invention causes the computer to receive input information from a user involved in event management, including at least the location of the event, the timing of the event, and the region where the attendees are visiting. a reception means for receiving information, a search means for searching each travel route between the visitor area and the venue based on the event period, a calculation means for calculating a travel cost corresponding to each of the searched travel routes; When the statistics of each calculated travel cost exceed the target cost, the present invention functions as a suggestion means that proposes to the user a change in the venue or timing of the event.

Further, the information processing apparatus according to the thirteenth aspect of the present invention includes a reception means for receiving input information including at least a departure point and an arrival point from a user; a search means for searching for a travel route to, a calculation means for calculating a travel cost corresponding to each of the searched travel routes, and suggesting one or more travel routes to the user based on the calculated travel cost. A proposal means is provided.

Further, the information processing device according to the fourteenth aspect of the present invention receives input information including at least the venue of the event, the timing of the event, and the visiting area of the attendees from a user involved in event management. a reception means, a search means for searching each travel route between the visitor area and the venue location based on the event period, and a calculation means for calculating a travel cost corresponding to each of the searched travel routes. and a proposing means for proposing to the user a change in the venue or timing of the event, if the statistics of each of the calculated travel costs exceed the target cost.

According to the present invention, it is possible to provide transportation services that take into consideration the travel costs of users.

FIG. 1 is a block diagram showing an example of the overall configuration of a travel route proposal system according to a first embodiment. FIG. 2 is a block diagram showing an example of the hardware configuration of the server device shown in FIG. 1. FIG. FIG. 2 is a block diagram showing an example of the functional configuration of the server device shown in FIG. 1. FIG. 4 is a flowchart showing an example of the flow of processing performed by each functional means shown in FIG. 3 in the travel route proposal system according to the first embodiment. It is a figure showing an example of a route search screen concerning a first embodiment. It is a figure showing an example of a proposal screen concerning a first embodiment. It is a figure showing an example of a suggestion screen concerning a second embodiment.

Hereinafter, a plurality of embodiments of the present invention will be described with reference to the accompanying drawings. In order to facilitate understanding of the explanation, the same components and steps in each drawing are denoted by the same reference numerals as much as possible, and redundant explanation will be omitted.

---First embodiment---
First, a first embodiment will be described.

<Overall configuration>
FIG. 1 is a block diagram showing an example of the overall configuration of a travel route proposal system 1 according to the first embodiment.

As shown in FIG. 1, the travel route proposal system 1 includes a server device 10 and a plurality of terminal devices 12. These devices are configured to be able to communicate with each other via a communication network NT such as the Internet or a telephone line network.

In response to a search request from the terminal device 12, the server device 10 searches (simulates) the travel cost corresponding to each travel route, and proposes a travel route with a low travel cost to the terminal device 12.

The terminal device 12 is a device operated by a user. These terminal devices 12 include, for example, a first terminal device 12A and a second terminal device 12B. Examples of the terminal device 12 include a mobile phone, a smartphone, a tablet, a personal computer, and the like.

The first terminal device 12A is a device operated by a first user. The first user may be a user who plans to use transportation.

The second terminal device 12B is a device operated by a second user. Examples of the second user include operation planners related to transportation services (for example, employees and consultants who perform urban planning or urban development, employees belonging to transportation agencies, etc.).

<Hardware configuration>
FIG. 2 is a block diagram showing an example of the hardware configuration of the server device 10 shown in FIG. 1. As shown in FIG.

As shown in FIG. 2, the server device 10 includes a control device 20, a communication device 26, and a storage device 28. The control device 20 mainly includes a CPU (Central Processing Unit) 22 and a memory 24 .

In the control device 20, the CPU 22 functions as various functional means by executing predetermined programs stored in the memory 24, the storage device 28, or the like. Details of this functional means will be described later.

The communication device 26 includes a communication interface for communicating with external devices. The communication device 26 transmits and receives various information to and from the terminal device 12, for example.

The storage device 28 is composed of a hard disk or the like. The storage device 28 stores various programs and information necessary for execution of processing in the control device 20, and information on processing results.

Note that the server device 10 can be realized using an information processing device such as a dedicated or general-purpose server computer. Furthermore, the server device 10 may be configured from a single information processing device, or may be configured from a plurality of information processing devices distributed over the communication network NT. Further, FIG. 2 only shows a part of the main hardware configuration that the server device 10 has, and the server device 10 can include other configurations that are generally included in servers. Furthermore, the hardware configuration of the plurality of terminal devices 12 can also be the same as that of the server device 10, except that the terminal devices 12 include, for example, operating means, a display device, and the like.

<Functional configuration>
FIG. 3 is a block diagram showing an example of the functional configuration of the server device 10 shown in FIG. 1.

As shown in FIG. 3, the server device 10 includes a storage means 50, a reception means 52, a search means 54, a calculation means 56, and a suggestion means 58 as functional configurations.

The storage unit 50 is a functional unit that stores the web page 50A, route information 50B, and facility information 50C.

The web page 50A includes a login screen, a route search screen, and the like. Route information 50B includes node information and link information. The node information includes a node name (eg, station name, stop name, airport name, etc.), timetable information, location information (eg, address, latitude and longitude), etc., in association with the node ID of each node. The timetable information includes the departure time at which the means of transportation operated by each transportation organization departs from a node (for example, a station, a stop, etc.) and the arrival time at which it arrives at the node. Examples of this means of transportation include trains, buses, airplanes, ships, and taxis. Link information is information that connects nodes. The link information is associated with the link ID of each link and includes link name (for example, route name), link length (for example, travel distance), required time, required fee (for example, fare), congestion information, type of transportation, etc. . The congestion information includes, for example, the congestion rate (eg, occupancy rate and congestion rate) for each time period on each day of the week. The facility information 50C includes the name of each facility (for example, a store, hotel, restaurant, experience facility, etc.), location information (for example, address, latitude and longitude), data on the flow of people in and around the facility, and the like.

The receiving means 52 is a functional means that receives various information from the user's terminal device 12. In the first embodiment, the reception means 52 receives input information including at least a departure point and an arrival point from a user. For example, when this input information is input by a first user (for example, a user who plans to use transportation), the information includes one or more travel routes used by the first user himself from the departure point to the arrival point, This information is input in order to receive a proposal for a travel route with a low travel cost among the travel routes. In addition, when the input information is input by a second user (for example, an operation planner related to transportation services), the input information may include the travel route that the user uses from the departure point to the arrival point with a low travel cost, or the travel route that has a high travel cost. This information is input in order to receive a proposal to reduce the travel cost regarding the route.

Further, the input information may include a target cost related to the movement cost or an element for calculating the target cost. This target cost is, for example, a value of 0 or more and 100 or less. Examples of factors for calculating the target cost include at least one of the required time, required amount of money, and congestion rate. The target cost becomes a lower value, for example, as the time required, the required fee, and the congestion rate per certain distance (for example, 1 km) are reduced. Further, the input information may include a departure time at a departure point and an arrival time at an arrival point. The input information may also include information specifying whether to use a means of transportation that requires a high fee, such as an airplane, Shinkansen, or paid express train.

The search means 54 is a functional means for searching each travel route from the departure point to the arrival point. In the first embodiment, the search means 54 searches for a travel route from a departure point to an arrival point in each time zone of a predetermined period. For example, the search means 54 refers to the route information 50B and the facility information 50C to search for each travel route including one or more means of transportation that connects the departure point to the arrival point in each time zone of the predetermined period. Examples of this time period include every second, every minute, every five minutes, every fifteen minutes, every thirty minutes, every hour, and every two hours. For example, the search means 54 changes (adds) the departure time by one minute from the departure point to the arrival point for a certain future predetermined period (for example, one day or one week from the search day). Search (simulate) the travel route to.

Furthermore, the search means 54 searches for each travel route that uses a plurality of means of transportation from the departure point to the arrival point. In other words, the search means 54 searches for a travel route that includes a transfer point for changing to a different means of transportation between the departure point and the arrival point. These different means of transportation include the use of the same type of means of transportation (for example, trains) operated by different companies.

Furthermore, when the input information includes a travel date, the search means 54 searches for a travel route from the departure point to the arrival point for a predetermined period (for example, one week) after the travel date. In addition, when the input information includes the arrival time, the search means 54 searches for a travel date included in the input information or a predetermined period after the search day, and returns the arrival point to the arrival point before the arrival time (for example, 3 hours before the arrival time). Search for each travel route that arrives at (up to). In addition, when the input information includes a departure time, the search means 54 searches for a travel date included in the input information or a predetermined period after the search day, and locates the departure point after the departure time (for example, 3 hours after the departure time). Search for each travel route departing until ).

The calculation means 56 is a functional means that calculates the travel cost corresponding to the travel route. In the first embodiment, the calculation means 56 calculates the travel cost corresponding to each of the travel routes searched (simulated) by the search means 54. This movement cost is, for example, a value of 0 or more and 100 or less. Furthermore, the travel cost includes at least one of the following elements: time required, amount of money required, congestion rate, number of transfers, and availability of seating. For example, the calculating means 56 calculates the travel cost of the travel route based on at least one of the following elements: time required, amount of money required, and congestion rate corresponding to the entire travel route. Specifically, the calculation means 56 calculates the travel time and fare per fixed distance (for example, 1 km) on the entire travel route, and calculates a value (travel cost) that is lower as the congestion rate is smaller, and calculates the travel time per fixed distance. The higher the transportation cost, required fare, and congestion rate, the higher the value (travel cost) will be calculated.

The suggestion unit 58 is a functional unit that makes various suggestions to the user's terminal device 12. In the first embodiment, the proposing means 58 proposes to the user the travel route with the lowest travel cost calculated by the calculating means 56. For example, the proposing unit 58 proposes to the first user a travel route with the lowest calculated travel cost, a second lowest travel route, and a third lowest travel route. Further, for example, the proposing unit 58 proposes to the second user a travel route for which the calculated travel cost is 30 or less.

Furthermore, when the travel cost corresponding to a certain travel route calculated by the calculation means 56 exceeds the target cost, the proposal means 58 proposes to the user an operation plan that reduces the travel cost. This target cost is not limited to the target cost included in the input information (for example, the time required, the required fare, the congestion rate), but is, for example, the cost corresponding to a certain distance of a certain travel route (for example, the time required per 1 km, the required cost , congestion rate) or statistics of each calculated movement cost (for example, average value, median value, mode value).

For example, the proposing means 58 proposes to a second user (for example, a transportation service) a travel plan in which the travel cost is less than or equal to the target cost for a certain travel route whose travel cost exceeds the target cost (for example, 50). (the relevant operation planner). This operation plan includes, for example, new means of transportation (for example, new routes for buses and trains). In this case, the proposing means 58 estimates (calculates) the number of passengers for the newly established means of transportation, and proposes an optimal vehicle size and a new route. This estimation of the number of passengers is calculated from actual travel history. In addition, when the means of transportation to be newly set up is a car-related service (for example, a taxi), the proposal means 58 suggests the season and time when reservations are crowded, the time required for travel due to traffic congestion, and whether or not a parking lot can be rented. Reference external data such as Furthermore, when the means of transportation to be newly set is public transportation (bus or train), the proposing means 58 introduces prediction data from average delay times and congestion records.

Furthermore, for example, the proposing unit 58 identifies a factor that is influencing an increase in travel cost in a certain travel route, and proposes measures to improve the factor. In this case, the proposal means 58 uses the flow of people data included in the facility information 50C of each facility regarding the certain travel route, various data (for example, average stay time) held by each facility (commercial facilities, accommodation facilities, etc.), etc. Based on this, the relevant measures will be proposed. Specifically, the proposing means 58 proposes changing the operating hours of the means of transportation (for example, narrowing the operation interval) when the travel time is long on a certain travel route, or proposing to change the operation time of the means of transportation (for example, narrowing the operation interval) or changing the operation time of the means of transportation (for example, reducing the operation interval) or changing the operation time of commercial facilities (for example, supermarkets) around the transfer point. and coffee shops), accommodation facilities (for example, hotels), and proposals to establish new means of transportation. Specifically, if the travel cost corresponding to the travel route that arrives at the arrival point by morning is high, the proposal means 58 makes a proposal to attract accommodation facilities around the arrival point. Further, for example, if the required toll is high for a certain travel route, the proposing means 58 proposes a reduction in the fare of the means of transportation included in the certain travel route. Further, for example, when the congestion rate is high on a certain travel route, the proposing means 58 makes a proposal to establish a new means of transportation or to change the operating time (operation interval) of the means of transportation.

Further, for example, when the input information includes a target cost, the proposing unit 58 proposes a travel route that has a cost equal to or less than the target cost. Furthermore, when the input information includes a required time, the proposing means 58 proposes a travel route that is less than or equal to the required time. Further, when the input information includes a required amount of money, the suggesting means 58 proposes a travel route that costs less than the required amount of money. Furthermore, when the input information includes a congestion rate, the proposing means 58 proposes a travel route that is less than or equal to the congestion rate.

<Processing flow>
FIG. 4 is a flowchart showing an example of the flow of processing performed by each functional means shown in FIG. 3 in the travel route proposal system 1 according to the first embodiment. Further, the processing of the following steps is started, for example, at the timing when the user issues an input instruction to display the route search page on the terminal device 12. Note that the order and contents of the following steps can be changed as appropriate.

(Step SP10)
The reception means 52 transmits a route search screen for executing a route search (simulation) to the user's terminal device 12.

FIG. 5 is a diagram showing an example of the route search screen 60 according to the first embodiment.

As shown in FIG. 5, the route search screen 60 is provided with a point input area 62, a date and time input area 64, and a send button 66. The point input area 62 shows input columns for inputting a departure point and an arrival point. The date and time input area 64 shows input columns for inputting the travel date and departure time or arrival time of the user. Note that the travel date, departure time, and arrival time may not be entered. The send button 66 is a button for sending the input information entered into each input field by the user to the server device 10.

(Step SP12)
In response to pressing the send button 66 on the route search screen 60, the accepting means 52 accepts transmission of input information from the user's terminal device 12. The process then moves to step SP14.

(Step SP14)
The search means 54 searches for each travel route from the departure point to the arrival point included in the input information. For example, the search means 54 refers to the route information 50B and the facility information 50C, and searches for a travel route from the departure point to the arrival point while changing the departure time in 1-minute increments for a period of one week from the search day. Search (simulate). In addition, when the input information includes a travel date, the search means 54 searches for a travel route from the departure point to the arrival point while changing the departure time in 1-minute increments for up to one week after the travel date. do. In addition, when the input information includes the arrival time, the search means 54 changes (subtracts) the arrival time by one minute, and searches for the arrival time at the arrival point for up to one week after the travel date or the search day. Each travel route that arrives earlier (for example, up to 3 hours before the arrival time) is searched. In addition, when the input information includes a departure time, the search means 54 changes (adds) the departure time by 1 minute and changes the departure point to the departure time for up to one week after the travel date or the search day. Each travel route departing after that time (for example, up to 3 hours after the departure time) is searched. The process then moves to step SP16.

(Step SP16)
The calculating means 56 calculates the travel cost corresponding to each of the travel routes searched (simulated) in step SP14. For example, if the required time per km on the entire travel route is less than 10 seconds (more than 360 km/h), the calculation means 56 adds 0 to the travel cost, and calculates that the required time is 10 seconds or more and less than 30 seconds (120 km/h) to 360 km), add 10 to the travel cost, and if the required time is 30 seconds or more and less than 60 seconds (from 60 km to 120 km per hour), add 20 to the travel cost and add 60 to the travel cost. If the required time is 120 seconds or more and less than 120 seconds (from 30 km/h to 60 km/h), 30 is added to the travel cost, and if the required time is 120 seconds or more (up to 30 km/h), 40 is added to the travel cost.
Further, for example, the calculation means 56 adds 0 to the movement cost when the required amount per 1 km of the entire movement route is less than 10 yen, and when the required amount is 10 yen or more and less than 20 yen, the calculation means 56 adds 0 to the movement cost. If the required amount is 20 yen or more and less than 30 yen, 20 is added to the movement cost, and if the required amount is 30 yen or more, 30 is added to the movement cost.
Further, for example, the calculation means 56 adds 0 to the movement cost when the congestion rate per 1 km in the entire movement route is less than 50%, and when the congestion rate is 50% or more and less than 70%, the calculation means 56 adds 0 to the movement cost. If the congestion rate is 70% or more and less than 90%, 20 is added to the movement cost, and if the congestion rate is 90% or more, 30 is added to the movement cost. The process then moves to step SP18.

(Step SP18)
The proposing means 58 extracts the travel route with the lowest travel cost calculated in step SP16. Here, if there are a plurality of travel routes with the lowest travel cost, the proposing means 58 preferentially extracts the travel route closest to the travel date, departure time, and arrival time included in the input information. Then, the proposal means 58 transmits a proposal screen including the extracted travel route to the user's terminal device 12.

FIG. 6 is a diagram showing an example of the proposal screen 70 according to the first embodiment.

As shown in FIG. 6, the proposal screen 70 is provided with a proposal area 72. The proposed area 72 represents a travel route with the lowest travel cost among the searched travel routes.

Then, the process ends the series of processes shown in FIG.

<Effect>
As described above, in the first embodiment, the receiving means 52 receives input information including at least a departure point and an arrival point from a user, and the search means 54 searches for a travel route from the departure point to the arrival point in each time period. , a calculation means 56 that calculates the travel cost corresponding to each of the searched travel routes, and a proposal means 58 that proposes to the user the travel route with the lowest calculated travel cost.

According to this configuration, the travel route in each time period is searched and the travel route in the time period with the lowest travel cost is proposed to the user, thereby providing a transportation service that takes into account the travel cost of users using transportation facilities. can do. Therefore, for example, a user who plans to use transportation can receive a proposal of a highly convenient travel route. Further, for example, an operation planner related to a transportation service can receive a proposal for a highly convenient travel route, which can be used to improve the transportation service.

Furthermore, in the first embodiment, the search means 54 searches for each travel route that uses a plurality of means of transportation from the departure point to the arrival point.

According to this configuration, each travel route using multiple means of transportation that is likely to incur travel costs due to transfers (transfers) is searched, and the travel costs corresponding to each of the searched travel routes are calculated, including transfers. It is possible to propose a travel route with low travel cost.

Further, in the first embodiment, the input information includes the arrival time, and the search means 54 searches for each travel route that arrives at the arrival point before the arrival time.

According to this configuration, each travel route that will arrive before the arrival time is searched and the travel cost corresponding to each of the searched travel routes is calculated, so a travel route that can be traveled at a low travel cost before the arrival time is proposed. can do.

Further, in the first embodiment, the input information includes a departure time, and the search means 54 searches for each travel route that departs from the departure point after the departure time.

According to this configuration, each travel route departing after the departure time is searched and the travel cost corresponding to each searched travel route is calculated, so a travel route that can be traveled at a low travel cost after the departure time is proposed. can do.

Furthermore, in the first embodiment, the user is a user who plans to use transportation.

According to this configuration, a travel route with low travel cost is proposed to a user who plans to use transportation, so a highly convenient travel route can be proposed when the user searches for a travel route. .

Further, in the first embodiment, the user is an operation planner related to a transportation service, and if the calculated travel cost corresponding to a certain travel route exceeds the target cost, the proposal means 58 Propose an operation plan to the user that reduces costs.

According to this configuration, an operation plan that eliminates travel costs is proposed to an operation planner related to transportation services, so that the operation planner can provide transportation services that reduce travel costs for users. Become.

Furthermore, in the first embodiment, the operation plan includes transportation means to be newly set.

According to this configuration, since a new means of transportation to be set is proposed, an operation planner related to transportation services can provide a new transportation service that can reduce travel costs for users.

Further, in the first embodiment, the target cost is included in the input information.

According to this configuration, a travel planner related to transportation services can know which travel routes have a travel cost exceeding the target cost inputted by him/her among the searched travel routes, so that he/she can provide better transportation services. Become.

Further, in the first embodiment, the target cost is a cost depending on the distance of a certain movement route.

According to this configuration, since the target cost is determined according to the distance of the travel route, operation planners related to transportation services can know the travel routes with high travel costs compared to a certain level, so they can improve the be able to provide transportation services.

Further, in the first embodiment, the target cost is a cost according to the statistics of each calculated movement cost.

According to this configuration, the target cost is determined according to the statistics of each calculated travel cost, so the operation planner related to transportation services can choose the route with the highest travel cost from the same departure point to the destination point. You can know the route. Therefore, operation planners involved in transportation services will be able to provide better transportation services.

Furthermore, in the first embodiment, the travel cost includes at least one of the following elements: time required, amount of money required, and congestion rate.

According to this configuration, at least one of the required time, required amount of money, and congestion rate is taken into consideration in the travel cost, so it is possible to make proposals with an allowable range for the user's time load, economic load, and physical load. You will be able to do this.

--- Second embodiment ---
Next, a second embodiment will be described.

In the second embodiment, the reception means 52 receives input information from users involved in event management, and the suggestion means 58 differs from the first embodiment in that it proposes alternative plans for the venue or timing of the event to the user. different from. Note that the configuration and functions of the travel route proposal system according to the second embodiment, which will not be described below, are the same as the configuration and functions of the travel route proposal system according to the first embodiment.

In the second embodiment, the reception means 52 receives input information including at least the location of the event, the timing of the event, and the area where the visitors are visiting from a user involved in event management. Examples of such events include sporting events, music events, exhibitions, seminars, meetings, and conferences. Users involved in event management include event managers (organizers), lecturers at seminars, consultants, and the like. The venue is, for example, a facility such as a stadium or a hall (exhibition hall). The event period includes the event date, start time, and end time. The visitor area includes the residential area and work area of event attendees (users who plan to use transportation). For example, if the event is a sporting event, the attendance area may include the home base of each team participating in the sporting event.

Furthermore, in the second embodiment, the search means 54 searches for each travel route between the visitor area and the venue (round trip) based on the event timing. For example, the search means 54 targets the event date included in the event period and the predetermined period before and after the event date (for example, one month before and after), sets the departure point as each terminal station in the visitor area, and sets the arrival point as the event location. Or search each outbound travel route using each station around the venue. Specifically, the search means 54 targets the event date and one month before and after the event date, and while changing the arrival time (event start time) by one minute, searches the arrival point before the arrival time (for example, the arrival time). Search (simulation) for each travel route that will arrive up to 3 hours before. Further, for example, the search means 54 targets the event date included in the event period and the predetermined period before and after the event date (for example, one month before and after the event date), and sets the departure point as the event location or each station around the event location, and the arrival point Search for each return route using `` as each terminal station in the visiting area. Specifically, the search means 54 targets the event date and one month before and after the event date, and changes the departure time (end time of the event) by one minute, while changing the departure point after the departure time (for example, the departure time). Search (simulate) each travel route departing from 3 hours after 3 hours.

Further, in the second embodiment, when the statistics of each travel cost on the event date calculated by the calculation unit 56 exceed the target cost, the proposal unit 58 proposes to the user a change in the venue or timing of the event. do. The statistics for each movement cost include the average value, median value, and mode of each movement cost.

For example, if the statistics of each travel cost exceed the target cost, the proposal means 58 proposes to the user (for example, the event organizer) that the venue of the event be changed. Further, for example, if the statistics of each movement cost exceed the target cost, the suggestion unit 58 suggests to the user that the timing of the event be changed. Specifically, when the mode value of each travel cost calculated by the calculation means 56 exceeds 60, the proposal means 58 displays a proposal screen to the user that prompts the user to change the venue or timing of the event. It is transmitted to the terminal device 12.

FIG. 7 is a diagram showing an example of a proposal screen 80 according to the second embodiment.

As shown in FIG. 7, the proposal screen 80 is provided with a proposal area 82. The suggestion area 82 indicates that the statistics for each of the calculated travel costs exceed the target cost, so a change in the event timing is recommended. For example, the suggestion area 82 displays a proposal urging the user to change the event timing to a date that is close to the event timing input by the user and where the statistics of each travel cost are below the target cost. .

<Effect>
As described above, in the second embodiment, the reception means 52 receives input information including at least the location of the event, the timing of the event, and the region where visitors will visit from a user involved in event management, and A search means 54 for searching each travel route between the visiting area and the venue based on the time, a calculation means 56 for calculating the travel cost corresponding to each searched travel route, and statistics for each of the calculated travel costs. If the cost exceeds the target cost, the system functions as a suggestion means 58 that proposes to the user a change in the venue or timing of the event.

According to this configuration, if the statistics of each calculated travel cost exceed the target cost, the user involved in event management can receive a proposal to change the venue or timing of the event. Events can be held taking into account the travel costs of many users. Thereby, it is possible to provide transportation services that take into account the transportation costs of event attendees (users using transportation).

<Modified example>
Note that the present invention is not limited to the above embodiments. In other words, the above-described embodiments may be modified as appropriate by those skilled in the art, as long as they have the characteristics of the present invention. Furthermore, the elements of the above-mentioned embodiment and the modified examples described below can be combined to the extent technically possible, and combinations of these are also included within the scope of the present invention as long as they include the features of the present invention.

For example, in the first embodiment, the receiving means 52 receives input information including the departure point and the arrival point from the user. The proposal means 58 may propose a round trip route with the lowest travel cost. In this case, the search means 54 searches (simulates) each outward travel route from the departure point to the arrival point and each return travel route from the arrival point to the departure point after the elapse of the stay time. Next, the calculating means 56 calculates the travel cost corresponding to each of the outbound travel routes and the travel cost corresponding to each of the return travel routes. Then, the proposing means 58 proposes a round-trip travel route with the lowest total value of the travel cost corresponding to the outbound travel route and the travel cost corresponding to the return travel route. As a result, the proposing means 58 can propose a round-trip travel route that takes into account the user's time load, economic load, or physical load, and for example, ``If the stay time is 2 hours, the travel cost (e.g. It is possible to propose a travel route with the lowest round-trip travel cost to users who want to minimize their travel costs.

Furthermore, in the second embodiment, a case has been described in which the reception means 52 receives input information from users involved in event management, but the reception means 52 receives input information from users who are involved in event management. Input information may also be received from (operation planners related to transportation services). In this case, for example, the proposing unit 58 may propose a round trip route with the lowest travel cost to the first user and the second user. Moreover, when the statistics of each of the calculated travel costs exceed the target cost, the suggesting means 58 may propose to the second user an operation plan in which the statistics of each of the travel costs are equal to or less than the target cost. This operation plan may include new means of transportation (for example, new routes for buses and trains).

Furthermore, in the first embodiment, a case has been described in which the search means 54 searches for a travel route from the departure point to the arrival point for a certain future period (for example, from the day of the search until one week later). This certain period in the future may cover only weekdays, or may cover only holidays (eg, Saturdays, Sundays, or holidays). In addition, in the second embodiment, the search means 54 searches for each travel route for the event date and a predetermined period before and after the event date, but this predetermined period may also be for weekdays only. You can also target only holidays.

Further, in the first embodiment and the second embodiment, a case has been described in which the user's movement cost is taken into consideration, but the movement cost (transportation cost) of luggage may also be taken into consideration. In this case, the travel cost includes at least one element of required time and required amount of money.

Further, in the first embodiment and the second embodiment, the target cost and the movement cost include the required fee as an element, but the required fee is the fee for a certain period or a certain number of times (for example, commuter pass fee, etc.). You may also take into account the cost of multiple tickets. Further, the target cost and the movement cost may include the availability of the movement route as an element.

Further, in the first embodiment, a case has been described in which the calculating means 56 and the suggesting means 58 are provided, but these may be omitted.

Furthermore, in the first embodiment, a case has been described in which the suggestion unit 58 proposes to the user the travel route with the lowest calculated travel cost, but it also proposes the travel route with the highest calculated travel cost to the user. Good too. That is, the suggestion unit 58 may propose one or more travel routes to the user based on the calculated travel cost. Furthermore, instead of proposing a travel route, the proposing unit 58 may propose to the user a travel plan that reduces travel costs.

Furthermore, in the first embodiment, a case has been described in which the calculating means 56 calculates the travel cost of the travel route based on at least one element of the travel time, the required amount, and congestion information corresponding to the entire travel route. , the travel cost of the travel route may be calculated based on the travel time and congestion information corresponding to the entire travel route. Further, the calculation means 56 may calculate the travel cost of the travel route based on the required amount of money and congestion information corresponding to the entire travel route.

DESCRIPTION OF SYMBOLS 10... Server device (computer), 50... Storage means, 52... Reception means, 54... Search means, 56... Calculation means, 58... Suggestion means

Claims (10)

computer,
reception means for receiving input information including at least a departure point and an arrival point from a user;
a search means for searching for a travel route using existing transportation from the departure point to the arrival point in each time slot of a predetermined period;
Calculation means for calculating a travel cost corresponding to each of the searched travel routes;
proposing means for proposing one or more of the travel routes to the user based on the calculated travel cost;
function as
The user is an operation planner related to transportation services,
When the travel cost corresponding to the calculated travel route exceeds a target cost, the suggesting means proposes to the user a new means of transportation that reduces the travel cost.
program. The proposal means proposes a vehicle size or route regarding the new means of transportation;
The program according to claim 1. The search means searches for each travel route using a plurality of means of transportation from the departure point to the arrival point.
The program according to claim 1 or 2. The input information includes arrival time;
The search means searches for each travel route that arrives at the arrival point before the arrival time.
The program according to any one of claims 1 to 3. The input information includes a departure time;
The search means searches for each travel route departing from the departure point after the departure time.
The program according to any one of claims 1 to 3. The target cost is included in the input information,
The program according to any one of claims 1 to 5. The target cost is a cost according to the distance of the certain movement route,
The program according to any one of claims 1 to 5. The target cost is a cost according to the statistics of each of the calculated movement costs,
The program according to any one of claims 1 to 5. The travel cost includes at least one of the following elements: time required, amount of money required, and congestion rate.
The program according to any one of claims 1 to 8. reception means for receiving input information including at least a departure point and an arrival point from a user;
a search means for searching for a travel route using existing transportation from the departure point to the arrival point in each time slot of a predetermined period;
Calculation means for calculating the movement cost corresponding to each of the searched movement routes;
a proposing unit that proposes one or more of the travel routes to the user based on the calculated travel cost;
Equipped with
The user is an operation planner related to transportation services,
When the travel cost corresponding to the calculated travel route exceeds a target cost, the suggesting means proposes to the user a new means of transportation that reduces the travel cost.
Information processing device.

Images