JP6846801B2 - Information processing system, information processing program, information processing device and information processing method - Google Patents

Description

The present invention relates to an information processing system, an information processing program, an information processing device, and an information processing method.

Currently, when traveling from the departure point to the destination by train, the appropriate train is searched for in advance using a personal computer or smartphone via the Internet line, etc., and the output result route is referred to. Many people choose to move. As a route search result, an optimum route is generally output based on a route that arrives at the destination quickly, a route that requires a low fare, a route that has a small number of transfers, and the like.

However, uncomfortable routes may be recommended due to the congestion of trains output as search results, such as during the morning rush hour. In addition, when trying to obtain a congestion state in advance, it is necessary to access the website provided by the railway company to acquire congestion information, etc., and further, re-search the route based on the acquired information. In many cases, the route acquisition operation becomes complicated, for example, it is necessary to perform such operations.

Patent No. 5294592

Therefore, an object of the present invention is to provide an information processing system that outputs a congestion avoidance route as a search route together with an optimum route satisfying a search condition, or outputs a congestion avoidance route as an optimum route.

According to one embodiment, the information processing system searches for an optimum route using public transportation based on the route search condition, and a low-congestion route in which the vehicle congestion degree of public transportation is lower than the optimum route. A means and an output means for outputting the low-congestion route together with the optimum route searched by the search means are provided.

According to another embodiment, the information processing system searches for a route based on a route search condition including a public transport vehicle congestion avoidance priority search request, and a search means, and the degree of congestion of the route among the searched routes. It is provided with an output means for outputting a route based on the above.

According to still another embodiment, the information processing system searches for a plurality of routes using public transportation based on the route search condition, and among the routes, the low-congestion route with the lowest degree of vehicle congestion of public transportation. The search means is provided with a search means for extracting the information, and an output means for outputting the route searched by the search means, which outputs the low-congestion route in a manner distinguishable from the other routes. ..

According to the present invention, it is possible to output a congestion avoidance route that satisfies the search condition.

The figure which shows the conceptual structure of the information processing system which concerns on 1st Embodiment. The figure which shows typically the data flow of the route information search part and the storage part. The flowchart which shows the processing flow of the information processing system which concerns on 1st Embodiment. The figure which shows the example of the optimum route and the low congestion route. The figure which shows the example of the display of the route search result. The figure which shows the example of the icon which shows the representative congestion degree. The flowchart which shows another example of the processing flow of the information processing system which concerns on 1st Embodiment. The flowchart which shows the process flow of the information processing system which concerns on 2nd Embodiment. The figure which shows the example of the acquisition screen of the route search condition which concerns on 2nd Embodiment. The figure which shows the example of the search result display which concerns on 2nd Embodiment.

Hereinafter, embodiments according to the present invention will be specifically described with reference to the drawings. In each figure, components having the same function are designated by the same reference numerals, and detailed description of the components having the same reference numerals will not be repeated.

In the following description, the starting point is the starting point of the route, and the destination is the destination of the route, for example, the starting point and the destination set in the route search condition. Further, the waypoint is a point on the route, for example, a waypoint set in the route search condition, and a landing including a boarding place and a transfer place of transportation included in the route information. Transportation is, for example, public transportation.

(First Embodiment)
The information processing system 1 according to the present embodiment has a route that reaches the destination quickly, a route that has a low fare to the destination, and a route that has a small number of transfers to the destination when outputting a route using transportation. Along with the optimum route that satisfies at least one condition, the route with a low degree of congestion is output in consideration of the degree of congestion of transportation.

In the following example, the case of getting on a train with the platform as a station will be described, but this embodiment is not limited to trains, and can be applied to any other means of transportation such as buses. The platform is, for example, a station if the transportation is a train, and a stop if the transportation is a bus. Further, the route may be a mixture of a plurality of sections having different transportation means. For example, it may be a route that travels by train from the departure point to the transit point and travels by bus from the transit value to the destination.

FIG. 1 is a diagram showing a schematic configuration of an information processing system 1 according to the present embodiment. As shown in FIG. 1, the information processing system 1 includes a terminal device 2 and a server 3. The terminal device 2 and the server 3 are connected to each other so as to be able to communicate with each other via a network 4 such as the Internet. At least a part of the terminal device 2 and the server 3 can be realized by a computer. The network 4 may be either a wired line or a wireless line, and the type and form of the line may be used.

The terminal device 2 is used by a user, and is, for example, an information processing terminal such as a mobile phone, a smartphone, a personal computer, or a tablet terminal. The terminal device 2 includes a control unit 21, a communication unit 22, a storage unit 23, an operation unit 24, and an output unit 25. The terminal device 2 may be provided with a positioning means (not shown) for positioning the current position of the terminal device 2 by GPS (Global Positioning System), Wi-Fi (registered trademark) positioning, or the like.

The control unit 21 includes a search condition acquisition unit 211 that acquires a route search condition, and an information output unit 212 that outputs information for output by the output unit 25. Each unit of the control unit 21 may be realized by software by executing a predetermined program by the processor in the terminal device 2.

The search condition acquisition unit 211 acquires the route search condition set by the user via the operation unit 24, and sets the route search condition. The route search condition includes at least information on the starting point and the destination. The departure point and destination are not limited to railway stations, but information that can identify the location, such as address, building name, zip code, telephone number, home, company, bus stop, airport, port, boarding area, etc. It may be. The departure place may be the current position detected by a positioning means such as GPS or Wi-Fi positioning. In addition to the departure point and the destination, the route search conditions may include conditions such as a waypoint, a route used, a departure time, an arrival time, a first train, and a last train.

The search condition acquisition unit 211 may acquire a part or all of the route search condition without going through the operation unit 24. For example, when the user does not input the time information, the current time may be acquired from the clock (not shown) of the terminal device 2 or an external server as the departure time. Alternatively, the route search condition may be acquired based on the past route search history, the information of the route (commuting / school route, favorite route, etc.) registered in advance by the user, or the information registered in the application such as the calendar. The route search condition may be acquired based on the schedule information.

