JP6138934B2 - Traffic demand control device - Google Patents

Description

  The present invention relates to a traffic demand control apparatus.

As a background art in this technical field, there is JP 2009-61984 (Patent Document 1). This gazette states that “Passenger R who appeared at A station, which is the target station, when the planned travel route to B station is interrupted, (1)“ Waiting ”waiting for resumption of driving, ( 2) One of the “detour” actions for selecting a detour route that detours the operation interruption section is selected. This selection action is determined according to a route selection model that is a logit model. That is, the detour selection probability Pa is calculated based on the utility Ua for “detour” and the utility Uu for “wait”, and “detour” or “wait” is selected according to the calculated selection probability Pa. Is described.
Moreover, there exists Unexamined-Japanese-Patent No. 2010-18221 (patent document 2). This gazette states that “a simple prediction diagram in which the planned schedule is corrected without any operational arrangements under the assumed transportation obstacles is created as a provisional operational arrangement plan, and a passenger flow simulation is performed on this provisional operational arrangement plan. As a result of the flow simulation, the passenger flow estimation results such as the behavior of each passenger when the train is operated along the provisional driving arrangement plan and the evaluation of the provisional driving arrangement plan are obtained. Based on this, a new provisional driving arrangement plan that corrects the dissatisfied part of the provisional driving arrangement plan is created, and then a passenger flow simulation for the new provisional driving arrangement plan and a new part that corrects the dissatisfied part of the provisional driving arrangement plan are prepared. The provisional operation arrangement plan is repeatedly created, and among the repeatedly prepared provisional operation arrangement plans, the “best” provisional operation arrangement plan is evaluated. It has been described as being output. "As proposal.

Japanese Unexamined Patent Publication No. 2009-61984 JP 2010-18221 A

  In Patent Document 1, the utility Ua for “detour” and the utility Uu for “wait” are calculated based on the total required time and the waiting time until the operation resumption time, and the detour selection probability Pa is calculated to detour the passenger. Simulate behavior. On the other hand, this known example does not provide means for setting the waiting time until the total required time and the operation resumption time so that the selection probability Pa becomes a predetermined value. Therefore, when the schedule is disrupted, the “waiting” passenger and the “detouring” passenger are dispersed, and the railway cannot be controlled so that the railway congestion is dispersed.

  Moreover, in the said patent document 2, the railway passenger flow at the time of a failure is simulated, and the diagram which minimizes a passenger's invalid use is created. However, in this known example, it is possible to create a diagram that minimizes the ineffectiveness of the passenger who selects the route, but it is not possible to control the flow of the passenger so as to optimize the load on the entire railway network. Have difficulty.

  Therefore, an object of the present invention is to provide control information in which each transportation means has a desired use probability in a transportation network in which a plurality of transportation means are mixed.

In order to solve the above problems, for example, the configuration described in the claims is adopted.
The present application includes a plurality of means for solving the above-mentioned problems. For example, operation status data indicating past operation status, passenger flow history indicating use history of passenger traffic, and passenger traffic A storage unit that stores a control variable that is a judgment material when selecting a means, the operation status data stored in the storage unit, and the passenger flow history; An arithmetic processing unit that is obtained in association with a starting point or a destination, and the arithmetic processing unit obtains the control variable such that the use probability of each means of transportation in a specified operation situation becomes a predetermined value. The control variable is provided to a traffic management system.

  The present invention can provide control information such that each transportation means has a desired utilization rate in a transportation network in which a plurality of transportation means are mixed.

As a result, for example, passengers can be distributed over multiple modes of transportation or routes, and transportation can be controlled so that the load is not concentrated on a single transportation. Flow can be realized.
Problems, configurations, and effects other than those described above will be clarified by the following description of embodiments.

