JP2013011976A - Train crew operation plan creation system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a train crew operation plan creation system capable of creating a crew operation plan per day even if the scale of creating the plan becomes large.SOLUTION: The train crew operation plan creation system 1 for creating a train crew operation plan for a specified period by allocating each train travel section in a train operation diagram to a work unit of each crew includes: train operation conversion means 22 for creating a travel segment of each crew for each day on the basis of train operation data reflecting a suspension which is not scheduled when creating the train operation diagram; travel segment sort means 23 for sorting the travel segments by start time of each travel segment; provisional combination means 24 for provisionally combining one sorted travel segment with another sorted travel segment not overlapped with each other in time series; combination evaluation means 25 for evaluating for each provisional combination whether a new travel segment acquired through each provisional combination is over a prescribed evaluation reference; and definitive combination means 26 for changing a provisional combination having the highest evaluation value among provisional combinations over the evaluation reference to a definitive combination and creating a longer travel segment or work plan.

Description

  The present invention, when creating an operation plan table for a train crew member, the crew member operation plan that can create a crew member operation plan every day in response to changes in the train schedule already created due to increase or decrease in demand, etc. It relates to a planning system.

  Conventionally, in the operation plan creation of crew members such as drivers and conductors of freight trains and passenger trains, when the unit of work content that a crew member performs in one work is a work, for example, this work is created for 30 days. One alternating table is created, and a plurality of crew members form one group (an alternating program), and operations are carried out by an alternating number in which each work is sequentially performed by rotation (see Patent Document 1).

  In Patent Document 1, a crew member's crew is shown by a horizontal solid line, and a broken line shows a crew member's rest time. A single line connecting them indicates the daily work contents (work) of the crew, and one alternation is created for several works.

  In the invention of Patent Document 1, when a drool occurs in a train operation diagram, an arrangement diagram corresponding to the diamond arrangement is created, and a crew member is reassigned to the arrangement diagram.

JP 2006-79440 A

  The crew member operation arrangement plan creation device disclosed in Patent Document 1 creates an operation plan of an alternating rate in which one exchange program performs each work in turn, so that it takes time and effort to create a daily plan. Although there is an advantage that it is possible to save time and effort to think about the conditions one by one, it is not possible to respond flexibly to fluctuations in demand that occur on a daily basis because the exchange program performs each work in turn.

  Moreover, the thing of patent document 1 cuts out the work scheduled on the day when a diamond droop occurs, and reassigns a crew member to this, and reflects daily demand is not.

  In general passenger train and freight train operations, a train schedule that is different from weekdays is used on Saturdays, holidays, and holidays. Furthermore, for example, the demand for oil trains fluctuates from day to day in the winter, and in the case of long holidays such as Golden Week and Bon Festival, the factories close and the demand for raw material products declines. Demand fluctuates on a daily basis due to a suspension or the like.

  However, even in such a case, when creating an operation plan by alternating allocation, for example, a crew operation plan is created on the assumption that all trains operate throughout the year, and the minimum crew required for operation is assigned. It is necessary to keep. However, as mentioned above, there is a wave in the transport volume, and if the operated train is not operated, even if there is a plan allocation, work may not actually occur, and it is possible to plan to optimize it temporarily. Even so, it is inevitable that it will become inefficient due to daily outages.

  Therefore, it is conceivable to create a plan in units of one day. In this case, for example, even if the work is repeated every day, for example, a plan for 30 days (about one month) is considered in order to regard it as a different work for each day. When creating a plan, the plan creation target data is about 30 times longer. For example, when a combinational optimization algorithm is used in which the calculation amount is proportional to the square of the data amount, it takes about 900 times longer. End up. For this reason, it may take time to obtain a solution for creating an operation plan, or a solution may not be obtained.

  Therefore, in view of the above circumstances, the present invention has an object to provide a crew member operation plan creation system that can create a crew member operation plan on a daily basis even if the plan creation scale is large. .

  (1) In order to achieve the above object, the crew operation plan creation system according to the present invention assigns each train operation section of the train operation diagram to a crew unit of work and creates an operation plan for the crew for a predetermined period. In the plan creation system, the train operation replacement means for generating the crew fragment of the crew based on the train operation data reflecting the suspension of the train operation, the stroke fragment sorting means for sorting the journey fragment by its start time, Temporary connection means for performing temporary connection processing for temporarily connecting one-to-one temporary connection between the process fragments that do not overlap with each other in time series, and an evaluation value when performing a predetermined evaluation for each temporary connection, It is determined whether or not a predetermined evaluation reference value is exceeded, and if it exceeds, a connection evaluation unit that replaces the predetermined evaluation reference value with the evaluation value, and an evaluation base obtained after the temporary connection processing The temporary connection values and the connection, characterized by comprising the present connecting means for generating a longer stroke fragment or act, the.

  (2) Further, the temporary connection unit performs the temporary connection process while shifting the day by day while maintaining the range of the target date to be temporarily connected, and the connection evaluation unit is an evaluation reference value of the existing temporary connection process. Based on the above, the connection cutoff reference value is calculated, and it is determined whether or not the current evaluation reference value after provisional connection processing exceeds the connection cutoff reference value, and the evaluation value exceeds the connection cutoff reference value. In this case, the main connection may be used.

  (3) Furthermore, when the temporary connection means temporarily connects the sorted process fragments, the first process fragment arbitrarily selected and another process whose start time difference between the process fragments is 24 hours or less. The fragments may be extracted and temporarily connected.

  (4) Moreover, when the temporary connection of the same evaluation value as the evaluation value of the temporary connection mentioned above appears, the bypass means which abbreviate | omits at least one part temporary connection after that may be provided.

  (5) Furthermore, another crew member operation plan creation system according to the present invention is the operation of each train operation in the above crew member operation plan creation system when the operation rate of the train when operated every day is 100%. For a train group with an operation rate less than the reference value, and a train grouping means for dividing the train operation group with the operation rate less than the reference value. Another feature is to create a crew operation plan.

  (6) Further, this system calculates a crew ratio calculation means for calculating the ratio of each crew member's crew time to the standard crew time (a crew ratio), and a crew group whose crew ratio is equal to or greater than a reference value and a crew group whose standard value is less than the standard value And a crew group having a crew ratio equal to or higher than the reference value is assigned to a train group having an operation rate equal to or higher than the reference value, and a crew group having a crew ratio less than the reference value is less than the reference value. It is good also as preparing a police box allocation about the train group for which the operation rate of the said train is more than a reference value.

  In the present application, the “stroke” means, for example, a train operation from A station to C station when there is one train operation that stops at three stations A → B → C station. "" Means a crew unit of a crew member in charge of train operation between A-B stations and B-C stations in the above example. Furthermore, “work” refers to the crew's crew content for about one day consisting of a plurality of “strokes”.

  “Crew ratio” means the ratio of the crew hours of each crew member to the standard crew hours.

  According to the crew operation plan creation system of the present invention configured as described above, it is possible to quickly and surely obtain a connected solution of process fragments that are usually difficult or impossible to obtain as a combination optimization problem.

  As a result, the time for obtaining the solution is remarkably shortened, and the daily work of each crew member can be created as a separate schedule for each day. Therefore, it is flexible to changes in demand, such as events that are difficult to respond with a system that only performs tasks that are determined in order, such as police boxes, such as an increase in demand due to an increase in demand or a suspension due to a sudden earthquake disaster. It can correspond to.