When the time information is not input by the user, as another example from the above example, the route information search unit 310 of the server 3 described later performs a route search using the current time indicated by the clock in the server 3 as the departure time. You may do it.

The information output unit 212 converts the route information or the like received from the server 3 into a video signal and outputs it to the output unit 25. Further, the data received from the server 3 may be molded in the information output unit 212 so that the user can easily see the data. The information output unit 212 may convert the information into an audio signal and output the information to the output unit 25.

The communication unit 22 is an interface for transmitting and receiving information between the control unit 21 and the server 3 via the network 4. The storage unit 23 stores a program for operating the control unit 21 and data (user information, etc.) handled by the control unit 21. The operation unit 24 is an interface for the user to input information to the terminal device 2, and is, for example, a keyboard, a mouse, a touch panel, a button, a microphone, a dial button, and the like.

The output unit 25 is an interface for outputting various information from the terminal device 2 to the user, for example, a video display means such as a liquid crystal display for displaying a video, and the terminal device 2 outputs various information to the user. Specifically, the output unit 25 displays a GUI (Graphical User Interface) for receiving an operation from the user, route information described later, and the like. Alternatively, the output unit 25 may be a speaker that outputs the searched route information, new arrival information, or the like by voice, or may be a vibrator that vibrates when there is new arrival information. When the operation unit 24 is a touch panel, the operation unit 24 may also serve as the output unit 25.

The output unit 25 does not have to directly present the information to the user. For example, the output unit 25 may output a video signal or an audio signal to a video display means or an audio output means connected to the outside of the terminal device 2, or may output data to a printing device connected to the outside. The data may be output and stored in a storage device inside or outside the terminal device 2.

Next, the server 3 will be described. The server 3 includes a control unit 31, a storage unit 32, and a communication unit 33.

The control unit 31 includes a route information search unit 310. Each function of the control unit 31 including the candidate route search unit 311 described later may be realized by software by executing a predetermined program by the processor in the server 3.

The route information search unit 310 reaches the optimum route, that is, a route that reaches the destination earlier than other routes, a route that has a cheaper fare to the destination, and a destination among the routes that meet the route search conditions. In addition to route information that satisfies at least one of the routes with a small number of transfers, information on a route with a low degree of congestion (hereinafter referred to as a low-congestion route) in consideration of the degree of congestion of transportation is searched for. The optimum route includes, among the routes that meet the above route search conditions, the route that reaches the destination fastest, the route that has the lowest fare to the destination, and the route that transfers to the destination the least number of times. A route that satisfies at least one condition may be included.

Here, the route information searched by the route information search unit 310 includes, for example, information such as a means of transportation from a departure place to a destination, a movement distance, a time and charge required for movement, a departure time and an arrival time in the route, and the like. .. The route information is output from the communication unit 33 to the terminal device 2 via the network 4.

The storage unit 32 includes a route database 321 and a congestion degree database 322. The route database 321 is a database used for route search, and includes a route network information database. In addition to this, the route database 321 may further include at least one of a traffic network information database, a map database, and a POI (Point of Interest) information database. When the timetable information database, the map database, and the POI database are provided, they may be stored in a storage location different from the route database 321.

Transportation network information is information that defines a transportation network such as a railroad or a bus or a road network. The transportation network information includes transportation route information, timetable information, fare information, and the like. The map information includes map data such as road maps of the whole country and each region, and information of map objects associated with the map data. In addition, the map information may include route map information related to a route map of public transportation.

These traffic network information and map information may be updated at a predetermined timing. The storage unit 32 does not necessarily have to be provided in the server 3, and may be provided in a separate device connected via the network 4.

A timetable information database is not required when performing only an average search that searches for a route without specifying a time, but timetable information is required for a normal search that specifies a time such as departure time or arrival items. You need a database. In addition, a map database or POI database is not required when searching for a route only between stations, but as described above, a map database or POI database is required when searching from an address, building name, etc. It becomes. These databases are not shown, but will be provided if needed.

The congestion degree database 322 is a database that stores the congestion degree for each route. The degree of congestion is, for example, an index indicating congestion between stations on each line. Indicators of congestion are, for example, empty seats, almost full seats, being able to hold onto straps, feeling oppressive, having difficulty turning, and being unable to board due to congestion. It is represented by an index such as the presence of people. Further, as another example of the degree of congestion, it may be calculated based on the occupancy rate obtained by a sensor for detecting the weight provided in each vehicle of the train.

In principle, for each train displayed in the timetable, the degree of congestion between each station is stored in the degree of congestion database 322. This degree of congestion does not necessarily have to be stored for all trains. For example, the degree of congestion is stored for one in two trains, and for the degree of congestion of trains for which there is no data, two trains before and after It may be possible to interpolate from the degree of congestion of.

Next, the route information search unit 310 will be described in more detail. FIG. 2 is a diagram showing the flow of data in the route information search unit 310 and the storage unit 32. As shown in FIG. 2, the route information search unit 310 includes a candidate route search unit 311, an optimum route extraction unit 312, a congestion degree calculation unit 313, and a low congestion route extraction unit 314.

The candidate route search unit 311 searches for a plurality of candidate routes that are candidates to be output as route information based on the route search conditions acquired by the search condition acquisition unit 211. For example, when the departure station and the arrival station are acquired as the departure point and the destination, respectively, the route departing from the departure station and reaching the arrival station is determined by using the data stored in the route network database in the route database 321. To search.

Further, when time information such as departure time and arrival time is specified, the search is performed with reference to the timetable database in the route database 321. When the time is not set, the average search indicating the average elapsed time in each route may be performed, or the search may be performed so that the current time is set as the departure time. The search is not limited to these, and the search may be performed so that the departure time is, for example, 5 minutes later.

If at least one of the departure point and the destination is not the station name, the station name is not entered based on the map database or POI database in the route database 321. The station around the departure point or the destination is searched and searched. The above route search is performed based on the station. Here, the surrounding stations are, for example, the stations closest to the departure point or the destination, the stations within a 10-minute walk from the nearest station, or the stations existing within 1 km in the surrounding area. .. The parameters (10 minutes on foot, 1 km in circumference, etc.) when searching for a station other than the nearest station may be predetermined by the system, may be set by the user, or may be in the city center or the suburbs. , Other parameters may be given in other areas.

