JP6246635B2 - Operation planning server and diamond creation method - Google Patents

Description

  The present invention relates to an operation plan server for creating a diagram and a diagram creation method.

  As a bus diagram creation method and apparatus capable of creating a diagram, there is a bus diagram creation method and apparatus disclosed in Patent Document 1 below. In the bus diagram creation method and apparatus, a boarding / alighting sensor that detects boarding / alighting of a user is provided at a boarding / alighting port of a bus that is driven by a driver. The detection signal of the boarding / alighting sensor is sent to the section-specific passenger number calculation section, and the calculation result of the section-specific passenger number calculation section is recorded on a recording medium in the recording section. This recording medium is removed from the recording unit after the predetermined operation of the bus is completed, and is used as input data for a diamond knitting apparatus in the bus company. This diamond knitting apparatus is provided with an operation number calculation unit and an operation display unit.

JP-A-9-330442

  However, in the above-described prior art disclosed in Patent Document 1, a diagram creation worker in the calculation center classifies the data on the recording medium by route and by the system constituting the route. Therefore, the conventional technique of Patent Document 1 has a problem that a diamond cannot be automatically created.

  An object of the present invention is to automatically create a diamond.

  An operation plan server and a diagram creation method according to an aspect of the invention disclosed in the present application are acquired by an acquisition process in which a processor acquires a movement demand in a schedule creation target time zone in an examination target route, and the acquisition process. Based on the travel demand and the capacity of the moving body, a first calculation process for calculating the required number of flights in the time zone of the schedule creation target in the examination target route, and the time length of the time zone of the schedule creation target And a second calculation process for calculating an operation interval in which the moving object operates in a time zone for which the schedule is created based on the required number of flights calculated by the first calculation process, A creation process in which the moving body creates a diagram that operates the route to be examined in the time zone for which the schedule is created, according to the operation interval calculated by the calculation process. Characterized in that it.

  According to a typical embodiment of the present invention, a diamond can be automatically created. Problems, configurations, and effects other than those described above will become apparent from the description of the following embodiments.

It is explanatory drawing which shows the diamond creation example 1 concerning a present Example. It is explanatory drawing which shows the diamond creation example 2 concerning a present Example. It is explanatory drawing which shows the system configuration example of an operation management system. FIG. 3 is a block diagram illustrating a hardware configuration example of each server illustrated in FIG. 2. It is explanatory drawing which shows the example of the memory content of a vehicle information table. It is explanatory drawing which shows the example of a memory content of a stop information table. It is explanatory drawing which shows the example of a memory content of a crew member information table. It is explanatory drawing which shows the example of the memory content of a path | route information table. It is explanatory drawing which shows the example of the memory content of a movement demand information table. It is explanatory drawing which shows the example of the memory content of a movement performance information table. It is explanatory drawing which shows the example of the memory content of schedule information. It is explanatory drawing which shows an example of input data. It is a flowchart which shows the example of an operation plan process by an operation plan server. It is a flowchart which shows an example of the diamond creation process (step S1203) regarding a selection use case when a selection use case is (UC1). It is a flowchart which shows an example of the diamond creation process (step S1302) by the simple automatic planning of FIG. It is a flowchart which shows an example of the diamond creation process (step S1403) by the simple automatic planning in the selection time slot | zone of FIG. It is a flowchart which shows the example of the diamond creation process (step S1303) by the optimal automatic planning shown in FIG. It is explanatory drawing 1 which shows the example of the diamond creation process (step S1603) by the optimal automatic planning in a selection time slot | zone. It is explanatory drawing 2 which shows the example of the diamond creation process (step S1603) by the optimal automatic planning in a selection time slot | zone. It is explanatory drawing 3 which shows the example of the diamond creation process (step S1603) by the optimal automatic planning in the selection time slot | zone. FIG. 17 is a flowchart showing an example of a diamond creation process (step S1603) by optimum automatic planning in the selected time period shown in FIG. It is explanatory drawing which shows the example 1 of the diamond creation process (step S1203) regarding a selection use case in case a selection use case is (UC2). It is explanatory drawing which shows the example 2 of the diamond creation process (step S1203) regarding the selection use case in case a selection use case is (UC2). It is explanatory drawing which shows the example 2 of the diamond creation process (step S1203) regarding the selection use case in case a selection use case is (UC2). It is a flowchart which shows an example of the diamond creation process (step S1203) regarding a selection use case when a selection use case is (UC2). It is a flowchart which shows an example of the input information setting process (step S2401) shown in FIG. It is a flowchart which shows an example of the diamond creation process (step S1203) regarding a selection use case when a selection use case is (UC3). It is explanatory drawing which shows the example of adjustment of a 1st adjustment process. It is explanatory drawing which shows the 1st adjustment process example in the case of FIG.27 (b). It is a flowchart which shows the 1st adjustment process example. 30 is a flowchart illustrating an example of a stool increase process (step S2903) for the specific stripe illustrated in FIG. 29. It is a flowchart which shows an example of the flight increase process (step S2904) in the specific operation area and specific time slot | zone shown in FIG. It is a flowchart which shows an example of the flight increase process (step S2905) with respect to the separate movement demand shown in FIG. It is a flowchart which shows the example of a diamond adjustment of the day in the case of a movement demand premise. It is a flowchart which shows the example of the day diamond adjustment in the case of a time interval premise. It is explanatory drawing which shows the example 1 of a display of the diamond automatically created by the simulation by optimal automatic planning or simple automatic planning. It is explanatory drawing which shows the example 2 of a display of the diamond automatically created by the simulation by optimal automatic planning or simple automatic planning.

  In the embodiment of the present invention, an operation plan of a bus, a tram, a trolley bus, and a water bus (hereinafter simply referred to as a bus) is simulated.

  The timetable is a timetable indicating a bus operation plan, and the arrival and departure times for each stop on the route are set. A diamond is created for each system, for example. A system is a set of routes having a common destination or midway route of a bus, and routes may be different even in the same system. A route is a route from a stop as a starting point to a stop as an end point. Even on the same route, the route may differ depending on the flight. For example, the stop that is the end point of the last flight may not be the stop at the end of the route, but may be some stops before that.

  The departure / arrival time is either the departure time or the arrival time, or both the departure time and the arrival time. A route in which a departure / arrival time is set for each stop on a route is referred to as a flight (also referred to as “suji”). In other words, a flight is time-series data of a series of stops from a start stop to an end stop where departure and arrival times are set for a certain route. Therefore, a set of flights becomes a diagram. A diamond can express a flight as a diagram. Embodiments of the present invention will be described below with reference to the accompanying drawings.

<Example of diamond creation>
FIG. 1A is an explanatory diagram of a diamond creation example 1 according to the present embodiment. FIG. 1A is an example in which a diagram is created by setting a streak according to the number of travel demands and the time of occurrence. Specifically, streaks are set to satisfy the minimum number of passengers. In the example of FIG. 1A, streaks s1 to s4 are set. Since the streaks s1 to s4 are set according to the number of travel demands and the generation time, the operation intervals d1 to d3 between the streaks are different time intervals (which may be the same as a result).

  FIG. 1B is an explanatory diagram of a diagram creation example 2 according to the present embodiment. FIG. 1B is an example of creating a diagram by setting a streak at a constant operation interval. Specifically, by counting the total number of travel demands in the target time zone (for example, 7: 0 to 7:59), the number of travel people (for example, 120 people) in the time zone is specified. If the bus boarding capacity is 40, three (= 120/40) streaks s1 to s3 may be set in the time zone. Since the time zone is 60 minutes from 7:00 to 7:59, the operation interval of the stripes s1 to s4 (s4 is the first stripe in the next time zone) is 20 minutes (= 60 minutes / 3 lines) It becomes.

  In this way, in this embodiment, a diamond can be automatically created. The diagrams shown in FIGS. 1A and 1B are displayed on the display of the operation plan server described later.

<System configuration example>
FIG. 2 is an explanatory diagram illustrating a system configuration example of an operation management system. The operation management system 200 is a system in which an operation plan server 201 is communicably connected to a search server 202, a reservation server 203, a location server 204, and a diagram organization server 205. As shown in FIG. 1A and FIG. 1B, the operation plan server 201 is a server that creates a schedule that is a bus operation plan by an operation from the administrator terminal 210 or simulates the operation with the created diagram. . The search server 202 is a server that searches for a route (or stripe) in accordance with a request from the user terminal 220. The search server 202 may acquire position information (for example, longitude and latitude) of the user terminal 220 or the relayed radio base station when the search is requested. At least a part of the movement demand shown in FIGS. 1A and 1B is information created based on the user of the user terminal 220, for example.

  The location server 204 is a server that manages the operation status of the bus 230. Each bus 230 is equipped with an in-vehicle device 240 and can communicate with the location server 204. The location server 204 acquires the current location information of the bus from the vehicle-mounted device 240. The reservation server 203 is a server that manages reception of seat reservations from the user terminal 220, reserved seats, and information on reserved users. The diamond organization server 205 is a server that organizes diamonds. The diamond composition server 205 can correct the diamond by an operation from the administrator terminal 210. The bus operates according to a schedule held in the schedule organization server 205.