It is a block diagram explaining the structure of the crew member operation plan creation system of embodiment which concerns on this invention. It is the figure which showed the daily train operation schedule. It is a flowchart explaining the flow of the whole process of the crew member operation plan creation system of embodiment which concerns on this invention. It is a flowchart explaining the main flows of the connection process of the process fragment | piece of FIG. It is a flowchart explaining the main flows of the partial connection process of the process fragment | piece of FIG. It is a flowchart explaining the flow of the temporary connection process of the process fragment | piece of FIG. It is a flowchart explaining the main flows of the process of the work improvement of FIG. It is a flowchart explaining the main flows of the partial exchange process of the process fragment | piece of FIG. It is a flowchart explaining the main flows of the temporary replacement | exchange process of the process fragment | piece of FIG. It is a figure which shows the daily train operation diagram created reflecting the daily stop from the daily train operation diagram of FIG. It is a figure which shows the pool of the process fragment | piece produced | generated based on the daily train operation diagram of FIG. It is the figure which arranged the process fragment | piece of FIG. Note that the date here is the date change at the time when the number of train operations is minimized (see the white arrows in FIGS. 2 and 10). (A)-(c) is a figure explaining the specific example of the connection process by a crew member operation plan creation system. It is a figure for showing the general example which shows the relationship between time and the number of train operations, and explaining the process which makes the date change the time when the number of train operations becomes the minimum. It is a figure which shows a crew member operation table according to day. It is a block diagram which shows the structure of the crew member operation plan preparation system of the Example which concerns on this invention. (A) The operation rate of each train and each train group divided according to the operation rate are shown. (B) The crew ratio of the crew and each crew group divided by the crew percentage are shown. It is a flowchart explaining the flow of the whole process which produces a crew member operation | movement table by the crew member operation plan creation system of an Example. It is a flowchart explaining the flow of the grouping process of the train of FIG. It is a flowchart explaining the flow of the crew member grouping process of FIG.

  Hereinafter, embodiments of the present invention will be described with reference to the drawings. FIG. 1 illustrates the configuration of a crew member operation plan creation system 1 according to the present embodiment.

  The crew operation plan creation system 1 includes a database 2 in which train operation data 2a and crew data 2b are stored, and a processing unit that creates a crew operation plan by processing the information stored in the database 2 by means described below. 3 and output means 4 for outputting the created crew member operation plan.

  This crew member operation plan creation system 1 reads daily train schedules reflecting demand by means of the reading means 21 of the processing unit 3, creates a plurality of “stroke fragments” based on this, and suitably links them. By creating work for each crew member by day, a crew member operation plan table for each day is created.

  Here, as described above, the “stroke fragment” means a crew unit of a crew member. For example, from the train operation N1 shown in FIG. 2, a journey fragment n1 of the crew content for performing the train operation N1 from the A station to the B station is generated.

  Here, although not shown, if there is a train service from A station to C station and a train service that stops at B station, the distance from A station to C station is between A and B stations. It will include two journey fragments between B and C stations.

  The train operation diagram of FIG. 2 shows the freight trains operated by time (see horizontal axis), and the vertical axis of the train operation diagram simply shows the names of stations and the distances between stations. Symbols M1, M2, N1, N2, Q1, Q2, X1, and Y1 indicate train operations. Since the “train” is different between the forward route and the return route, different train operations are “M1”, “M2”, and so on. Yes.

  The general daily train operation diagram shown in FIG. 2 shows all trains operated by time, but for example, on June 12, the train operations Q1 and Q2 are initially set to stop. Even if there was a train, the train may not operate due to a decrease in demand.

  Therefore, when creating an operation plan for each day, it is necessary to generate a daily train operation diagram reflecting the suspension information, as shown in FIG. The daily train operation diagram of FIG. 10 is obtained by expanding the daily train operation diagram of FIG. 2 side by side reflecting the stop information. In this system, it is assumed that this daily train operation schedule is included in the train operation data 2a.

  Hereinafter, the processing unit 3 of the crew member operation plan creation system 1 will be described.

  The processing unit 3 sorts the daily train operation schedule by reading means 21, train operation replacement means 22 for replacing each daily train operation with a journey fragment, and the replaced crew members' journey fragments by their start times. The process fragment sorting means 23, the temporary connection means 24 for temporarily connecting the sorted process fragments, the connection evaluation means 25 for evaluating the reduction cost amount of each temporary connection, and the best temporary connection with the maximum reduction cost amount. And a bypass means 27 for bypassing at least a part of the subsequent temporary connection process when a process fragment having the same evaluation value as the best temporary connection already appeared in the temporary connection process, A work creation means 28 for adding a necessary piggyback to a work piece and performing work, a work improvement means 29 for improving work by exchanging work pieces within the work, and the work piece and work are different from the labor regulations. And labor provisions check means 30 to check whether or not mainly equipped.

  Here, “temporary connection” means that the process fragments are temporarily connected on a one-to-one basis, and in order to evaluate how much costs such as labor costs are reduced when the process fragments are actually connected. Is to be done.

  The “main connection” means that the temporary connection is actually connected to generate a longer stroke fragment. Furthermore, the “temporary connection process” refers to a process of temporarily connecting a plurality of process fragments together.

<Train operation replacement means>
The train operation replacement means 22 replaces daily train operations with stroke fragments. Each stroke fragment generated by this replacement is generated with at least information on the start time (see FIG. 11).

<Date change time>
Freight trains are often operated at midnight, so if the date change time is set to 24:00 (midnight), train operations across days may be unnaturally divided (for example, If there is a train that departs from station A and arrives at station B at 11:00 pm, then arrives at station B at 1:00 am the next day, trains between stations A and B and station C The operation between them will be the target of creating a plan divided separately).

  Therefore, it is desirable to set the time zone with the smallest number of trains as the date change time. For example, in the general example shown in FIG. 13, the set time (open arrow) is the date change time. As a result, the time zone with a large number of operating trains becomes the search range as the same date, so that there is an effect that the connection target is found earlier. There are cases where trains are operated at the corresponding time, but this system has a mechanism that makes consecutive search dates together into a search range, and since it is finally connected, there is no problem.

  The date change time only needs to be the time when the number of train operations is the smallest, and can be set not only at night but also during the day. In addition, the date change time can be set in the same manner even when a plan is created by this system for other crew operation plans, not limited to freight trains.

<Process fragment sorting means>
The process fragment sorting means 23 performs sorting that rearranges each process fragment in time series using the start time of each process fragment as an index for the generated pool of each process fragment (see FIG. 11). FIG. 12 shows the process fragments sorted by date. In addition, each process fragment of FIG. 12 is shown by the small letter alphabet corresponding to each train operation of FIG. 10 similarly to FIG.

