CN1622110A - Vehicle base inner shunting plan implementing device, method and program - Google Patents

Abstract

Provided is an in-yard shunting plan creating device for a vehicle base that can efficiently create an in-yard shunting plan independent of the layout structure of the vehicle base and the number of formations. The vehicle base layout network creation device 0111 creates vehicle base layout information with the numbered routes and travel route definition information; the shunting sequence initialization device 0112 arranges the dispatching sequence from the job content and the numbered routes between jobs according to the vehicle base layout network for each formation The metadata of the grouping of the car operation diagram is the initialization of the shunting sequence; the shunting operation diagram selection and time determination device 0113 selects the shunting operation diagram from the shunting sequence and makes a schedule for determining the execution time for all the groups of the planning objects. The processed tentative solution of the on-site shunting plan; the shunting sequence changing means 0114 uses the vehicle base layout network to change the shunting sequence so as to eliminate the contention of numbered routes and travel routes included in the obtained tentative solution.

Description

Device, method and program for making shunting plan in vehicle base

technical field

The present invention relates to an apparatus and method for using a computer to create a shunting plan for vehicles in a railway vehicle base, and in particular to a plan making device capable of efficiently creating an on-site shunting plan independent of the layout and structure of the rolling stock base and the number of formations .

Background technique

As a prior art, the shunting plan making device described in Patent Document 1 is provided with a work plan determining device and a shunting order (suji) determining device; the work plan determining device holds vehicle base structure information and business trunk line operation map (guiya) information , and in accordance with the entry and exit times determined by the business trunk line operation diagram and the scheduled operation procedures, determine the operation plan consisting of the operation number line and the operation start time and end time for each formation; the shunting sequence determination device is in accordance with the above The entry and exit time and the scheduled shunting regulations determine the entry numbered line, the exit numbered line, the start and end time of the first line change from the above entry numbered line to the above operation numbered line and the start and end time from the above operation The shunting sequence formed by the numbered line to the second line change start and end time of the above-mentioned exit numbered line.

As a prior art for creating an on-site shunting plan for a vehicle formation, for example, Non-Patent Document 1 describes that a vehicle formation from entering the vehicle base to exiting the field is used as a planning unit, and the shunting operation diagram of the vehicle formation in the yard is registered in advance. , a method of searching for a work map suitable for a corresponding vehicle in the creation process.

The present invention is not limited to the on-site shunting plan as the object. In various fields such as industry, circulation, public, transportation, etc., there are many unclear in advance due to the operation content of the planning object, available resources, and various preparation conditions. , Therefore, the person in charge of general plan making repeats adjustments and trial operation mistakes, and proceeds to plan making in stages until the day of plan implementation. In addition, even on the day when the plan is implemented, due to delays in work or changes in the plan, the information on the premise or the actual state of the conditions are inconsistent, there are often cases where the plan made at one time conforms to the actual situation and adapts to the actual situation.

As a prior art that supports the re-creation of plans by such a plan undertaker, Patent Document 2 describes a technique for revising the plan according to the progress of the work on the day when the plan is implemented, storing in advance the delivery of accompanying materials. When the computer finds an operation plan violating the constraints in the middle of the plan recreation process, the multiple constraints of the operation will be displayed on the CRT, and the planner will see this and instruct to reduce the violating constraints. The computer re-formulates the transmission condition plan. Therefore, if a transmission plan satisfying the constraints cannot be obtained now, the intermediate result obtained at that time is discarded, and the content of the operation plan is changed so as to match the constraints, and the constraints can be eased by using the judgment of the planner. The effect of shortening the time for replanning to continue processing from a state in which there is no constraint violation is obtained.

[Patent Document 1] Japanese Laid-Open Patent Publication No. 2000-190849

[Patent Document 2] Japanese Laid-Open Patent Publication No. 8-55154

[Non-Patent Document 3] Hihita: "Systematization of On-Site Work Diagram Creation Business", Proceedings of a National Symposium on the Utilization of Cybernetics in Railways, pp. 167-170 (1996)

The most important feature of Patent Document 1 is that the technical operation diagram in the vehicle base, that is, the operation shunting plan in the vehicle base is divided into two stages, that is, (i) determining the operation plan and (ii) determining the shunting before and after the operation order. According to such a plan making method, the shunting sequence from entry to exit for each formation is limited to "entry→detention→operation→detention→exit". While this is a useful shunting sequence in a vehicle base with a simple structure as shown in FIG. 7 of Patent Document 1, it is not always applicable to a vehicle base with a more complex structure. For example, if the job numbering line is free, it will not be placed on the indwelling numbering line. From the perspective of operation efficiency, it is hoped to take the route directly to the job numbering line immediately after entering the site. Moreover, when there are multiple formations in the vehicle base at the same time, and the field is mixed, it is necessary to stand by across multiple indwelling numbered lines while waiting for the vacant operation numbered line. And go through the indwelling numbered line not just once but multiple times before reaching the job numbered line. However, since the indwelling before operation is limited to one time in Patent Document 1, it is difficult to cope with such complicated shunting operation.

The feature of Patent Document 1 is that (i) determining the operation plan and (ii) determining the shunting order must add a specific order to the formation, and then select the formation according to the order, and then determine the operation plan shunting order. In this sequential processing method, if the decision cannot be made during the processing process, the decision content of other groupings that have just been decided before is temporarily eliminated, and the processing of the corresponding grouping is carried out first, which is the so-called retreat. For example, for 5 formations A, B, C, D, E, etc., if the operation plan is created in this order, if the operation of formation D is not scheduled, the operation plan of formation C that has been created will be temporarily canceled and exchanged. The order of group C and group D shall be carried out in the order of A, B, D, C, and E; even so, if there is still no operation arranged for group D, the operation plan of group B will also be temporarily eliminated, and the operation plan of group B will be temporarily eliminated, and the operation plan will be canceled according to A, B, D, C, and E. D, B, C, E in order. In this way, it is possible to make full use of already created parts and efficiently create plans. However, the number of times of trial and error going back according to the combination of the formation is too large, and the planning cannot be completed within a practical time. For example, according to the above-mentioned 5 groupings, in the worst case, it is necessary to perform all 5 groupings permutations and combinations, that is, 5! = 120 trials and errors, the same number of retreats must be performed. This number of times increases according to the exponential function with the increase of the number of groups. In the case of 10 groups of 2 times of this example, it is necessary to carry out 10! = 3628800 times or nearly 4 million times back.

The most important feature of Patent Document 1 is that the technical operation diagram in the vehicle base, that is, the operation shunting plan in the vehicle base is divided into two stages, that is, (i) determining the operation plan and (ii) determining the shunting before and after the operation order. However, multiple operations must be performed for one formation, and when these operations must be performed individually, the order of shunting to connect these operations must be determined. However, in Patent Document 1, since the determination operation is not included, The processing of the shunting sequence in the process, so it is difficult to plan multiple operations for one group.

In addition, using the prior art (Non-Patent Document 1), a plan can be automatically created by a computer, but since the above-mentioned adjustment and trial operation errors by the plan undertaker cannot be avoided, the plan needs to be corrected after the fact. When the plan undertaker performs revision planning, unplanned violations of conditions may occur in places different from the correction points that the undertaker pays attention to depending on the contents of the revision. Fig. 37 shows an example of revision of the on-site shunting plan by the planner. In this example, the planner decides to correct the start time of the second online display part 3710 of group 03 to be earlier than the present for some reason. If the planner moves the start time forward based on this intention, the end time of the moving part 3720 of the route associated with the online display part 3710 must be changed. As a result, since the start time and end time of the movement of the route are reversed in time, a contradiction of physical conditions related to the movement of the vehicle formation occurs. In addition to this, there will also be a road contention between the moving part 3730 of the traveling route of the 01 group. In order to eliminate the violation of these conditions, the end time of the first online display part 3740 of the 03 grouping is moved to the earlier direction of time, and if the start of the traveling route is corrected to an appropriate time, this time the traveling route moving part 3720 will be in and A road contention occurred between the moving parts 3750 of the 01 formation. In this way, since small-scale corrections by the plan undertaker sometimes cause chain violations of the conditions, it is important for the undertakers to make such corrections that the violations do not occur as much as possible, or manually correct the violations that occur bit by bit. becomes a very large load. In the on-site shunting plan, because the movement of each formation from entering to exiting the field and the physical continuity in the online repetition, it is easy to modify a certain place and also need to modify other parts of the same formation. Therefore, compared with plans in other fields, local revisions tend to affect the entire plan, and partial revisions originally intended by the plan maker will affect a wide range of the entire plan, and it is easy to fall into a situation where most of the plan has to be manually corrected to eliminate contradictions. situation.

In such a situation, even if a plan that does not violate the condition is created by instructing mitigation of the occurrence condition (constraint) violated by the plan undertaker using the prior art (Patent Document 2), due to the characteristics of the above-mentioned on-site shunting plan, There are many occasions where violations of conditions occur in a wide range that the plan undertaker did not intend. Therefore, it becomes a large burden on the plan undertaker to judge each of these and to instruct whether mitigation is possible and the content of mitigation. In addition, in the on-site shunting plan, the conditions that are violated due to partial correction are mostly the movement time between numbered lines or the switching time of points, and the contention between the traveling line and the numbered line is impossible to alleviate at the beginning. Physical constraints, therefore, make it difficult to efficiently modify or reproduce plans using existing technologies.

Contents of the invention

An object of the present invention is to provide an apparatus, method and program capable of efficiently creating an in-yard shunting plan independent of the layout structure of a vehicle base and the number of trains.

Another object of the present invention is to provide an apparatus, method, and program for reducing the burden on the undertaker when creating an in-yard shunting plan.

The most important feature of the present invention is that it is provided with a device for creating data in the form of a network (vehicle base layout network) representing the layout structure of the vehicle base, and for each formation, the specified work content (inspection, repair, Cleaning, etc.) and the numbered route between operations, the device that initializes the metadata (shunting sequence) grouped by the shunting operation diagram, selects the shunting operation diagram from the shunting sequence, and groups all the planning objects A device that performs processing to determine the execution time and then creates an on-site shunting plan that minimizes numbered routes and travel routes, and a device that uses the vehicle base layout network to change the shunting sequence to obtain numbered routes and travel routes that do not compete for lanes; use these The device (1) initializes the shunting sequence of all the formations targeted for plan creation; (2) creates an on-site shunting plan that minimizes the numbered route and the running route; (3) if the obtained plan includes the numbered route If there is a conflict on the route, the shunting sequence is changed; (4) until the plan of no conflict is obtained or the end condition is reached, the above (2) and (3) are repeated (plan making method 1).

The present invention is characterized in that (1) select a formation from the formation groups whose plan has not been made, and add it to the formation group targeted for planning; (2) fix the plan of the formation group whose plan has been made, and use the Method 1) Create an on-site shunting plan for the composition group targeted for planning creation, and (A) transfer all the formations of the composition group targeted for planning creation when a solution for lane contention that does not include numbered lines and travel lines is obtained Go to the formation group that has already made the plan, and start the implementation from the above (1) before making the plan for all the formations. (B) In the case of the obtained plan including the numbered route and the route of the route, (C ) If the grouping number of the plan making object is lower than the limit value, (3) select a grouping from the grouping groups that have already made a plan, and delete the plan of this grouping, add this grouping to the grouping group of the planning making object, and then from The above (2) starts to be implemented, (D) if the number of formations targeted for plan creation is equal to the limit value, (4) as long as the end condition is not met, the formation group of the plan creation object is canceled, and then from the above (1 ) to start implementation (plan making method 2).

The feature of the present invention is that in the device for initializing the above-mentioned shunting sequence according to the vehicle base layout network for each formation, the scheduled operation of the formation can be completely implemented, and the number of numbered lines passing between operations can be minimized under the layout structure of the vehicle base. shunting sequence.