<Example of server hardware configuration>
FIG. 3 is a block diagram illustrating a hardware configuration example of each of the servers 201 to 205 (hereinafter collectively referred to as the server 300) illustrated in FIG. The server 300 includes a processor 301, a storage device 302, an input device 303, an output device 304, and a communication interface (communication IF 305). The processor 301, the storage device 302, the input device 303, the output device 304, and the communication IF 305 are connected by a bus. The processor 301 controls the server 300. The storage device 302 serves as a work area for the processor 301.

  The storage device 302 is a non-temporary or temporary recording medium that stores various programs and data. Examples of the storage device 302 include a ROM (Read Only Memory), a RAM (Random Access Memory), an HDD (Hard Disk Drive), and a flash memory. The input device 303 inputs data. Examples of the input device 303 include a keyboard, a mouse, a touch panel, a numeric keypad, and a scanner. The output device 304 outputs data. Examples of the output device 304 include a display and a printer. The communication IF 305 is connected to a network and transmits / receives data.

<Examples of stored contents of various tables>
Examples of stored contents of various tables held by the operation plan server 201 will be described. The various tables are information given to the operation plan server 201 in advance. In the following description, the “table” format is used. However, the data structure is not necessarily expressed by a table, and may be expressed by a data structure such as a list, a DB, a queue, or the like. Therefore, “table”, “list”, “DB”, “queue”, etc. may be simply referred to as “information” to indicate that they do not depend on the data structure. In addition, when explaining the contents of each information, the expressions “identification information”, “identifier”, “name”, “name”, “ID” can be used, and these can be replaced with each other. It is.

FIG. 4 is an explanatory diagram showing an example of stored contents of the vehicle information table. The vehicle information table 400 is a table for managing bus information indicating the characteristics of the bus. The vehicle information table 400 includes a vehicle ID item, a capacity item, a CO ₂ emission amount item, a depreciation expense item, and a noise item. The bus information indicating the characteristics of is specified.

The vehicle ID item stores a vehicle ID that is identification information for uniquely identifying a bus. The capacity item stores the number of passengers that is a guideline for getting on the bus. The CO ₂ emission amount item stores the CO ₂ emission amount discharged during the operation of the bus. The CO ₂ emission amount is the amount of CO ₂ . In addition to CO ₂ emissions, NO _x emissions may also be used. The depreciation expense item stores the depreciation expense of the bus. The noise item stores the volume of noise generated by the bus. The volume of the noise is set depending on, for example, the type of bus. These items are examples, and the fuel consumption of the bus may be stored.

  FIG. 5 is an explanatory diagram showing an example of the stored contents of the stop information table. The stop information table 500 is a table for managing stop information indicating the characteristics of the stop. The stop information table 500 has a stop ID item, a stop name item, and a location information item for each stop. By setting a value for each item, stop information indicating the characteristics of the stop in entry units is displayed. Identify. The stop information includes stop information of existing stops, as well as stop information of new stops added by new routes or new routes.

  The stop ID item stores a stop ID that uniquely identifies the stop. In the stop name item, a name (stop name) assigned to the stop is stored. The location information item stores location information (for example, latitude and longitude) of the stop.

  FIG. 6 is an explanatory diagram showing an example of the stored contents of the crew information table. The crew member information table 600 is a table for managing crew member information indicating characteristics of crew members. The crew member information table 600 includes a crew member ID item, a personal information item, and a personnel expense item, and values are set in the respective items, thereby specifying crew member information indicating characteristics of the crew member in units of entries.

  In the crew ID item, a crew ID that uniquely identifies the crew is stored. The personal information item stores personal information such as the name, affiliation, and contact information of the crew member. The personnel cost item stores the cost when the crew member performs the operation work. As an example, the labor cost when driving one bus on a certain route is stored.

  FIG. 7 is an explanatory diagram of an example of the contents stored in the route information table. The route information table 700 is a table for managing route information indicating the characteristics of the route. The route information table 700 includes a route ID item, a start stop information item, a via stop information item, and an end stop information item, and a value is set in each item, so that the feature of the route in units of entries. The route information indicating is specified. The route information includes route information of a new route and route information of an existing route.

  The route ID item stores a route ID that uniquely identifies the route. Here, as an example, “R1a” and “R1b” are stored, but R1a and R1b are an upstream route and a downstream route on the same route (a at the end indicates upstream and b indicates downstream). . The starting point stop information item stores the starting point stop information. The starting point stop information is information indicating the characteristics of the starting point, that is, the starting point stop serving as the starting point. For example, the starting point stop ID and the distance from the starting point stop are stored.

  The via stop information is stored in the via stop information item. The route stop information is information indicating the characteristics of a route stop that is a stop through, and stores, for example, a stop ID of a start point stop and a distance from the start point stop. One or more transit stop information is stored. In the end point stop information item, end point stop information is stored. The end point stop information is information indicating characteristics of the end point, that is, the end point stop that is the final arrival point, and stores, for example, the stop ID of the end point stop and the distance from the start point stop.

  FIG. 8 is an explanatory diagram showing an example of the stored contents of the movement demand information table. The movement demand information table 800 is a table for managing movement demand information indicating characteristics of movement demand for new routes and new routes. The travel demand is a demand for travel using a bus that passes through a new stop, for example, a passenger who wants to get on the bus. The movement demand information table 800 includes a movement demand ID item, an occurrence information item, a boarding information item, a moving person number item, a getting-off information item, and an arrival information item, and a value is set for each item. Thus, the movement demand information indicating the characteristics of the movement demand is specified for each entry.

  In the movement demand ID item, a movement demand ID which is identification information for uniquely identifying the movement demand is stored. The occurrence information item stores occurrence information that the movement demand will occur. For example, the occurrence information is a location where the travel demand occurs and a time when the travel demand occurs. For example, the place of occurrence includes a home of travel demand, a station where the travel demand has dropped off, and the like.

  In the boarding information item, boarding information of the travel demand is stored. The boarding information is the stop ID of the stop where the travel demand is to get on and the boarding time at which the bus is to be boarded. The number of persons included in the movement demand is stored in the movement number of people item. In the getting-off information item, getting-off information of the movement demand is stored. The getting-off information is a stop ID of a stop that the user wants to get off from the bus on which the travel demand has taken, and a boarding time at which the user wants to get off. In the arrival information item, arrival information of the movement demand is stored. The arrival information is an arrival place and arrival time at which the travel demand is desired to arrive. Arrival locations include, for example, offices for travel demand, schools, and stations that people want to board.

  FIG. 9 is an explanatory diagram of an example of the stored contents of the movement record information table. The movement record information table 900 is a table that manages movement record information indicating the characteristics of the movement record for existing routes and existing routes. Each item of the movement record information table 900 is the same as the movement demand information table 800, but has a different meaning. In other words, the occurrence information is information indicating that a movement demand has occurred, the boarding information is information on which the movement demand has been boarded, the number of persons moving is the number of persons who have moved, and the disembarking information is that the demand for movement has dropped off. It is information, and arrival information becomes the information that the movement demand arrived.

  FIG. 10 is an explanatory diagram of an example of stored contents of schedule information. The schedule information 1000 is information in which a schedule on a certain route is associated with a bus ID and a crew ID of a bus operated by the schedule. The diamond is acquired from the diamond organization server 205, for example. Here, the schedule information 1000 of a certain route L is taken as an example. The schedule information 1000 has a start point departure time, an end point arrival time, a bus ID, and a crew member ID for each flight. For example, the information is stored for each day of the week. In FIG. 10, the schedule information 1000 for the day of the week is shown, but it may be a daily unit, a week unit, a biweekly unit, a monthly unit, or the like.

  FIG. 11 is an explanatory diagram showing an example of input data. The input data 1100 is information given to the operation plan server 201, may be given in a file format, or may be given by an administrator's operation input from the administrator terminal 210. The input data 1100 includes, for example, a route ID, a departure time, a travel demand ID, an automatic planning type, a minimum operation interval, an expected boarding rate, a longest waiting time, and a minimum number of passengers. The departure time is the departure time from the starting point stop on the route specified by the route ID. The automatic planning type is a type of diamond automatic planning, and there are two types: simple automatic planning and optimum automatic planning. The minimum operation interval is a lower limit value of the operation interval to be observed in automatic planning. The expected occupancy rate is the occupancy rate that is expected by the planned schedule. The longest waiting time is an upper limit value of the waiting time of passengers to be observed in automatic planning. The minimum number of passengers is the lower limit of the number of passengers that must be observed in automatic planning.

<Operation plan processing by the operation plan server 201>
Next, an operation plan process by the operation plan server 201 will be described. The operation plan includes, for example, the following four types of use cases (UC1) to (UC4).