<Temporary connection means>
The temporary connection means 24 is a process in which process fragments for consecutive days (for example, for three consecutive days, see the search range in FIG. 12) targeted in one temporary connection process are expanded on a daily basis as shown in FIG. Extracting from the fragments, further selecting one of the stroke fragments as a basic fragment, and temporarily connecting the basic fragment with another stroke fragment that does not overlap in time series.

  The temporary connection means 24 extracts and temporarily connects other process fragments whose start time is within 24 hours before and after the start time of the basic fragment. This is because the connection with a process fragment whose start time difference exceeds 24 hours is restricted by labor regulations and the like. In this example, the target of one temporary connection process is set to three consecutive days. This means that it is necessary to search for two days in order to create a 24-hour work starting from the middle of the day, and in order to use the periodicity of train operation, another work can be included. This is because it is necessary to target.

  However, it may be possible to temporarily link with a travel fragment exceeding 24 hours in consideration of work performed by the crew for consecutive nights. In this case, consecutive days (search range) to be subjected to one temporary connection process. ) May be four consecutive days or more.

<Consolidation evaluation means>
The connection evaluation unit 25 determines, for each temporary connection, whether or not the evaluation value for the stroke fragment obtained by the one-to-one temporary connection by the temporary connection unit 24 exceeds a predetermined evaluation reference value. For example, for this evaluation value, an evaluation reference value when provisionally connected can be used as a reduction cost amount.

  In this case, in the example shown in FIG. 12, when the third-day process fragments q1 and q2 are compared with the first-day process fragments n1 and n2, the process fragments q1 and q2 have a narrower interval between the process fragments and the cost is reduced. Therefore, the evaluation value at the time of provisional connection is high. Accordingly, when temporary connection processing is performed on the first to third days, the temporary connection of the process fragments q1 and q2 on the third day is the best temporary connection.

  Further, the connection evaluation means 25 always keeps updating the connection-time best reduction cost as the evaluation reference value of the temporary connection while trying a series of temporary connections. Then, when a series of temporary connections are completed, the information on the best reduction cost at the time of connection, that is, the best temporary connection in which the cost has been reduced and the evaluation value information are passed to the main connection means 26 described later.

  Whether the evaluation value given to the connection means 26 exceeds the reduction cost for connection termination as the connection termination reference value calculated from the highest evaluation value in the temporary connection processing that has already been performed. It is also judged whether or not, and if it does not exceed, it will not be connected as described later.

  This is excluded from the scope of this consolidation, even if the temporary cost reduction is the most cost-reduced, as long as it does not exceed the reduction cost for closing the connection, sufficient cost reduction has not been achieved. As a result, stroke fragments with low cost reduction are not linked to each other, but can be linked to stroke fragments in other search ranges.

<This connection means>
The main connecting means 26 is for main connecting the best temporary connection to create a longer stroke fragment or work. The main linked process fragment is again used for the temporary connection process as a new process fragment.

<Bypass means>
The bypass means 27 omits the temporary connection scheduled after that when the temporary connection of the same condition as the already temporarily connected temporary connection appears, and temporarily performs the temporary connection process for the current trial. Is to end.

  Specifically, when one-to-one temporary connection is performed for one basic fragment and another process fragment, the same temporary connection as the reduction cost of the best temporary connection that has already been fully connected appears. It is determined that the conditions are the same as those of the temporary connection described above, and the subsequent temporary connection is not performed.

<Work creation method>
The work creation means 28 analyzes the process fragment after the main connection that cannot further perform the main connection that satisfies the above conditions, and determines whether the work has started and ended at the base station. If the work has not started at the base station or has not ended at the base station, passengers can be boarded on the post-consolidated journey fragment so that the work starts at the base station and returns to the base station. Add or cut at an appropriate position.

  The base station for the work may be determined by any means, but the base station to which the work belongs needs to be determined when the work is created.

  When there is one base station, the base station is self-explanatory, but when there are two or more base stations, it is necessary to determine the base station for each operation. As a method for determining the base station, for example, business rules can be set, or a base station close to the station of the process fragment can be selected.

  In the case of a crew member whose station A is a base station, a process fragment having the same base station A as a start point and an end point is only one work without any modification. On the other hand, if the starting point or the ending point of the journey fragment is not the same base station A, it is necessary to correct the operation to return to the base station A by adding the flight boarding or the journey fragment.

<Work improvement measures>
The work improvement means 29 performs this exchange when the evaluation value can be improved by temporarily exchanging partial process fragments between works.

  Here, “provisional exchange” means to temporarily exchange one-to-one process fragments included in each of a plurality of targeted operations, and personnel expenses when actual process fragments are exchanged. It is performed in order to evaluate how much the cost is reduced.

  Also, “main exchange” means that a new work is regenerated by exchanging the actual process fragments between the works. Further, the “temporary exchange process” refers to a process of temporarily exchanging a plurality of stroke fragments with a round robin.

  The work improvement means 29 compares the sum of the evaluation values of each work before provisional exchange with the sum of the evaluation values of each work after provisional exchange. When the sum of the evaluation values is improved before and after the exchange, Perform this exchange.

  Also, the work improvement means 29 limits the provisional replacement target to a range limited to a time series by performing a provisional exchange process using a predetermined continuous day (for example, three consecutive days) as a search range, similarly to the provisional connection process. can do.

  In addition, when an evaluation value equal to the evaluation value at the time of the best temporary replacement that has already appeared appears during one temporary replacement process, the subsequent temporary replacement may be omitted by the bypass means 27. .

<Labor regulation check method>
The labor regulation checking means 30 determines whether the work piece temporarily connected by the temporary connection means 24, the work created by the work creation means 28, or the work in which the work piece is temporarily exchanged by the work improvement means satisfy the labor regulations. Check.

  For example, if the created work is too long and exceeds the limit of one flight time, the work is not realized. In addition, if there is a limit to the distance or time during which you can continue to ride, work that includes more than that will not work. Furthermore, work that exceeds the limit of working hours by adding the other required work hours to the crew hours cannot be realized.

  Such a work or process fragment is detected by the labor regulation checking means 30, and it is determined that the cost cannot be reduced, or is excluded from replacement candidates.

<Output means>
The output unit 4 performs a process of outputting the crew member operation table generated by the processing unit 3 of the crew member operation plan creation system 1. The output unit 4 may be any configuration such as a unit for writing data on a recording medium, a printer, or a monitor.

<Concatenation of process fragments>
Next, the flow of processing of the crew member operation plan creation system 1 according to the present embodiment will be described with reference to the flowcharts of FIGS.

  In step S1-1, the train operation data 2a having daily train operation data is read by the reading means 21 of the processing unit 3.

  As described above, the train operation data 2a is different every day due to a change in schedule due to an increase or decrease in demand or the like.

  When all trains M1, M2, N1, N2, Q1, Q2, X1, and Y1 are scheduled to be repeatedly operated every day in the daily train schedule of FIG. As shown in the train schedule, for example, on June 12th, train operations N1, N2, Q1, Q2, X1, and Y1 are stopped and only train operations N1 and N2 are operated. Yes.

  In step S1-2, a daily process fragment corresponding to the train operation of the daily train operation diagram is generated. Specifically, based on the train operation N1 on June 12 shown in FIG. 10, the journey fragment n1 (see FIG. 11 and FIG. 12) is generated on June 12, and each journey fragment is generated. Is done.

  As a result, a pool of stroke fragments composed of the stroke fragments for the date of the operation table creation target period is created (see FIG. 11). Each process fragment included in the pool shown in FIG. 11 has a similar process fragment in appearance, but each process fragment has a different start time, and thus is a different process fragment.

  Referring to FIG. 3, in step S1-3, the process fragments included in the process fragment pool are time-sequentially processed by sub-steps S2 to S4 (see FIGS. 4 to 6) which will be described later. A crew member's work is generated by suitably connecting them so as not to overlap.

  In step S1-4, the work of each crew member is generated from the process fragment. As described above, a process is performed in which a crew member's departure station and arrival station are set to the same base station by adding a flight.

  In step S1-5, the process fragments included in each of the generated crew member's work are mutually exchanged to improve the work. This specific process will be described later in steps S5 to S7 (see FIG. 7 to FIG. 9). However, by replacing the process fragment included in the work with the process fragments of other work, It is an improvement.

  In step S1-6, each train operation is assigned to the improved work, and a crew member is assigned to each work in step S1-7.

  In step S1-8, the crew member operation table generated by assignment is output by the output means 4 (see FIG. 14). The base stations for the crew members “Takahashi” and “Nakada” are the A stations, and the base stations for the crew members “Eto” and “Magome” are the B stations.