The present invention is characterized in that after selecting a shunting operation map from the shunting sequence and performing a process of determining execution time for all formations to be planned, an in-yard shunting that minimizes numbered lines and traveling lines is created. In the planning device, an extended shunting sequence is created in which the moving elements of the route between numbered routes are added to the shunting sequence, and a mathematical model is constructed. The mathematical model uses the numbered route and the route as resources, and the The numbered lines in the extended shunting sequence of all formations move online and on the traveling line, the resources allocated to them and their execution time are taken as decision variables, the physical conditions and operating conditions of shunting in the field are taken as constraints, and the disregarded Special resources that can be used without restriction due to time competition are used as buffer resources, and the purpose function is to minimize the use of buffer resources.

The present invention is characterized by using constraint logic programming to calculate the optimal solution of the above-mentioned mathematical model.

The feature of the present invention is that, in the device for obtaining the numbered route and traveling route non-contest plan by changing the shunting sequence by using the vehicle base layout network, one or more formations are selected from the formations in which resource competition occurs, and the layout of the vehicle base Under the structure, change the partial series of the numbered lines that are associated with resource competition in the shunting sequence of this grouping.

The most important feature of the present invention is that it is equipped with a device for outputting the on-site shunting plan data to be changed to the display device in the form of an on-site operation diagram, and receiving the on-site shunting plan data output to the display device by using the input device of the person in charge of the plan. The operation result of the correction of the operation diagram, the device for correcting the data of the on-site shunting plan, the device for detecting violations of the conditions included in the on-site shunting plan, and the on-site response output to the display device by the input device of the person in charge of the plan. As a result of the setting operation of the operation diagram, display data (user intention data) indicating the location and content of correction intended by the plan manager are generated and stored in the storage device, or the device for updating the user intention data on the storage device is reflected in the A plan re-creation device that eliminates site shunting plan data that violates conditions by creating corrections included in user intention data; using these devices (1) reads the site shunting plan and displays it in the form of a site operation diagram; (2) Correction of the on-site shunting plan data based on the result of the correction operation using the input device of the plan undertaker; (3) Detect condition violations in the on-site shunt plan data and communicate to the undertaker, and proceed according to the result of confirmation by the plan undertaker In the case of manual correction, perform (2) again, and in the case of automatic re-creation, (3) generate or update user intention data according to the result of the setting operation of the input device of the person in charge of the usage plan; (4) ) Create shunting data that satisfies both the reflection of the correction content of the data indicating the user's intention and the elimination of the violation of the condition.

In addition, the present invention is characterized in that, in the device for correcting the above-mentioned in-yard shunting plan data, the correction operation performed by the plan undertaker designates the online display part of the vehicle formation on the in-yard diagram, and changes the content of the online display part. Use any one of numbered line, start time, end time, and time zone.

In addition, the present invention is characterized in that, in the device for generating or changing the above-mentioned user intention data, the setting operation performed by the planner is designation of an online display part of the vehicle formation on the field diagram, and the online display part Any of the attribute value of the attribute value, the candidate specification of the attribute value, and the relationship specification of the attribute value of other online display parts.

In addition, the present invention is characterized in that, in the device for generating or changing the above-mentioned user intention data, the designation of the time range from the plan manager is accepted, and the fixed all attributes are generated for the online display part including the entire execution time zone within the time range. Value user intention data, for the online display part that includes a part of the execution time period within the time range, generate user intention data with a fixed part of the attribute value.

In addition, the present invention is characterized in that, in the above-mentioned plan recreating device, constraint expression data expressed by a mathematical expression or a logical expression is generated by using user intention data as an input.

In addition, the present invention is characterized in that, in the above-mentioned plan recreating device, only the vehicle composition that violates the condition in the initial state is re-planned, and only when the violation condition cannot be eliminated, the plans of other formations are eliminated in stages.

According to the present invention, according to the layout structure of the vehicle base and the grouping of the plan creation object, the metadata that organizes the shunting operation diagram, that is, the shunting sequence, which is the metadata of the work content and the numbered route passing order between the jobs, is created appropriately, and then the shunting sequence is generated from the By selecting a shunting work plan in the sequence to determine the execution time, and creating an on-site shunting plan, there is an advantage that it is unnecessary to register all necessary shunting work plans in each vehicle base in advance.

According to the present invention, in the process of selecting the shunting operation diagram from the shunting sequence and determining the execution time, a mathematical model for corresponding processing of all the grouping-total of planning objects is constructed, and the corresponding mathematical model is calculated by optimal operation. Therefore, considering the integration of the overall plan, the best choice can be made from the huge combination of shunting operation diagram and implementation time, so that the possibility of being trapped in the failure to make the plan and the consequent burden on personnel can be suppressed to a minimum, while getting a fully organized plan.

According to the present invention, the plan of the formation group that has already been planned is fixed and the plans of the remaining formation groups are made. As a result, if the plan cannot be made, part of the plan of the formation group that has already been planned is cancelled, and the plan is recreated. Therefore, effective Create plans efficiently by using the partial plans that have already been obtained. In this way, the plan can be created without destroying the part of the plan that has been obtained as much as possible. Therefore, the entry time of some formations changes and the temporarily prepared plan is partially corrected. At the same time, it can be used to add formations in stages while talking with the planner. The purpose for which the plan is made.

According to the present invention, when the change operation of the plan is performed manually, the content (intent) that the plan undertaker wants to modify can be directly set on the part that the plan undertaker wants to modify on the field operation map displayed graphically using an input device such as a mouse. Satisfies its intent and automatically re-plans to eliminate violations of the conditions. If the focused part and its content are communicated to the computer through user intention data, the so-called "restoring to the computer" can be performed, so the plan manager does not need to consider the unforeseen condition violations that frequently occur during the change operation of the plan plan . Therefore, the person in charge of the plan can efficiently carry out the work of changing the plan proposal without additional burden.

According to the present invention, in the automatic re-creation process of the plan, only the group that violates the condition in the initial state is taken as the object of re-planning, and the plan of other groups is eliminated in stages only when the violation cannot be eliminated. Pre-comparison can efficiently obtain a plan with less change.

Description of drawings

Fig. 1 is a structural diagram of the functions and equipment of the shunting plan in the vehicle base of the present invention.

Fig. 2 is a processing flowchart showing the procedure of creating a shunting plan in a vehicle base using the present invention.

FIG. 3 is an example diagram of a layout structure of a vehicle base.

Fig. 4 is a diagram showing an example of numbered line definition data.

FIG. 5 is a diagram showing an example of route definition data.

FIG. 6 is an example diagram of a vehicle base layout network.

Fig. 7 is an example diagram of grouping data.

Fig. 8 is an example diagram of job definition data.

FIG. 9 is a diagram showing an example of a moving job graph between jobs.

Figure 10 is an example diagram of a shunting sequence.

FIG. 11 is a processing flowchart of initial sequence creation processing.

Fig. 12 is a diagram showing an example of an initial sequence creation example.

FIG. 13 is a processing flowchart of N-step sequence creation processing.

Fig. 14 is a processing flowchart of shunting operation map selection and time determination processing.

Figure 15 is an example diagram of an extended shunting sequence.

FIG. 16 is a diagram showing an example of creating condition data.

Fig. 17 is a diagram showing an example of course-of-course lane definition data.

Fig. 18 is a processing flowchart of the basic consideration of the shunting sequence change processing.

Fig. 19 is a diagram showing an example of execution of shunting sequence change processing.

Fig. 20 is a processing flowchart of specific steps in the shunting sequence change processing.

Fig. 21 is a processing flowchart showing the procedure for creating a shunting plan in a vehicle base using the present invention.

Fig. 22 is a flow chart of the creation process of the in-yard shunting plan of the vehicle base in the conventional device.

Fig. 23 is an example diagram of a shunting plan in a vehicle base.

FIG. 24 is an example diagram of a vehicle base layout structure.

Fig. 25 is a diagram showing an example of a shunting operation diagram of a formation.

Fig. 26 shows the function and structure of the device for creating a shunting plan in a vehicle base according to the present invention.

Fig. 27 is a processing flowchart showing the procedure for creating a shunting plan in a vehicle base using the present invention.

Fig. 28 is a diagram showing an example of the operation of changing the order of the diagrams.

FIG. 29 is an example diagram of a data structure of user intention data.

FIG. 30 is a diagram showing an example of a setting operation of the user's intention "fix instruction".

Fig. 31 is a diagram showing an example of a setting operation of the user's intention "candidate designation".

FIG. 32 is a diagram showing an example of a setting operation of the user's intention "designation of relationship".

FIG. 33 is a diagram showing an example of a setting operation of a user's intention specified according to a time range.

FIG. 34 shows a processing flow of plan recreation processing.

Fig. 35 is an example diagram of a layout structure of a vehicle base.

Fig. 36 shows a display example of an in-field operation map.

Fig. 37 shows an example of modification of the sequence of diagrams and a violation thereof.

Detailed ways

Embodiments 1 and 2, which are the best modes for carrying out the present invention, are described below.

Example 1

Embodiment 1 of the present invention will be described below using FIGS. 1 to 21 and Formulas 1 to 11. Embodiment 1 of the present invention is an embodiment in which an on-site shunting plan for all formations is prepared from a blank paper state. The so-called marshalling is a concentrated mobile (interconnected) multi-section vehicles. However, the formation can also be 1 vehicle.

Fig. 1 is a configuration diagram of a shunting plan creation device in a vehicle base. The shunting plan making device in the vehicle base is a computer system, which is composed of a processing device 0110 , a storage device 0120 connected to the processing device 0110 , an input device 0130 , a display device 0140 and an output device 0150 . The processing device 0110 is connected to the network 0160 . The storage device 0120 stores the composition data 0121 storing the composition information which is the object of creating the on-site shunting plan, the numbered route definition data 0122 which stores the numbered route information in the vehicle base yard, and stores the travel routes in the same vehicle base yard Route definition data 0123 for information, route conflict definition data 0124 for defining the conflict relationship between travel routes, operation definition data 0125 for defining operation information to be implemented on the formation, and various creations of shunting plans in the storage yard Condition data 0126 for creating conditions and shunting plan data 0127 for storing some to all shunting in the yard.

The input device 0130 is a device for the planner to operate the shunting plan creation device in the vehicle base, the display device 0140 is a device for displaying the result of the plan creation, and the output device 0150 is a device for printing the plan creation result in the form of a ticket. vehicle base layout network creating means 0111 for configuring vehicle base layout information as data in the form of a network; shunting sequence initialization means 0112 for initializing a shunting sequence by collecting a set of promising shunting operation map candidates for each formation; The shunting operation map selection and time determination device 0113, which selects the operation map and determines the shunting time according to the shunting sequence and creates an executable on-site shunting plan, changes the dispatching in order to correct the inadequacy of the obtained plan The shunting sequence changer 0114 of the train sequence is stored in the memory of the processing device 0110 as a program, and is executed by the processing device 0110 . The work area 0115 is an area on the memory used as a work area for program execution. The above-mentioned program can be stored in the storage device 0120, and then read into the processing device 0110 through the starting device of the storage device, or stored in the storage device of other computers or an independent storage device, and then transmitted to the processing device 0110 through the network 0160. implement.

FIG. 2 is an overall processing flowchart showing the outline of the processing of the vehicle yard in-yard shunting plan creation device in this embodiment, and each step of this flowchart will be described in detail below. For a concrete description, the vehicle base shown in FIG. 3 is assumed to be described below. However, the present invention does not presuppose a specific vehicle base, and is applicable to various vehicle bases having different layouts. The vehicle base shown in Figure 3 is a hypothetical vehicle base, but it can also be a combination of movement between numbered lines across multiple fork roads and parallel transfer or entry and exit according to this combination, so this includes the actual vehicle base. The complexity of the layout as a feature.