(UC1) New route planning (when there is no existing route)
(UC2) New route planning (when existing routes exist)
(UC3) Schedule revision (UC4) Schedule adjustment on or after that date

  The operation plan server 201 receives the selection of any of the above use cases (UC1) to (UC3) and executes a process of planning an operation plan according to the selected use case. There are two types of bus operations, one based on travel demand and the other based on the operation interval (also referred to as the operation interval; simply “time interval”). . In this embodiment, as shown in FIG. 1A, there are an optimum automatic planning that plans a schedule in accordance with the movement demand, and a simple automatic planning that makes the operation interval constant as shown in FIG. 1B. In an environment that operates on the premise of moving demand, either optimum automatic planning or simple automatic planning can be applied. In an environment that operates on a time interval basis, simple automatic planning may be adopted.

  FIG. 12 is a flowchart showing an operation plan processing example by the operation plan server 201. The operation plan server 201 acquires the examination target route (step S1201). The route to be considered is a new route that does not have a diamond set when creating a diagram for a new route, and an existing route that has a diamond that is subject to revision when it is revised. is there. Specifically, the operation plan server 201 refers to the route ID of the input data 1100, for example, and acquires the corresponding entry from the route information table 700 shown in FIG. 7 as the examination target route. For example, if the route ID of the input data 1100 is “R2a”, the operation plan server 201 acquires an entry whose route ID is “R2a” from the route information DB.

  Next, the operation plan server 201 receives a use case selection by an operation of the administrator (step S1202). Specifically, for example, the operation plan server 201 accepts selection of any use case from the use cases (UC1) to (UC3) displayed on the display as an output device by an operation of the administrator. In the case of (UC4), since it is a separate flow, it is not selected in step S1202.

  Then, the operation plan server 201 executes a diagram creation process regarding the selected use case (step S1203). In the diagram creation process related to the selected use case (step S1203), a diagram corresponding to the selected use case is created. The diamond creation process (step S1203) related to the selected use case will be described later because the process differs for each use case.

  After the diagram creation process (step S1203) related to the selected use case, the operation plan server 201 acquires vehicle and crew resource information (step S1204). The vehicle and crew resource information may be acquired by an operation input from an administrator, or may be included in the input data 1100. The vehicle resource information is an upper limit value of the number of buses used for the created diagram, and the crew member resource information is an upper limit value of the number of crew members used for the created diagram.

  Further, the operation plan server 201 acquires the schedule information 1000 shown in FIG. 10 (step S1205). Then, the operation plan server 201 refers to the acquired schedule information 1000, the vehicle information table 400, and the crew information table 600, and waits for the created schedule under the constraint conditions based on the vehicle and crew resource information. And the waiting crew are assigned (step S1206). Specifically, for example, the operation plan server 201 has a bus ID of a waiting vehicle that does not operate on an existing route in the schedule information 1000 or a crew member who does not operate a bus on an existing route for a created line with a diagram. An ID is specified and assigned to a certain streak.

  Next, the operation plan server 201 determines whether or not the assignment in step S1207 is successful (step S1207). The criteria for determining success is, for example, whether or not the assignment was made in compliance with the constraint conditions based on the vehicle and crew resource information. For example, if it is assigned under the constraint condition, it is a success (step S1207: Yes), and if it is violated, it is a failure (step S1207: No).

  In the case of failure (step S1207: No), the operation plan server 201 changes the resource information that is the constraint condition by the operation input of the administrator (step S1208), and returns to step S1206. On the other hand, in the case of success (step S1207: Yes), the operation plan server 201 calculates an evaluation value for the created diamond (step S1209). The evaluation value E is calculated by the following formula (1), for example.

Evaluation value E = A × Bus regularity evaluation value + B × Convenience evaluation value + C × Profitability evaluation value + D × Environmental evaluation value
... (1)

  In the above formula (1), A to D are weights, which may be acquired by operation input from the administrator, or may be included in the input data 1100. The bus punctuality evaluation value is a delay rate indicating a probability that the bus has not arrived at the stop on time. For example, it can be calculated by the number of delayed stops / (number of stops arriving on time + number of delayed stops). In the case of creating a new route diagram, the A × delay rate that is the first term is not applied.

  The convenience evaluation value is an index value indicating the convenience of the user (passenger) who uses the bus. The convenience evaluation value is calculated by, for example, the following formula (2).

  Convenience evaluation value = B1 x operation interval + B2 x congestion rate (2)

  In the above formula (2), B1 and B2 are weights, which may be acquired by an operation input from the administrator, or may be included in the input data 1100. The operation interval is a time interval during which the bus operates in the diagram created in the diagram creation process (step S1203) related to the selected use case, and is calculated by the diagram creation process (step S1203) related to the selected use case.

  The congestion rate is a ratio indicating how much the bus is congested, and is calculated by, for example, the maximum number of passengers obtained per section / bus capacity for a certain route. The maximum number of passengers may be the average of the maximum values obtained for each stripe, or may be the maximum value, median value, minimum value, or any value.

  The profitability evaluation value is an index value indicating the profitability of the bus operator. The profitability evaluation value is calculated by the following formula (3), for example.

  Profitability evaluation value = C1 x Fare revenue + C2 x Personnel expenses + C3 x Depreciation expenses (3)

  In the above formula (3), C1 to C3 are weights, which may be acquired by an operation input from the administrator, or may be included in the input data 1100. The fare revenue is a value obtained by multiplying the fare per passenger in the created diagram by the number of passengers (the number of persons in the movement demand information table 800). The labor cost is a labor cost per crew member operating on the created diamond, and is acquired from the crew information table 600 of FIG. 6, for example. The depreciation cost is the depreciation cost of the bus operated by the created diagram, and is acquired from the bus information table of FIG.

  The environmental evaluation value is an index value indicating the influence of the bus operated by the created diagram on the environment. The environmental evaluation value is calculated by, for example, the following formula (4).

Environmental evaluation value = D1 x CO ₂ emissions + D2 x noise (4)

In the above formula (4), D1 and D2 are weights, which may be acquired by an operation input from the administrator, or may be included in the input data 1100. CO ₂ emissions, the buses that diamonds created is the amount of CO ₂ to be discharged, is acquired from the bus information table in FIG. The noise is the noise of the bus operated by the created diagram, and is acquired from the bus information table of FIG.

  After calculating the evaluation value in step S1209, the operation plan server 201 displays the created diamond and the calculated evaluation value on a display which is an output device (step S1210). Thereby, the administrator can evaluate the created diagram according to the size of the evaluation value.

  In addition, the operation plan server 201 determines whether or not the evaluation value is greater than or equal to the reference value (step S1211). If it is not equal to or higher than the reference value (step S1211: No), the operation plan server 201 changes the weight used in the input data 1100, constraint conditions (resource information), and other evaluation value formulas (1) by the operation of the administrator. (Step S1212), the process returns to Step S1203 or Step S1206. Which step to return to is determined by the operation of the administrator.

  On the other hand, when the evaluation value is greater than or equal to the reference value (step S1211: Yes), the operation plan server 201 displays on the display that is the output device 304 that the created diagram is an evaluation value that is greater than or equal to the reference value (step S1213). ). As a result, the series of processes is completed. Thus, since the evaluation value is calculated and displayed for the created diamond, the administrator can objectively determine whether the created diamond is suitable for operation.