<Concatenation of process fragments>
The process fragment partial linking process will be described below with reference to FIGS.

  In step S2-1, the process fragments included in the pool of process fragments shown in FIG. 11 are sorted into daily groups (daily lists) using the start time as an index.

  In step S2-2, the process fragment partial connection process is performed. In the example shown here, as shown in FIG. 12, three consecutive groups (stroke fragments for three consecutive days) are the targets of the partial connection process (see “search range” in FIG. 12).

  This partial connection process mainly includes a series of connection processes from the temporary connection described later to the main connection (see FIGS. 5 and 6). With this partial connection process, temporary connection that exceeds the reduction cost for connection termination that is the highest reduction cost amount among the process fragments included in the plurality of groups to be processed and that is calculated from the highest evaluation value of the temporary connection that has already been issued. This will be connected.

  Subsequently, in step S2-3, it is determined whether or not there is a main connection in the partial connection process in step S2-2. If there is a main connection (Yes), the process proceeds to step S2-4. Conversely, if there is no main connection (No), the process proceeds to step S2-7.

  In step S2-4, this connection information is set to “present”. Here, “mainly connected information” indicates, for example, information on whether or not the main connection has been made at least once in the partial connection process for 30 days when a plan for 30 days is created. is there.

  As a result, it is understood that if the “main link information” is “present” at the time when the partial link process for 30 days is completed, there is a room for further partial link that satisfies the condition. On the other hand, if “main link information” is “none”, it can be understood that there is no room for partial connection that satisfies the conditions.

  In step S2-5, the process fragment before partial connection is deleted from the daily list. This is performed in order to avoid the overlap between the new process fragment generated by the partial connection process and the two process fragments before the partial connection.

  In step S2-6, the new process fragment generated by the partial connection process is added to the daily list to update the daily list.

  In step S2-7, it is determined whether or not a series of processing relating to partial connection has been completed for a period for which an operation plan is to be created (for example, for 30 days), and if completed (Yes), the process proceeds to step S2-10. move on.

  On the other hand, when the partial connection process for the plan target period (for example, 30 days) is not completed (No), this connection information is set to “None” (step S2-8), and the target of the partial connection process is set to 1. The search range changing process (step S2-9) shifted by the day is performed, and the process returns to step S2-2.

  In step S2-10, when it is determined that the “main link information” described above is “present”, it is determined that there is a room for partial connection that satisfies a further condition, and the main link information is set to “none”. "(Step S2-8), the search range changing process (step S2-9) for shifting the target of the partial connection process by one day is performed, and the process returns to step S2-2.

  On the other hand, if it is determined that the “main connection information” is not “present” (No), it is determined that there is no room for further partial connection that satisfies the condition, and the process returns to the main routine to return to step S1- Go to 4 (see FIG. 3).