Return to FIG. 2 to continue the description. First, in step 0210, use the vehicle base layout network creation device 0111 in FIG. 1 to construct the layout of the vehicle base yard into data in the form of a network, and store it in the working area inside the processing device. The input data in this process are the three data of numbered route definition data 0122 and travel route definition data 0123 in FIG. 1 .

FIG. 4 is a diagram showing an example of numbered line definition data 0122. The numbered line definition data is data in a table format having the definition content for one numbered line existing in the vehicle base as one row. Each line is composed of a numbered line name, its use, and a flag indicating whether it is passable, and the numbered line definition data in FIG. 4 includes definitions of all numbered lines in the vehicle base in FIG. 3 . In the part of step 0220 (shunting sequence initialization), the meaning of "via" is explained.

FIG. 5 is an example diagram of the traveling route definition data 0123. The traveling route definition data is data in the form of a matrix with numbered routes and traveling routes in the vehicle base yard as the vertical axis and the horizontal axis. One row of the matrix is the definition content of one travel route, and one value among three values of 0, 1, and 2 is stored in each column of the same row. In order to simplify the drawing, in Figure 5, the blank cells are 0, and no 0 is included. These values mean a connection relationship in terms of in-field layout to a combination of a route of travel and a numbered route specified in rows and columns. For example, if the value of row x and column y is 0, it means that there is no connection between the route x and the numbered route y; if it is 1, it means that the numbered route y is the departure point (that is, the starting position) of the route x; , it means that the numbered line y is the arrival point (ie, the end position) of the traveling line x. The route definition data example in Fig. 5 includes the definition of all routes in the vehicle base in Fig. 3, and in terms of the route layout structure of the vehicle base, even if there is a route, the definition does not actually include the relationship between signal equipment When the travel route cannot be set. Also, for a combination of mutually movable numbered routes, each route defines a total of 2 travel routes in each direction of movement, but in the case of only one-way movement, the defined travel route is 1.

Returning to FIG. 2 to continue the description, the layout network in the vehicle base is a network G(N, E) formed by taking the data of the numbered route and the traveling route as input. Here, N is a set of network nodes, and each node corresponds to a numbered line included in the numbered line definition data. E is a collection of directional turnouts connecting nodes, each turnout corresponds to the travel route included in the travel route definition data, and connects the numbered line corresponding to the departure point and the numbered line corresponding to the arrival point in the direction from the departure point to the arrival point . FIG. 6 is an example of a layout network in a vehicle base, which is created based on the numbered route definition data in FIG. 4 and the travel route definition data in FIG. 5 . This network corresponds to the layout structure of the vehicle base in FIG. 3 . With this layout network, numbered lines and travel lines that can be connected to a specific numbered line can be listed without omission, and used in each process of initialization and change of the shunting sequence described later.

Return to FIG. 2 to continue the description. After the layout network in the vehicle base is created, go to step 0220 to initialize the shunting sequence. The data used in this process are the vehicle base layout network created in the previous step 0210 , the formation data 0120 and the work definition data 0125 in FIG. 1 . Hereinafter, before describing the processing content of the shunting sequence initialization step 0220, the formation data and job definition data as input data will be described. Fig. 7 is an example diagram of the formation data. The formation data is data in the form of a table that stores information on the formations that are the subject of on-site shunting. Each row corresponds to one formation. The "entry time" of the vehicle base, the "exit time" of the departure from the vehicle base, and the "work content" performed between entry and exit, the information set in the "work content" is defined by the work in Figure 1 Data 0125 to specify. 8 is an example diagram of job definition data. The job definition data is data in the form of a table in which each row corresponds to the information of one job. The "job name" that identifies the job and the "required time" that means the shortest time necessary to implement the job ", store the " implementable numbering line " of the numbering line that can implement corresponding operation and form. FIG. 8 shows the definition of work in the vehicle base of FIG. 3 , and two kinds of work are defined. The time required for one of the jobs, Job A, is 60 minutes, and the numbered routes that can be implemented are "Job A No. 1 Route" and "Job A No. 2 Route"; the required time for the other job, Job B, is 90 minutes , the numbered routes that can be implemented are "Job B No. 1 Route" and "Job B No. 2 Route".

Return to FIG. 2 to continue the description. The initialized shunting sequence in step 0220 is metadata representing a collection of shunting work patterns acquired by the composition. In order to leave the marshalling on the numbered line where the scheduled work can be carried out, it is necessary to carry out the shunting of the marshalling, that is, the movement between the numbered lines, so it is natural to make decisions centered on "when" and "where" to carry out the work. Grouped shunting plan, but the numbered lines that can implement certain operations are generally concentrated in a specific place in the vehicle base (for example, the respective possible numbered lines of operation A and operation B in the vehicle base in Figure 3), Therefore, considering the shunting operation diagram, the same type of operation numbering lines can be summarized as one for processing.

The method of moving from a job numbered route (group) to another job numbered route (group) can accept the constraints of the layout of the vehicle base, but, as shown in FIG. Types of mobile work diagrams that divide work numbered routes through other numbered routes several times. FIG. 9 shows various movement work diagrams when moving from a numbered route group where work A can be performed to a numbered route group where work B can be performed within the vehicle base in FIG. 3 . Among the movement work diagrams, the movement work diagram whose numbered route passes the least number of times is a work diagram that moves directly from the numbered route of work A to the numbered route of work B with the number of passes 0. Considering the time and manpower required for the movement, it is desirable to pass as few numbered lines as possible between the numbered work lines. Therefore, in the case of FIG. 9 , the ideal movement is zero. However, because there are multiple vehicles in the vehicle base field at the same time, it is impossible for all vehicles to move ideally. This is because the available numbered routes and travel routes are limited, so a detour must be taken to move to the job numbered route, and unnecessary movement must be performed for waiting on the reserved route until the job numbered route can be vacated.

As described above, the shunting sequence is a type of meta-work diagram (metadata) in which a plurality of shunting work diagrams are grouped based on the content of the grouped work and the movement content between the work-numbered lines. A shunting sequence is assigned to all the formations targeted for preparation of the plan, and FIG. 10 is an example diagram of the shunting sequence. The shunting sequence is data in the form of a list, and each element of the list consists of an action of "entry", "exit", "operation", "(numbered line) via" and the possible actions necessary to implement each action. A collection of numbered lines used constitutes, and these actions are referred to as "processing" hereinafter. Because the incoming and outgoing processing can be treated together with the numbered lines that can be used in the same way as the operation, they can be regarded as a type of operation processing. Therefore, in the following description, unless otherwise specified, "job processing" includes entry processing and exit processing. In the shunting sequence, a part comprised of a series of passing processes intermingled with work processing will be called a passing sequence in particular below.

The shunting sequence simultaneously embodies various shunting operation diagrams representing a series of moving contents from the formation entering the vehicle base to receiving the necessary operations and leaving the vehicle base. By selecting a numbered route, the shunting sequence included Each processing does not contradict the layout, and thus a specific shunting operation diagram can be obtained. For example, in the example of the shunting sequence in FIG. → "upward transfer" selects the numbered line, and just obtains a shunting operation diagram that can be physically performed in the vehicle base of Fig. 3 . The so-called "not inconsistent with the layout" means that there must be a traveling route between the selected numbered route and the numbered routes before and after it. Using the vehicle base layout network created in step 0210 of FIG. 2 can easily determine whether or not there is a route.

Return to FIG. 2 to continue the description. In the shunting sequence initialization step 0210, assuming an ideal situation where each formation performs shunting operations with the highest efficiency, use the shunting sequence initialization device 0112 in FIG. is the shortest shunting sequence of the program. FIG. 11 is a processing flowchart showing an overview of shunting sequence initialization processing. First, at step 1110, a shunting sequence is created that completely executes scheduled operations (including entry and exit) regardless of the route between operations. Here, the so-called "disregarding the passage between jobs" means that in the layout constraints of the vehicle base, even if the passage of the numbered route is necessary for the movement between jobs, it is ignored and a continuous sequence of job processing is created. Let the created sequence be X. Then, in step 1320, for the adjacent (job) processing pairs included in X, the process of creating the shortest path sequence connecting them is repeated for all the pairs while satisfying layout constraints. Here, if possible, the shortest passage sequence is taken as a sequence whose number of passes is 0 (job graphs that move directly between job number lines). In this way, the creation of the initial sequence for one group is completed. The shunting sequence initialization device 0112 in FIG. 1 performs this process on all the formations included in the formation data.

Fig. 12 is an execution example of shunting sequence initialization processing. The grouped operation content is "operation A, operation B". Step 1110 of the sequence initialization process). And all the numbered lines that can be used in the numbered line set of each process are set without omission; after that, the processes that are adjacent in sequence, that is, for "entry" and "operation A", the shortest sequence of routes connecting them is created. . At this time, from the layout of the vehicle base in Figure 3, it can be known that the number of passes is 0, that is, the sequence of direct movement is the shortest. Therefore, no addition is made to the sequence; , the shortest sequence is also the sequence with the number of passes 0; finally, it can be seen from the configuration that for "job B" and "exit", you cannot directly move between them, and you must pass through the number defined in the numbered line definition data 0122 in Figure 1 once. One of the 3 indwelling numbered lines that are "passable". Therefore, the shortest sequence of passages is the sequence of the number of passes 1, and this sequence is inserted between "job B" and "exit". The sequence obtained by the above processing (the bottom row in FIG. 12 ) becomes the initial sequence.

Create the shortest route sequence that connects job processes by using the process of creating a sequence between job processes with the specified number of steps, that is, starting from 0 and passing through the number of steps N until the sequence is successfully created As N is increased, the creation of the sequence is repeated. FIG. 13 is a processing flow chart showing the outline of the sequence creation process of N steps. First, in step 1310, it is determined whether the number of steps is 0. If the determination result N is 0, the process proceeds to step 1320, and it is determined whether the preceding operation ( Let it be A) move to the subsequent operation (let it be B), that is, determine whether there is at least one traveling route from the numbered route that can be used by A to the numbered route that can be used by B. In this determination, a layout network of vehicle bases is used. If the result of the determination is that the connection is possible, all processing is terminated as a successful creation of the route sequence; on the other hand, when the connection is not possible, all processing is terminated as a failure in the creation of the route sequence. When step 1310 determines that N is not 0, proceed to step 1330, use the layout network of the vehicle base to list all the numbered lines that can be connected to the preceding operation A and "passable" and store them as Available numbered lines for "via process 1" at the beginning of the via sequence. However, if the result of this processing is that there is no numbered line that can be connected, the sequence creation fails, and all processing is immediately terminated. If the numbered line list is successful, go to step 1340. In this step, the variable k is changed from 1 to N-1 one by one, and at the same time, the numbered lines that can be connected to the process k and "can be passed through" are listed without omission. Listed and stored as processed k+1. However, in this process, if even one of the numbered lines that can be connected cannot be listed, it is considered that the sequence creation has failed, and all the processes are terminated immediately. If the above steps are successful, proceed to step 1350, and cut off all the numbered lines that cannot be connected to the subsequent operation B from the candidate lines through the process N, that is, any of the numbered lines that can be used for the subsequent operation B does not have a travel route. . However, as a result of this processing, if there is no usable numbered line via processing N, it is regarded as a sequence creation failure, and all processing is immediately terminated. In the case that the above-mentioned steps are successful, proceed to step 1360, at this step, the variable k is changed from N to -1 successively to 2, and all the usable numbered lines that cannot be connected to via process k are cut off from the available numbered lines via process k-1. Numbered lines. However, in this process, if there is no numbered line that can be used via the process, it is regarded as a sequence creation failure, and all processes are immediately terminated. When this step is successful, it is regarded as the completion of sequence creation, and all processing ends. The resulting sequence is a sequence of N steps connecting jobs.