In the route search, if the destination is a station, the route that can be reached by train to the stations around the station is searched, and the route that moves from the getting-off station to the destination station on foot is output. You may try to do it. For example, when searching for a route to Tokyo Station, the route to Otemachi Station may be searched, and the route to move from Otemachi Station to Tokyo Station on foot may be searched.

In this way, the candidate route search unit 311 searches the route of the candidate route from the departure point to the destination based on the data stored in the route database 321. The candidate route searched by the candidate route search unit 311 is output to the optimum route extraction unit 312 and the congestion degree calculation unit 313.

The optimum route extraction unit 312 extracts a predetermined number of data to be the optimum route from the data searched as the candidate route. As described above, the optimum route is, for example, the route that can reach the destination fastest. Which condition is satisfied as the optimum route to be extracted may be predetermined by the system or may be set by the user.

For example, as the optimum route, at least one of the route with the earliest arrival, the route with the cheapest fare, and the route with the easiest transfer may be output as the optimum route, or one condition, for example, the arrival A predetermined number of routes may be extracted from the candidate routes in order from the earliest route to the earliest arrival.

In addition to these, it is also possible to include a route that avoids trains that require additional charges such as special train types (for example, limited express trains) as a condition. Furthermore, an index for comprehensively judging these fast routes, cheap routes, and easy routes, for example, a cost function with parameters indicating time, fare, number of transfers, transfer time, etc. as arguments is provided, and the output of the cost function is provided. A predetermined number of routes may be output as the optimum route based on the above.

The congestion degree calculation unit 313 is a representative congestion which is an index showing the degree of congestion of the route based on the congestion degree between each station of each line stored in the congestion degree database 322 for each of the routes searched as a candidate route. Calculate the degree. The representative congestion degree is an average of the degree of congestion experienced, and is calculated in consideration of, for example, an average of the congestion degree between each station of each line on the route. The average degree of congestion between stations on each line on the route is specifically calculated by multiplying the boarding time between stations and the degree of congestion to calculate the degree of congestion between stations, and between all stations. It is the sum of the congestion levels between stations in Tokyo and divided by the total boarding time. In this way, the average degree of congestion per hour is calculated. For example, the degree of congestion between stations is stored in the degree of congestion database 322 based on the degree of congestion experienced in advance.

This also applies when there are a plurality of routes constituting the candidate route. For example, when a candidate route is composed of two routes, one route is less congested and rides a long distance, and the other route is highly congested and rides a short distance. The degree is relatively low. On the other hand, when one line is less congested and rides a short distance, and the other line is highly congested and rides a long distance, the representative congestion is higher than in the above example.

In addition to the above average congestion, other factors can be considered as representative congestion. Specifically, it is information such as a train type and the first train. For example, as a train type, in general, trains that stop at each station are vacant as compared with rapid trains and express trains, so trains that stop at each station can be an element that reduces the degree of congestion.

Also, if there is a timing when there is a possibility of sitting in the middle of the route and the user can sit in the seat, even if the actual congestion of the train after the station where he / she sat is high, it does not matter the actual congestion. , The degree of congestion can be underestimated. For example, when there are many passengers who change to another train on the route constituting the route, or when there is a timing to change to the first train in the middle of the route, the case where the passenger can sit down by changing to the first train is applicable. Whether or not you can sit is not limited to these, and there may be other cases where there are large factories or schools on the route and there are times when many passengers get off.

In this way, the congestion degree calculation unit 313 calculates the representative congestion degree, which is the congestion degree of the route, based on the information such as the train type and the first train on the route, as well as the congestion degree between each station and the boarding time between each station. If the representative congestion degree of a certain candidate route is to be obtained and the congestion degree of at least one route constituting the candidate route is not stored in the congestion degree database 322, the representative congestion degree of the candidate route is not stored. Is not calculated and shifts to the calculation of the representative congestion degree of the next candidate route.

The low-congestion route extraction unit 314 extracts a low-congestion route from the candidate routes based on the optimum route information extracted by the optimum route extraction unit 312 and the representative congestion degree calculated by the congestion degree calculation unit 313. Specifically, a low-congestion route is extracted by comparing the representative congestion degree of the optimum route calculated by the congestion degree calculation unit 313 with the representative congestion degree of another candidate route.

First, the low-congestion route extraction unit 314 extracts the route having the lowest calculated representative congestion degree from the optimum routes. Next, a route having a low representative congestion degree as compared with the extracted route is extracted. Finally, from the routes extracted in this way, a predetermined number of routes are extracted as low-congestion routes in consideration of multiple factors such as the arrival time to the destination of each route, the number of transfers, the fare, and the representative congestion degree. To do.

Extraction of a predetermined number of low-congestion routes uses a cost function with indicators such as arrival time, number of transfers, fare, and degree of congestion as arguments. For example, a predetermined number of routes are low-congested in order from the route with the smallest cost value. Extract as a circuit. By defining the cost function in this way, routes excluding routes such as routes that are too detoured, routes that require a large number of transfers, and routes that take an enormous amount of time are extracted as low-congestion routes.

Instead of evaluating by the cost function, the low-congestion route may be extracted under various conditions from the candidate routes having a representative congestion degree lower than the representative congestion degree of the optimum route. For example, a route whose arrival time does not exceed twice the minimum arrival time in the optimum route, a route in which the number of transfers is less than the minimum number of transfers in the optimum route plus a predetermined number (for example, 3 times), and a business kilometer is the optimum route. A low-congestion route may be extracted under conditions such as a route that does not exceed twice. The parameters such as arrival time, number of transfers, business kilometers, and double or triple times mentioned here are given as examples, and are not limited to this. As another example, it may be a condition that the walking section at the time of transfer is not too long.

The route information search unit 310 transmits the optimum route extracted by the optimum route extraction unit 312 and the low congestion route extracted by the low congestion route extraction unit 314 to the information output unit 212 of the terminal device 2 via the communication unit 33. Is output.