<Diagram Creation Processing for Selected Use Case When Selected Use Case is (UC1) (Step S1203)>
FIG. 13 is a flowchart illustrating an example of a diagram creation process (step S1203) related to a selected use case when the selected use case is (UC1). In FIG. 13, the operation plan server 201 refers to the planning type of the input data 1100 and determines whether to execute the simple automatic planning or the optimal automatic planning (step S1301). When executing simple automatic planning (step S1301: simple), the operation plan server 201 executes a diagram creation process by simple automatic planning (step S1302), and proceeds to step S1304. On the other hand, when the optimum automatic planning is executed (step S1301: optimum), the operation plan server 201 executes a diagram creation process by the optimum automatic planning (step S1303), and proceeds to step S1304.

  FIG. 14 is a flowchart illustrating an example of a diagram creation process (step S1302) based on the simple automatic planning in FIG. The operation plan server 201 determines whether there is an unselected time zone (step S1401). Here, the time zone is a time width for creating a streak, and may be, for example, a unit such as one hour or a range such as morning or afternoon. The same applies to the following processing.

  When there is an unselected time zone (step S1401: Yes), the operation plan server 201 selects an unselected time zone (step S1402), and executes a diagram creation process by simple automatic planning in the selected time zone ( Step S1403). Then, control goes to a step S1401. On the other hand, if there is no unselected time zone in step S1401 (step S1401: No), the process proceeds to step S1404.

  FIG. 15 is a flowchart showing an example of a diagram creation process (step S1403) by simple automatic planning in the selected time zone of FIG. The operation plan server 201 determines whether there is a confirmed streak in the selected time zone (step S1501). The confirmed line is a line in which the arrival / departure time of the bus stop is confirmed, and is a line that should not be changed by a diagram creation process (step S1503) by simple automatic planning in a selected time zone. The setting of the fixed stripe can be executed by the operation of the administrator before the diamond creation process (step S1503) by the simple automatic planning in the selected time zone. If there is a confirmed streak (step S1501: Yes), a diamond creation process based on optimum automatic planning in the selected time zone is executed (step S1508), and the process proceeds to step S1501. Details of the diamond creation process (step S1508) by the optimum automatic planning in the selected time zone will be described later.

  On the other hand, when there is no confirmed streak (step S1501: No), the vehicle information table 400, the travel demand information table 800, the expected boarding rate, and the minimum operation interval are read (step S1502), and the necessary number of streaks in the selected time zone is calculated. (Step S1503). For example, it is assumed that the selection time zone is 1 hour from 7:00 to 7:59. In this selected time zone, the operation plan server 201 identifies an entry whose departure time is in the selected time zone among the entries in the travel demand information table 800. Here, as an example, it is assumed that the total number of moving people of the specified entry is 150 people. If the bus capacity is 50 people, it is necessary to operate 3 buses per hour. These three are the required number.

  Next, the operation plan server 201 calculates an operation interval. In the case of the above example, since it is necessary to operate three buses per hour, the operation interval is calculated as 20 minutes. The operation plan server 201 determines whether the operation interval exceeds the minimum operation interval (step S1505). When an operation interval exceeds the minimum operation interval (step S1505: Yes), it transfers to step S1507. On the other hand, when the operation interval does not exceed the minimum operation interval (step S1505: No), the operation plan server 201 sets the operation interval to the minimum operation interval (step S1506), and proceeds to step S1507.

  In step S1507, the operation plan server 201 creates a diagram in the selected time zone for each stop using the operation interval. In the above example, when three trains are operated in one hour (operation interval: 20 minutes), for example, the operation plan server 201 sets the time of 7:00 departure, 7:20 departure, and 7:40 departure for the starting stop. Set. In the subsequent stop, the operation plan server 201 sets a departure / arrival time shifted by an operation time corresponding to the distance from the start stop.

  At the starting stop, the earliest time in the selected time zone was set at 7:00, but the minimum operation interval from the departure time of the last flight in the previous time zone from 6:00 to 6:59 It is good also as the time which added. For example, if the departure time of the first stop of the last flight from 6:00:00 to 6:59 is 6:45, the operation interval is 20 minutes, so the operation plan server 201 issues 7:05 departure for the start stop. , 7:25 departure, 7:45 departure. Thereafter, the process proceeds to step S1501. Thus, in the diamond creation process (step S1503) by simple automatic planning, diamond creation can be executed at high speed. Next, optimum automatic planning will be described.

  FIG. 16 is a flowchart showing an example of a diagram creation process (step S1303) based on the optimum automatic planning shown in FIG. The operation plan server 201 determines whether there is an unselected time zone (step S1601). When there is an unselected time zone (step S1601: Yes), the operation plan server 201 selects an unselected time zone (step S1602), and executes a diagram creation process by optimum automatic planning in the selected time zone ( Step S1603). Then, control goes to a step S1601. On the other hand, if there is no unselected time zone in step S1601 (step S1601: No), the process proceeds to step S1604. Next, a diagram creation process (step S1603, step S1608) by optimum automatic planning in the selected time zone will be described.

  17 to 19 are explanatory diagrams illustrating an example of a diagram creation process (step S1603) based on the optimum automatic planning in the selected time zone. Here, the selection time zone is set to 7:00 to 8:00. In addition, the minimum number of passengers in each section (between adjacent stops) is 25, and the minimum operation interval is 10 minutes. The operation interval setting information 1700 is information that holds a plurality of operation intervals set in advance. Since the minimum operation interval is 10 minutes, the initial position in the operation interval setting information 1700 is set to 10 minutes. Further, A to G are stops, and A is a start stop and G is an end stop. It is assumed that a streak having a departure time of 7:00 at stop A has already been set (existing streak).

  Since the minimum operation interval is 10 minutes, the investigation target stripe is temporarily set as 7:10 departure at the starting point stop A. Based on the travel demand information, the travel demand between the existing streak and the target streak is 12 between AB, 16 between AG, 20 between CD, 7 between DE, and 3 between EG . As shown in FIG. 16, the number of passengers in each section is 28 for AB, 28 for BC, 43 for CD, 43 for DE, 46 for EF, 46 for FG, 23 for FG It becomes. Since the minimum number of passengers in each section is 25, the section FG is not satisfied. Therefore, the operation plan server 201 shifts the operation interval information from 10 minutes to 12 minutes.

  FIG. 18 shows a state where the operation interval setting information 1700 is shifted to 20 minutes. The movement demand in FIG. 18 is the same as the movement demand in FIG. Therefore, the section FG is not satisfied. Since the next operation interval of 20 minutes is 30 minutes, which is the longest waiting time, the operation interval is fixed at 30 minutes.

  FIG. 19 also shows a state where the operation interval setting information 1700 is shifted to 20 minutes, as in FIG. The difference from FIG. 18 is that a new movement demand is added at 7:25. Accordingly, as shown in FIG. 19, the number of passengers in each section is 28 between AB, 28 between BC, 43 between CD, 47 between DE, 47 between EF, 50 between FG, and FG So 27 people. Therefore, since every section is more than the minimum number of passengers, the operation interval is determined in 20 minutes. In the examples of FIGS. 17 to 19, the example has been described in which the operation interval is extended starting from the minimum operation interval and the optimum operation interval is searched within a range not exceeding the longest wait time. Then, the operation interval may be reduced, and the optimum operation interval may be searched within a range that does not fall below the minimum operation interval.

  FIG. 20 is a flowchart showing an example of a diagram creation process (step S1603) based on the optimum automatic planning in the selected time period shown in FIG. Step S1508 in FIG. 15 is the same process. Here, in conjunction with the description of FIGS. 17 to 19, a flowchart for starting the minimum operation interval and extending the operation interval and searching for an optimal operation interval within a range not exceeding the longest waiting time will be described.

  The operation plan server 201 reads the travel demand information table 800 and the input data 1100 (longest waiting time, minimum number of passengers, minimum operation interval) (step S2001), and sets the operation interval to the minimum operation interval (step S2002). Next, the operation plan server 201 sets a starting point (step S2003). The starting point is the departure time of the starting point stop in the selected time zone.

  For example, when the selected time zone is 7:00 to 7:59, when temporarily setting the first streak, the operation plan server 201 sets 7:00 departure at the starting point stop. At the starting stop, the earliest time in the selected time zone was set at 7:00, but the minimum operation interval from the departure time of the last flight in the previous time zone from 6:00 to 6:59 It is good also as the time which added. For example, when the departure time of the first stop of the last flight from 6:00 to 6:59 is 6:55, assuming that the minimum operation interval is 10 minutes, the operation plan server 201 sets the start point stop at 7: Set 00. For the second and subsequent streaks, the streaks may be temporarily set at the time that is the minimum operation interval from the immediately preceding streak.

  The operation plan server 201 calculates the number of passengers in each section when a streak is drawn at the operation interval with reference to the starting point (step S2004). Then, the operation plan server 201 determines whether or not any section satisfies the minimum number of passengers ≦ the number of passengers (step S2005). When satisfy | filling (step S2005: Yes), the operation plan server 201 confirms an operation space | interval (step S2011), and transfers to step S2012. On the other hand, when not satisfy | filling (step S2006: No), the operation plan server 201 expands an operation interval according to the operation interval setting information 1700 (step S2006).

  Then, the operation plan server 201 determines whether or not there is a minimum operation interval up to the confirmed line immediately after that (step S2007). If not (Step S2007: No), the starting time is changed to the starting time at the minimum travel interval from the confirmed streak immediately after the starting point stop (Step S2008), and the process returns to Step S2004.

  On the other hand, when the minimum operation interval is reached (step S2007: Yes), the operation plan server 201 determines whether or not the operation interval is less than the longest waiting time (step S2009). When it is below (step S2009: Yes), it returns to step S2004. On the other hand, when the operation interval is not less than the longest waiting time (step S2009: No), the operation interval is set to the longest waiting time (step S2010), and the process proceeds to step S2012. In step S2012, the operation plan server 201 creates a diagram for each stop using the operation interval (step S2012). Thereby, streaks are set.