Return to FIG. 2 to continue the description. After the shunting sequence is initialized, in step 0230, the shunting operation map selection and time determination processing are performed. Select an actual shunting operation map from the shunting sequence of each formation, and at the same time specifically determine the implementation time of shunting, that is, the start/end time of movement and the online time of the numbered line, so as to obtain the on-site shunting plan. This processing is performed by the shunting work map selection and time determination device 0113 in FIG. 1 .

FIG. 14 is a processing flowchart showing an overview of shunting work map selection and time determination processing. Firstly, in step 1410, a mathematical planning model for shunting operation map selection and time determination problems is constructed. The outline of this mathematical planning model will be described below. Generally, a mathematical planning model is composed of numerical representations of (1) planning objects (determinant variables), (2) conditions to be complied with (constraints), and (3) planning evaluation scales (objective functions). Here, the decision variables are first defined. A numbered route is selected from the available numbered routes for each process of the shunting sequence, thereby determining a shunting operation diagram. Therefore, the numbered line used by each process in the shunting sequence is a determining variable. In addition, the start/end time of the movement and the online time of the numbered line are determined only by determining the start and end time of each process of the shunting sequence, so these are also decision variables. In addition, although not publicly indicated in the shunting sequence, the travel route used for movement between numbered routes is also a determining variable.

In order to deal with these decision variables in a unified manner, in step 1410, as a preprocessing for constructing the mathematical planning model, an "extended shunting sequence" of the extended shunting sequence is created and stored in the work area by considering the moving elements between the numbered lines. What Fig. 15 shows is the extended shunting sequence to the shunting sequence shown in Fig. 10, and the extended shunting sequence is a shunting sequence in which a process meaning "moving" is added between all processes of the shunting sequence. In each movement process, the travel lines connecting the preceding and following numbered lines are stored without omission, and such an extended shunting sequence is uniquely determined for the shunting sequence. The creation of such an extended shunting sequence can be easily realized by adding movement processing from the beginning of the shunting sequence and setting the travel routes between the connection numbered routes without omission using the vehicle base layout network. The extended shunting sequence is a sequence that also includes the travel route on the way to define in detail the movement of the marshalling from entering to exiting the field. It can be said that it is all data that includes the work content of the marshalling. Therefore, it is also called "operation (work)" hereinafter. )". In addition, below, the processing which means "moving" included in the extended shunting sequence is called "moving processing", and the other processing is called "online processing".

If the extended shunting sequence (job) is used, the decision variables of the shunting operation map selection and time determination problem can be defined as the used numbered routes and travel routes of all processes (including moving processes) and the start/end times of these processes. Since the start/end time of mobile processing is obviously consistent with the start/end time of online processing before and after it, it is not necessarily necessary to use it as a decision variable, but the mathematical planning model is simplified by treating online processing and mobile processing without distinction, So it is considered as the decision variable in this embodiment. Hereinafter, the "numbered route" and the "travel route" are collectively referred to as "resources".

Then, define the constraints of shunting operation diagram selection and time determination problem. First, describe the conditions that the on-site shunting plan should meet according to the chapters, as follows:

(1) There is no time competition among numbered routes and travel routes used by each process.

(2) Obey the connection of numbered routes and the layout of travel routes.

(3) Satisfying various creation conditions such as the failure time of the traveling line or the continuation time interval of the numbered line.

(4) Execute the scheduled work without omission.

(5) Comply with the entry time and exit time.

(1) to (3) are the necessary conditions for physically implementing on-site shunting, and (4) and (5) are the conditions that must be met from the perspective of the operation of the vehicle base business. In order to describe these conditions mathematically, various symbols are defined below as a preparation. The appended "^" after the symbol indicates that the subsequent symbol is an upper-fix word, and "_" indicates that the subsequent symbol is a lower-fix word.

(1) collection

J: set of jobs {1,...,n}

O: the set {1,...,m} to process

M: set of resources (= travel route, numbered route) {1,...,1}

O_j: set of processes belonging to job j {j=1,...,n}

Let the number of elements |O_j|=m_j. O_j is a partial set of O, consisting of consecutive elements from (N_j-1)+1 to N_j in O. Here, N_0=0, N_j=Σm_k (k: 1 to j); it is assumed that the elements in O_j are executed in order of smaller numbers.

M_i: set of resources that can be allocated to process i (i=1,...,m)

0^R, 0^T: collection of mobile processing (R) and online processing (T)

M^R, M^T: the collection of travel routes (R) and numbered routes (T)

M^src_k, M^dst_k: Set the element k (numbered route) of M^T as the travel route of the departure numbered route (arrival numbered route)

(2) constant

M_0 (or use 0 alone): Special resources (buffer resources) that do not consider contention

r_j, d_j: start time (r_j) and end time (d_j) of job j (j=1,...,n)

p_i: Minimum processing time for processing i (i=1,...,m)

δ_ij: Road-fighting sign on the traveling route

-1: The traveling line i and the traveling line j are faulty (i, j are both elements of M^R)

-0: other than the above

※According to the definition of buffer resources, δ_0i and δ_i0 are 0

u: fault time of traveling line

q: the continuation time interval of the numbered line

(3) Determining variables

s_i: start time of processing i

e_i: the termination time of processing i

z_i: handle the allocated resources of i

(4) Cost function

C_ik: the cost of allocating resource k to process i

-1: when k=0 (dummy resource)

-0: other than the above

(5) Logical expression

AB: A and B

A‖B: A or B

Or{A_k}(k=1,...,n): A_1‖A_2‖...‖A_n

Here, the buffer resource M_0 is a resource specially imported for the mathematical modeling of this problem. Because this problem is to select the shunting operation map and determine the time under a specific shunting sequence, no matter how the shunting sequence is selected and sorted, the numbered route or the traveling route cannot be avoided. Using ordinary modeling will lead to the so-called "unsolvable" situation. However, in the case of unavoidable lane contention of the numbered route/travel route, as explained below, in order to obtain the shunting sequence as the premise of changing, it is necessary to grasp the position of the lane conflict even without obtaining an executable solution. "Where" and "How" happened, and use it as clues to change the shunting sequence. Therefore, buffer resources that can be used without limitation regardless of lane contention or layout constraints are introduced, and when resource competition is unavoidable, buffer resources are allocated to processing to temporarily create a solution that satisfies the constraints, and then use the result with For changes in the shunting sequence.

Parameters for creating a plan, such as the failure time of the traveling line (u) or the continuation time interval (q) of the numbered line, use the values defined in the creation condition data 0126 of FIG. 1 . FIG. 16 is an example diagram of the plan creation condition data. The creation condition is data in the form of a table including at least four items of "travel line failure time", "numbered line continuation time interval", "minimum online time", and "travel line movement time".

The value of the route contention flag (δ_ij) is set according to the route contention definition data 0124 in FIG. 1 , and FIG. 17 is an example diagram of the route contention definition data. The route definition data for the route is data in the form of a matrix with all the routes in the vehicle base yard as the vertical axis and the horizontal axis. Here, the so-called course contention means that the two courses cannot be set at the same time due to a part of the course shared by the two courses or for reasons of security. In the data example of FIG. 17 , if the combination of travel routes specified by the row and column competes for a lane, a value of 1 is stored; if there is no competition, a value of 0 is stored. This example shows a part of the course race in the vehicle base in FIG. 3 .

Under the definition of the symbols above, the constraints of the shunting operation map selection and time determination problem are described as follows.

z _i ＝z _i′ && z _i ≠0s _i ≥e _i′ +q‖s _i′ ≥e _i +q i, i′∈O ^T ; i′＞i 【Formula 1】

Equation 1 means that when the same numbered line other than the buffer is allocated to two online processes i, i', the execution time periods do not overlap, and an interval of more than the continuation time interval (q) is left between the two processes .

【Formula 2】

Equation 2 means that in the case of allocating resources to contend for lanes to two mobile processes i, i′, the execution time slots do not overlap, and an interval equal to or greater than the failure time (u) is vacated between the two processes.

【Formula 3】

Equation 3 indicates which of the numbered lines assigned to i is assigned to the next movement process i+1 of the online process i within the same job as the travel line from which the numbered line is issued. That is, it means that consecutive online and moving numbered lines and traveling lines must be connected.

【Formula 4】

Equation 4 indicates which of the numbered lines assigned to i is assigned as the travel line of the outgoing numbered line to the previous movement process i-1 of the online process i within the same job (the opposite of the expression 3).

·s _i =r _j i=N _j-1 +1; j∈J

【Formula 5】

Expression 5 means that the start time of the processing at the head of each job coincides with the start time of the job.

·s _i = e _i-1 i≠N _j-1 +I; j∈J

【Formula 6】

Expression 6 means that the start time of processing other than the head of each job coincides with the end time of the previous processing. That is, each process must be performed without interruption in time.

·e _i =d _j i=N _j ;j∈J

【Formula 7】

Equation 7 means that the end time of the last process of each job coincides with the end time of the job.

· e _i ≥ s _i +p _i i∈O ^T [Formula 8]

Equation 8 means that the termination time of online processing must be above (start time + minimum processing time).

e _i ＝s _i +p _i i∈O ^R 【Formula 9】

Equation 9 means that the end time of the movement process must be consistent with (start time + minimum processing time).

·s _i ＞0, e _i ＞0, z _i ∈ M _i i∈O

【Formula 10】

Equation 10 is a condition for determining the acquired value of the variable.

These mathematical constraints contain all the constraints described in the previous chapters, and are more rigorously defined. In the case of job processing, the minimum processing time of processing i sets the required time of the job, other online processing sets the minimum online time defined by the creation conditions, and the movement processing sets the travel route specified by the same creation conditions mobile time.

The objective function of the mathematical model is as follows.