When the representative congestion degree is not calculated for all the candidate routes or all the candidate routes other than the optimum route, the low-congestion route extraction unit 314 ends the process without extracting the low-congestion route. In this case, the route information search unit 310 outputs only the optimum route without outputting the low-congestion route. Similarly, when there is no route lower than the representative congestion degree of the optimum route, the process is terminated without extracting the low-congestion route.

The above is the operation of each component of the information processing system 1. Next, the overall processing flow will be described using a flowchart. FIG. 3 is a flowchart showing a processing flow of the information processing system according to the present embodiment. In the following, for example, the case where the user inputs the information of the departure station and the destination station and the time information such as the departure time will be described. In other cases, as in the above example, the following processing is performed after acquiring the departure station information, the destination station information, and the time information at an appropriate timing.

First, the search condition acquisition unit 211 of the terminal device 2 acquires the route search condition by input from the user (step S10). Subsequently, the search condition acquisition unit 211 transmits the route search condition to the server 3 via the communication unit 22 and the network 4 (step S11).

Next, the candidate route search unit 311 of the route information search unit 310 that has acquired the route search condition via the communication unit 33 obtains candidate route information that matches the route search condition based on the data stored in the route database 321. Search (step S20). The searched candidate route information is output to the optimum route extraction unit 312, the congestion degree calculation unit 313, and the low congestion route extraction unit 314.

Next, the optimum route extraction unit 312 extracts the optimum route information based on the candidate route information output by the candidate route search unit 311 (step S21). At this time, the optimum route may be extracted according to the route search condition specified by the user. That is, conditions such as outputting routes in the order of arrival time specified by the user may be added. The extracted optimum route is output to the low-congestion route extraction unit 314.

Next, the congestion degree calculation unit 313 represents the representative congestion degree of each candidate route based on the candidate route information output by the candidate route search unit 311 and the congestion degree between each station of each line stored in the congestion degree database 322. Is calculated (step S22). The calculated representative congestion degree is output to the low congestion route extraction unit 314.

Next, the low-congestion route extraction unit 314, which has input the optimum route information and the representative congestion degree of each candidate route, extracts the lowest representative congestion degree among the representative congestion degrees of the optimum route, and is higher than the representative congestion degree. It is determined whether or not there is a candidate route having a low representative congestion degree, that is, a route that is a candidate for a low congestion route (step S23).

When there is a route that is a candidate for a low-congestion route (step S23: Yes), the low-congestion route extraction unit 314 contains the above-mentioned optimum route, information on the candidate route searched by the candidate route search unit 311 and each candidate route. A low-congestion route is extracted based on the representative congestion degree of (step S24).

Next, the route information search unit 310 transmits and outputs the optimum route information and the low-congestion route information searched to the terminal device 2 via the communication unit 33 and the network 4 (step S25). After this process, the control unit 31 of the server 3 may shift to the standby state and return to the state of waiting for the next search condition to be input.

On the other hand, when it is determined that there is no candidate for a low congestion route (step S23: No), the low congestion route extraction unit 314 does not output the low congestion route, and the route information search unit 310 outputs only the optimum route to the terminal device. Output to 2. When calculating the representative congestion degree (that is, in step S22), if the representative congestion degree is not calculated for all the candidate routes or all the candidate routes other than the optimum route, No processing is performed in step S23. That is, the processing flow shown by the dotted line in FIG. 3 may be followed.

Next, the information output unit 212 of the terminal device 2 that has received the optimum route information and the low congestion route information via the network 4 and the communication unit 22 outputs the route information to the user via the output unit 25 (step S12). ). The route information to be output is the optimum route information and the low congestion route information when the low congestion route information is output from the server 3, and is optimal when the low congestion route information is not output from the server 3. Only route information.

Here, specific examples of the optimum route and the low-congestion route will be described. 4 (a) to 4 (d) are diagrams showing examples of output optimum route information and low-congestion route information. In these figures, the circles represent stations, and the characters written in the circles represent station names. Station S is the departure station and station D is the arrival station. However, the following routes are shown as examples, and the optimal route and the low-congestion route are not always the same as these examples when there are the following routes. That is, the low-congestion route is evaluated and extracted by, for example, a cost function as described above.

FIG. 4A shows an example in which the optimum route is a rapid train, while the low-congestion route is a train that stops at each station. Generally, trains that stop at each station are less crowded than express trains. Therefore, although the trains that stop at each station have a slower arrival time than the rapid trains, the routes that use the local trains are output as low-congestion routes. If the congestion level of local trains is higher than that of rapid trains, data to that effect is stored in the congestion degree database 322, so there is a possibility that each station stop will be output as a low-congestion route. Will be less.

FIG. 4B shows an example in which the route from S station to D station uses the same route in the optimum route and the low-congestion route, but in the low-congestion route, the train is changed to the first train at X station on the way. In this way, even if the same line (and the same train type) is used, if there is an X station that will be the first station on the way, changing trains at the X station will result in a less crowded train. By changing trains, it is possible to reduce the degree of congestion on the route.

When there is a station to transfer to the first train in this way, instead of outputting the last-minute time required to transfer to the first train as the departure time as low-congestion route information, it is possible to sit side by side with the first train. The time with a margin may be output as the departure time. Alternatively, if the departure time is specified by the user, there is a first train that can be transferred at the X station earlier, but the transfer information of the first train after the first train is intentionally made so that the train can sit comfortably at the X station. May be output. In addition, a cost function may be defined in advance so as to output a train that can be seated in this way.

FIG. 4C shows an example in which there is no change in the number of transfers in the route from S station to D station, but there is a shortest route and a detour route. When the shortest route is extracted as the optimum route and the representative congestion degree of the detour route is lower than the representative congestion degree of the optimum route, the shortest route is output as the optimum route, but the detour route is used as the low congestion route. The route is output.

FIG. 4D shows an example in which a low-congestion route with more transfers than the optimum route is output in the route from S station to D station. For example, in the shortest route, there is no transfer from S station to D station, while another line is used to go from S station to Y station, and at Y station, transfer to another line bound for D station. In this way, even when the number of transfers is large, if the representative congestion value of the route via Y station is lower than that of the shortest route from S station to D station, the route via Y station is regarded as a low congestion route. Output.