<Diagram Creation Processing for Selected Use Case When Selected Use Case is (UC2) (Step S1603)>
FIG. 21 is an explanatory diagram of an example 1 of the diagram creation process (step S1203) regarding the selected use case when the selected use case is (UC2). FIG. 21 shows an example in which an operation plan for a new route that passes through some of the existing routes is prepared. Here, as an example, the route passing through the stop A-B-C-D is an existing route, and the route passing through the stop A-E-F-G is a new route. Stops E, F and G are new stops. T is a destination point.

  It is assumed that a place where the travel demand MDx using the existing route is generated is between the stop B and the stop E. Further, the distance from the travel demand MDx to the stop B is α, and the distance from the travel demand MDx to the stop E is β. When the new route is opened, the probability that the movement demand MDx shifts from the stop B to the stop E, that is, the shift rate X (E) can be calculated by the following equation (5), for example.

  X (E) = β / (α + β) (5)

  Therefore, the operation plan server 201 executes the automatic planning of a new route by using the number of moving people obtained by multiplying the number of moving people of the movement demand MDx by the shift rate X (E).

  FIG. 22 is an explanatory diagram illustrating Example 2 of the diagram creation process (step S1203) regarding the selected use case when the selected use case is (UC2). FIG. 22 is also an example of planning an operation plan for a new route that passes through some of the existing routes. In the case of FIG. 22, it is assumed that a certain travel demand MDy moves to a destination point by car. Here, t2_1 is the travel time for the travel demand MDy to travel to the stop E, t2_2 is the travel time for the travel demand MDy to travel from the stop G to the destination T, and the travel time for the travel demand MDy to travel to the destination T by car t3, the travel cost (gasoline cost, etc.) is cc, the travel time of the bus from the stop E to the stop G on the new route is t1, and the travel cost (gasoline cost, etc.) is cb. These pieces of information are assumed to be stored in advance in the storage device.

  In this case, the utilization utility Ub when the movement demand MDy moves to the destination point T using a bus on a new route is calculated by, for example, the following equation (6).

  Ub = P0 * cb + P1 * t1 + P2 * (t2_1 + t2_2) (6)

  Moreover, utilization utility Uc when the movement demand MDy moves to the destination point T using a car from the generation | occurrence | production location is calculated by following formula (7), for example.

  Uc = Q0 × cc + Q1 × t3 (7)

  Note that P0 to P2, Q0, and Q1 are weights and can be freely set by the administrator.

  Moreover, when a new route is opened, the probability that the movement demand MDy shifts from the vehicle to the stop E, that is, the shift rate Y (E) can be calculated by the following equation (8), for example.

  Y (E) = Ub / (Ub + Uc) (8)

  Therefore, the operation plan server 201 executes the automatic planning of a new route by using the moving number of people of the moving demand MDy multiplied by the shift rate Y (E).

  FIG. 23 is an explanatory diagram of an example 2 of the diagram creation process (step S1203) regarding the selected use case when the selected use case is (UC2). FIG. 23 is also an example in which an operation plan for a new route that passes through a part of stops on an existing route is created. In the case of FIG. 23, a new route is set in the existing route group.

  The existing route L1 is a route that operates the stop A-B-D, and the existing route L2 is a route that operates the stop C-B-E. The new route L3 is a route that operates the stop ABC. It is assumed that the travel demand MDz gets on the route L1 bus from the stop A, gets off at the stop B, changes to the bus on the route L2 at the stop B, moves to the stop D, and reaches the destination point T on foot.

  Here, the travel time from the stop A to the stop B on the existing route L1 is tab, the travel time from the stop B to the stop C on the existing route L2 is tbc, and the transfer from the existing route L1 at the stop B to the existing route L2 is transferred. The waiting time is tb, and the traveling time from the stop A to the stop C via the stop B by the new route L3 is tac.

  The shift rate Z (L3) at which the travel demand MDz shifts from the existing routes L1 and L2 to the new route L3 is calculated by, for example, the following formula (9).

  Z (L3) = tac / (tab + tb + tbc) (9)

  Therefore, the operation plan server 201 executes the automatic planning of the new route L3 by using the moving number of people of the moving demand MDz multiplied by the shift rate Z (L3).

  Further, it is assumed that the travel demand MDz travels from the location S to the destination point T by car. Here, tsa is the travel time for the travel demand MDz to travel to the stop A, tct is the travel time for the travel demand MDz to travel from the stop C to the destination T, and the travel time for the travel demand MDz to travel to the destination T by car. Let t_car, the travel cost (gasoline cost, etc.) be cc, and the travel cost (gasoline cost, etc.) when moving from the stop A via the new route L3 to the stop C via the stop B is cb.

  Use utility Ub (L3) of new route L3 of movement demand MDz is calculated by the following formula (10), for example.

  Ub (L3) = P0 × cb + P1 × tac + P2 × (tsa + tct) (10)

  In addition, the utilization utility Uc when the travel demand MDz travels from the place of occurrence S to the destination point T using a vehicle is calculated by, for example, the following equation (11).

  Uc = Q0 × cc + Q1 × t_car (11)

  Note that P0 to P2, Q0, and Q1 are weights and can be freely set by the administrator.

  Further, when the new route L3 is opened, the probability that the travel demand MDz shifts from the vehicle to the stop A, that is, the shift rate Z (b) can be calculated by the following equation (12), for example.

  Z (L3) = Ub / (Ub + Uc) (12)

  Therefore, the operation plan server 201 executes the automatic planning of the new route L3 by using the moving number of people of the moving demand MDz multiplied by the shift rate Z (L3).

  FIG. 24 is a flowchart illustrating an example of a diagram creation process (step S1203) regarding a selected use case when the selected use case is (UC2). First, the operation plan server 201 executes input information setting processing (step S2401). The input information setting process (step S2401) is a process for setting input information, for example, a process for calculating the above-described shift rate and setting the number of passengers on the movement demand for the new route.

  Thereafter, the operation plan server 201 refers to the planning type of the input data 1100 and determines whether to execute the simple automatic planning or the optimal automatic planning (step S2402). When executing simple automatic planning (step S2402: simple), the operation plan server 201 executes diamond creation processing by simple automatic planning (step S2403), and proceeds to step S1604. The diamond creation process (step S2403) by the simple automatic planning is the same process as step S1302 shown in FIG. On the other hand, when the optimal automatic planning is executed (step S2402: optimal), the operation plan server 201 executes a diamond creation process by the optimal automatic planning (step S2404), and proceeds to step S1604. The diamond creation process (step S2404) by the optimum automatic planning is also the same process as step S1303 shown in FIG.

  FIG. 25 is a flowchart showing an example of the input information setting process (step S2401) shown in FIG. In FIG. 25, the operation plan server 201 first refers to the travel demand information table 800 to determine whether there is an unselected travel demand entry (step S2501). If there is an unselected movement demand entry (step S2501: Yes), an unselected movement demand entry is selected (step S2502).

  Then, the operation plan server 201 determines whether there is boarding information in the selected entry (step S2503). When there is boarding information (step S2503: Yes), the movement demand of the selected entry indicates that the existing route is used. Therefore, the operation plan server 201 calculates a shift rate from the existing stop to the new stop on the examination target route (step S2504). Specifically, for example, as illustrated in FIGS. 21 and 23, the operation plan server 201 calculates the shift rate X (E) and the shift rate Z (L3). Next, the operation plan server can estimate the number of people on the new route bus by multiplying the calculated shift rate by the number of people in the selected entry (step S2505).

  Then, the operation plan server specifies a stop where the travel demand of the selected entry gets off on the new route (step S2506), and returns to step S2501. The getting-off stop is, for example, a stop on a new route closest to the arrival location (the destination point T in FIGS. 21 and 23) in the arrival information of the selected entry. Moreover, it is good also as a stop of the new route nearest to the getting-off stop in the getting-off information of the selection entry. Moreover, you may set the getting-off stop of a new route beforehand.

  In step S2503, when there is no boarding information in the selected entry (step S2503: No), the movement demand of the selected entry indicates that the existing route is not used. For example, as shown in FIGS. 22 and 23, the movement demand of the selected entry moves to the destination point T by car. In this case, as shown in FIGS. 22 and 23, the operation plan server 201 calculates the use utility of the new route and the use utility of the car for the selected entry (step S2507).

  Then, as shown in FIGS. 22 and 23, the operation plan server 201 calculates the shift rate to the new route by using the calculated utility utility of the new route and the vehicle utility utility (step S2508). Next, the operation plan server can estimate the number of people on the new route bus by multiplying the calculated shift rate by the number of people in the selected entry (step S2509).

  Then, the operation plan server specifies a stop where the travel demand of the selected entry gets off on the new route (step S2510), and returns to step S2501. The getting-off stop is, for example, a stop on a new route closest to the arrival location (the destination point T in FIGS. 22 and 23) in the arrival information of the selected entry. Moreover, it is good also as a stop of the new route nearest to the getting-off stop in the getting-off information of the selection entry. Moreover, you may set the getting-off stop of a new route beforehand.

  If there is no unselected travel demand entry in step S2501 (step S2502: No), the process proceeds to step S2502, and the input information setting process (step S2501) is terminated. Thereby, even when planning a new route in an area where an existing route exists, a diagram can be created.

<Diagram Creation Processing for Selected Use Case When Selected Use Case is (UC3) (Step S1203)>
The use case (UC3) is a use case for revising the diagram. Specifically, for example, the operation plan server 201 selects a period to be revised and revises the diagram for the selected period. In the use case (UC3), the route selected as the examination target route is the route of the existing route.

  FIG. 26 is a flowchart illustrating an example of a diagram creation process (step S1203) regarding a selected use case when the selected use case is (UC3). First, the operation plan server 201 acquires travel result information for the examination target route (step S2601).

  Next, the operation plan server 201 selects a target period and acquires movement history information for the target period (step S2602). The target period is a period to be revised, and may be a specific day such as a weekday, a holiday, or a holiday, or may be a specific time zone such as 6:00 to 8:59. Moreover, the combination of a specific day and a specific time slot | zone may be sufficient.

  The travel history information is information indicating the bus travel history in the target period. For example, it is the maximum number of passengers for each section in the examination target route. For example, it is assumed that the route to be examined is a route that passes through the stop A-B-C-D. The operation plan server 201 identifies the number of passengers in the sections AB, BC, and CD for each stripe with reference to the movement record information. Then, the operation plan server 201 identifies the maximum number of passengers for each section. For example, in the section AB, when the streak R1 is 20, the streak R2 is 3, and the streak R3 is 15, 20 streak R1 persons are employed.

  Next, the operation plan server 201 refers to the movement record information table 900 and creates a record diagram by averaging the arrival and departure times of each stop for each line (step S2603). Thereafter, the operation plan server 201 calculates the evaluation value of the actual diagram and the evaluation value of the existing diagram that is the creation source of the actual diagram. As a method for calculating the evaluation value, the above-described formula (1) may be applied. Alternatively, the maximum value of the number of passengers may be used as each evaluation value. The calculated evaluation value is displayed on a display that is the output device 304.

  Next, the operation plan server 201 determines whether or not to modify the existing diagram (step S2605). For example, the operation manager determines whether or not to amend the diamond based on the evaluation value displayed on the display. When the amendment is made, the operation manager selects the amendment button from the input device 303 and moves to step S2606. . Further, the operation plan server 201 may determine whether or not there is a revision based on the difference between the calculated evaluation values. For example, when the difference is greater than or equal to a predetermined value, the operation plan server 201 determines to revise.

  When not amending (step S2605: No), it transfers to step S1604. On the other hand, when the amendment is made (step S2605: Yes), the operation plan server 201 refers to the planning type of the input data 1100 and determines whether to execute the simple automatic planning or the optimal automatic planning (step S2606). . When executing simple automatic planning (step S2606: simple), the operation plan server 201 executes a diagram creation process by simple automatic planning using the movement record information (step S2607), and proceeds to step S1604.

  The diamond creation process (step S2607) by simple automatic planning is the same process as step S1302 shown in FIG. 13 except that the movement record information table 900 is used instead of the movement demand information table 800, and the description thereof will be omitted. . On the other hand, when the optimal automatic planning is executed (step S2606: optimal), the operation plan server 201 executes a diagram creation process by the optimal automatic planning using the movement record information table 900 (step S2608), and the process goes to step S1604. Transition. The diamond creation process (step S2604) by the optimum automatic planning is also the same process as step S1303 shown in FIG. 13 except that the movement record information table 900 is used instead of the movement demand information table 800, and thus the description thereof is omitted. . Thereby, the operation plan server 201 can perform the diamond revision in consideration of the movement record.