<Partial consolidation processing>
5 and 6 are flowcharts of the partial connection process.

  The partial connection process consists of a temporary connection process and a main connection process. For example, when creating a crew operation plan for 30 days, a process included in a range of partial three consecutive days (for example, the first to third days). For the fragments (for example, the process fragments n1, n2, n1, n2, x1, q1, q2 in FIG. 12), a temporary connection process is tried. In this temporary connection process, the process fragments are temporarily connected to calculate an evaluation value (here, a reduction cost amount) when the process fragments are connected, and actual connection (main connection) is not performed.

  One of the stroke fragments (for example, the stroke fragment n1 of the first day) is fixed, and the other stroke fragments (in this example, the stroke fragments n2 (first day), n1, n2, x1 (second day), q1 , Q2 (3rd day)) and one-to-one temporary connection. Thereafter, the process pieces to be fixed are exchanged and temporarily connected in the same manner. As a result, the round robin temporary connection is performed. Then, the reduction cost amount of each temporary connection is calculated, and the best temporary connection with the largest reduction cost amount (for example, the temporary connection of the process pieces q1 and q2 on the third day) is returned (the temporary connection processing up to here is one time). Becomes).

  Then, when the best temporary connection can reduce the cost exceeding the connection cutting reduction cost calculated from the highest estimated value of the temporary connection, the main connection is performed. After that, the trial from the temporary connection process is repeated again in a state where the stroke fragment is reduced by one by the main connection. By this series of processing, a longer stroke fragment that satisfies a certain condition is created.

  The above-described reduction cost amount is calculated based on a predetermined evaluation function. As an element constituting this evaluation function, for example, the time difference between the start times of the process fragments (the larger the time difference, the smaller the reduction cost amount). ) And the number of flight multipliers (the amount of reduction cost decreases as the flight increases).

  Hereinafter, each step of the partial connection processing S3 system performed in units of three days will be described with reference to FIG. Note that, at the start stage, a reduction cost amount, which will be described later, and a concatenation best reduction cost are reset to a value of “−1”.

  In step S3-1, the process fragments are sorted in the order of the start time using the start time of each process fragment included in the pool of process fragments as an index.

  This start time is used when temporarily connecting the stroke fragments (step S4-3, which will be described later), and is used to limit the connection target for one stroke fragment.

  In step S3-2, temporary concatenation processing is performed between the process fragments for consecutive days (here, for three consecutive days) among those sorted in step S3-1. In the temporary connection process, as described above, the temporary connection having the highest reduction cost is returned as the best temporary connection and the reduction cost is returned.

  In step S3-3, it is determined whether this reduction cost amount is a positive value, that is, whether the cost is reduced by the best temporary connection. When it is a positive value and the cost is reduced (Yes), the process proceeds to step S3-4. Conversely, if the cost increases and becomes a negative value (No), the process returns and proceeds to step S2-3.

  The “reduction cost” shown in step S3-3 is the same value as the “best reduction cost at connection” when returning from the temporary connection process shown in FIG.

  With respect to this reduced cost amount, the difference in start time between adjacent process fragments may be large, resulting in a cost increase and a negative value (see, for example, process fragments n2 and q1 in FIG. 12).

  In step S3-4, it is determined whether or not a reduction cost for connection termination of the reduction cost amount is set. If not set (No), the process proceeds to step S3-6, and is set (Yes). Advances to step S3-5.

  This reduction cost for connection termination is the standard value calculated in step S3-6. Since it is unclear how much the cost can be reduced at the first stage, the first temporary connection process (in FIG. 12, the process fragments n1, n2 (first day), n1, n2, x1 on the first to third days) 2nd day), q1, q2 (3rd day) round-robin provisional connection), and using the best temporary connection reduction cost amount obtained there, the reduction cost for connection termination is determined.

  In step S3-6, the reduction cost for the connection termination of the reduction cost amount is calculated. For example, a value obtained by multiplying the best temporary connection reduction cost amount by 0.95 is determined as the connection cutoff reduction cost. If the connection cut-off reduction cost is set to a low value, it is necessary to adjust the process fragments so that the process fragments having a small reduction cost amount are easily connected to each other.

  On the other hand, in Step S3-5, whether the reduction cost amount of the best temporary connection obtained in the second and subsequent temporary connection processes is higher than the reduction cost for connection termination set in the reduction cost amount set in Step S3-6. Judging. If it is higher than the connection cut-off reduction cost (No), it is determined as the best temporary connection that is sufficiently cost-reduced compared to the connection with the process fragment in another adjacent search range, and the process proceeds to step S3-7. .

  On the other hand, if the reduction cost amount is lower than the connection cutting reduction cost (Yes), it is determined that the best temporary connection is not made with sufficient cost reduction, and the process returns to step S2-3.

  In step S3-7, the reduction cost amount that appears in the “first” provisional connection process in each partial connection process is set as a reduction cost for bypass connection in step S4-9 described later. This bypass connection reduction cost will be described later in step S4-9.

  In step S3-8, the two stroke fragments that are the best temporary links returned in step S3-2 are fully linked to generate a new stroke fragment.

  In step S3-9, the two stroke fragments before the main connection are deleted.

  In step S3-10, the newly connected new process fragment is inserted into the correct position in time series of the other process fragments sorted in the order of the start time in step S3-1.

  Hereinafter, the temporary connection process will be specifically described with reference to FIG.

  In step S4-1, one stroke fragment as a basic fragment is selected from the stroke fragments sorted in step S3-1. The selection of the basic fragment moves the pool of the stroke fragments sorted by the start time one by one every time it comes to step S4-1 (and returns to the beginning when it reaches the end). Thereby, temporary connection processing is performed in order of time, and a search using periodicity can be performed.

  In step S4-2, another stroke fragment is selected from the pool of stroke fragments.

  In step S4-3, it is determined whether the start time difference between the one stroke fragment selected in step S4-1 and the other stroke fragment in step S4-2 is within 24 hours.

  If it exceeds 24 hours, the selection of the other one stroke fragment may be discontinued. This is because the stroke fragments are sorted by the start time, and it can be seen that subsequent selections always exceed 24 hours. The value of 24 hours can be arbitrarily set based on labor regulations.

  In step S4-4, one stroke fragment and one other stroke fragment are temporarily connected, and then in step S4-5, if this temporary connection is assumed to be the main connection, the reduction cost amount to be reduced is evaluated. The value is calculated by a predetermined evaluation function.

  With respect to this reduction cost amount, if a violation is detected as a result of checking by the labor regulation checking means 30, a cost increase, that is, a negative value is used. Further, although depending on the evaluation function to be used, when the process fragments whose start times are extremely far apart are temporarily connected, the cost may increase and become a negative value.

  In step S4-6, it is determined whether this reduction cost amount exceeds the highest reduction cost amount (the best reduction cost at the time of connection) in the current temporary connection process. When exceeding (Yes), it progresses to step S4-7, and when not exceeding (No), it progresses to step S4-8.

  In step S4-7, the reduction cost amount calculated in step S4-5 is set or updated to the best reduction cost at the time of connection. At the same time, temporary connection information (process fragment information, etc.) at that time is stored. By doing so, information on a higher reduction cost amount and information on temporary connection at that time are updated and held.

  In step S4-8, it is determined whether or not a series of provisional connections with other process fragments included in the connection target is completed for the one process fragment selected in step S4-1. If completed (Yes), the process proceeds to step S4-9. If not completed (No), the process returns to step S4-2.

  In step S4-9, it is determined whether or not the current best connection reduction cost is the same as the bypass connection reduction cost set in step S3-7. In the case of the same value (Yes), it is determined that there is periodicity, the loop of S4-1 to S4-9 is exited, and the process returns to Step S3-3. If the value is different (No), the process proceeds to step S4-10.

  The reduction cost for bypass connection is a cost reduction amount at the time of the main connection performed before the current round of continuous days (here, for three consecutive days) as described above.

  For example, as shown in FIG. 12, when temporary connection processing is performed for the first to third-day process fragments, the first-day process fragment n1 and the process fragment n2 are optimally connected, and this value is used for bypass connection. If it is assumed that the reduction cost is set, then when the second day's process fragment n1 is fixed as a basic fragment and temporarily connected with another process fragment, the temporary connection with the second day's process fragment n2 The reduction cost amount is equivalent to the reduction cost for bypass connection. In this way, a part of the provisional connection process is omitted by using the periodicity of the process fragment as originally performed in the police box.

  In step S4-10, it is determined whether or not provisional concatenation has been performed for each of the process fragments for consecutive days (here, for three consecutive days). If yes (Yes), return the information of the best temporary connection and the reduction cost amount, and go to Step S3-3. If not (No), return to Step S4-1.

  Hereinafter, the work improvement process (see FIG. 3) in step S1-5 will be described with reference to FIGS.

  Here, the “work improvement process” means that the process fragment included in the already generated work is replaced with the process fragment included in the other work, and the better condition (here, the cost is reduced). A process that generates work.

  First, in step S5-1, processing for dividing each work generated in step S1-4 by day is performed.

  In step S5-2, partial replacement processing is performed for the process fragments included in each work. This partial replacement processing basically has a flow of processing similar to the partial connection processing (see FIG. 5) already described (see FIG. 8).

  In step S5-3, it is determined whether or not there has been a real exchange in the process fragment partial exchange process in step S5-2. If there has been a real exchange (Yes), the process proceeds to step S5-4. On the other hand, if there is no real exchange (No), the process proceeds to step S5-7.

  In step S5-4, the exchange information is set to “present”. This “main exchange information” is information similar to the “main connection information” already described. If the main exchange is performed at least once after the partial exchange process is performed for the period for which the plan is created, “present” is set. Is set.

  In step S5-5, the process fragment before the main exchange is deleted from the daily list, and in step S5-6, the process fragment after the main exchange is added to the daily list.

  In step S5-7, it is determined whether or not the process is completed for the plan period to be improved. For example, if the work improvement target is for 30 days, it is determined whether or not a series of processing mainly for partial replacement processing has been completed for 30 days, and if completed (Yes), step S5-10. Proceed to

  If it is not completed (No), in step S5-8, the exchange information is set to "None", and in step S5-9, the search range is changed by shifting the partial exchange target by one day, and step S5 is executed. Return to -2.

  On the other hand, if it is determined that the exchange information is “Yes” in step S5-10 (Yes), it is determined that there is room for further work improvement that satisfies the condition, and step S5-8 is performed as described above. , Return to step S5-2 via S5-9. On the other hand, if it is determined that the exchange information is not “present”, it is determined that there is no room for improvement of the work that satisfies the conditions, and the process returns to step S1-7 (see FIG. 3). .

  Hereinafter, the process fragment partial replacement process in step S5-2 will be described with reference to FIG.

  In step S6-1, each work is sorted by start time.

  In step S6-2, provisional exchange processing is performed on the process fragments included in each sorted work, and information on the provisional exchange of the best process fragments and information on the reduction cost amount at that time are obtained.

  In step S6-3, it is determined whether the best temporary replacement reduction cost amount is a positive value. When the reduction cost amount is a positive value and the cost is reduced (Yes), the process proceeds to step S6-4. Conversely, if the cost increases and becomes a negative value (No), the process returns and proceeds to step S5-3.

  The “reduction cost” shown in step S6-3 is equivalent to the “best reduction cost at the time of replacement” at the time of returning from the provisional replacement process shown in FIG.

  In step S6-4, it is determined whether or not a reduction cost for replacement termination is set. If not set (No), the process proceeds to step S6-6, and if set (Yes). Advances to step S6-5.

  Note that the replacement cutoff reduction cost is a value calculated in step S6-6.

  Since it is unclear how much the cost can be reduced at the first stage, the first temporary replacement process is performed, and the reduction cost for replacement abortion is determined by using the best temporary replacement reduction cost amount obtained there.

  In step S6-6, the reduction cost for replacement termination of the reduction cost amount is calculated. For example, a value obtained by multiplying the best temporary replacement reduction cost amount by 0.95 is determined as the replacement cutoff reduction cost. If the reduction cost for replacement abortion is set low, it is necessary to adjust the process fragments so that the process fragments having a small reduction cost amount are easily exchanged.

  On the other hand, in step S6-5, whether the reduction cost amount of the best temporary replacement obtained in the second and subsequent temporary replacement processing is higher than the reduction cost for replacement termination set in the reduction cost amount set in step S6-6. Judging. If it is higher than the reduction cost for replacement termination (No), it is determined as the best temporary replacement that is sufficiently cost-reduced compared to the replacement with the process fragment in another adjacent search range, and the process proceeds to step S6-7. .

  On the contrary, if the reduction cost amount is lower than the reduction cost for replacement termination (Yes), it is determined that the temporary replacement is not the best temporary replacement that is not sufficiently cost-reduced, and the process returns to step S5-3.

  In step S6-7, the reduction cost amount that appears in the initial temporary replacement process is set as a reduction cost for bypass replacement used in step S7-9, which will be described later. This reduction cost for bypass replacement will be described later in step S7-9.

  In step S6-8, the two stroke fragments that are the best temporary exchanges returned in step S6-2 are fully exchanged to generate new works.

  Hereinafter, the temporary replacement process in step S6-2 will be described with reference to FIG.

  In step S7-1, one of the works is selected as the basic work. The selection of the basic work is performed by moving the work pool (not shown) sorted by the start time in step S6-1 one by one each time it comes to step S7-1 (and the first when it reaches the end) Back to). Thereby, the provisional exchange process is performed in order of time, and a search using periodicity can be performed.

  In step S7-2, another work is selected from the work pool.

  In step S7-3, it is determined whether or not the start time difference between the one operation selected in step S7-1 and the other operation in step S7-2 is within 24 hours. The case where it exceeds 24 hours is the same as step S4-3.

  In step S7-4, temporary exchange of exchangeable process fragments between one work and another work is performed, and then in step S7-5, a reduction cost amount of the temporary exchange is calculated by a predetermined evaluation function. However, the labor regulation checking means 30 checks whether the exchange is possible.

  In step S7-6, it is determined whether or not the reduction cost amount exceeds the highest reduction cost amount (the best reduction cost at the time of replacement) in the current temporary replacement process. When exceeding (Yes), it progresses to step S7-7, and when not exceeding (No), it progresses to step S7-8.

  In step S7-7, the reduction cost amount calculated in step S7-5 is set or updated to the best reduction cost at the time of replacement. At the same time, provisional exchange information (process fragment information, etc.) at that time is stored. By doing so, information of a higher reduction cost amount and information of provisional exchange at that time are updated and held.

  In step S7-8, it is determined whether the provisional exchange with the other work included in the search range is completed for the one work selected in step S7-1. If completed (Yes), the process proceeds to step S7-9. If not completed (No), the process returns to step S7-2.

  In step S7-9, it is determined whether or not the current best replacement reduction cost is equivalent to the reduction cost for bypass replacement set in step S6-7. If the values are the same (Yes), it is determined that there is periodicity, the process returns from step S7-1 to S7-9, and the process proceeds to step S6-3. If the value is different (No), the process proceeds to step S7-10.

  The reduction cost for bypass replacement is the amount of cost reduction at the time of the main replacement performed before the current round of continuous days (here, for three consecutive days) as described above.

  In step S7-10, it is determined whether or not provisional exchange has been performed for each of the operations for consecutive days (here, for three consecutive days). If yes (Yes), return the information of the best temporary exchange and its reduction cost amount and proceed to Step S6-3. If not (No), return to Step S7-1.

  Hereinafter, the effect of the crew member operation plan creation system according to the present invention will be described.

  According to the crew member operation plan creation system according to the present invention, it is possible to obtain a connected solution of stroke fragments that is usually difficult to obtain or cannot be obtained as a combination optimization problem by at least the following configuration (1). For this reason, it is possible to create different crew operation plans for each day corresponding to different demands (see FIG. 14).

  As a result, it is possible to create a daily crew member operation plan that takes into account daily demand fluctuations. In addition, it is possible to improve the efficiency of the plan creation work by drastically reducing the trouble of reviewing the plan that has occurred in the crew operation plan of the alternating method of the conventional method.