FIG. 5 is a diagram showing a display example of a screen output to the output unit 25 of the terminal device 2. When the user performs a search, the output unit 25 displays the display area 250 as shown in FIG. 5 as a result screen. Hereinafter, each area in the display area 250 will be described.

In the area 251, the details of the search condition and the display order of the optimum route are output. For example, in the case of FIG. 5, the walking speed is about the standard, and the display order of the optimum route is the order of the shortest time, that is, the order of the earliest arrival time.

The area 252 is an area for displaying the fact when the low congestion route is output. By clearly indicating that the low-congestion route is output to the area 252 in this way, it is possible to reduce the possibility that the user will miss the low-congestion route information.

Regions 253A to 253D are regions that output information about the optimum route. In the example of FIG. 5, four routes are output as the optimum routes. The number of routes to be output is not limited to four, and may be preset by the system or application, or the number of routes to be output by the user may be set.

For example, the optimum route displayed in the uppermost area 253A indicates the optimum route that takes the shortest time from the departure point to the destination, as shown in the area 251 in the order of "shortest time". Is. For example, it departs from the departure station at 8:20 and arrives at the arrival station at 9:12. It takes 52 minutes, the fare is 780 yen, and the number of transfers is two. It also indicates that the line takes a train from the departure station to A station, changes at A station, takes another train to B station, and further changes at B station to reach the destination station.

Area 254 is a display indicating that the display below this display is a low-congestion route. By explicitly displaying the low-congestion route in the area 254 in this way, it is possible for the user to clearly distinguish between the optimum route and the low-congestion route.

The area 255 is an area for outputting information on the low congestion route. By displaying the low-congestion route in an area different from the optimum route, it is possible to make the user clearly recognize that there is a comfortable route with less congestion with respect to the optimum route. In the example of FIG. 5, one low-congestion route is output. The number of routes to be output is not limited to one, and may be, for example, two. The number of outputs of this low-congestion route may be preset by the system or application, or the number of routes to be output by the user. May be set.

By selecting the regions 253A to 253D and the region 255, more detailed route information may be output for the selected route. That is, the route information to be boarded and the type of train to be boarded may be displayed in more detail. In addition, if the route uses the first train from this station, that fact may be displayed. In addition, information that can be a factor or a factor to be considered in calculating the degree of congestion or the degree of representative congestion may also be displayed.

The icons 257A to 257D in the area 253A to 253D and the icon 258 in the area 255 are icons indicating the degree of congestion, respectively. These icons make it possible to visually grasp the representative congestion degree in each route. By using such an icon, the user can intuitively and easily recognize which route is crowded and how much when the route search result of FIG. 5 is viewed. In the detailed route information output by selecting the regions 253A to 253D and the region 255, an icon indicating the representative congestion degree of each route section to be boarded on the selected route is displayed for each route section. May be displayed. This makes it possible to know not only the degree of congestion of the entire route including the transfer, but also the degree of congestion of each transfer section constituting the route.

FIG. 6 is a diagram showing an example of icons 257A to 257D and icon 258. The icon shown in FIG. 6 is merely an example, and the icon and the state indicated by each icon are not limited to those shown in FIG. 6 and those described below. Any icon can be used as long as it can visually capture the congestion state as in this example. The degree of congestion is also 6 stages, but the number of stages is not limited to 6 and may be a smaller number or a larger number.

In FIG. 6, the icon at the top indicates a state in which the train is vacant, and indicates a state in which the train can be seated with a margin. Specifically, this icon also indicates the state in which the first train has entered the platform.

The second icon from the top indicates that the inside of the train is relatively empty, and the seats are almost full, but you can stand with plenty of room, specifically, inside the deck of the train. Indicates a state in which one or two people are standing.

The third icon from the top indicates that the train is neither empty nor crowded, indicating that it is difficult to sit in the seat, but you can afford to catch it on the strap. ..

The fourth icon from the top indicates that the train is relatively crowded, it is difficult to sit in a seat, and it is barely caught by the straps.

The fifth icon from the top indicates that the train is crowded and it is possible to stand and board, but it is difficult to turn around as well as to sit in the seat, and it is difficult to move. Indicates a difficult state.

The sixth icon from the top indicates that the train is very crowded, and some of the people on the platform cannot get on the train due to the congestion in the train.

In this way, an icon is used so that the degree of congestion can be visually recognized. Also, these icons may have different colors, for example, the top icon is blue, the second icon is light blue, the third icon is green, the fourth icon is yellow, and five. The sixth icon may be color-coded orange, the sixth icon red, and so on. Further, these icons may be icons having the same shape as if "□" having only different colors is filled.

The congestion degree used by the congestion degree calculation unit 313 described above when calculating the representative congestion degree may be the same as the congestion degree described in FIG. That is, the degree of congestion between stations on each line stored in the degree of congestion database 322 may correspond to the state of the above icon. Specifically, the congestion degree of the top icon is 0, the congestion degree of the second icon is 1, ..., The congestion degree of the bottom icon is 5, and so on. The degree may be stored.

Further, it is not necessary that the icon and the quantified degree of congestion have a one-to-one correspondence, and a finer numerical value may be used when calculating the degree of congestion. For example, the degree of congestion of the top icon may be 0 to 1, the degree of congestion of the second icon may be 2 to 4, and so on, depending on the situation. In this case, for example, the difference in the degree of congestion of the icon at the top is that the degree of congestion is 0 when the first train is in the platform or when 0 to 1 people are sitting in a seat for 7 people. In this case, the degree of congestion in a state where 2 to 4 people are sitting in a seat for 7 people is quantified as 1. These are not limited to long seats, but can be used in other forms of seats such as cross seats as well.

Returning to the explanation of the display screen of FIG. 5, the icons 259A to 259D in the areas 253A to 253D and the icon 260 in the area 255 have different route search conditions for the routes output to the respective areas. It is an icon indicating whether the route is applicable.