It is a block diagram of the 1st Example of a traffic demand control apparatus. It is an example of a route data table. It is an example of a point information data table. It is a figure explaining the relationship between an area, route information, and point information. It is an example of a diagram information data table It is an example of an operation trouble and accident example data table. It is an example of a passenger flow history data table. It is an example of the process sequence of a passenger flow estimation part. It is an example of the input information for calculating a utility function parameter in a passenger flow estimation part. It is an example of the output result of a passenger flow estimation part. It is an example of the process sequence of a traffic demand adjustment part. It is the example which calculated the route selection probability in a traffic demand control part. It is the figure which showed the example of visualization of the demand control in an operation plan preparation part. It is a block diagram of the 2nd Example of a traffic demand control apparatus. It is an example of the information stored in the passenger flow history database 110 in the 2nd Example of a traffic demand control apparatus. It is an example of the process sequence of a route set creation part. It is the figure which showed the example of the original route set before a route set creation process produced | generated from probe information. It is the figure which showed the example of the route set after a route set creation process.

  Hereinafter, embodiments will be described with reference to the drawings.

  In this embodiment, an example of a traffic demand control device that controls traffic demand and an operation management device that creates an operation plan and provides information to a user will be described.

  FIG. 1 is a diagram illustrating an example of a configuration of a traffic demand control device according to the present embodiment. The traffic demand control apparatus 100 includes a storage unit 130 that stores various programs and databases, and an arithmetic processing unit 120 that performs various calculations. The storage unit 130 stores the route database 108 and the operation failure / accident information database 109 as the operation information 101, and stores the passenger flow history database 110 as the flow information 102. Here, the route database 108 includes a route data table (FIG. 2), a point information data table (FIG. 3), and a diagram information data table (FIG. 5) which will be described later. The arithmetic processing unit 120 includes a passenger flow estimation unit 103 that estimates passenger flow and a traffic demand adjustment unit 104 that adjusts the use probability of passengers for each means of transportation as software executed by the arithmetic processing unit 120.

  The traffic demand control apparatus 100 includes an input device 150 configured with a keyboard, a mouse, and the like, and an output device 140 configured with a display or the like.

  The traffic demand control device 100 is connected to an operation management device 160 that performs train and bus operation plans and operation management. The operation management device 160 manages the operation according to the operation plan created by the operation plan creation unit 105 that creates a train or bus operation plan, the information provision unit 106 that provides information to the user, and the operation plan creation unit 105. An operation management unit 107 is provided.

  In the present embodiment, the arithmetic processing unit 120 is configured by, for example, a CPU and has various software as programs executed by the arithmetic processing unit 120. However, hardware or hardware can be obtained by designing, for example, an integrated circuit for each function or processing. Can also be realized. Further, although the operation management device 160 is described as being provided separately from the traffic demand control device 100, the operation processing unit 160 performs functions performed by the operation management device 160, or the operation processing unit 120 and the operation management device. A plurality of processes executed by 160 can be realized by separate hardware for each function.

  Hereinafter, the operation of each device in the traffic demand control device 100 will be described in detail.

  FIG. 2 is a diagram illustrating an example of a route data table stored in the route database 108 included in the operation information management unit 101. The route data table 200 stores data composed of elements of a record ID 201, a departure point 202, an arrival point 203, a route name 204, a distance 205, a fee 206, and a standard required time 207. The record ID 201 is an ID uniquely assigned to each record representing route data. The departure point 202 and the arrival point 203 are a combination of the departure point and the arrival point of the transportation of each route data. The point corresponds to a station when the transportation is a railroad, and a bus stop when the bus is a bus. The route name 204 is the name of the route to which the departure point 202 and the arrival point 203 belong. The distance 205, the fee 206, and the standard required time 207 are data representing the distance, the fee, and the standard required time between the departure point 202 and the arrival point 203.

  FIG. 3 is a diagram illustrating an example of the point information data table stored in the route database 108 included in the operation information 101. The spot information data table 300 stores data composed of elements of record ID 301, spot name 302, address 303, coordinates 304, and area ID 305. The record ID 301 is an ID uniquely assigned to each record representing the point information data. The point name 302 is information corresponding to the departure point 202 or the arrival point 203. The address 303 is address information of the point 302. The coordinates 304 are latitude / longitude information where the point name 302 exists. The area ID 305 is an ID for identifying the area to which the point belongs. The area ID is obtained by dividing the entire area of the city covered by the city traffic represented by the route into a predetermined range according to the position of the point and assigning it with a unique ID. As a dividing method, a method of dividing a rectangle with a predetermined size according to the position information of the point can be considered. Or you may divide | segment by an address unit. One area usually includes a plurality of pieces of point information. FIG. 4 is a diagram illustrating an example of the relationship between an area ID, route information, and point information. The relationship between the area ID, route information, and point information is, for example, as follows. There are a departure area 1 (401) and a destination area 2 (402) represented by rectangles, and the departure area 1 has stations A and C as points, and the destination area 2 has stations B and D. Exists. Line A is connected between station A and station B, and line Y is connected between station C and station D. As for the point and the route, a railroad or a bus can be considered as public transportation. FIG. 5 is a diagram illustrating an example of diagram information data stored in the route database 108 included in the operation information 101. The diamond information data 500 stores diamond information which is train or bus operation information data. FIG. 5 is a diagram showing an example of diagram information. In the diagram information 500, the horizontal axis represents time 501 and the vertical axis represents a station or bus stop position 502, and a line 503 represents the operation of one train or bus. As a result, it is possible to express which train and bus exist at which station. In addition, information on the operation interval for each route is also stored.

  FIG. 6 is a diagram showing an example of an operation failure / accident case data table stored in the operation failure / accident case database 109 included in the operation information 101. The operation failure / accident case data table 600 stores operation failure / accident case data that occurred in the past, record ID 601, date 602, occurrence time 603, scheduled operation resumption time 604, occurrence route 605, occurrence location 606, occurrence Data including each element of cause 607 and operation normalization time 608 is stored. The record ID 601 is an ID uniquely assigned to each operation failure / accident case data. The date 602 is a date when an operation failure or an accident occurs. Occurrence time 603 is the time when an operation failure / accident occurs. The scheduled operation resumption time 604 is a time at which the expectation that the transportation facility will resume operation due to the occurrence of an operation failure or accident is recorded. The generation route 605 is the name of the route where the failure / accident occurred. The occurrence location 606 is a location where a failure / accident occurred. The occurrence cause 607 is a cause of operation failure / accident. The operation normalization time 608 is the time when the transportation facility has recovered to normal operation. The difference between the operation normalization time 608 and the operation resumption scheduled time 604 is as follows. The scheduled operation resumption time is a time at which the manager who manages the operation immediately after the occurrence of the accident predicts when the operation can be resumed based on the past cases and the situation of the site. On the other hand, the operation normalization time 608 is the time when the transportation facility actually recovered to normal operation. If an accident or failure occurs at the present time, the passenger will be informed of the scheduled operation resumption time.

  FIG. 7 is a diagram illustrating an example of a passenger flow history data table stored in the passenger flow history database 110 included in the flow information 102. The passenger flow history data table 700 stores data including ID 701, entry time 702, entry time 703, entry station 704, and entry station 705. The entry / exit history data recorded in each record is generated from information on an IC card ticket or a magnetic ticket that has passed through an automatic ticket gate installed at a ticket gate of each station, for example, when using the railway as a transportation facility. ID 701 is an ID for identifying entry / exit information stored in each record, and is attached to each trip (one trip from entering the route facility until entering). The entrance time 702 is the time at which the entrance station 704 is entered. The entry time 703 is the time at which the entry station 705 is entered. Use route 706 is a route used by a passenger. Further, when the transportation is a bus or the like, information on the boarding time, the boarding time, the boarding point, and the boarding point may be stored in place of the entrance time 702, the entry time 703, the entrance station 704, and the exit station 705, respectively.

  In this embodiment, the route database 108 stored in the operation information 101, the operation failure / accident case information database 109, and the data tables stored in the passenger flow history database 110 stored in the flow information 102 are used as input information. Provide a device for controlling the traffic demand of transportation. Specifically, the traffic demand is controlled by the following procedure.

  The passenger flow estimation unit 103 performs processing for estimating passenger flow based on past data cases. The traffic demand adjustment unit 104 performs a process of calculating the selection probability of the transportation facility based on the estimated passenger flow information. And based on the calculated selection rate, the method of performing demand control by adjusting the selection probability for each route when an operation failure occurs is determined. The operation plan creation unit 105 determines an operation plan for each transportation facility based on the determined demand control information. The information providing unit 106 provides the determined demand control information to the user of the transportation facility. The operation management unit 107 manages the operation of trains and buses based on the determined operation plan.

  Each process will be described below.