(1) Since the process fragments are connected in order from the most advantageous connection, the connection process is quick.
The process fragments are temporarily connected to each other, and it is evaluated each time whether or not each temporary connection is advantageous. Then, the main connection is performed with the advantageous temporary connection having the largest reduction cost among the temporary connections as the best temporary connection. By repeating the same process including the main linked process fragments, the process fragments are connected in order from the largest reduction cost amount, and the connection processing is performed rather than connecting the process fragments with the lowest reduction cost amount by hand. Is appropriate and quick.

  Furthermore, by using the following configurations (2) to (6), the above connected solution can be obtained more quickly and reliably.

  (2) Since the range of the target date of the provisional connection process is limited (here, limited to three consecutive days), there is a high possibility of being connected to one stroke fragment, between the stroke fragments close to the time series Temporary connection processing is performed, and the connection processing becomes quick.

  Furthermore, due to the existence of a reduction cost for connection termination of the deletion cost amount (see step S3-6), even if the best provisional connection within the target date range is not exceeded unless the reduction cost for connection termination is exceeded, The connection between the process fragment that constitutes the best temporary connection and the process fragment that is outside the adjacent target range and exceeds the reduction cost for the connection termination is not deprived of the possibility of temporary connection or main connection, and more appropriate connection is possible. Made.

  As a specific example, consider provisional connection processing for each process fragment included in the first to third days of FIG. 12A (a). First, it is assumed that the linking process has progressed to some extent, and it is a stroke fragment in which n1 and n2 on the first day and the second day are connected, respectively, and a stroke fragment in which q1 and q2 on the third day are connected. Further, it is assumed that there is a stroke fragment of x1 on the second day and y1 on the fourth day, and that each can be linked to a stroke fragment (concatenated q1 and q2) of the third day.

  If the reduction cost for connection termination is not taken into account, in the search range 1 (1st to 3rd days), the process fragment x1 on the second day and the process fragment (combined q1 and q2) on the third day can be connected. If the cost can be reduced even slightly, the connection is performed (see FIG. 12A (b)).

  Thereafter, even if the range of connection moves to the search range 2, the process fragment y1 on the fourth day is not connected to the process fragment on the third day (what is connected to x1, q1, and q2). This is due to the fact that the start time of the process fragment is more than 24 hours away or the labor regulations are violated (the work must be 24 hours or less in length).

  When the reduction cost for connection termination is introduced, in the search range 1 (1st to 3rd days), it is possible to connect the process fragment x1 of the second day and the process fragment of the third day (concatenated q1 and q2). Cost savings are negligible. If the cost reduction is less than the connection cutoff reduction cost, this connection is not performed and the connection range moves to the search range 2. As a result, concatenation capable of further cost reduction is performed, and it is possible to create a process fragment in which q1 and q2 on the third day and y1 on the fourth day are concatenated (see FIG. 12C).

  (3) At the time of provisional connection, one process fragment and another process fragment with a start time difference of 24 hours or less are extracted and used as a provisional connection target, so that the connection process is accelerated.

  When it is not possible to connect process fragments whose start time difference exceeds 24 hours due to restrictions on labor regulations or the like, the processing can be speeded up by removing those that do not meet the conditions from the connection target.

  (4) When a process fragment that exceeds the above-mentioned reduction cost for connection termination and becomes the same value as the evaluation value at the time of the best temporary connection appears again, it is regarded as a process fragment of the same condition as the best temporary connection that has already been made. Since the one-to-one temporary connection with the remaining stroke fragments is bypassed, the processing becomes quick.

  As a specific example, as shown in FIG. 12, when temporary connection processing is performed for each process fragment on the first to third days, the temporary connection between the process fragments n1 and n2 on the first day is the most cost-reduced. If this is the case, this reduction cost amount is stored as a reduction cost for bypass connection in step S3-7.

  In the subsequent temporary connection process, when the temporary connection process is performed for the process fragment n1 on the second day, the reduction cost amount of the temporary connection of the process fragments n1 and n2 on the second day is equal to the reduction cost for bypass connection. Therefore, it is determined that the process fragments n1 and n2 on the second day are the process fragments having the same conditions as the process fragments n1 and n2 on the first day, and the subsequent temporary connection is skipped, so that the connection process becomes quick.

  Next, another crew member operation plan creation system according to the present invention will be described.

  Changes in daily demand do not occur uniformly for all train operations, but differ for each train operation. By creating a crew operation plan for each train operation on a daily basis, it becomes possible to efficiently link the operation rate and the crew ratio.

  By doing in this way, a quicker process is possible rather than producing every day about the crew operation plan part which can respond by police box percent.

  FIG. 15 shows the configuration of the crew member operation plan creation system 10 of the embodiment, and FIG. 16 shows a table of the results of grouping.

  The crew member operation plan creation system 10 includes a reading unit 3A as shown in FIG. In addition to the processing unit 3 of the crew member operation plan creation system 1 described above, the reading unit 3A includes a crew ratio calculation unit 31 that calculates the crew ratio of each crew member, and a driving rate calculation that calculates the driving rate of each train operation. The means 32, the train grouping means 33 for grouping train operations according to the driving rate, the crew grouping means 34 for dividing the crew members into the same number of groups as the train groups by the crew ratio, and the train group and the crew group are linked. Group linking means 35 to be used.