For example, the icon containing the character "early" shown in the icon 259A indicates that the route arrives at the destination station earliest in the output route information. The icon containing the character "cheap" shown on the icon 259B indicates that the fare is the cheapest route compared to other routes. The icon containing the character "easy" shown on the icon 259C indicates that the route has the least number of transfers as compared with other routes. Then, the icon containing the character "empty" shown in the icon 260 indicates that the low congestion route is a feature of the present embodiment.

In this way, by displaying the icon "sky" as well as the icons such as "cheap", "early", and "easy", the user can use the route on which the icon "sky" is displayed as a low-congestion route. It becomes possible to easily recognize it by just glancing at it. If the low-congestion route is not output, the "empty" icon may be added to the route with the lowest representative congestion degree from the optimum routes.

Although not shown, if the output information does not fit on one screen, a scroll bar is displayed and the displayed scroll bar is output by the user operating it, but it is output on the screen. May allow you to see information that is not displayed.

As described above, according to the present embodiment, when the user searches for a transportation route, the route that can be reached earliest, the route with the lowest fare, the route with the least number of transfers, and the like are output as the optimum route. At the same time, by outputting a route having a lower degree of congestion than the optimum route as a low-congestion route, it is possible to improve the convenience of the user's route search. For the user, the low-congestion route can be searched by performing the search by the same method as the conventional search method.

Then, it is possible to expand the range of route selection by the user by not only showing the optimum route but also outputting a low-congestion route having a lower degree of congestion than the optimum route. Furthermore, among the routes output as the search results, by explicitly indicating that a low-congestion route exists in addition to the optimum route, and by indicating the low-congestion route in a manner that can be clearly distinguished from the optimum route, the user It is possible to prevent oversight due to the above and intuitively or intuitively inform the user of the low congestion route.

By doing this, I want to use a vacant route even if it takes a little extra time, I want to move comfortably even if it costs a little money, I do not want to get on a crowded route even if the number of transfers increases It is possible to flexibly respond to the user's request such as. Further, by outputting the low-congestion route together with the optimum route, it is possible to make the user compare and examine how much time, charge, and time and effort required for transfer are compared with the optimum route.

Further, by outputting the low-congestion route, the use of the low-congestion route is promoted, so that it is possible to contribute to the alleviation of congestion in the metropolitan area.

(Modified example of the first embodiment)
In the first embodiment described above, an example of outputting the optimum route and the low-congestion route together from the server 3 to the terminal device 2 has been shown, but this transmission method is not limited to this. That is, it is also possible to transmit the optimum route and the low-congestion route separately.

FIG. 7 is a flowchart showing an example of a process of transmitting the optimum route and the low-congestion route separately.

As shown in this flowchart, the server 3 first transmits the optimum route to the terminal device 2 via the communication unit 33 and the network 4 after the optimum route extraction unit 312 extracts the optimum route (step S21) (step S21). Step S26).

The information output unit 212 of the terminal device 2 that has received the optimum route information via the communication unit 22 outputs the optimum route information to the output unit 25 (step S13).

In parallel with this, the congestion degree calculation unit 313 calculates the representative congestion degree of each candidate route, and the low congestion route extraction unit 314 extracts the low congestion route (steps S22 to S24).

Next, when the low congestion route is extracted, the server 3 transmits the low congestion route information to the terminal device 2 via the communication unit 33 and the network 4 (step S27).

The information output unit 212 of the terminal device 2 that has received the optimum route information via the communication unit 22 outputs the low congestion route information to the output unit 25 together with the optimum route information that has already been output (step S14).

In this way, when the optimum route information is extracted, the optimum route information may be transmitted from the server 3 to the terminal device 2 and output to the output unit 25. By doing so, for example, even if the state of the network 4 is not good, at least the optimum route can be output to the user as soon as possible.

(Second Embodiment)
The first embodiment and its modification described above output the optimum route information and the low-congestion route information together, but in the present embodiment, the low-congestion route information is output together with the route information that arrives early. By making it possible to specify it as a route search condition, it is intended to output low-congestion route information as an optimum route.

FIG. 8 is a flowchart showing a processing flow of the information processing system 1 according to the present embodiment.

First, the search condition acquisition unit 211 acquires the route search condition specified by the user to output the low-congestion route as the optimum route as the route search condition (step S30).

FIG. 9 is an example of a screen presented to the user as an input screen for the route search condition when the route search according to the present embodiment is performed. In this way, as in the normal route search, the optimum route can be selected together with the area for inputting conditions such as the departure station and the time. As the route to be selected as the optimum route, in addition to the fast route, the cheap route, and the easy route, the user is presented with an option of preferentially searching for a route that avoids congestion. When the user wants to preferentially search for a route to avoid congestion, he / she selects the option and sets it as a route search condition. In the example of FIG. 9, the user selects a radio button indicating "route priority to avoid congestion".

Next, the terminal device 2 transmits the route search condition to the route information search unit 310 of the server 3 via the communication unit 22 and the network 4 (step S31).

The candidate route search unit 311 that has received the route search condition searches for a candidate route that matches the route search condition from the data stored in the route database 321 as in the above-described embodiment (step S40). It is assumed that the route search condition used in this step does not include the condition (designation of early, cheap, easy, empty) which condition is output as the optimum route. The searched candidate route is output to the congestion degree calculation unit 313.

Next, the congestion degree calculation unit 313 calculates the representative congestion degree of each candidate route based on the information of the candidate route information searched by the candidate route search unit 311 and the congestion degree database 322 (step S41).

Next, the low-congestion route extraction unit 314 extracts the low-congestion route as the optimum route based on the representative congestion degree of each candidate route calculated by the congestion degree calculation unit 313 (step S42). Here, the route to be extracted as the optimum route may be simply extracted in ascending order of the representative congestion degree, or is calculated by using a cost function including the representative congestion degree as an argument as in the above-described embodiment. It may be extracted based on the cost.

The processes of steps S40 to S42 may be collectively performed. That is, when a route search condition for searching a congestion avoidance route is received from the user, a predetermined number of routes are calculated by considering the degree of congestion in the step of searching for a candidate route. It may be possible to search for a low-congestion route. That is, as a candidate route, a low-congestion route (optimal route), which is a route considering the representative congestion degree, may be searched. Further, the optimum route may be searched based on the congestion degree information between stations included in the route without obtaining the representative congestion degree.