<Diagram Creation Processing for Selected Use Case When Selected Use Case is (UC4) (Step S1203)>
The use case (UC4) is a process indicating a diamond adjustment on or after the current day. For example, on the day or after that, adjustments may be made when an event such as “congestion is expected due to traffic restrictions due to weather fluctuations, festivals, fireworks display, etc.” or when a traffic accident has occurred on that day It is a process to adjust when such a sudden event occurs. The former is called a first adjustment process, and the latter is called a second adjustment process. Therefore, the movement demand information is information considering such an event. First, the first adjustment process will be described.

  FIG. 27 is an explanatory diagram illustrating an adjustment example of the first adjustment process. In FIG. 27, the vertical axis represents distance and indicates the position of the stop. The horizontal axis indicates time. A solid line streak is a plan diagram, that is, a streak indicating an existing diagram, and a one-dot chain line streak is a streak increased by the first adjustment processing. Further, in the example of FIG. 27, the bus passes in the order of B-C-D-E (end point stop) with the stop A as the start stop.

  In the case of (a), since an increase in demand for a certain stripe s10 is expected, the operation plan server 201 increases the number of flights of the stripe s0 that is operated before the stripe s10. In the case of (b), since an increase in demand for a specific operation section (here, from stop B to stop E) and a specific time zone is expected, the operation plan server 201 is connected to the line corresponding to the specific section and the specific time zone. Increase the number of streaks s0 operated before s10. In the case of (c), since an increase in movement demand is expected at individual stops, the operation plan server 201 increases the number of lines s0 operated before the line s10 in order to cope with the increase in individual demand. Specifically, by adjusting the travel demand information table 800, the operation plan server 201 adjusts the diagram by adding streaks. Here, the case of (b) will be described in detail.

  FIG. 28 is an explanatory diagram showing a first adjustment processing example in the case of FIG. (1) First, the operation plan server 201 selects a streak related to a specific operation section (between the stop B and the stop E) and a region Z indicating a specific time zone by an operation of the operation manager. A streak related to the region Z is, for example, a streak overlapping the region Z. In the example of FIG. 27, the stripes are s11 and s12. The streak s13 that does not overlap with the area Z but appears first after the elapse of the time zone of the area Z is included. In addition, as an example, it is assumed that the movement demand in the region Z is 100 people. In addition, the number of passengers who ride from the stop A to the stop E is 20 for the streak s11, and the number of passengers who ride from the stop A to the stop E is 15 for the streaks s12 and s13.

  In (2), the operation plan server 201 apportions the movement demand in the area Z by the lines s11 to s13. In this example, at the time of the stop B, the specific time zone is divided into 10%, 70%, and 20%. Therefore, 10% of the travel demand is apportioned to the streak s11, 70% of the travel demand is apportioned to the streak s12, and 20% of the travel demand is apportioned to the streak s13.

  Therefore, the number of passengers from the stop A to the stop E for the line s11 is 30 (= 20 + 100 × 0.1), and the number of passengers from the stop A to the stop E for the line s12 is 85 (= 15 + 100 × 0. 7), and the number of passengers from the stop A to the stop E for the line s13 is 35 (= 15 + 100 × 0.2).

  The operation plan server 201 increases the number of passengers when the number of passengers obtained for each of the lines s11 to s13 exceeds a predetermined number of passengers. For example, if the predetermined number of passengers is 50, the number of passengers (85 people) of the line s12 exceeds the predetermined number of passengers. Therefore, the operation plan server 201 increases flights by adding a streak between the streak s11 and the streak s12.

  FIG. 29 is a flowchart illustrating a first adjustment processing example. First, the operation plan server 201 selects a demand increase pattern by an operation manager operation (step S2901). Specifically, for example, the operation plan server 201 operates the operation manager to operate a stool increase process for a specific streak as shown in FIG. 27A, a specific section as shown in FIG. A flight increase process for a specific time zone or a flight increase process for an individual movement demand as shown in FIG. 27C is selected.

  Then, the operation plan server 201 determines which demand increase pattern has been selected (step S2902). When the flight increase process for a specific stripe as shown in FIG. 27A is selected (step S2902: specific stripe), the operation plan server 201 executes the flight increase process for the specific stripe (step S2903). In addition, when the stool increase process in the specific section and the specific time period as shown in FIG. 27B is selected (step S2902: specific section and specific time period), the stool increase process in the specific section and the specific time period is executed. (Step S2904). When the flight increase process for individual travel demand as shown in FIG. 27C is selected (step S2902: individual), the operation plan server 201 executes the flight increase process for the individual travel demand (step S2905). ).

  FIG. 30 is a flowchart showing an example of the stool increase process (step S2903) for the specific stripe shown in FIG. The operation plan server 201 sets an increase in demand for a specific stripe by the operation manager's operation (step S3001). For example, the operation plan server 201 sets 100 people as an increase in demand for the stripe s10 in FIG. The increase in demand is an increase in the number of passengers expected for the specific stripe s1.

  Next, the operation plan server 201 calculates the number of passengers on the specific stripe (step S3002). Specifically, for example, the operation plan server 201 refers to the movement record information table 900 and calculates the past number of passengers of the specific line s10. The past number of passengers may be the latest number of passengers, or may be a statistical value such as an average value, median value, maximum value, minimum value of the past number of passengers.

  Next, the operation plan server 201 adds the increase in demand set in step S3001 to the number of passengers calculated in step S3002 (hereinafter referred to as the number of passengers due to the increase in demand) as the number of passengers on the bus that operates a specific stripe. It is determined whether or not the number is larger than the number of persons multiplied by the design boarding rate (step S3003). If not large (step S3003: No), the stool increase process (step S3003) for the specific stripe is terminated.

  On the other hand, when large (step S3003: Yes), the operation plan server 201 adds a streak between the specific streak and the previous streak (step S3004). Specifically, for example, the operation plan server 201 divides the number of passengers due to an increase in demand by the number of passengers on a bus that operates a specific line multiplied by the design boarding rate (one specific line). (s10 minutes) By subtracting, the number of streaks to be added is specified. Then, the operation plan server 201 arranges the specified number of lines at regular intervals between the specific line and the previous line. For example, if the number of passengers due to increased demand is 120 and the number of passengers on a bus that operates a specific stripe is 50, the number of lines added is 1.4 (= 120 / 50-1). Accordingly, since one line is insufficient, the operation plan server 201 adds two lines by moving up the decimal point.

  FIG. 31 is a flowchart illustrating an example of the flight increase process (step S2904) in the specific operation section and the specific time period illustrated in FIG. The operation plan server 201 specifies the corresponding streak in the specific operation section and the specific time zone set by the operation manager, and calculates the time ratio occupied by each streak (step S3101). Specifically, for example, as illustrated in FIG. 28, the operation plan server 201 specifies the stripes s11 to s13 corresponding to the region Z. And the operation plan server 201 calculates 10%, 70%, and 20% as a time ratio.

  Next, the operation plan server 201 sets the number of passengers in a specific operation section by an operation of the operation manager (step S3102). Specifically, for example, as shown in FIGS. 27 and 28, the operation plan server 201 sets 100 people as the number of passengers in a specific operation section. Then, the operation plan server 201 apportions the number of passengers at the time ratio (step S3103). In the above example, the operation plan server 201 apportions 100 people who are in the specific operation section by 10%, 70%, and 20%.

  Thereafter, the operation plan server 201 determines whether or not there are unselected lines in the lines corresponding to the specific operation section and the specific time zone (step S3104). When there is an unselected streak (step S3104: Yes), the operation plan server 201 selects an unselected streak (step S3105), and the number of passengers apportioned for the selected streak rides on the bus that operates the selected streak. It is determined whether or not the number of persons obtained by multiplying the capacity by the design boarding rate is exceeded (step S3106). Note that the number of passengers who ride from a stop outside a specific operation section to a stop within a specific operation section may be added to the apportioned number of passengers.

  When not exceeding (step S3106: No), it returns to step S3104. On the other hand, when exceeding (step S3106: Yes), the operation plan server 201 adds a streak between the selected streak and the previous streak (step S3107), and returns to step S3104. Specifically, for example, the operation plan server 201 divides the divided number of passengers by the number of passengers on the bus that operates the selected line multiplied by the design boarding rate, and subtracts one line (for the selected line). As a result, the number of stripes to be added is specified.

  Then, the operation plan server 201 arranges the specified number of lines at regular intervals between the specific line and the previous line. For example, as shown in FIG. 28 (2), if the number of passengers who are allocated is 85, and the number of passengers on a bus that operates a specific stripe is multiplied by the design boarding rate, the number of passengers added is 50. Is 0.7 (= 85 / 50-1). Therefore, since 0 is insufficient, the operation plan server 201 adds one streak to the decimal point.

  In step S3104, if there is no unselected line (step S3104: No), the operation plan server 201 ends the flight increase process (step S3104) in the specific operation section and the specific time zone.

  FIG. 32 is a flowchart showing an example of the flight increase process (step S2905) for the individual movement demand shown in FIG. The operation plan server 201 identifies the streak used by the individual travel demand by the operation manager's operation (step S3201), and selects the time zone to the identified streak by the operation manager's operation (step S3202). . Then, the operation plan server 201 receives the individual travel demand in step S3201 and executes a diagram creation process based on the optimum automatic planning in the selected time zone selected in step S3202 (step S3203). The diamond creation process (step S3203) based on the optimum automatic planning in the selected time zone is the same process as the diamond creation process (step S1601) based on the optimum automatic planning in the selected time zone shown in FIG.

  Thereby, the operation plan server 201 can execute the diamond adjustment according to the increase pattern of the movement demand, and can improve the degree of freedom of the diamond adjustment. Prior to the first adjustment process described above, it is also possible to create a time schedule prediction diagram in which the movement demand increases by using the optimum automatic planning or the simple automatic planning. Thereby, it can be set as the index | index in the case of an operation manager adjusting a diamond by displaying the produced prediction diamond, the existing diamond, and a performance diamond.

  Next, the second adjustment process will be described. As described above, the second adjustment process is a process for adjustment when a sudden event such as “a traffic accident has occurred” occurs on the day. For example, the second adjustment process is executed in an event-driven format when a delay occurs in a bus in service. The second adjustment process is divided into the case of the movement demand premise and the case of the time interval premise. First, the 2nd process in the case of a movement demand premise is demonstrated.

  FIG. 33 is a flowchart showing an example of schedule adjustment on the day when the movement demand is assumed. First, the operation plan server 201 waits until it detects a streak whose delay is greater than or equal to a threshold value (step S3301: No). The delay is the time from the scheduled time to the actual arrival time. For example, the operation plan server 201 may detect a streak whose delay is equal to or greater than the threshold even once, or may detect a streak whose delay is equal to or greater than the threshold continuously. The detected streak is set as the target streak.

  When detected (step S3301: Yes), the operation plan server 201 determines whether or not the bus that operates the examination target line is operated by a return flight (step S3302). When the flight is not operated on a return flight (step S3302: No), the diamond adjustment is unnecessary, and thus the series of processes is terminated. On the other hand, when operated by a return flight (step S3302: Yes), the operation plan server 201 acquires the current position of the bus that operates the examination target stripe from the location server 204 (step S3303). Then, the operation plan server 201 calculates the end point arrival time of the bus that operates the examination target line (step S3304). Specifically, for example, the operation plan server 201 adds the time obtained by dividing the distance from the current position of the bus operating the examination target line to the end stop by the bus speed to the current time. The end point arrival time is calculated. In addition, you may add the waiting time in the middle stop. Alternatively, the end point arrival time may be calculated by adding a delay to the end point arrival time.

  Then, the operation plan server 201 determines whether or not the bus operating the examination target line is in time for the return flight departure time (step S3305). Specifically, for example, the operation plan server 201 determines whether or not the time obtained by adding the preparation time for the return flight to the end point arrival time calculated in step S3303 is the time before the return flight departure time. to decide. If it is before the departure time of the return flight, it is determined that the return flight is in time, otherwise it is determined that it is not in time for the return flight.

  Accordingly, when the return flight is in time (step S3305: Yes), the diamond adjustment is not necessary, and the series of processes is terminated. On the other hand, when it is not in time for the return flight (step S3305: No), the operation plan server 201 refers to the schedule information 1000 and determines whether there is a waiting bus and a waiting crew (step S3306). .