$<span\; class="notranslate">\; \&Center\; Dot;</span>\mathrm{<span\; class="notranslate">\; min</span>}\underset{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; m</span>}}{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}}{\mathrm{<span\; class="notranslate">\; C</span>}}_{{\mathrm{<span\; class="notranslate">\; iz</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}}$

【Formula 11】

By minimizing this objective function, a solution that does not use buffer resources as much as possible can be obtained. That is, in this way, the selection of the shunting operation map and the determination of the time can be performed, and resource competition does not occur as much as possible under the given shunting sequence. If a solution that does not use buffer resources at all can be obtained, this becomes an executable solution for the on-site shunting plan.

The above is the outline of the mathematical model. In step 1410 of FIG. 14 , after creating an extended shunting sequence (job) for the shunting sequence of each formation, a mathematical model composed of the above-mentioned decision variables, constraints, and objective functions is constructed. The model constructed here is a problem of associating the execution sequence (time) of each processing and the resources used with other jobs for a job composed of multiple processing, which can be understood as a kind of flexibility in the field of production scheduling Job shop problem or parallel machine scheduling problem.

Then in step 1420, the solution of the model is made with the optimal operation. Although various methods are considered for the method of the optimal operation, because the mathematical model is a special form that includes logical constraints (, ‖, etc.), Therefore, it is difficult to use a general method in the field of mathematical programming, such as a search method combining LP relaxation and branch-and-limit method based on a linear model, or an extended form of the branch-and-cut method. Therefore, in the present invention, constraint logic programming is used to solve the mathematical model. Constraint logic programming is a method for solving problems with sufficient constraints. Its specialty is (1) that it has the "constraint" that narrows the search area by transferring the change of the obtained value (domain) of the decision variable to other variables through the associated constraint. (2) It can correspond to the solution of models containing a wide range of constraints such as logical constraints, symbolic constraints, or nonlinear constraints. Like linear programming (LP), constraint logic programming has widely circulated general-purpose libraries, and the mathematical model of this problem is a general form that can handle these libraries. Therefore, in the optimal calculation process in step 1420, the execution mechanism of the constraint logic can be independently installed, or the general program library can be called to solve the problem.

The above description of the shunting work map selection and timing determination device in FIG. 14 is completed, and the description will be continued by returning to FIG. 2 . In step 0240, it is judged whether the solution obtained by demodulating the problem of car operation map selection and time determination is an executable on-site shunting plan. Specifically, check whether the obtained solution is a solution using buffer resources. In the case of a buffer resource, it is judged to be unexecutable due to resource competition.

If the result of the determination is that it cannot be executed, go to step 0260 to determine whether the stop condition of the program loop is satisfied. In this embodiment, it is assumed that the stop condition is that the number of cycles exceeds the set value, but other methods such as setting a stop condition based on the change content of the shunting sequence may also be used. When the determination result satisfies the stop condition, all processing is stopped as the plan cannot be created.

If the stopping condition is not met, proceed to step 0270, and use the shunting sequence changing device 0114 of FIG. 1 to apply changes to the current shunting sequence. Fig. 18 is a processing flowchart showing an outline of processing by the shunting sequence changing device. First, at step 1810, an analysis of the resulting solution is performed to investigate "where" and "how" resource contention occurs. Then, at step 1820, one or more formations are selected according to the analysis results, and the shunting sequences of these formations are changed so as not to cause resource competition. Specifically, various adjustments such as setting of a detour route and shortening of the route are performed on the part of the numbered route for connecting job processes, that is, the route sequence.

Fig. 19 is an example diagram of changing the shunting sequence and creating a shunting plan accordingly. This example is an example of changing the shunting sequence for composition 02, the upper part of the figure corresponds to before the sequence change, and the lower part of the figure corresponds to the after sequence change. The shunting sequence of formation 02 before the change is "Arrival" → "Operation A" → "Exit", but as the numbered line for operation A, no matter whether "operation A1" or "operation A2" is selected, it is consistent with other formations ( 01, 03) A dispute occurred. Therefore, instead of carrying out operation A immediately after entering the field, it waits on other numbered lines to wait for the vacancy of the operation numbered line. Inserting the sequence of such meaning (detention → traction) before the operation processing can eliminate resource competition .

As in the above-mentioned example, as long as resource competition can be eliminated, methods such as solution analysis and sequence modification in the flowchart of FIG. 19 may be used. Fig. 20 is the processing flowchart of its example, at first, in step 2010, from the shunting plan that obtains as the result of shunting operation map selection and time determination, the processing that is allocated to buffer resources is listed (assuming that the set is X); in step 2020, select the earliest processing from X (assuming that the processing is A); in step 2030, the processing that may compete with A for resources is being used in the time period overlapping with A The processing of resources that can be assigned to A is listed in a table (assuming that the set is Y); then in step 2040, select a processing (as B) from A and Y, and change the shunting that contains this processing in subsequent steps Sequence; in step 2050, determine the type of B, if B is the operation process, proceed to step 2060, take out the via series between B and the previous operation of B in the shunting sequence comprising B (assuming that the via sequence is α); if B is other processing, proceed to step 2070, take out the via sequence that contains B (assuming that the via sequence is α); in the case of B being mobile processing, determine where to include on the extended shunting sequence B. Take out the via sequence corresponding to this part. No matter what the judgment result is, then proceed to step 2080, take the variable k as 1, create a sequence of passages whose number of passages is only k steps more than α (set the passage sequence as β), and increase in sequence until the creation is successful k Repeat for processing. The process used for the initialization of the shunting sequence (FIG. 13) can be used in creating the k-step transit sequence. Finally, in step 2090, insert β into the corresponding position of the shunting sequence to replace α, and then end the whole process.

The above-mentioned process focuses on the process of allocating buffer resources, that is, the process that competes with other processes for resources, and after selecting one process from the process and the process that competes with the process, the shunting sequence including the process is changed. If the selected processing is a job, the minimum unit is extended to the previous sequence, which means waiting on another numbered line or taking a detour before the job; on the other hand, if the selected processing is another processing , to extend the minimum unit of the sequence including the processing, and its intention is also to avoid resource competition by taking a detour. The reason for taking the extension of the transit sequence as the minimum unit is to minimize the movement between numbered lines from the perspective of shunting operation efficiency. If the transit sequence is too long, there will be more resource competition or the possibility of non-compliance with the exit time.

The above is the end of the description of the means for changing the shunting sequence, and the description will be continued by returning to FIG. 2 . If the result of the execution possibility judgment in step 0240 is executable, the process proceeds to step 0250, and the obtained result is output to the display device 0140 in FIG. 1, and the entire process is terminated as completion of planning.

The above ends the description of Embodiment 1. In this way, according to the layout structure of the vehicle base and the grouping of the plan making objects, the metadata that organizes the shunting work diagrams into groups according to the work content and the sequence of the numbered routes between jobs is appropriately created, that is, the scheduling. Then select the shunting operation diagram from the shunting sequence and determine the execution time to create the on-site shunting plan, so there is no need to register all the necessary shunting operation diagrams in each vehicle base in advance Effect.

In the process of selecting the shunting operation diagram from the shunting sequence and determining the execution time, a mathematical model for corresponding processing of all the grouping and total planning objects is constructed, and the solution of the mathematical model is calculated by optimal calculation, so , can consider the integration of the overall plan to make the best selection from the huge combination of shunting operation diagram and implementation time, and can minimize the possibility of not making the plan and the resulting manpower burden to a minimum, so as to obtain the entire organization plan of.

Next, the user interface portion will be described using FIGS. 26 to 36 .

Fig. 26 is a diagram showing the configuration of a shunting plan creation device in a vehicle base. Corresponding to the device for making shunting plans in the vehicle base in Figure 1. However, FIG. 26 is described centering on the user interface part.

The shunting plan creation device in the vehicle base is a computer, and is composed of a processing device 2610 , a storage device 2620 connected to the processing device 2610 , an input device 2630 , a display device 2640 , and an output device 2650 . In addition, the processing device 2610 is connected to the network 2660 . The storage device 2620 is composed of the user who stores the shunting plan data 2621 of the on-site shunting plan that is the target of the plan correction using the vehicle base in-yard shunting plan creation device of the present invention, and stores information about the plan maker's plan revision intention. The intention data 2622 and the basic data 2623 which store various input signals which are the prerequisites of the on-site shunting plan are constituted. As the basic data, at least information about the time of entry and exit of the formations to be planned or information about the content of operations, information about the layout of numbered routes or travel routes in the vehicle base yard, information about the output of cleaning or inspection, etc. Various parameters such as numbered lines of work, information on required time, travel time between numbered lines, cross-failure time, etc. are used, but are not limited thereto.

The input device 2630 is a device used by the plan creator to operate the vehicle yard shunting plan creation device, and is equipped with at least pointing devices such as a keyboard and a mouse. The display device 2640 is a device for presenting the result of planning creation. The output device 2650 is a device for printing the result of planning creation in the form of a slip. In the memory of the processing device 2610, an on-site operation diagram display device 2611 for displaying the on-site shunting plan in the form of an operation diagram, and a condition violation detection device for detecting violations of various conditions of the on-site shunting plan in the correction operation 2612. Receive the request from the plan undertaker to change the specific schedule order of the schedule in the site. 2613. The user intention setting device to generate/store the intention information of plan revision according to the input operation of the plan undertaker. 2614 . The recreating device 2615 that receives instructions from the plan maker and recreates the plan stores it as a program, and executes it by the processing device 2610 . The work area 2616 is an area on the memory used as a work area for executing programs. The above-mentioned program can be stored in the storage device 2620, and then read into the processing device 2610 through the startup device of the storage device, or stored in the storage device of other computers or an independent storage device, and then transmitted to the processing device 2610 through the network 2660 for execution. .

Fig. 27 is an overall processing flowchart showing the outline of processing by the vehicle base in-yard shunting plan creation device in this embodiment. Each step of the process is described in detail below. In order to make the description concrete, the vehicle base shown in FIG. 35 will be described below as the creation object.

Return to FIG. 27 to continue the description. First, in step 2710, the shunting plan data 2620 shown in FIG. Fig. 36 is a display example of an in-field operation map. On the plane where the numbered lines in the vehicle base are taken as the vertical axis and the time is taken as the horizontal axis, the in-field operation diagram is a line showing the movement in the vehicle base and the repetition of lines for each formation record (called the sequence of the operation diagram) diagram. In a run diagram sequence, diagonal lines 3610 indicate movement between numbered lines, and horizontal lines 3620 indicate lines within a particular numbered line. When online, the length of the horizontal line indicates the online time. The example in Fig. 36 is an in-field operation diagram of 3 groups. The beginning of the diagram sequence is the entry time of the formation, and the end is the exit time of the formation. However, when the formation is completed before the planned implementation date, the left end of the sequence of the operation diagram coincides with the start time of the plan creation. Similarly, when the group enters the field after the plan implementation date, the right end of the sequence of the diagram coincides with the end time of the plan creation.

Return to FIG. 27 to continue the description. In step 2720, the on-site operation diagram output to the display device is corrected by the plan undertaker through the input device 2630 in FIG. Correction processing of data. The correction operations accepted by the diagram sequence changing device include at least four types: "numbered route change", "start time change", "end time change", and "time zone change". These correction operations are operations on the online display part (horizontal line) of any operation diagram sequence, "numbered line change" refers to the change of the numbered line used online, "start time change" refers to the change of the online start time, "end time "Change" refers to the change of the online termination time, and "time slot change" refers to the change of the online implementation time slot. FIG. 28 shows an example of how to perform these four correction operations using a mouse. When changing the numbered line, place the mouse pointer 2810 in the center of the line display part to be changed, press the left button 2821 of the mouse 2810 and move the mouse up and down. As a result, the on-site operation map display device 2611 detects the moving distance of the mouse pointer, and moves the display on the online display part to the numbered line corresponding to the position of the distance. By releasing the left button of the mouse when moving to the target numbered line, the numbered line where the online display part is located at this moment is taken as the latest information, and the operation diagram sequence changing device 2613 updates the shunting plan data in the work area. The same applies to other correction operations. To start changing the time, put the mouse pointer on the left end of the online display part, press the left button of the mouse and move the mouse left and right at the same time. Thus, since the start portion of the online display portion moves left and right along the time axis according to the moving distance, the operation is terminated by releasing the left button of the mouse at the desired time point. To terminate the time change, put the mouse pointer on the right end of the online display part, press the left button of the mouse and move the mouse left and right. Thus, since the end portion of the online display portion moves left and right along the time axis according to the moving distance, the operation is terminated by releasing the left button of the mouse at the time point located at the target time. To change the time zone, place the mouse pointer in the center of the online display part, and move the mouse left and right simultaneously by pressing both the left and right keys of the mouse to distinguish it from the numbered line. As a result, since the entire online display portion moves left and right according to the moving distance, the operation is terminated by releasing the left and right keys of the mouse at the target position.

Return to FIG. 27 to continue the description. In step 2720, an instruction from a project manager who presses a button on the display screen is received. In step 2730, use the condition violation detection device 2613 in FIG. 26 to detect the violation of the condition on the corrected shunting plan data stored in the work area. The conditions to be detected include the following five conditions.

(1) There is no time competition among numbered routes and travel routes used by each formation.

(2) Obey the connection of numbered routes and the layout of travel routes.

(3) Satisfy the physical parameters such as the failure time of the traveling line or the continuous time interval of the numbered line.

(4) Execute the scheduled work without omission.

(5) Comply with the entry time and exit time.

These are the basic conditions that should be satisfied at the minimum in order to comply with the physical constraints and implement the work determined in advance in the time frame from the time when the formation enters the vehicle base to the time when it leaves the field. In addition to the above, various conditions regarding the operation method of on-site work such as limiting the execution time zone of the work or carrying out the work in a specific order are considered. Therefore, the conditions that should be checked are added to the above-mentioned basic conditions, and the items necessary for setting the operating characteristics of each vehicle base are added. The condition violation detection means 2612 checks whether each set condition is violated, and if there is a violation, it notifies the plan manager of the fact through the display means. The output state of the display device is not particularly specified, but the violating part and the content of the violating part are clearly communicated visually to the person in charge by changing the display color of the violating part to an accent color such as red, and using a pop-up window to output the violating part and the violating content in symbols or letters. The fact that the condition is violated.

Return to FIG. 27 to continue the description. In step 2740, the planner confirms the in-field operation map displayed on the display device, and judges whether to approve the content. As a result of the judgment, if it is approved, proceed to step 2750, and register the shunting plan data in the work area corresponding to the field diagram displayed on the display device into the storage device as a formal plan, and terminate the process. In addition, while registering the shunting plan data in the storage device, the data may also be transferred to the output device 2650 in FIG. 26 and a slip of the shunting plan may be printed.

On the other hand, when it is judged that the plan manager needs to continue to change the plan manually, the process returns to step 2720 and repeats the previous process again. When it is judged that it is difficult to correct the condition manually due to multiple violations of the condition, and it is decided to perform automatic recreation of the plan, the process proceeds to step 2760 .

In step 2760, use the user intention setting means 2614 in FIG. 26 to set the "intent" of the plan undertaker. The term "intent" here indicates the content of a specific part of the plan that the plan undertaker wishes to realize when the plan is recreated.

Fig. 29 is a diagram showing the data structure of user intention data. There are at least three types of user intentions that can be set: "fixed", "specified candidate", and "specified relationship". In this embodiment, a dedicated data structure corresponding to each is defined.

The user intends to "fix", and it is prohibited to set a value other than the fixed value of the attribute in the online display part of the operation chart sequence. The attributes of the online display part include at least four types: "use numbered line", "start time", "end time", and "online time". The data structure corresponding to this is the table 2910 in FIG. 29 . "Fixed" data is data in the form of a table with one fixed instruction as one row, and each row is given to the online display part of the designated object by the group number and the sum corresponding to the group corresponding to the order of the operation chart of the online display part of the designated object It is composed of 4 items: online number, fixed attribute type, and fixed value that are repeated in other online display parts of the same sequence of diagrams. For example, the first line of the table 2910 is group number "group 01", line number "1", type "use numbered line", value "reserved line No. Use numbered lines for indebted line 4".

The user's intention to "specify candidates" is to limit the value of a specific attribute in the online display portion of the diagram sequence to a specified set of candidate values, and to prohibit the setting of other values. The properties of the online display part are the same as the user intent "fixed". The corresponding data structure is the table 2920 in FIG. 29 . The "specified candidate" data is data in the form of a table in which one candidate is designated as one row, and each row is composed of the group number corresponding to the group including the sequence of the diagram of the online display part of the designated object, and the number assigned to the online display part of the designated object It consists of four items of line number, type of attribute specifying candidate, and value candidate. For example, the first row of the table 2920 is grouping number "grouping 02", online number "3", category "use numbered line", candidate "detention 4, detaining 5, detaining 6". The use number line of No. 3 line is set as any one of Lien 4, Lien 5, and Lien 6", which is the intention of the plan maker. In addition, when the attribute of the designation candidate has a continuous property such as a start time, a range of continuous values may be designated as a candidate (see the second row of the table 2920).

The user's intention to "specify a relationship" is to set a specific association relationship between online display parts of different groups. The types of relationship are roughly divided into "execution sequence" and "use numbered line". Examples of the "execution order" include that the online connection of a certain composition does not start until the online connection of another composition is terminated, and that a certain composition waits for the online start of another composition to start online. The execution sequence considers various changes due to the combination of the start time and the end time, that is, the query time of execution, so the work map that can be set is defined in advance corresponding to the vehicle base of the use object. On the other hand, as an example of "using numbered lines", there can be mentioned that a certain formation and other formations use the same numbered lines, and vice versa, a certain formation and other formations use different numbered lines. In this regard, a more complex work map than the example shown above can also be considered, so it is necessary to define a work map that can be set in advance corresponding to the vehicle base to be used. The data structure corresponding to the "specified relationship" is the table 2930 in FIG. 29 . The "specified relationship" data is data in the form of a table where one relationship is designated as one row, and each row is composed of the group number of the group corresponding to the order of the operation diagram including the online display part of the specified object, and the number assigned to the online display part of the specified object. Consists of five items: online number, group number of the online display part of the other party who set the relationship, the same online number, and the type of relationship designation. For example, the first line of table 2930 is the group number "group 01", the online number "2", the other party's group number "group 03", the other party's online number "2", and the category "use the same numbered line", which means "hope the 01 group It is the intention of the planner that the second line uses the same numbered line as the second line of the 03 group".

In addition, the user intention data can also be used based on the three types of online display parts of the diagram sequence shown in FIG.

Return to FIG. 27 to continue the description. In the user intention setting process of step 2760, the plan leader uses the input device to perform a setting operation on the field diagram output on the display device. Based on the result, the user intention setting device 2614 in FIG. The intention data is stored in the storage device 2620, or the user intention data 2622 stored in the storage device is corrected.

Various variations can be considered in the setting operation of the user's intention by the planner. The present invention does not limit the operation method to a specific method, and in this embodiment, there are four kinds of setting operations described below.

Fig. 30 shows an operation example of a fixed instruction. The plan undertaker moves the mouse pointer 3010 to the online display part (No. 1 of group 01 in the figure) of the fixed pointing object, performs a selection operation, and displays a setting dialogue on the screen by pressing a specific button or other instruction on the screen 3020. Since the list of fixable attributes is displayed as an item in the setting dialogue, the setting process can be executed by moving the mouse pointer to the corresponding item and selecting it here. Specifically, the user intention setting unit 2614 in FIG. 26 reads the selected item, generates corresponding user intention data, and stores it in the storage unit 2620 . Items with a check mark on the setting dialog indicate that the fixed indication is set. When the setting operation is performed on the item with a check mark, the fix instruction is canceled. Specifically, the user intention setting means reads the selected item, retrieves the corresponding intention data from the storage means, and deletes the data.

Fig. 31 shows an example of operation for specifying candidates. The person in charge of the plan moves the mouse pointer 3110 to the online display portion of the candidate designation object, performs a selection operation, and presses a specific button on the screen to display a setting dialog 3120 . The setting dialog is divided into setting areas corresponding to each of the four attributes that can be set as candidates. The check box 3131 is used to switch between valid and invalid designation of the candidate for the attribute "start time". The radio button 3132 is used to designate the automatic type of start time (previous, later, fixed). The scroll bar 3133 is used to set the starting point of the range of starting time. In the case of the setting example in FIG. 31, the user's intention of "starting the second online display part of the 02 group by 12:15" is indicated.

Hereinafter, the operation of setting the "end time" and "online time" in FIG. 31 is the same as that of the start time. On the other hand, the setting operation is slightly different for the "use numbered line" which has a discrete nature different from the time attribute such as the start time. The list 3141 and the list 3142 respectively indicate the numbered lines that do not include designation candidates and the numbered lines that include designation candidates. The configurable numbered lines must contain one of the above two lists. If any item in the list box on the left is selected with the mouse and the remove button 3143 is pressed, the item is moved to the list box on the right. Conversely, if any item in the list box on the right is selected with the mouse and the add button 3144 is pressed, the item is moved to the list box on the left.

If the "OK" button 3150 is pressed after performing the above setting operation, the user intention setting device 2614 in FIG. Existing ones perform new data generation processing. The content of the user intention data 2622 in the storage device 2620 is updated. On the other hand, when the "Cancel" button 3160 is pressed, the operation result on the setting dialog box is not reflected in the storage device, nothing is done, and the process ends.

Fig. 32 shows an example of an operation for specifying a relationship. The planner uses the mouse to select the two online display parts of the relationship designation object, and presses a specific button on the screen or the like to instruct to display the setting dialog 3220 . Since the settable relationship list is displayed as an item in the setting dialogue, the setting process can be executed by moving the mouse pointer 3210 to the corresponding item and performing a selection operation. Specifically, the user intention setting unit 2614 in FIG. 26 reads the selected item, generates corresponding user intention data, and stores it in the storage unit 2620 . Items with a check mark on the setting dialog indicate that the fixed indication is set. When a selection operation is performed on an item with a check mark, the fix instruction is canceled. Specifically, the user intention setting means reads the selected item, retrieves the corresponding intention data from the storage means, and deletes the data.

Fig. 33 is a diagram showing an operation example of specifying a time range and fixing a plurality of online display parts at a time. This setting operation is used to fix the part of the plan that has been completed so far and only re-plan the remaining part when the plan needs to be corrected due to the chaos of train operation or the delay of on-site operations on the day of plan implementation. The person in charge of the plan switches the execution method of this setting operation by pressing a specific button on the screen or the like, and displays the pointer 3310 for time range setting. The mouse can be used to move the pointer left and right, and the time corresponding to the position of the pointer on the operation map in the field is displayed in the label 3320, and at the same time, the plan part from the left of the plan display area to the pointer is marked. Means that the part of the online display contained in the marked area fixes its properties. In addition, for the online operations partially included in the marked area such as the online display portion 3330 in FIG. 33 , only the numbered line and the beginning portion are fixedly used.

After setting the fixed area by the operation described above, the planner executes the setting process by pressing a specific button on the screen or the like. Specifically, the user intention setting means 2614 in FIG. 26 reads the online display part contained in the mark area, and generates a fixed four-type attribute of "use numbered line", "start time", "end time", and "online time". The user's intention data is stored in the storage device 2620 (however, the "end time" and "online time" are not fixedly indicated for the online display part partially included in the mark area).

Returning to FIG. 27 to continue the description, after setting the user's intention in step 2760, the plan undertaker executes the plan re-creation process in step 2770 at any time by pressing a specific button on the screen or the like. In the plan re-creation process, an on-site shunting plan that satisfies the intention set by the plan undertaker is automatically created by adding to the plan creation conditions set in advance. The method used as the basis for the automatic creation is shown in the already-applied patent "Apparatus and method for creating a shunting plan in a vehicle base" (Japanese Patent Application No. 2003-396502). Next, using the processing flowchart of FIG. 34, the re-creation processing actually using the patent-applied system will be described.

Firstly, in step 3410, a condition violation detection is performed on the corrected shunting plan data stored in the working area. Specifically, the condition violation detection means 2613 in FIG. 26 is used to check whether there is a contention for the numbered route or the travel route, or violation of the conditions set in advance, and the result is temporarily stored in the work area.

Next, in step 3420, the grouping of classification planning objects is divided into two types including those that violate the conditions and those that do not, and the result is temporarily saved in the work area. In addition, the processing results are used as input data to the patented planning method at step 3440 .

In step 3430, based on the user intention data 2622 stored in the storage device 2620 of FIG. 26, constraint data that can be explained by the plan creation method of the patent application is generated. The constraint expression data is a mathematical expression using an equal sign (=), an inequality sign (<, >, ≤, ≥), or a logical expression using a logical symbol (=, ≠, ∥, &, !). For example, a constraint expression (z11=4) is generated from the first row in the fixed designation data 2910 in FIG. 29 . Here, z11 is a decision variable related to the numbered line used in the online display part 1 of group 01, and 4 is an ID number that does not overlap with other ID numbers assigned to the reserved line No. 4. Also, a constraint expression (z23=4∥z23=5∥z23=6) is generated from the first row in the candidate designation data 2920 in FIG. 29 . Here, z23 is a decision variable about the numbered lines used in the online display part 3 of group 02, and 4, 5, and 6 are respectively other non-repeating ID numbers given to lines 4, 5, and 6. Furthermore, similarly, a constraint expression (12:30≤e12≤14:00) is generated from the second row in the candidate designation data 2920 in FIG. 29 . Here, e12 is a decision variable regarding the termination time of the online display section 2 of the 01 group. Finally, a constraint expression (e22≦s12) is generated from the second row of the relationship specifying data 2930 . Here, e22 is a variable of the end time of the online display part 2 of the group 02, and s12 is a variable of the start time of the online display part 2 of the group 01. Generate constraint data for all user intention data stored in the storage device, temporarily save the processing results in the work area, and end step 3430 .

Then in step 3440, execute the method for making the shunting plan in the field for which a patent has been applied for. The feature of this method is that the in-yard shunting plan that satisfies the constraints described in the mathematical formula or the logical formula is fixed, and the solution of the grouping of the plan that has been obtained is fixed, and the remaining grouping plans are inserted into it and divided into stages. Made (Example 2). When the plan creation fails in the middle, plan creation is continued after performing (1) canceling part of the fixed plan, (2) reselecting another group, one of them, so cancel all at once as in the conventional method and restart It is more efficient to explore when creating a plan. Since the range of possible combinations to be explored is wide, the possibility of failure in the exploration can be minimized. In addition, since it is possible to create a plan without destroying the already obtained part of the plan as much as possible, it can be used to partially correct the temporarily created plan when the entry time of a part of the formation changes, or to share the plan while talking with the plan maker. Create a plan by adding groups to stages.

When executing this method, it is necessary to classify the planning target group into two types: (1) fixed plan and (2) newly created plan. As a result of re-planning, it can be said that it is desirable not to change the already obtained plan as much as possible from the viewpoint of caring for planners or work deployment. Therefore, using the result of the formation sorting process in step 3420, the formations not including violation conditions are set as (1) fixed plans, and the formations including violation conditions are set as (2) newly created plans. By doing so, it is possible to perform replanning only including groups that violate the conditions, that is, require plan changes, so that the amount of change due to replanning can be kept to a minimum. In addition, in the above setting, even if the violation condition cannot be eliminated, as mentioned above, the application method can determine the part related to the elimination of the violation and eliminate it from the fixed plan in stages, so it is possible to efficiently obtain the non-violation condition. Executable plan.

Thereafter, the process proceeds to step 3450, and the result of the replanning process is output to the display device 2640 in the form of an on-site operation diagram through the on-site operation diagram display device 2611 in FIG. 26 . In addition, when the result of the replanning process does not satisfy the condition violation or the user's intention, change the display color of the corresponding part to an accent color such as red, or display a message represented by symbols or letters, and convey this so that the person in charge does not ignore it. situation.

Return to FIG. 27 to continue the description. Returning to step 2740 again after the re-creation process, the plan undertaker confirms the on-site operation chart described on the display device, and judges whether to approve the content. As a result of the judgment, in the case of approval, proceed to step 2750, and register the shunting plan data in the work area corresponding to the field diagram described on the display device in the storage device as a formal plan, and end the process. Usually, if the condition violation or the user's intention is not satisfied, the manual change of the diagram order in step 2720 or the automatic recreation of the user's intention setting in step 2760 are executed again. However, even if the person in charge judges that it is appropriate for any reason including a violation of the conditions, etc., the process proceeds to the termination process after step 2750 .

This concludes the description of this embodiment. As a result, when manually changing the plan, the content (intent) that the planner wants to modify can be directly set on the part to be corrected by using an input device such as a mouse on the graphically displayed field operation diagram, and the revision can be performed automatically. The plan is to satisfy the intent while eliminating the violated condition. If the part and its contents that one pays attention to are conveyed to the computer through the user's intention data, it can become the so-called "leaving the next thing to the computer", so the planner does not need to consider the unexpected unexpected problems that occur frequently in the change operation of the plan plan condition violated. Therefore, it is possible to efficiently carry out the work of changing the plan without imposing an extra burden on the person in charge of the plan. In addition, in the automatic plan re-creation process, in the initial state, only the group that violates the condition is re-planned, and only when the violation cannot be eliminated, the plans for other groups are released in stages, thereby achieving high efficiency. Obtain a plan with less change than before re-planning.

[Example 2]

Embodiment 2 of the present invention will be described below centering on Fig. 22 and Formulas 12 and 13. Embodiment 2 of the present invention is to add the rest of the formations in stages and then make the overall plan in the state where the on-site shunting plan has been made for several formations; it is used for the plan that the train diagram of the business day is disrupted, etc. Make changes or create plans interactively with planners.

The device configuration of this embodiment is the same as that of the first embodiment shown in FIG. 1, and the specifications of input and output data are also completely the same. The difference from the first embodiment is the overall processing flow for creating an on-site shunting plan, and an overview of this processing will be described below using the processing flowchart in FIG. 22 .

At first, in step 2110, read in the plan of the formation group (as A) of the on-site shunting plan that has been made from the shunting plan data 0127 of Fig. 1, and store in the work area; Select one of the planned formations and add it to formation group B, which is an empty set in the initial state. In step 2130, the on-site shunting plan of the formation group A is fixed, and the on-site shunting plan of the formation group B is created in the form of an addition thereto. This plan preparation process adopts almost the same method as that of Embodiment 1 of the present invention, that is, in the processing flowchart ( FIG. 2 ) representing the overall processing of Embodiment 1 of the present invention, the input data, that is, the grouping data, is limited to only It is processed in the group included in the group group B. In this way, the on-site shunting plan of the formation group B is obtained, but because the conditions of the so-called fixed formation group A plan are considered, the shunting operation diagram selection and time determination processing in step 0230 of Fig. 2 is the same as that of embodiment 1 of the present invention slightly different. Specifically, in addition to Expressions 1 to 10, Expressions 12 and 13 shown below are added as constraints included in the mathematical model.

【Formula 12】

${\mathrm{<span\; class="notranslate">\; \&delta;</span>}}_{{\mathrm{<span\; class="notranslate">\; z</span>}}_{{\mathrm{<span\; class="notranslate">\; i</span>}}^{<span\; class="notranslate">\; \&prime;</span>}}^{<span\; class="notranslate">\; *</span>}{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; \&DoubleRightArrow;</span>{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; \&Greater\; Equal;</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{{\mathrm{<span\; class="notranslate">\; i</span>}}^{<span\; class="notranslate">\; \&prime;</span>}}^{<span\; class="notranslate">\; *</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; u</span>}<span\; class="notranslate">\; |</span><span\; class="notranslate">\; |</span>{\mathrm{<span\; class="notranslate">\; the\; s</span>}}_{{\mathrm{<span\; class="notranslate">\; i</span>}}^{<span\; class="notranslate">\; \&prime;</span>}}^{<span\; class="notranslate">\; *</span>}<span\; class="notranslate">\; \&Greater\; Equal;</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; u</span>}<span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; \&ForAll;</span>\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; \&Element;</span>{\mathrm{<span\; class="notranslate">\; o</span>}}^{\mathrm{<span\; class="notranslate">\; R</span>}}<span\; class="notranslate">\; ,</span>{<span\; class="notranslate">\; \&ForAll;</span>\mathrm{<span\; class="notranslate">\; i</span>}}^{<span\; class="notranslate">\; \&prime;</span>}<span\; class="notranslate">\; \&Element;</span>{\mathrm{<span\; class="notranslate">\; o</span>}}^{<span\; class="notranslate">\; \&prime;</span>\mathrm{<span\; class="notranslate">\; R</span>}}$

【Formula 13】

in

· J^ ^* : Create a collection of understood jobs (group A)

· O^ ^* : generate a collection of understood processes

· O^ ^* R, O^T: Generate a collection of understood mobile processing (R), online processing (T)

s^ ^* _i: start time of processing i (element of 0 ^* ) (constant)

· e^ ^* _i: the end time of processing i (element of 0 ^* ) (constant)

· z^ ^* _i: allocation resource for processing i (element of 0 ^* ) (constant)

The meaning of Equation 12 is "if the allocation resources of online processing i have been allocated to processing i' for generating solutions, then the execution time periods do not overlap, and there is an interval above the continuation interval (q) between the two processing", The constraints expressed by Formula 1 are defined between the composition group A and the composition group B.

The meaning of Equation 13 is "If the allocated resources of the mobile process i compete with the allocated resources of the generated process i', the execution time periods do not overlap, and there is an interval of more than the failure time (u) between the two processes" , between the formation group A and the formation group B define the constraints expressed in formula 2.

Except for adding these mathematical formulas to the mathematical model, it is exactly the same as the first embodiment of the present invention. With the plan of the composition group A fixed in this way, the shunting plan of the composition group B can be created in the form of an addition thereto.

Return to FIG. 21 to continue the description. After obtaining the plan of the formation group B, determine the possibility of plan execution in step 2140. If an executable plan is obtained, proceed to step 2150 to include All the formations are added to the formation group A, and the formation group B is regarded as an empty set, so that the made plan is fixed in the subsequent solution; In the case of a plan of all groups, the entire process is completed as the completion of plan creation. In the case that there are still groups left, the process returns to step 2120 to continue creating the plan.

In the executable judgment of step 2140, if it is judged as "impossible to execute", it will go to step 2170, where it is judged whether the number of elements of group B is equal to the limit value, if the result of the judgment is lower than the limit value, then start from Taking out a formation from formation group A and adding it to formation group B means that part of the fixed plan is released. Thereafter, proceed to step 2130 to create a trial plan again.

In the determination of the number of elements in step 2170, if the number of elements of the composition group B is equal to the limit value, the process proceeds to step 2190. In this step, it is judged whether or not the stop condition for retrying is satisfied, and the stop condition is, for example, "select all formations in the formation group targeted for planning creation". When the condition is satisfied, the processing is stopped, and it is concluded that the plan cannot be created. If do not reach the stopping condition of retrying, then proceed to step 2195, after the formation group B is regarded as an empty set, then return to step 2120, and retrying plan is made.

This concludes the description of Embodiment 2. In this way, by fixing the solutions of the already planned groups as they are, plans for the remaining groups can be prepared step by step by adding to them. The method in the prior art is also a method of adding groups in stages and obtaining a plan at the same time, which is similar to the method of this embodiment. However, in the present embodiment, when the planning fails halfway, first (1) cancel a part of the fixed plan, or (2) reselect another group, and then continue the planning. Therefore, it is different from the conventional method Compared with the case where all the plans are canceled at once and the plan is created again, the search efficiency is higher. Since the search for possible combinations has a wide range, the possibility of failure in the search can be minimized. Moreover, since the plan can be created without destroying the partial plan obtained in this way as much as possible, it can be used to partially correct the temporarily created plan when the entry time of a part of the formation changes, etc., while having a dialogue with the plan maker, Create a plan by adding groups in stages.

According to the present invention, since the data that becomes the shunting sequence that classifies the shunting sequence according to the operation content of the formation and the passing times of the indwelling numbered lines before and after the operation is used to make the plan, it is possible not to follow the "approach→detention→ The fixed shunting sequence of operation→detention→exit” is planned. That is, (a) in the initial state, the necessary operations can be carried out without omission for each formation, and a shunting sequence with the least number of shunting times can be made; (b) then the numbered lines and Implementation time; (c) As a result, in the case of violation of constraints such as numbered line competition, the shunting sequence is changed to wait for the reserved numbered line before the operation or to obtain a detour route, and the plan is created again. In each process of initialization and change of the above-mentioned shunting sequence, by using data in the form of a network (vehicle base layout network) representing the layout structure of the vehicle base, it is always possible to obtain the physical structure (numbered line, The connection of traveling routes, etc.) The shunting sequence that does not contradict.

According to the present invention, what is equivalent to the two processes of (i) operation plan determination and (ii) shunting order determination in Patent Document 1 is the above (b) "allocating the numbered routes and implementation times of each shunting sequence to the shunting sequence." deal with". In the described invention, the process is mathematically modeled as a certain operation diagram problem, and then a method for solving sufficient constraints problems, that is, constraint logic programming, is used to calculate the optimal solution. Thus, even in the case of a large number of groups It is also possible to make a plan according to the practical time. That is, by introducing the change of the obtained value of the decision variable related to the numbered line or the shunting time, which is a feature of the constraint logic programming, into other variables through the associated constraint, it is possible to effectively narrow the search range by "constraint propagation" Efficiently obtain valid solutions without checking all huge combinations.

According to the present invention, in the initialization process of the shunting sequence (above (a)), the initialization of the shunting sequence in order to carry out the necessary work without omission and the subsequent shunting sequence change processing (the above (a) In c)), since only the shunting sequence is changed to obtain a standby or detour route to the reserved numbered line, manpower is not increased in the part related to the work, so it is possible to make a suitable shunt even for a formation that is scheduled to have various operations. car plan.

The present invention can be used for inspection of railway vehicles and the like in vehicle yards.

Claims (18)

1. A device for making a shunting plan in a vehicle base, which is used to create a shunting plan in the marshalling of the marshalling that enters the vehicle base from the marshalling of the vehicles to the end of the prescribed operation and leaves, and is characterized in that it is provided with: Using the numbered route information and the travel route definition information to create a vehicle base layout network specified by the nodes representing the numbered routes of the vehicle base and the directed switches representing the travel routes between the numbered routes, and store the first creation in the memory device, According to the vehicle base layout network on the memory, for each formation, a series of train shunting on the online numbered routes that can be used from when the vehicle formation enters the vehicle base to when the specified operation is completed and then exits initialization means for sequence initialization and storage in said memory, The second creating device, which first selects from the shunting sequence on the memory, a series of online shunting lines representing a series of numbered lines from when the vehicle formation enters the vehicle base to when it exits after completing the specified operation. car operation diagram, and at the same time determine the online execution time of the numbered line of the shunting operation diagram, and then make a tentative solution of the on-site shunting plan, and store it in the memory, changing the shunting sequence by using the vehicle base layout network and creating the in-yard Changing device for shunting plan; The numbered lines include a work line usable for the prescribed work in each of the prescribed works and a transit line usable for moving between the work numbered lines in each transit between the work numbered lines. 2. The device for creating a shunting plan in a vehicle base according to claim 1, wherein the provisional solution of the shunting plan in the yard is a solution that minimizes the contention between the numbered route and the traveling route. 3. The shunting plan making device in the vehicle base according to claim 1, characterized in that the initialization device can fully implement the specified operations of the formation, and make the following in the layout structure of the vehicle base. The shunting sequence in which the number of times of use of the via-line between operation lines is the minimum. 4. The shunting plan making device in the vehicle base according to claim 1, characterized in that said second making device makes an extended sequence in which the moving lines between numbered lines are added to the shunting sequence, and then The numbered lines and the moving lines are used as resources, and a mathematical model is made for the moving of the numbered lines and moving lines included in the extended shunting sequence, and the mathematical model will be allocated to the moving resources of the numbered lines and moving lines The execution time of the above-mentioned resources is used as the decision variable, the physical conditions and operating conditions of the on-site shunting are used as the constraints, the special resources that can be used without restriction regardless of time competition are used as the buffer resources, and the buffer resources are used as buffer resources. Resource usage is minimized as a function of purpose. 5. The device for making shunting plan in the vehicle base according to claim 4, characterized in that the optimal solution of the mathematical model is calculated by using constraint logic programming. 6. The shunting plan making device in the vehicle base according to claim 1, characterized in that the changing device selects one or more formations from the formations in which the road conflict occurs, and the said vehicle base is arranged under the layout structure of the vehicle base. The shunting sequence of the marshalling changes the part series related to the online part of the race. 7. A method for making a shunting plan in a vehicle base using a computer, making an on-site shunting plan for a formation from the formation of vehicles entering the vehicle base to finishing the prescribed operations and leaving the formation, characterized in that it includes the following steps : (1) The processing device of the computer uses the numbered route information and the route definition information to create a vehicle base layout network defined by nodes representing the numbered routes of the vehicle bases and directed switches representing the routes between the numbered routes and stored in the memory of the computer; (2) The processing device indicates, for each formation, the number that can be used from when the vehicle formation enters the vehicle base to when the specified operation is completed and then exits, according to the vehicle base layout network on the memory The serial shunting sequence of the line online is initialized and stored in the memory; (3) The processing device first selects from the shunting sequence in the memory the online shunting of a series of numbered lines representing the time when the vehicle formation enters the vehicle base and exits after finishing the specified operation. car operation diagram, and at the same time determine the online execution time of the numbered line of the shunting operation diagram, and then make a tentative solution of the on-site shunting plan and store it in the memory; (4) The processing device uses the vehicle base layout network to change the shunting sequence and create the on-site shunting plan, so as to eliminate the tentative solution of the on-site shunting plan included in the memory The numbered line in the contention with the traveling line; The numbered lines include a work line usable for the prescribed work in each of the prescribed works and a transit line usable for moving between the work numbered lines in each transit between the work numbered lines. 8. The method for making a shunting plan in a vehicle base according to claim 7, characterized in that: The processing device selects a formation from the unplanned formation groups and adds it to the planned formation target formation group, then fixes the plan of the planned formation group, and then creates the on-site shunting plan; In the case of obtaining a contention lane that does not include the numbered route and the traveling route, the processing device transfers all the formations of the formation group to which the plan is made into the formation group that has already made the plan, until the plan for all the formations is made, prepare said on-site shunting plan; In the case where a solution to the race including the numbered route and the travel route is obtained and the number of formations to be planned is less than a limit value, the processing device selects one formation from a group of formed formations and deletes the formation. plan, then add the formation to the formation group that is the object of the plan, and then create the on-site shunting plan; When a solution to the contention lane including the numbered route and the traveling route is obtained and the number of formations subject to plan preparation is equal to the limit value, the processing device cancels the formation subject to plan preparation only if the termination condition is not met group, and then make the on-site shunting plan. 9. A program for causing a computer to realize the function of creating an on-site shunting plan for the formation from when the formation of vehicles enters the vehicle base to leaving after completing a predetermined operation, characterized in that the computer realizes: A function of creating a vehicle base layout network specified by nodes representing the numbered routes of the vehicle bases and directed switches representing travel routes between the numbered routes by using the numbered route information and travel route definition information, and storing in the memory; For each formation, according to the vehicle base layout network on the memory, a series of shunting sequences representing the numbered lines that can be used on the line from the formation entering the vehicle base to exiting after completing the specified operation a function to initialize and store in said memory; From the shunting sequence on the memory, select a shunting operation diagram representing a series of numbered lines on-line from when the formation enters the vehicle base to leaving after completing the specified operation, and at the same time determine the shunting operation The function of making a tentative solution of the on-site shunting plan and storing it in the memory at the execution time of the numbered line of the vehicle operation diagram online; Using the vehicle base layout network to change the shunting sequence and create the on-site shunting plan to eliminate numbered routes and travel routes included in the tentative solution of the on-site shunting plan on the memory The function of fighting for road; The numbered lines include a work line usable for the prescribed work in each of the prescribed works and a transit line usable for moving between the work numbered lines in each transit between the work numbered lines. 10. A device for making a shunting plan in a vehicle base, which is used to create an on-site shunting plan for a vehicle formation from when the vehicle formation enters the vehicle base to when the prescribed operation is completed and then exits. It is characterized in that it is provided with: The output device is used to output the on-site shunting plan data to the display device in the form of an on-site operation diagram, a correction means for receiving a result of a correction operation performed on the on-site operation chart output to the display device using an input device of a plan undertaker, and correcting the in-yard shunting plan data according to the result of the correction operation, detection means for detecting violations of conditions contained in said yard shunting plan data, generating means for receiving a result of a setting operation performed on the on-site operation chart output to the display device using the input device of the plan undertaker, and generating a plan including the plan based on the result of the setting operation. The undertaker stores the user intention data of the place to be revised in the on-site shunting plan data and the correction content, and stores the user intention data in the storage device, or updates the user intention data in the storage device, The re-creation means reflects the correction content included in the user intention data to create the yard shunting plan data in which the violation of the condition has been eliminated. 11. The device for creating a shunting plan in a vehicle base according to claim 10, characterized in that, The correcting means accepts designation of an online display part of the vehicle formation on the on-site operation diagram, a use numbered line for the online display part, a start time, and an end time, as a correction operation by the plan undertaker. , a change in any of the time periods. 12. The device for creating a shunting plan in a vehicle base according to claim 10, wherein: The generation device accepts designation of an online display portion of the vehicle formation on the on-site operation map, fixation of attribute values of the online display portion, and candidate attribute values as a setting operation by the plan manager. Any of the designation of the designation and the designation of the relationship with the attribute value of other online display parts. 13. The device for creating a shunting plan in a vehicle base according to claim 10, wherein: The generating means accepts the time range data as a correction operation of the plan undertaker, and generates the user intention data in which all attribute values are fixed for the online display part including the entire execution time zone in the time range data. The online display part that includes a part of the execution time period in the time range data generates the user intention data that fixes the attribute value of this part, 14. The device for making a shunting plan in a vehicle base according to claim 10, characterized in that, The reformulation device generates constraint expression data represented by a mathematical expression or a logical expression from the user intention data. 15. The device for creating a shunting plan in a vehicle base according to claim 10, characterized in that: The re-creating means targets the formation of vehicles that violate the condition in the initial state as a target for re-planning, and when the violation of the condition cannot be eliminated, the formation of other vehicles is targeted for re-planning in stages. 16. A computer-based method for making a shunting plan in a vehicle base, making an in-yard shunting plan for a vehicle formation from when the vehicle formation enters the vehicle base to when the specified operation is completed and then leaves, the method is characterized in that it includes the following step: (1) The processing device of the computer outputs the on-site shunting plan data to the display device in the form of an on-site operation diagram, (2) The processing device accepts the result of the correction operation performed on the on-site operation chart output to the display device using the input device of the plan undertaker, and corrects the on-site shunting according to the result of the correction operation planning data, (3) the processing means detects a condition violation contained in the yard shunting plan data, (4) The processing device accepts the result of the setting operation performed on the on-site operation map output to the display device using the input device of the plan undertaker, and based on the result of the setting operation Generating user intention data including the place and content of correction that the plan undertaker intends to modify in the on-site shunting plan data, storing the user intention data in a storage device, or updating all data in the storage device user intent data, (5) The processing device generates the yard shunting plan data in which the violation of the condition is eliminated by reflecting the correction content included in the user intention data. 17. The method for making a shunting plan in a vehicle base according to claim 16, characterized in that: When the plan undertaker continues to make corrections by manual operation, the above step (2) is performed, and when the plan undertaker conducts corrections by automatic recreation, the above step (3) is carried out, 18. A program for causing a computer to realize the function of creating an on-site shunting plan for a vehicle formation from the time the vehicle formation enters the vehicle base to when the vehicle formation is completed and then exits, characterized in that the computer realizes: The output function of outputting the shunting plan data in the field to the display device in the form of the field operation diagram, A correction function for correcting the on-site shunting plan data based on the result of the correction operation performed on the on-site operation diagram output to the display device by using the input device of the plan undertaker, a detection function for detecting violations of conditions contained in said yard shunting plan data, Accepting the result of the setting operation performed on the on-site operation chart output to the display device using the input device of the plan undertaker, and generating The place to be corrected in the on-site shunting plan data and the user intention data of the correction content, storing the user intention data in the storage device, or updating the generation function of the user intention data in the storage device, A re-creation function for creating the yard shunting plan data in which the violation of the condition is eliminated by reflecting the correction content included in the user intention data.

Images