Next, the route information search unit 310 transmits and outputs the optimum route information (low congestion route information) extracted by the low congestion route extraction unit 314 to the terminal device 2 via the communication unit 33 and the network 4 (step). S43).

The information output unit 212, which has received the optimum route information via the communication unit 22, outputs the optimum route information to the output unit 25 (step S32).

The above is the processing flow of the information processing system 1 in the present embodiment. FIG. 10 is a diagram showing an example of the route search information output by the information processing system 1 according to the present embodiment.

In the display area 251, it is displayed in which priority the output search results are output. When the user specifies that the route to avoid congestion is given priority for output, for example, as shown in FIG. 10, a tab including an "empty" icon is displayed as if it is selected, and the following display area is displayed. , Indicates that the route to avoid congestion is output preferentially. For example, as shown in FIG. 10, the optimum routes are sorted and output in ascending order of representative congestion.

Since the details of the display in the areas 253A to 253D in which each optimum route is displayed are the same as those in the first embodiment described above, detailed description thereof will be omitted. Since FIG. 10 is shown as an example of output, the output screen configuration is not limited to such a configuration.

If the low congestion route is not output, another sort condition, for example, the condition that the destination can be reached earliest may be output as the sort condition.

As described above, according to the second embodiment, in addition to the route with early arrival, the route with low fare, and the route with easy transfer, it is possible to preferentially output the route avoiding congestion as the optimum route. Become. When the user wants to preferentially know the route to avoid congestion, it is possible to specify that fact when searching for the route in the same manner as the former three. As described above, the information processing system 1 according to the present embodiment expands the range of options when the user sets the route search condition, improves the convenience of the user, and guides the user to the low congestion route. As a result, it is possible to even out the congestion of transportation.

In the description of each embodiment and each modification described above, the degree of congestion of each line is described as being output to the output unit 25 every day at all time zones, but the present invention is not limited to this. That is, the degree of congestion may be output based on at least one situation of each season, each day of the week, each date and time, and each time zone.

Specifically, in the case of a route including a route whose degree of congestion changes depending on the season such as cherry-blossom viewing and sea bathing, a low-congestion route may be output in the congested season. In the highly congested route of the commuting rush, for example, the low congestion route may be output in the morning time zone on weekdays and the time zone from the evening to the night. If the schedule of a sports match or an artist's concert is fixed, the date and time and the low congestion route in the surrounding area at that time may be output.

The timing to output the low-congestion route is not limited to the above, and for example, the low-congestion route is selected based on the train near the last train on Friday and Saturday, the schedule with some event, the seasonal event, the busy time zone, and the like. It may be output. Of course, as in each of the above-described embodiments, the output may always be performed regardless of these restrictions, or the low-congestion route may be output at the request of the user.

If there is a disruption in the timetable such as delay information or suspension information on any of the routes constituting the optimum route or the route extracted as the low congestion route, it is possible not to output the low congestion route. In such a case, since congestion different from the data stored in the congestion degree database 322 is generated in the first place, it cannot be determined whether or not the route is comfortable even for the low congestion route. Alternatively, the information indicating that the timetable is disturbed may be displayed together with the low congestion route information to suggest that the congestion information may not be reliable.

In addition to the routes that compose the route extracted as the optimum route or the low-congestion route, the low-congestion route should not be output even if the above-mentioned timetable disorder occurs on the route in the surrounding predetermined area. It may be. If there is a disruption in the timetable for the routes that make up the area around the route extracted as a candidate route, the route that includes passengers avoiding from the route in which the disruption of the timetable is occurring is included in the candidate route. This is because the congestion level is expected to be different from that in normal times.

In the description of each of the above-described embodiments and modifications, the degree of congestion of each line is assumed to be stored for each train, but the degree of congestion is not limited to this. For example, as described above, when calculating the degree of congestion based on the occupancy rate obtained from the value indicated by the sensor that detects the weight provided for each vehicle of the train, the degree of congestion is calculated for each vehicle of the train. You may do so. In this case, since the degree of congestion is obtained for each vehicle, it is possible to output the vehicle to be boarded as a route for avoiding congestion, and it is possible to further improve the comfort level of the user. The degree of congestion for each vehicle may be determined by a method other than detecting the weight. For example, the congestion degree of each vehicle may be investigated in advance, and the congestion degree of each vehicle investigated may be stored in the congestion degree database 322.

When calculating the representative congestion degree for each vehicle, if there are toll vehicles such as green cars in the train formation, the representative congestion degree of these toll vehicles can also be calculated. By outputting such a toll vehicle as well, it is possible to meet the user's request for comfortable movement because a small charge may be incurred in addition to the fare.

Further, in each of the above-described embodiments and modifications, the low-congestion route is extracted from the candidate routes and the low-congestion route is output together with the optimum route or as the optimum route. Not limited to these. That is, by calculating the representative congestion degree of the optimum route for each, the one with the lowest representative congestion degree among the optimum routes or the entire output route including the low congestion route output together with the optimum route is "empty". You may output with an icon. By doing so, the user can know the route having the lowest representative congestion degree among the output routes.

Further, a customer information database may be provided in the storage unit 23 of the terminal device 2 or the storage unit 32 of the server 3 to accumulate the action history of each user who is the owner of the terminal device 2. Here, the action history is history information of POI search conditions designated by the user in the past, history information such as station information searched by the user in the past, or history information designated by the user as search conditions. When the user performs a search, the initial value of the search condition may be output to the search screen based on the historical information.

The configuration described above is an example, and at least a part of the configuration requirements in the server 3 may be in the terminal device 2. For example, the storage unit 32 and the control unit 31 in the server 3 may be provided in the terminal device 2 to configure an information processing device or an information display device capable of searching for a route only by the terminal device 2 without communication. In this case, the communication unit 22 and the like may be omitted as appropriate.

At least a part of the information processing system described in the above-described embodiment may be configured by hardware or software. When configured by software, a program that realizes at least a part of the functions of the information processing system may be stored in a recording medium such as a flexible disk or a CD-ROM, read by a computer, and executed. The recording medium is not limited to a removable one such as a magnetic disk or an optical disk, and may be a fixed recording medium such as a hard disk device or a memory.