When there is a waiting bus and a waiting crew (step S3306: Yes), the operation plan server 201 obtains the bus ID of the waiting bus, the crew ID of the waiting crew, and the flight ID of the return flight. Then, the schedule formation server 205 is notified (step S3307). The diamond organization server 205 executes diamond organization according to the notified information. On the other hand, when there is no waiting bus or no waiting crew (step S3306: No), the operation plan server 201 notifies the diagram formation server 205 of a non-turnback notification (step S3308). In this case, for example, a return flight is dealt with as a flight failure.

  FIG. 34 is a flowchart showing an example of schedule adjustment on the current day when the time interval is assumed. First, the operation plan server 201 waits until it detects a bus whose time interval with the preceding bus exceeds the operation interval (step S3301: No). For example, the operation plan server 201 may detect a bus that has exceeded once or may detect a bus that has exceeded a predetermined number of times.

  When the excess is detected (step S3401: YES), the operation plan server 201 determines whether or not the bus in which the excess is detected is operated by a return flight (step S3402). If the flight is not operated on a return flight (step S3402: NO), the diamond adjustment is unnecessary, and thus the series of processes is terminated. On the other hand, when operated by a return flight (step S3402: Yes), the operation plan server 201 acquires the current position of the bus from which excess has been detected from the location server 204 (step S3403). Then, the operation plan server 201 calculates the end point arrival time of the bus for which the excess has been detected (step S3404). Specifically, for example, the operation plan server 201 adds the time obtained by dividing the distance from the current position of the bus where the excess is detected to the end stop by the bus speed to the current time. Calculate the arrival time. In addition, you may add the waiting time in the middle stop. Alternatively, the end point arrival time may be calculated by adding an excess to the end point arrival time.

  Then, the operation plan server 201 determines whether or not the bus whose excess has been detected is in time for the return flight departure time (step S3405). Specifically, for example, the operation plan server 201 determines whether or not the time obtained by adding the preparation time for the return flight to the end point arrival time calculated in step S3404 is the time before the return flight departure time. to decide. If it is before the departure time of the return flight, it is determined that the return flight is in time, otherwise it is determined that it is not in time for the return flight.

  Accordingly, when the return flight is in time (step S3405: Yes), the schedule adjustment is not necessary, so the location server 204 is notified to give a standby instruction to the preceding bus (step S3406), and the series of processing ends. . On the other hand, when it is not in time for the return flight (step S3405: No), the operation plan server 201 refers to the schedule information 1000 and determines whether there is a waiting bus and a waiting crew (step S3407). .

  When there is a waiting bus and a waiting crew (step S3407: Yes), the operation plan server 201 obtains the bus ID of the waiting bus, the crew ID of the waiting crew, and the flight ID of the return flight. Then, the schedule formation server 205 is notified (step S3408). The diamond organization server 205 executes diamond organization according to the notified information. On the other hand, when there is no waiting bus or waiting crew (step S3407: No), the operation plan server 201 notifies the diagram organization server 205 of a non-turnback notification (step S3409). In this case, for example, a return flight is dealt with as a flight failure.

  Thereby, even when a sudden event occurs, it is possible to adjust the diagram according to the delay / excess due to the event.

  FIG. 35 is an explanatory diagram showing a display example 1 of a diamond automatically created by simulation based on optimum automatic planning or simple automatic planning. A diamond 3501 is a diamond automatically created by the above-described optimal automatic planning or simple automatic planning simulation. The operation plan server 201 operates the input device of the operation plan server 201 and selects a certain streak s335 in the diagram 3501, and the operation plan server 201 displays the evaluation information 3510 related to the selected streak s335 on the display screen 3500 together with the diagram 3501. indicate.

  The evaluation information 3510 is information including a performance value and an optimized evaluation value for each evaluation item. Examples of the evaluation items include a bus punctuality evaluation value, a convenience evaluation value, a profitability evaluation value, an environmental evaluation value, and the like shown by the above formula (1). The actual value of each evaluation item is data acquired from any of the search server 202, the reservation server 203, the location server 204, and the diagram organization server 205, and is data before the simulation. Thereby, the administrator can confirm the evaluation value regarding the selected stripe s35 in the diamond 3501 together with the diamond 3501.

  FIG. 36 is an explanatory diagram showing a display example 2 of a diagram automatically created by simulation based on optimum automatic planning or simple automatic planning. The diamond 3601 is a diamond automatically created by the above-described optimal automatic planning or simple automatic planning simulation. FIG. 36A is a diagram 3601 showing a simulation result of a certain route. In (A), the administrator operates the input device of the operation plan server 201, selects a certain streak s362 in the diagram 3601, and sets it as a confirmed streak.

  Thereafter, the operation plan server 201 executes the re-simulation by the above-described optimum automatic planning or simple automatic planning with the streak s362 as the confirmed streak for the same route. (B) is a diagram 3701 showing the result of re-simulation by the above-mentioned optimum automatic planning or simple automatic planning. The diamond 3701 includes lines s370 and s371s373 obtained by re-simulation, and a fixed line s362 fixed in the re-simulation. In other words, the fixed stripe s362 is not changed by re-simulation. As a result, even after creating the diamond, the administrator can set the confirmed stripe s362 from the diamond 3601 and automatically create the diamond again.

  The present invention is not limited to the above-described embodiments, and includes various modifications and equivalent configurations within the scope of the appended claims. For example, the above-described embodiments have been described in detail for easy understanding of the present invention, and the present invention is not necessarily limited to those having all the configurations described. A part of the configuration of one embodiment may be replaced with the configuration of another embodiment. Moreover, you may add the structure of another Example to the structure of a certain Example. In addition, for a part of the configuration of each embodiment, another configuration may be added, deleted, or replaced.

  In addition, each of the above-described configurations, functions, processing units, processing means, etc. may be realized in hardware by designing a part or all of them, for example, with an integrated circuit, and the processor realizes each function. It may be realized by software by interpreting and executing the program to be executed.

  Information such as programs, tables, and files that realize each function can be stored in a storage device such as a memory, a hard disk, or 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 the information lines are those that are considered necessary for the explanation, and not all the control lines and the information lines that are necessary for the mounting are shown. In practice, it can be considered that almost all the components are connected to each other.