<Crew ratio calculation means>
The crew ratio calculation means 31 is a means for calculating the ratio of each crew member's crew time to the standard crew time. For example, crew ratio = time spent by each crew member during one month / time spent by a crew member of regular employee A during one month × 100 (%).

<Driving rate calculation means>
The operation rate calculation means 32 calculates the operation rate of each train when the operation rate of the train that operates every day is 100%.
<Train grouping means>
The train grouping unit 33 is a unit that sorts each train into train groups in a predetermined operation rate range using the operation rate of each train calculated by the operation rate calculation unit 32 as an index.

<Crew grouping means>
The crew grouping means 34 is a means for sorting each crew member into a crew group within a predetermined crew ratio range, using the crew ratio calculated by the crew ratio calculation means 31 as an index.

<Group linking means>
The group linking means 35 sorts the train groups in the order of the driving rate according to the driving rate of the train, sorts the crew group in the order of the riding rate according to the crew rate of the crew, and corresponds the train group and the crew group in the sorting order. It is a means of associating.

  Hereinafter, the crew member operation plan creation system 10 according to the embodiment will be described in detail.

  First, the operation rate calculation means 32 calculates the operation rate of each train operation when the daily operation is 100% for each train operation R1, R2, U1, U2, T1, T2 (see FIG. 16 (a)).

  Then, the trains are grouped by the train grouping means 33 according to the operation rate of the train operation (see FIG. 16A).

  On the other hand, with respect to crew members, the crew ratio of each crew member is calculated by the crew ratio calculation means 31, and the grouping according to the crew ratio is performed by the crew grouping means 34 (see groups I to III in FIG. 16B). ).

  Then, by each means already described in the embodiment, a daily crew member operation plan is created for the groups B and C of the train whose driving rate is less than a predetermined value, and a crew member whose crew ratio is less than a predetermined value is determined by the group linking means 35. Group II and III are linked to groups B and C in the same order.

  On the other hand, for group A of trains with an operation rate of more than a predetermined value, a partial crew operation plan is created by applying the conventional circulating police box, and the crew members of group I with a duty ratio of greater than or equal to a predetermined value are grouped. Tie to A.

  By doing in this way, a plan is created every day only for trains that are likely to change in demand and cannot be handled by police box allocation, the efficiency of staffing can be improved, and the plan creation process is further accelerated.

  Hereinafter, the processing flow of the crew member operation plan creation system 10 will be described with reference to the flowcharts of FIGS. 17 to 19.

  In step S8-1, the train operation data 2c and the crew data 2d are read by the reading means 21. The train operation data 2c includes a daily train operation diagram in which the suspension information of the target period for creating the operation plan is reflected. The crew data 2d includes information such as the crew name and crew hours (see FIG. 16B).

  In step S8-2, the operation rate of each train scheduled to be initially operated is calculated, and each train is divided into two or more train groups based on this operation rate. The calculation and grouping of the operation rate will be described in the later-described step S9 system.

  In step S8-3, the crew ratio of each crew member is calculated from the crew hours recorded in the crew data, and is divided into two or more crew groups equal to the number of train groups based on this crew ratio. The calculation and grouping of the crew ratio will be described in the later-described step S10 system.

  In step S8-4, the train group and the crew group are associated with each other. In this linking, the train groups are sorted in descending order by the operation rate, the crew groups are sorted in descending order by the crew ratio, and the train groups and crew groups are linked to correspond to the descending order.

  In step S8-5, as described in the embodiment, a daily crew member operation plan is created for a train group having an operation rate of less than a predetermined value.

  In this example, a daily crew member operation plan is created for train groups B and C with an operation rate of 90% or less (see FIG. 16A).

  In step S8-6, a crew member operation plan is created for train groups with an operation rate equal to or greater than a predetermined value by applying an alternating rate circulating as usual based on the train operation data 2c. Basically, a police box is created from train schedules for one day (not shown).

  In step S8-7, the crew member operation table created in steps S8-5 and S8-6 is synthesized and output (not shown).

  Hereinafter, the process of grouping trains according to the operation rate will be described with reference to FIG.

  In step S9-1, the operation days of a predetermined period (here 1 year) are derived for each train from the train operation data 2c.

  In step S9-2, the operation rate of each train is calculated. This operation rate is calculated by the number of operation days / 365 (366 for leap years) × 100 (%).

  In step S9-3, an operation rate threshold for dividing each train into groups is set. This threshold value can be set by the user. In addition, since the target train of the operation plan created for each day is determined by the setting of the threshold, the final operation cost of the crew changes depending on the setting. Therefore, it is desirable to determine the threshold value in consideration of the final crew operating cost.