Further, a program that realizes at least a part of the functions of the information processing system may be distributed via a communication line (including wireless communication) such as the Internet. Further, the program may be encrypted, modulated, compressed, and distributed via a wired line or wireless line such as the Internet, or stored in a recording medium.

Further, the information processing system may be operated by one or more information processing devices. When a plurality of information processing devices are used, one of the information processing devices may be a computer, and the function may be realized as at least one means of the information processing system by executing a predetermined program by the computer.

Based on the above description, those skilled in the art may be able to conceive of additional effects and various modifications of the present invention, but aspects of the present invention are not limited to the individual embodiments described above. .. Various additions, changes and partial deletions are possible without departing from the conceptual idea and purpose of the present invention derived from the contents defined in the claims and their equivalents.

1 Information processing system 2 Terminal device 21 Control unit 211 Search condition acquisition unit 212 Information output unit 22 Communication unit 23 Storage unit 24 Operation unit 25 Output unit 3 Server 31 Control unit 310 Route information search unit 311 Candidate route search unit 312 Optimal route extraction Unit 313 Congestion degree calculation unit 314 Low congestion route extraction unit 32 Storage unit 321 Route database 322 Congestion degree database 33 Communication unit 4 Network

Claims (9)

A search means for searching for a low-congestion route in which the degree of vehicle congestion of public transportation is lower than the optimum route, as well as an optimum route using public transportation based on the route search condition.
An output means that outputs the low-congestion route together with the optimum route searched by the search means.
With
The search means
Candidate route search means for searching a candidate route based on the route search condition, and
An optimum route extraction means for extracting the optimum route from the candidate route, and
For each of the candidate routes, a congestion degree calculation means for calculating a representative congestion degree indicating the congestion degree of the route, and a congestion degree calculation means.
Among the candidate routes, a low-congestion route extraction means that extracts a route having the representative congestion degree lower than the representative congestion degree of the optimum route as the low-congestion route, and a low-congestion route extraction means.
Information processing system equipped with. The information processing system according to claim 1 , wherein the output means outputs the representative congestion degree of the optimum route together with the optimum route, and outputs the representative congestion degree of the low congestion route together with the low congestion route. The information processing system according to claim 1 or 2 , wherein the output means outputs the low-congestion route based on at least one condition of season, day of the week, date and time, and time zone. The search means further among the candidate routes, extracting the lowest the low congestion path vehicle congestion of public transport,
The output means further outputs the low-congestion route having the lowest degree of vehicle congestion in a manner distinguishable from the other candidate routes.
The information processing system according to claim 1. An output means that outputs a low-congestion route in which the degree of vehicle congestion of public transportation is lower than the optimum route, as well as an optimum route that uses public transportation based on route search conditions.
An information processing program for functioning as,
The low congestion route is
A candidate route is searched based on the route search condition, and the candidate route is searched.
The optimum route is extracted from the candidate route, and the optimum route is extracted.
For each of the candidate routes, a representative congestion degree indicating the congestion degree of the route was calculated.
Among the candidate routes, this is a route extracted as a route having the representative congestion degree lower than the representative congestion degree of the optimum route.
Information processing program . Computer,
With optimal route for public transport based on route search conditions, vehicle congestion of public transport to explore the low congestion path is lower than the optimal path, a search means,
Candidate route search means for searching a candidate route based on the route search condition, and
An optimum route extraction means for extracting the optimum route from the candidate route, and
For each of the candidate routes, a congestion degree calculation means for calculating a representative congestion degree indicating the congestion degree of the route, and a congestion degree calculation means.
Among the candidate routes, a low-congestion route extraction means that extracts a route having the representative congestion degree lower than the representative congestion degree of the optimum route as the low-congestion route, and a low-congestion route extraction means.
Search means, equipped with
An information processing program to function as. An information processing system consisting of multiple computers connected to each other so that they can communicate with each other.
With optimal route for public transport based on route search conditions, vehicle congestion of public transport to explore the low congestion path is lower than the optimal path, a search means,
Candidate route search means for searching a candidate route based on the route search condition, and
An optimum route extraction means for extracting the optimum route from the candidate route, and
For each of the candidate routes, a congestion degree calculation means for calculating a representative congestion degree indicating the congestion degree of the route, and a congestion degree calculation means.
Among the candidate routes, a low-congestion route extraction means that extracts a route having the representative congestion degree lower than the representative congestion degree of the optimum route as the low-congestion route, and a low-congestion route extraction means.
Search means, equipped with
An output means that outputs the low-congestion route together with the optimum route searched by the search means.
In order to make the information processing system equipped with
An information processing program for making at least one of the computers function as at least one of the means. Computer,
With optimal route for public transport based on route search conditions, vehicle congestion of public transport to explore the low congestion path is lower than the optimal path, a search means,
Candidate route search means for searching a candidate route based on the route search condition, and
An optimum route extraction means for extracting the optimum route from the candidate route, and
For each of the candidate routes, a congestion degree calculation means for calculating a representative congestion degree indicating the congestion degree of the route, and a congestion degree calculation means.
Among the candidate routes, a low-congestion route extraction means that extracts a route having the representative congestion degree lower than the representative congestion degree of the optimum route as the low-congestion route, and a low-congestion route extraction means.
Search means, equipped with
An output means that outputs the low-congestion route together with the optimum route searched by the search means.
An information processing program to function as. Search means, together with the optimum route to public transport based on route search conditions, comprising the steps of vehicle congestion of public transport to explore the low congestion path is lower than the optimal path,
A step of searching for a candidate route based on the route search condition, and
The step of extracting the optimum route from the candidate route and
For each of the candidate routes, a step of calculating a representative congestion degree indicating the congestion degree of the route, and
Among the candidate routes, a step of extracting a route having the representative congestion degree lower than the representative congestion degree of the optimum route as the low congestion degree, and a step of extracting the route.
And the steps to prepare
A step in which the output means outputs the low-congestion route together with the optimum route searched by the search means.
Information processing method including.

Images