The passenger flow estimation unit 103 performs processing for estimating passenger flow based on past data cases. In this embodiment, passenger flow is estimated by constructing a route selection model based on a discrete selection model. The route selection model based on the discrete selection model is a model based on the premise that a utility function of a route is defined and a passenger selects a route having a higher selection probability based on the utility value calculated by the utility function. For example, when considering moving from a certain departure area i to a destination area j, it is assumed that there are two means for moving, that is, route X and route Y. Assuming that the utility value of the route X (Y) is UX (Y), the selection probability PX (Y) for the passenger to select the route X is expressed by equations (1) and (2).
PX = Pr [UX> UY]… (1)
PY = 1- PX… (2)

As a typical discrete selection model, there is a logit model, which is expressed as Equation (3).
PX = exp (UX) / {exp (UX) + exp (UY)}… (3)

  Therefore, if the value of the utility function is changed, the selection probability will change accordingly.

  Hereinafter, in this embodiment, this logit model will be described as an example of passenger flow estimation. FIG. 8 is a flowchart showing a processing procedure of the passenger flow estimation unit 103.

  Passenger flow estimation unit 103 calculates parameters for determining the passenger's transportation means selection probability from past cases stored in route database 108, operation failure / accident information database 109, and passenger flow history database 110. This calculation process is performed every time data is accumulated to some extent, for example, every week.