200 operation management system 201 operation plan server 202 search server 203 reservation server 204 location server 205 diagram organization server 210 administrator terminal 220 user terminal 230 bus 240 vehicle-mounted device 400 vehicle information table 500 stop information table 600 crew information table 700 route information table 800 Travel demand information table 900 Travel performance information table 1000 Schedule information 1100 Input data 1700 Operation interval setting information

Claims (13)

An operation plan server for creating a diagram of a moving object,
A processor for executing a program; and a memory for storing a program to be executed by the processor;
The processor is
An acquisition process for acquiring travel demand in the time zone of the diamond creation target on the route to be considered;
A first calculation process for calculating a required number of flights in the time zone of the diamond creation target in the examination target route based on the movement demand acquired by the acquisition process and the capacity of the moving body;
Based on the time length of the time zone subject to diamond creation and the required number of flights calculated by the first calculation process, the operation interval for calculating the operation interval in which the mobile body operates in the time zone subject to diamond creation is calculated. 2 calculation processes;
A creation process for creating a diagram in which the moving body operates the examination target route in a time zone of the diamond creation target according to the operation interval calculated by the second calculation process;
When there is an unchangeable flight in the time zone for the schedule creation on the route to be considered, from the start point stop where the arrival and departure times are set to the end point stop in the time zone for the diamond creation time in the route to be considered A temporary setting process for temporarily setting the second flight, which is the second time-series data after elapse of a predetermined operation interval, for the first flight, which is the first time-series data of the series of stops ,
The number of travel demands that can be boarded on the second flight temporarily set by the temporary setting process after the departure of the first flight at each stop is calculated for each continuous stop section in the examination target route. A third calculation process;
Based on the number of persons calculated for each section calculated by the third calculation process and the minimum number of passengers for each section, the predetermined operation interval is set as a condition regarding the minimum number of passengers for each section. A setting process for setting the second flight by changing to a satisfactory operation interval;
An output process for outputting information on the second flight set by the setting process;
The operation plan server characterized by executing.   In the creation process, based on the minimum operation interval and the operation interval in the examination target route, the moving body creates a diagram that operates the examination target route in the time zone for the diamond creation target. The operation plan server according to claim 1.   The said 1st calculation process calculates the said required number of flights, when the flight which cannot be changed in the time zone of the said diamond creation target in the said examination object route does not exist, The operation plan of Claim 1 characterized by the above-mentioned. server. An operation plan server for creating a diagram of a moving object,
A processor for executing a program; and a memory for storing a program to be executed by the processor;
The processor is
An acquisition process for acquiring travel demand in the time zone of the diamond creation target on the route to be considered;
Predetermined operation for the first flight which is the first time series data of a series of stops from the start point stop to the end point stop where the arrival and departure times are set in the time zone to be created on the route to be examined Temporary setting processing for temporarily setting the second flight, which is the second time-series data after the elapse of time for an interval,
The number of travel demands that can be boarded on the second flight temporarily set by the temporary setting process after the departure of the first flight at each stop is calculated for each continuous stop section in the examination target route. Calculation process,
Based on the number of persons calculated for each section calculated by the calculation process and the minimum number of passengers for each section, the predetermined operation interval satisfies the conditions regarding the minimum number of passengers for each section. A setting process for setting the second flight by changing to an interval;
An output process for outputting information on the second flight set by the setting process;
The operation plan server characterized by executing. In the setting process, when any of the number of persons in each section is less than the minimum number of passengers, the predetermined operation interval is extended until all of the persons in each section become equal to or more than the minimum number of passengers. The operation plan server according to claim 4. 6. The operation plan server according to claim 5, wherein in the setting process, the predetermined operation interval is extended until a longest waiting time for the travel demand is exceeded. In the setting process, when any of the number of people in each section is equal to or greater than the minimum number of passengers, the predetermined operation interval is reduced until any of the number of people in each section falls below the minimum number of passengers. The operation plan server according to claim 4. The operation planning server according to claim 7, wherein in the setting process, the predetermined operation interval is reduced until it falls below a minimum operation interval of the moving body. The processor is
Based on a first distance between the travel demand and a stop on an existing route, and a second distance between the travel demand and a stop on the examination target route, the route used by the travel demand is A probability calculation process for calculating the probability of changing from the existing route to the examination target route is executed,
In the said acquisition process, the said movement demand is acquired based on the probability calculated by the said probability calculation process, The operation plan server in any one of Claims 1-8 characterized by the above-mentioned. The processor is
A value indicating the utility when the travel demand uses the vehicle of the travel demand to the destination point, and a value indicating the utility when the travel demand uses the mobile body that operates the route to be examined up to the destination point And a probability calculating process for calculating a probability of changing the moving means used by the moving demand from the moving demand car to the moving body,
5. The operation planning server according to claim 1, wherein in the acquisition process, the travel demand is acquired based on the probability calculated by the probability calculation process. The processor is
Boarding time and transfer time of the plurality of existing routes when the movement demand arrives by changing a plurality of existing routes from the first stop to the second stop, and from the first stop to the second stop Based on the boarding time of the examination target route that operates without transfer, a probability calculation process is performed to calculate a probability that the route used by the travel demand is changed from the plurality of existing routes to the examination target route. ,
5. The operation planning server according to claim 1, wherein in the acquisition process, the travel demand is acquired based on the probability calculated by the probability calculation process. The processor is
Based on the diagram in the existing route, and the movement record when operated by the diamond, a record diagram creation process for creating a record diagram that takes the travel record into consideration in the diagram in the existing route;
Performing an evaluation value calculation process for calculating an evaluation value of the diamond in the existing route and an evaluation value of the actual diamond created by the actual diamond creation process;
The operation plan server according to claim 1 or 4, wherein, in the acquisition process, the movement demand is acquired based on each evaluation value calculated by the evaluation value calculation process. An operation planning server comprising a processor for executing a program and a memory for storing a program to be executed by the processor is a creation method for creating a diagram of a mobile object,
The creation method is as follows:
The processor is
An acquisition process for acquiring travel demand in the time zone of the diamond creation target on the route to be considered;
A first calculation process for calculating a required number of flights in the time zone of the diamond creation target in the examination target route based on the movement demand acquired by the acquisition process and the capacity of the moving body;
Based on the time length of the time zone subject to diamond creation and the required number of flights calculated by the first calculation process, the operation interval for calculating the operation interval in which the mobile body operates in the time zone subject to diamond creation is calculated. 2 calculation processes;
A creation process for creating a diagram in which the moving body operates the examination target route in a time zone of the diamond creation target according to the operation interval calculated by the second calculation process;
When there is an unchangeable flight in the time zone for the schedule creation on the route to be considered, from the start point stop where the arrival and departure times are set to the end point stop in the time zone for the diamond creation time in the route to be considered A temporary setting process for temporarily setting the second flight, which is the second time-series data after elapse of a predetermined operation interval, for the first flight, which is the first time-series data of the series of stops ,
The number of travel demands that can be boarded on the second flight temporarily set by the temporary setting process after the departure of the first flight at each stop is calculated for each continuous stop section in the examination target route. A third calculation process;
Based on the number of persons calculated for each section calculated by the third calculation process and the minimum number of passengers for each section, the predetermined operation interval is set as a condition regarding the minimum number of passengers for each section. A setting process for setting the second flight by changing to a satisfactory operation interval;
An output process for outputting information on the second flight set by the setting process;
The creation method characterized by performing.