In this example,
Group A operation rate (%)> 90
90 ≧ Group B operation rate (%)> 50
50 ≧ Group C operation rate (%)> 0
The threshold is set so that

  In step S9-4, each train is divided into groups based on the derived operation rate and the set threshold value. Then, it returns and progresses to step S8-3 (S10-1).

  In this example, as shown in FIG. 16 (a), train operations R1 and R2 with an operation rate of 100% are classified into group A, train operations U1 and U2 with an operation rate of 85% are classified into group B, and the operation rate 43% of train operations T1 and T2 are classified into Group C.

  Hereinafter, with reference to FIG. 19, the process of grouping crew members according to the crew ratio will be described.

  In step S10-1, for the regular employee A with a crew ratio of 100%, the working hours for one month to be planned are calculated from the crew data 2d, and the same working hours for each crew member are calculated. .

  Here, the working time is the time during which the operation as a driver is performed.

  In step S10-2, a crew ratio is calculated for each crew member.

  This crew ratio is calculated by the time spent for each crew member during one month / the time when the crew member of regular employee A is crewed during one month × 100 (%).

  In step S10-3, a crew ratio threshold for grouping crew members is set. Each crew member is grouped by this threshold value. The crew ratio threshold can also be set by the user as an element for determining the reduction cost amount.

In this example,
Group I crew ratio (%)> 80,
80 ≥ Group II crew ratio (%)> 40
40 ≧ Group III crew ratio (%)> 0
The threshold is set so that

  In step S10-4, the crew members are divided into groups based on the derived crew ratio and the set threshold value. Then, it returns and progresses to step S8-4.

  In this example, as shown in FIG. 16 (b), “Sayama” and “Suzuki” who are 100% crew members are classified into Group I, while “Takahashi” and “Nakada” who are 71% crew members. ”Is classified as Group II, and“ Mamagome ”and“ Eto ”who are full-time employees C and have a crew ratio of 28% are classified as Group III.

  Group I crew “Sayama” or “Suzuki” is on board Group A train operations R1 and R2, and Group II crew “Takahashi” or “Nakada” is on Group B train services U1 and U2. Then, “Magome” or “Eto” who is a crew member of Group III will be in charge of train operations T1 and T2 of Group C.

  Hereinafter, the effect of the crew member operation plan creation system 10 according to the embodiment of the present invention will be described.

  Since the target trains for creating daily operation plans are limited according to the operation rate of the train, the number of creation targets is reduced, and the plan creation process becomes quick.

  Furthermore, because it is possible to create a daily operation plan for trains with low operation rates, it is possible to assign crew members by crew ratio, and there are a mix of crew members who are very difficult to achieve with the conventional police box assignment. A crew operation plan can be created. For example, it can be applied to shortened work such as childcare (see full-time employees B and C in FIG. 16B).

  As mentioned above, although the crew member operation plan creation system according to the present invention has been described based on the embodiments and examples, the specific configuration is not limited to these embodiments and examples. Modifications and additions of the design are permitted without departing from the spirit of the invention according to each claim in the scope of the above.

  For example, the daily train operation schedule may be generated by the train operation replacement means 22 using difference information such as stop information and information on temporary trains in addition to the basic operation schedule.

1,10 Crew member operation plan creation system 2 Database 21 Reading means 22 Train operation replacement means 23 Process fragment sorting means 24 Temporary connection means 25 Connection evaluation means 26 Main connection means 27 Bypass means 28 Work preparation means 29 Work improvement means 30 Labor regulations check Means 31 Operation rate calculation means 32 Crew ratio calculation means 33 Train grouping means 34 Crew grouping means 35 Group linking means 2a, 2c Train operation data 2b, 2d Crew data 3, 3A Processing section 4 Output means
n1, n2, n1, n2, q1, q2 travel segment N1, N2, M1, M2, Q1, Q2 train operation R1, R2, U1, U2, T1, T2 train operation

Claims (6)

In the crew operation plan creation system that assigns each train operation section of the train operation diagram to the crew's work unit and creates the crew's operation plan for a predetermined period,
Train operation replacement means for generating daily journey fragments of crew based on train operation data reflecting the suspension of the train operation,
A process fragment sorting means for sorting the process fragments by their start times;
Temporary connection means for performing temporary connection processing for temporarily connecting one-to-one temporary connection between the process pieces that do not overlap in time series with the sorted process pieces;
Connection evaluation means for determining whether or not an evaluation value when a predetermined evaluation is performed for each temporary connection exceeds a predetermined evaluation reference value, and replacing the predetermined evaluation reference value with the evaluation value if it exceeds When,
A crew member operation plan creation system comprising: a main connection means for generating a longer process fragment or work by main connection of temporary connection of evaluation reference values obtained after the temporary connection processing. The temporary connection means performs the temporary connection process while shifting the day by day while maintaining the range of the target date to be temporarily connected,
The connection evaluation means includes
Based on the evaluation standard value of the existing temporary consolidation process, the consolidated termination standard value is calculated,
Judge whether the evaluation standard value after the current provisional consolidation process exceeds the standard value for termination of consolidation,
The crew member operation plan creation system according to claim 1, wherein the main connection is made when the evaluation value is higher than the connection cutoff reference value.   When temporarily connecting the sorted process fragments, the temporary connection unit extracts one process fragment arbitrarily selected and another process fragment whose start time difference between the process fragments is 24 hours or less. The crew member operation plan creation system according to claim 1, wherein temporary connection is performed.   The bypass means which abbreviate | omits at least one part temporary connection after that when the temporary connection of the same evaluation value as the evaluation value of the temporary connection mentioned above appears was provided. A crew management plan creation system described in 1. An operation rate calculating means for calculating the operation rate of each train operation when the operation rate of the train when operating daily is 100%,
A train grouping means that divides the train operation group with an operation rate equal to or higher than a reference value and a train group with a driving rate lower than the reference value
The crew member operation plan creation system according to any one of claims 1 to 4, wherein a crew member operation plan is created on a daily basis for a train group having an operation rate less than a reference value. A crew ratio calculation means for calculating a crew ratio that is a ratio of each crew member's crew time to the standard crew time;
A crew grouping means for dividing the crew ratio into a crew group having a standard value or more and a crew group having a standard value or less;
Assign a crew group with a crew ratio greater than or equal to the reference value to a train group with an operation rate greater than or equal to the reference value,
A group linking means for allocating a crew group having a crew ratio less than the reference value to a train group having an operation rate less than the reference value, and creating an alternating allocation for a train group having an operation rate of the train equal to or greater than the reference value. 6. The crew member operation plan creation system according to claim 5,