First, in step 801, a utility function is determined. In the logit model, the utility function is expressed by a linear expression such as Expression (4).

In Equation (4), Um is the utility value of path m, X _km is the kth explanatory variable, α _k is a parameter, and β is a constant term.

  The utility value Um of the path m is calculated using the utility function obtained by determining the explanatory variables and then performing parameter estimation. Therefore, in step 801, processing for selecting an explanatory variable is performed based on the route database 108 stored in the operation information management unit 101 and the information stored in the operation failure / accident case information database 109. That is, in step 801, as an explanatory variable, for example, which item is used as the utility function among “fee”, “required time”, “number of operations per hour”, and “expected time until operation restart” is used. decide. Which item is to be adopted may be determined in advance or may be input by the user for each calculation.

  Information related to “charge” can be acquired from the charge 206 stored in the route data table 200. Information relating to “required time” can be acquired from the standard required time 207 or the difference between the entry time 702 and the entry time 703 stored in the passenger flow history database 110. The “number of services per hour” can be obtained from the diagram information data table. Information relating to “time to resume operation” can be acquired from the difference between the operation normalization time 608 and the occurrence time 603 stored in the operation failure / accident case data table 600.

  In step 802, with reference to the operation failure / accident case information database 109 stored in the operation information management unit 101, operation failure / accident case information related to the departure area i and the destination area j is acquired. The procedure for obtaining information on operation failures / accidents is as follows. First, the departure point 202 and the arrival point 203, which are information stored in the route data table 200, are acquired based on the information on the occurrence route 605, which is information stored in the operation failure / accident case data table 600. Next, based on the acquired information about the departure point 202 and the arrival point 203, the area ID 305 in the point information data table 300 is referred to, and the departure point where the departure area ID is i and the destination area ID is j 202, information on arrival point 203 is extracted.

  In step 803, based on the departure point 202 and arrival point 203 information extracted in step 802, the flow history information with the departure area ID i and the destination area ID j is extracted from the passenger flow history database 110. To do.

  In step 804, route selection result data is created based on the information extracted in steps 802 and 803. FIG. 9 shows route selection result data 900. The route selection result data 900 is data storing the value of each explanatory variable when each route is selected and the route selection result of each passenger.

  The route selection result data 900 includes data of an ID 901, a charge 902, a required time 903, the number of operations per time 904, a time 905 until the operation is resumed, and a selection result 907. These data sets exist as many as the number of routes used by passengers between the departure area i and the destination area j. Each passenger selects any one route, and the information is stored in the passenger flow history database 110. On the other hand, information on routes that have not been selected is referred to from the route database 109.

  ID 901 is ID 701 stored in the passenger flow history database 110. A fee 902 is a fee for each route, and corresponds to the fee 206 stored in the route data table 200. The required time 405 is the required time to the departure point 202 and the arrival point 203 where the departure area ID is i and the destination area ID is j. If the route is a selected route, the entry in the passenger flow history database 110 is performed. It is calculated from the time 702 and the entry time 703. On the other hand, if the route is not selected, the data of the standard required time 207 in the route data table 200 is referred to. The number of operations per hour 904 is the number of operations per hour of each route, and is referred to from the diagram information data table 400. The time 407 until the operation is restarted can be acquired from the difference between the operation normalization time 608 and the occurrence time 603 stored in the operation failure / accident case data table 600. In the case of a route in which no operation failure has occurred, a value of 0 is stored. The selection result 906 is data representing which route each passenger has selected. For example, when the passenger selects route 1, 1 is stored in the route 1 selection result, and 0 is stored otherwise.

In step 805, the value of the utility function parameter is calculated. Specifically, it is calculated as follows. The selection result of the route n of the passenger i stored in the selection result 906 is δ _in . Then, the simultaneous selection probability that the selection results for all passengers are realized is expressed as shown in Equation (5).

  Equation (5) becomes a function of the utility function parameter, and the utility function parameter can be calculated by maximizing L by the maximum likelihood estimation method using this function L as a likelihood function.

In step 806, it is determined whether utility function parameters have been calculated for all combinations of the departure area and the destination area. If there is a combination of a departure area and a destination area that has not been calculated, the process returns to step 802 to repeat the calculation. On the other hand, if the calculation has been completed for all the combinations, the processing in the passenger flow estimation unit is terminated.

  FIG. 10 is a diagram illustrating an output result of the passenger flow estimation unit 103. The output result 1000 stores a departure function area ID 1001, a destination area ID 1002, a departure area ID 1001, and a utility function parameter 1003 calculated for each destination area ID 1002.

  Next, the operation of the traffic demand adjustment unit 104 will be described.

  Based on the parameters of the utility function calculated by the passenger flow estimation unit 103, the traffic demand adjustment unit 104 determines the route of each route for the combination of the departure area and the destination area related to the route on which the operation failure or accident occurred. The value of the explanatory variable is calculated so that the selection probability becomes a desired value. Then, by outputting the calculated value of the explanatory variable to the operation plan creation unit 105, the control method of the transportation means in the route when the operation failure occurs is determined.

  Hereinafter, the operation of the traffic demand adjusting unit 104 will be described in detail.

  FIG. 11 is a flowchart showing the processing procedure of the traffic demand adjustment unit 104.

  In step 1101, information on an operation failure / accident that has occurred is input. When operation trouble / accident information occurs, the information is transmitted from the transport operator through the communication means. Information transmitted from the operator includes date 602, occurrence time 603, occurrence route 605, occurrence location 606, and occurrence cause 607 in the operation failure / accident case data table 600.

  In step 1102, a departure area and a destination area related to a route / point where an operation failure / accident has occurred are extracted. Specifically, first, a departure area and a destination area through which a route in which an operation failure or accident has occurred pass are extracted. Then, from the set of combinations of the departure area and destination area, the point where the operation failure / accident occurred is between the departure area and the destination area or within the area. Extract area combinations.

  In step 1103, search is made for explanatory variables such that the route stage selection probability for the departure area and destination area extracted in step 1102 becomes a predetermined value, and control information for adjusting the route selection probability in each route is obtained. create. Specifically, it is performed by the following method. From the output result 1000 of the passenger flow estimation unit 103, the utility function parameter 1003 relating to the extracted departure area and destination area is selected. Next, the utility function of the route selection model is determined by substituting the selected parameter into equation (4). And the selection probability shown in Formula (3) is calculated by adjusting the value of the explanatory variable in the utility function.

  FIG. 12 shows an image of an explanatory variable adjustment method. FIG. 12 shows changes in the selection probabilities of the routes X and Y when the price of the route X is changed as an example of explanatory variables. The adjustment of demand is performed as follows, for example. It is assumed that the value of route X and the selection probability of routes X and Y are points indicated by 1201 in a normal time when no operation failure or accident occurs. When an operation failure occurs from this point, a value of a charge within a predetermined selection probability, for example, a range shown in 1102, is searched starting from this value. The same processing is performed for other explanatory variables such as “required time”, “the number of operations per hour”, and “time until restart of operation”, and the value of the explanatory variable is searched so as to have a predetermined selection probability. . Since “time to resume operation” is uncertain at the stage where the operation failure occurs, an estimated value is designated based on past failure cases. The search method can be realized by a generally known optimization method with a constraint condition using a selection probability as an objective function. Alternatively, instead of calculating the selection probability by the optimization method, the traffic manager may set a predetermined selection probability.

In step 1104, the determined explanatory variable information is transmitted to the operation plan creation unit as control information of the transportation means.
The operation plan creation unit 105 uses the transportation control information created in the traffic demand adjustment unit 104 as input information to create a transportation plan for each route. Specifically, an operation diagram is created using a known diagram creation algorithm method with “required time” given as control information, “number of operations per hour”, and “time to resume operation” as constraints.

  The operation plan creation unit 105 has means for visualizing the selection probability of the transportation facility. For example, as shown in FIG. 13, with respect to the urban traffic network 1301, a point 1302 and a route 1303 where a failure occurs, a departure point 1305 and a destination 1306 related to the route 1304, and selection before and after the occurrence of the failure on each route It is conceivable to display probability changes 1307 and 1308 or to the traffic demand control device user via the output device 140.

  The information providing unit 106 is a device that guides control information to a passenger. Specifically, control information such as “required time”, “number of operations per hour”, and “time to resume operation” is sent to information boards installed at stations and bus stops and mobile terminals owned by passengers. Used to prompt the user to select a mode of transportation.

  The operation management unit 107 is a device that controls various control devices such as a signal device in order to operate a train and a bus based on an operation plan. Operation management can be performed by a known technique.

  In the present embodiment, an example of a traffic demand control apparatus capable of controlling not only public traffic demand control such as trains and buses but also road traffic on which ordinary vehicles travel will be described.

  FIG. 14 is an example of a configuration diagram illustrating the traffic demand control device 1400 according to the second embodiment.

  In the traffic demand control apparatus 100 of FIG. 1, the description of the components having the same functions as those already described with reference to FIG. 1 is omitted.

  In the traffic demand control apparatus 1400 according to the second embodiment, in addition to the configuration according to the first embodiment, the operation information 101 further includes a road database 1401 and a route set creation unit 1402. By adding this configuration, it is possible to perform demand control of road traffic on which ordinary vehicles travel.

  Hereinafter, the traffic demand control apparatus 1400 will be described.

  The road database 1401 stores information constituting the road map, such as node IDs, link IDs, road types, road types such as national roads and prefectural roads, and the like.

  The difference between the second embodiment of the operation failure / accident case data table 600 and the first embodiment is as follows. In the case of road traffic, the case of a fault accident can be expressed by whether the road has been closed or lane restricted in the case of road traffic, while the transportation has stopped operating. Therefore, the information stored in the scheduled operation resumption time 304, the generation route 305, and the operation normalization time 308 in the first example are the normal normal operation restart scheduled time, the generation road, and the normal operation in the second example, respectively. Time.

  In the second embodiment, information stored in the passenger flow history database 110 included in the flow information management unit 102 further stores flow information based on probe data collected from vehicles traveling on the road.

  FIG. 15 is a diagram illustrating an example of a passenger flow history data table stored in the passenger flow history database 110 of the flow information management unit 102 that is additionally stored in the second embodiment. The passenger flow history data table 1500 includes a vehicle ID 1501 for identifying a vehicle that has collected probe data, a road start node ID 1502 and an end node ID 1503 for identifying a road link from which probe data has been collected, and the vehicle has its road link. An inflow time 1504 that is a time when the vehicle enters the vehicle, a travel time 1505 when the vehicle passes the road link, and a travel distance 1506 are configured.

  The route set creation unit 1402 is a device that creates a set of routes on a road from a certain departure area to a certain destination area. When considering road traffic, which is the case of the second embodiment, there are many different routes from a certain departure area to a certain destination area, compared to when considering only public traffic. I think that. If routes with slightly different travel routes are regarded as different routes and used as a route set, the probe data that traveled on each route decreases, and a highly reliable discrete selection model cannot be created. In view of this, the route set creation unit 1402 performs processing that considers a route that can be regarded as the same route from a set of a plurality of different routes from a certain departure area to a certain destination area as a single route. A process of creating a route set that can be an option to the destination area is performed.

  Hereinafter, the operation of the route set creation unit 1302 will be described.

  FIG. 16 is a flowchart showing the operation of the route set creation unit 1302.

  In step 1601, probe information relating to all vehicles flowing out from area i and flowing into area j is extracted from the probe data stored in passenger flow history data table 1501. The area setting method is the same as in the first embodiment.

  FIG. 17 shows an image of probe information data relating to all vehicles that flow out of area i and flow into area j. A road link represented by a set of pairs of a start node ID 1502 and an end node ID 1503 constituting the probe information is represented as 1701. A certain route 1702 is expressed by a set of road links 1701. Moreover, since several vehicles may use the same road, it is possible that the road link which comprises another path | route overlaps on one path | route.

  In step 1602, focusing on a certain vehicle among the data extracted in step 1601, a road link sequence from area i to area j is extracted.

  In step 1603, it is determined whether there is a route registered as a route set. If it exists, go to the next step 1604. If one does not exist, the process proceeds to step 1606 described later.

  In step 1604, the link sequence is compared with all registered routes, and the duplication rate is calculated. The overlap rate is the rate at which road links overlap when link sequences are compared. When this ratio is large, the two link strings mean that the road links that overlap are large, and the link strings of both are similar.

  In step 1605, it is determined whether the duplication rate is equal to or less than a threshold value. If it is less than the threshold for all routes, it is determined that similar routes have not yet been registered in the route set. Then, the process proceeds to step 1606 to calculate the toll and the required time for the route. The toll is determined based on the operation policy of the road billing system. For example, it is conceivable to set a toll that is proportional to the travel distance. The required time is calculated based on the standard required time for each road link registered in the road database. Or you may use the result of integrating | accumulating the travel time of a road link row | line | column.

  In step 1607, the link string is registered in the route set as one of routes when area i is the destination and area j is the departure point.

  On the other hand, if it is determined in step 1605 that a route having an overlap rate equal to or greater than the threshold exists in the route set, it is determined that the route represented by the link string already exists in the route set. Then, the process returns to step 1602 and the same processing is performed on the link row related to the next vehicle.

  In step 1608, it is determined whether or not the processing has been completed for the traveling trajectories of all vehicles. If processing has not been completed for all the vehicles, the process returns to step 1602 to repeat the processing.

  In step 1609, it is determined whether or not the processing has been completed for all combinations of the departure area and the destination area. If not completed, the process returns to step 1601 to repeat the process.

  FIG. 18 shows an example of routes stored in the route set after the processing of the route set creation unit. In this embodiment, an example is shown in which it is determined that there are two routes from the departure area to the destination area. In addition, the stored route is regarded as the same route as a link string including many overlapping road links.

    In addition to the route set creation processing shown in the present embodiment, for example, as described in “Extraction of sightseeing tour route set by Screening method” (Civil Engineering Planning Lecture No. 22 (1), October 1999), the departure area, Alternatively, a processing method may be employed in which route search is performed a plurality of times between arbitrary nodes existing in the destination area, and the result is set as a route candidate set.

  The difference in operation between the passenger flow estimation unit 105 in the present embodiment and the passenger flow estimation unit 105 in the first embodiment is as follows. The explanatory variable of the utility function uses the charge, the time required, and the time until resumption of traffic. Further, in determining the route to be used in creating the selection result data, the route using the route having the highest probe data overlap rate is used.

  The operation of the demand adjustment unit 106 in this embodiment is the same as that in the first embodiment. However, unlike the case of the first embodiment, the explanatory variable of the utility function uses the charge, the required time, and the time until the traffic is resumed.

  The operation plan creation unit 105 performs creation processing of information to be provided to the vehicle such as a fee, a required time, and a time until restart of traffic.

  In this way, in this embodiment, it is possible to control so that the load is not concentrated on one transportation system, considering not only buses and railroads but also road traffic control of general vehicles as a choice of transportation means. .

  In addition, this invention is not limited to an above-described Example, Various modifications are included. For example, the structure which combined Example 1 and Example 2 is also considered. Further, the present invention can be operated not only when an operation failure occurs, but also during normal operation in order to distribute the load on the route.

  The above-described embodiments have been described in detail for easy understanding of the present invention, and are not necessarily limited to those having all the configurations described. Further, a part of the configuration of one embodiment can be replaced with the configuration of another embodiment, and the configuration of another embodiment can be added to the configuration of one embodiment. Further, it is possible to add, delete, and replace other configurations for a part of the configuration of each embodiment.

Each of the above-described configurations, functions, processing units, processing means, and the like may be realized by hardware by designing a part or all of them with, for example, an integrated circuit. Each of the above-described configurations, functions, and the like may be realized by software by interpreting and executing a program that realizes each function by the processor. Information such as programs, tables, and files for realizing each function can be stored in a recording device such as a memory, a hard disk, an SSD (Solid State Drive), or a recording medium such as an IC card, an SD card, or a DVD.
Further, the control lines and information lines indicate what is considered necessary for the explanation, and not all the control lines and information lines on the product are necessarily shown. Actually, it may be considered that almost all the components are connected to each other.

DESCRIPTION OF SYMBOLS 100 Traffic demand control apparatus 101 Operation information 102 Flow information 103 Passenger flow estimation part 104 Traffic demand adjustment part 105 Operation plan preparation part 106 Information provision part 107 Operation management part 108 Route database 109 Operation trouble and accident information database 110 Passenger flow history database 120 Arithmetic processing unit 130 Storage unit 140 Output device 150 Input device 160 Operation management device 1400 Traffic demand control device 1401 Road database 1402 Route set creation unit

Claims (8)

A storage unit that stores operation status data indicating past operation status, passenger flow history indicating a use history of a passenger's transportation means, and a control variable serving as a determination material when the passenger selects a transportation means;
An arithmetic processing unit that obtains a use probability for each means of transportation of a passenger in association with a departure place or a destination from the operation status data stored in the storage unit, and the passenger flow history,
The arithmetic processing unit obtains the control variable such that the use probability of each means of transportation in a specified operation situation becomes a predetermined value, and provides the control variable to a system for managing traffic Demand control device. In claim 1,
In the operation status data, operation failure information related to operation failures that occurred in the past is stored,
The said arithmetic processing part calculates | requires the said control variable that the utilization probability for every said transportation means becomes a predetermined value at the time of the operation failure of object, The traffic demand control apparatus characterized by the above-mentioned. In claim 2,
The arithmetic processing unit obtains a parameter necessary for obtaining a use probability from the control variable and the passenger flow history in association with a departure place or a destination,
Furthermore, the operation failure information related to the operation failure at the target date and time for adjusting the use probability is captured, and the use probability is a predetermined value using the parameter of the departure point or destination related to the operation failure. A traffic demand control device characterized by obtaining a control variable. In claim 1,
The storage unit further stores road map information,
The arithmetic processing unit generates set information of a route selected by a passenger from a predetermined departure point to a destination based on the passenger flow history and the road map information, and selects a main route from the set information, A traffic demand control device characterized by obtaining a use probability for each means of transportation using the selected route. The control variable according to claim 3, wherein the control variable is an explanatory variable in a discrete selection model,
The arithmetic processing unit obtains a parameter necessary for obtaining a utility value using a transportation fee for use or a required time as the explanatory variable, and the explanation for the use probability for each transportation means to be a predetermined value. A traffic demand control device characterized by obtaining a variable. The control variable according to claim 3, wherein the control variable is an explanatory variable in a discrete selection model,
The arithmetic processing unit obtains a parameter necessary for obtaining a utility value having the number of buses or trains operating per hour as the explanatory variable, and the explanatory variable such that a use probability for each means of transportation becomes a predetermined value. A traffic demand control device characterized by: In claim 1,
Furthermore, the traffic demand control apparatus provided with the operation plan preparation part which produces the operation plan of a transportation means based on the calculated | required said control variable. In claim 1,
Furthermore, the traffic demand control apparatus provided with the information provision part for guiding the calculated | required said control variable to the passenger using a transportation means.

Images