An optimization method for handling temporary return tracks of subway trains based on route conflicts

Abstract

The present invention relates to a method for optimizing the processing of temporary return tracks of subway trains based on route conflicts, and the specific process is as follows: S1, constructing a return path tree and an exit path tree based on the route according to the depot station type and route information; S2, calculating the passing time of each route on the path corresponding to the return plan, and obtaining a return plan route set with time; S3, calculating the passing time of each route on the path corresponding to the exit plan, and obtaining a exit plan route set with time; S4, calculating the passing time of each route on the path corresponding to the shunting plan, and obtaining a shunting plan route set with time; S5, finding all the storage routes of the temporary return train, calculating the passing time of each route on the path, and obtaining a route set with time and a conflicting route set under different storage schemes; S6, calculating the influence of different storage schemes on the planned driving of the depot; S7, obtaining a temporary return plan with the least influence on the planned operation of the depot. Compared with the prior art, the present invention has the advantages of reducing the possible operation conflicts when the train temporarily returns to the depot.

Description

Technical Field

[0001] The invention relates to a train signal control system, in particular to a method for optimizing the processing of temporary return tracks of subway trains based on route conflicts. Background Art

[0002] The subway depot is a place for the storage, inspection and maintenance of vehicles. Its main function is to inspect and repair vehicles and provide healthy vehicles to the main line. The boundary between the depot and the main line is the switch track. The depot needs to arrange the vehicles to run to the switch track to be out of the warehouse and put on the line. After the train on the line completes the transportation task, it will return to the depot through the switch track as planned for storage and maintenance.

[0003] How to reasonably arrange train tracks to reduce unnecessary shunting operations and avoid conflicts in receiving and dispatching trains while meeting the needs of inspection, maintenance, and receiving and dispatching trains is one of the difficulties in depot dispatching.

[0004] After searching, Chinese patent publication number CN106228243 disclosed the "Metro Depot Track Arrangement Method". This model can make reasonable choices among train tasks under resource constraints and find the best track arrangement plan, providing decision support for subsequent daily inspections and shunting operations to improve the operating efficiency of the depot.

[0005] The paper "Optimization Model for Track Utilization in Metro Depot" proposes track arrangement when subway trains return to the depot. On the basis of the train operation plan and maintenance plan, the operation costs caused by unreasonable track utilization are converted into additional shunting operations. The optimization model for track utilization when receiving trains is established with the minimum total shunting times as the optimization goal.

[0006] The paper "Arrangement of Subway Vehicle Return Tracks Based on Multi-Objective Genetic Algorithm" takes task completion, total shunting times during vehicle receiving process, and extra time spent on vehicle entering and exiting the depot as optimization objectives, and establishes a return track arrangement model based on a multi-objective genetic algorithm with vehicle return time interval and depot maintenance capacity as constraints.

[0007] Domestic and foreign scholars have conducted little research on the arrangement of return tracks in subway depots. The research direction is mainly focused on combining vehicle maintenance plans and operation plans to arrange return tracks in advance to optimize maintenance completion, shunting, and resource utilization as much as possible. There is even less research on the use of storage tracks for temporary return trains, which are generally decided manually based on the current use of storage tracks. Temporary return to the depot is generally caused by sudden failures or other unforeseen factors. In this case, manual operation is particularly prone to errors. Incorrect return track arrangements often lead to conflicts between return trains and other trains, which interfere with normal depot operations and even affect mainline driving, causing operational delays. Summary of the invention

[0008] The purpose of the present invention is to overcome the defects of the above-mentioned prior art and to provide a method for optimizing the temporary return of subway trains to the depot based on route conflicts.

[0009] The purpose of the present invention can be achieved by the following technical solutions:

[0010] According to a first aspect of the present invention, a method for optimizing the temporary return of subway trains to the depot based on route conflicts is provided, and the specific process is as follows:

[0011] Step S1: construct a return path tree and an outbound path tree based on the route according to the depot station type and route information;

[0012] Step S2, according to the return plan and the return path tree obtained in step S1, calculate the passing time of each route on the path corresponding to the return plan, and obtain a set of return plan routes with time;

[0013] Step S3, according to the outbound plan and the outbound path tree obtained in step S1, calculate the passing time of each route on the path corresponding to the outbound plan, and obtain the outbound plan route set with time;

[0014] Step S4, according to the shunting path and shunting time specified in the shunting plan, calculate the passing time of each route on the path corresponding to the shunting plan to obtain a shunting plan route set with time;

[0015] Step S5: According to the return path tree and conflicting route settings obtained in step S1, all the storage paths of the temporary return train are found, the passing time of each route on the path is calculated, and the route set with time and the conflicting route set under different storage schemes are obtained;

[0016] Step S6, calculating the impact of different parking schemes on the planned driving of the depot according to the route set of different parking schemes obtained in step S5 and the planned route set obtained in steps S2 to S4;

[0017] Step S7, compare the impact of the vehicle storage plan obtained in S6, and obtain a temporary vehicle return plan that has the least impact on the vehicle depot's planned operations.

[0018] As a preferred technical solution, in step S1, according to the depot type and route information, the route-based return path tree is constructed as follows:

[0019] The transfer track is the root node, the signal corresponding to the route on the return path is the intermediate node, the storage track is the leaf node, and the connection between the intermediate nodes represents the route with the upper node signal as the starting point and the lower node signal as the end point.

[0020] As a preferred technical solution, in step S1, according to the depot type and route information, the route-based outbound path tree is constructed as follows:

[0021] The storage track is the root node, the signal corresponding to the approach on the outbound path is the intermediate node, the conversion track is the leaf node, and the connection between the intermediate nodes represents the approach with the upper node signal as the starting point and the lower node signal as the end point.

[0022] As a preferred technical solution, the step S2 is specifically as follows:

[0023] Step S 21 , according to the planned return track and parking location, the return path tree is obtained in combination with step S1, and the path set of the return plan is obtained;

[0024] Step S 22 , Calculate step S according to the planned return time 21 The passing time of the signal on the return path is obtained, and the route set with time is obtained.

[0025] As a preferred technical solution, the step S3 is specifically as follows:

[0026] Step S 31 , according to the storage track where the train is located and the planned outbound transfer track, combined with the outbound path tree obtained in step S1, a path set of the outbound plan is obtained;

[0027] Step S 32 , according to the planned delivery time, calculate step S 31 The passing time of the signal on the outbound path is obtained, and the route set with time is obtained.

[0028] As a preferred technical solution, the step S5 is specifically as follows:

[0029] Step S 51 , according to the return-to-depot conversion track of the temporary return-to-depot train, combined with the return-to-depot path tree obtained in step S1, find the path set corresponding to different parking schemes;

[0030] Step S 52 , according to the temporary train return time, calculate step S 51 The passing time of the signal on the obtained path is used to obtain the route set of the temporary return path;

[0031] Step S 53 , according to the conflict route setting of the vehicle depot and step S 52 The obtained route set of the temporary return path is obtained, and the conflicting route set of the temporary return path is obtained.

[0032] As a preferred technical solution, the step S6 is specifically as follows:

[0033] Step S 61 , compare the temporary return route set obtained in step S5 with the return route set of the return plan obtained in step S2, and calculate the impact value of the temporary return plan on the return plan;

[0034] Step S 62 , compare the temporary return route set obtained in step S5 with the departure plan route set obtained in step S3, and calculate the impact value of the temporary return plan on the departure plan;

[0035] Step S 63 , comparing the temporary return route set obtained in step S5 with the shunting plan route set obtained in step S4, and calculating the impact value of the temporary return scheme on the shunting plan;

[0036] Step S 64 According to step S 61 The impact value of the return plan obtained, step S 62 The impact value of the outbound plan obtained, step S 63 The impact value of the shunting plan is obtained, and the total impact value of the temporary return plan is calculated.

[0037] As a preferred technical solution, the method optimizes the temporary return path of the train and the storage track.

[0038] According to a third aspect of the present invention, there is provided an electronic device, comprising a memory and a processor, wherein a computer program is stored in the memory, and the method described above is implemented when the processor executes the program.

[0039] According to a fourth aspect of the present invention, there is provided a computer-readable storage medium having a computer program stored thereon, wherein the program implements the method described when executed by a processor.

[0040] Compared with the prior art, the present invention has the following advantages:

[0041] 1) The present invention takes minimizing the impact on the execution of the original driving plan of the vehicle depot as the optimization goal, reducing the possible operation conflicts when the train temporarily returns to the depot;

[0042] 2) The present invention establishes a signal path model based on the route, replaces the actual travel path with the signal path, reduces the algorithm calculation amount, speeds up the algorithm processing speed, and enhances the real-time performance of the system;

[0043] 3) The present invention automatically searches for the storage location according to the train return location and generates a return path, effectively reducing the burden of manual operation. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] Figure 1 Flow chart of the method of the present invention. DETAILED DESCRIPTION

[0045] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present invention.

[0046] The present invention provides a method for optimizing the processing of temporary return tracks of subway trains based on route conflicts. The method takes minimizing the impact on the original shunting plan and in-and-out plan of the depot as the optimization goal, takes the route throughput as the constraint condition, and selects the return path and storage location for the trains that temporarily return to the depot. The model first establishes a path model based on the route, then establishes a shunting plan, an in-and-out plan, and an route model of the temporary return plan based on the model, and finally calculates the impact of the return plan on the existing plan based on the route conflict situation, and obtains a temporary return plan with the least impact on the planned route.

[0047] refer to Figure 1 , the method of the present invention is described, and the model of the present invention comprises the following steps:

[0048] Step S1, constructing a return path tree and an outbound path tree based on the route according to the depot type and route information;

[0049] Step S2: Find the return plan path according to the return plan and the return path tree obtained in step S1, calculate the passing time of each route on the path, and obtain the return plan route set R with time. i回 (t);

[0050] Step S3: Find the delivery plan path according to the delivery plan and the delivery path tree obtained in step S1, calculate the passing time of each route on the path, and obtain the delivery plan route set R with time. i出 (t);

[0051] Step S4: Calculate the transit time of each route on the path according to the shunting path and shunting time specified in the shunting plan, and obtain the shunting plan route set R with time. i调 (t);

[0052] Step S5: According to the return path tree and conflicting route settings obtained in step S1, find all the storage routes for the temporary return train, calculate the passing time of each route on the path, and obtain the set R of all temporary return routes with time for the storage plan i临 (t) and its conflicting path set R i临(冲突) (t);

[0053] Step S6: According to step S5, the route set and conflicting route set of different parking schemes are obtained, and compared with the planned route set obtained in steps S2 to S4, and the impact of different parking schemes on the planned driving of the depot is calculated. i Pro

[0054] Step S7, compare the impact of the vehicle storage plan obtained in S6, and obtain a temporary vehicle return plan that has the least impact on the vehicle depot's planned operations.

[0055] The specific steps of step S1 are as follows:

[0056] Step S 11 , According to the depot station type and route information, construct the route-based return path tree, take the return transfer track as the root node, and find the signal s of the starting track with the return transfer track k The starting signal j The route r of the terminal signal k-j ,s j For k , find the path r k-j The end track g j , such as g j is the storage track, then g j For j The leaf node of the node, and then s j As the parent node, traverse the return path according to the root node steps to obtain the return path tree;

[0057] Step S 12 2. According to the depot station type and route information, construct the outbound path tree of each storage track based on the route, take the storage track as the root node, and find the signal machine s with the storage track as the starting track k The starting signal j The route r of the terminal signal k-j , r k-j Terminal signal j For k The child node, r k-j The end track g j , such as g j is the storage track, then g j For j The leaf node of the node, and then s j As the parent node, traverse the outbound path of the storage rail in the same way as the root node, and so on to obtain the outbound path tree of all storage rails;

[0058] The step S2 is specifically as follows:

[0059] Step S 212. According to the planned return track and storage location, the return path tree is obtained in combination with step S1, the path from the conversion track to the storage track is found, and the path set of the return plan is obtained;

[0060] Step S 22 , Calculate step S according to the return time 21 The passing time of the signal on the return path is obtained, and the route set R with time is obtained i回 (t) = {r k-j (t),t k ≤t≤t j |r k-j is the route starting from signal k and ending at signal j. k and j are non-leaf nodes on the i-th return path, j is the child node of k, and t k is the time to pass the signal at node k, t j is the time to pass the signal at node j}.

[0061] The step S3 is specifically as follows:

[0062] Step S 31 2. According to the storage rail where the train is located and the switch rail where the train is scheduled to leave the warehouse, combined with the exit path tree obtained in step S2, find the path from the storage rail to the switch rail, and obtain the path set of the exit plan;

[0063] Step S 32 , Calculate step S according to the delivery time 31 The passing time of the signal on the outbound path is obtained, and the route set R with time is obtained i出 (t) = {r k-j (t),t k ≤t≤t j |r k-j is the route starting from signal k and ending at signal j. k and j are non-leaf nodes on the i-th outbound route, j is the child node of k, and t k is the time to pass the signal at node k, t j is the time to pass the signal at node j}.

[0064] The step S5 is specifically as follows:

[0065] Step S 51 2. According to the return track of the temporary return train, the return path tree is obtained in combination with step S1, the paths corresponding to different storage schemes are found, and the path sets of different schemes are obtained;

[0066] Step S 52 , according to the temporary train return time, calculate step S 51 The passing time of the signal on the obtained path is used to obtain the route set R on the temporary return pathi临 (t) = {r k-j (t), t k ≤t≤t j |r k-j is the route starting from signal k and ending at signal j. k and j are the signals recorded at the non-leaf nodes on the path corresponding to the temporary return plan i. j is the child node of k. k is the time to pass the signal at node k, t j is the time to pass the signal machine at node j};

[0067] Step S 53 , according to the conflict route setting of the vehicle depot and step S 52 The obtained route set, the temporary return to the library conflict route set R i临(冲突) (t) = {r k-j(冲突) (t)|r k-j(冲突) is the route r of the temporary return plan i k-j The set of conflicting paths, r k-j ∈R i临路径 (t)}.

[0068] The step S6 is specifically as follows:

[0069] Step S 61 , calculate the impact value I of the temporary return plan i on the return plan i临回 ,

[0070] I i临回 =∑(a rk-j *r k-j (t)+b rk-j *r k-j(冲突) (t)), where a rk-j =a if r k-j (t)∈R i回 (t)∩R i临 (t), otherwise a rk-j =0, b rk-j = b if r k-j(冲突) (t)∈R i回 (t)∩R i临(冲突) (t), otherwise b rk-j =0;

[0071] Step S 62 , calculate the impact of temporary return plan i on the return plan I i临出 ,

[0072] I i临出 =∑(a rk-j *r k-j (t)+b rk-j *r k-j(冲突) (t)), where ark-j =a if r k-j (t)∈R i出 (t)∩R i临 (t), otherwise a rk-j =0, b rk-j = b if r k-j(冲突) (t)∈R i出 (t)∩R i临(冲突) (t), otherwise b rk-j =0;

[0073] Step S 63 , calculate the impact of temporary return plan i on the shunting plan I i临调 ,

[0074] I i临调 =∑(a rk-j *r k-j (t)+b rk-j *r k-j(冲突) (t)), where a rk-j =a if r k-j (t)∈R i调 (t)∩R i临 (t), otherwise a rk-j =0, b rk-j = b if r k-j(冲突) (t)∈R i调 (t)∩R i临(冲突) (t), otherwise b rk-j =0;

[0075] (a and b are the impact coefficients of the route and conflicting route respectively)

[0076] Step S 64 , calculate the total impact of temporary return plan i on the existing plan I i临 ,

[0077] I i临 =c 回 *I i临回 +c 出 *I i临出 +c 调 *I i临调 , where c 回 is the impact weight of the return plan, c 出 is the weight of the outbound plan, c 调 Influence weights on shunting plans.

[0078] The above is an introduction to the method embodiment. The following is a further explanation of the scheme of the present invention through electronic equipment and storage medium embodiments.

[0079] The electronic device of the present invention includes a central processing unit (CPU), which can perform various appropriate actions and processes according to computer program instructions stored in a read-only memory (ROM) or loaded from a storage unit into a random access memory (RAM). In the RAM, various programs and data required for device operation can also be stored. The CPU, ROM and RAM are connected to each other via a bus. An input / output (I / O) interface is also connected to the bus.

[0080] Multiple components in the device are connected to the I / O interface, including: input units, such as keyboards, mice, etc.; output units, such as various types of displays, speakers, etc.; storage units, such as disks, optical disks, etc.; and communication units, such as network cards, modems, wireless communication transceivers, etc. The communication unit allows the device to exchange information / data with other devices through computer networks such as the Internet and / or various telecommunication networks.

[0081] The processing unit performs the various methods and processes described above, such as methods S1 to S7. For example, in some embodiments, methods S1 to S7 may be implemented as a computer software program, which is tangibly contained in a machine-readable medium, such as a storage unit. In some embodiments, part or all of the computer program may be loaded and / or installed on the device via a ROM and / or a communication unit. When the computer program is loaded into the RAM and executed by the CPU, one or more steps of methods S1 to S7 described above may be performed. Alternatively, in other embodiments, the CPU may be configured to execute methods S1 to S7 in any other appropriate manner (e.g., by means of firmware).

[0082] The functions described above herein may be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), and the like.

[0083] The program code for implementing the method of the present invention can be written in any combination of one or more programming languages. These program codes can be provided to a processor or controller of a general-purpose computer, a special-purpose computer or other programmable data processing device, so that the program code, when executed by the processor or controller, enables the functions / operations specified in the flow chart and / or block diagram to be implemented. The program code can be executed entirely on the machine, partially on the machine, partially on the machine as a stand-alone software package and partially on a remote machine, or entirely on a remote machine or server.

[0084] In the context of the present invention, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0085] The above is only a specific embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any technician familiar with the technical field can easily think of various equivalent modifications or replacements within the technical scope disclosed by the present invention, and these modifications or replacements should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention shall be based on the protection scope of the claims.

Claims

1. A method for optimizing the temporary return of subway trains to the depot based on route conflicts, characterized in that: The specific process is as follows: Step S1: construct a return path tree and an outbound path tree based on the route according to the depot station type and route information; Step S2, according to the return plan and the return path tree obtained in step S1, calculate the passing time of each route on the path corresponding to the return plan, and obtain a set of return plan routes with time; Step S3, according to the outbound plan and the outbound path tree obtained in step S1, calculate the passing time of each route on the path corresponding to the outbound plan, and obtain the outbound plan route set with time; Step S4, according to the shunting path and shunting time specified in the shunting plan, calculate the passing time of each route on the path corresponding to the shunting plan to obtain a shunting plan route set with time; Step S5: According to the return path tree and conflicting route settings obtained in step S1, all the storage paths of the temporary return train are found, the passing time of each route on the path is calculated, and the route set with time and the conflicting route set under different storage schemes are obtained; Step S6, calculating the impact of different parking schemes on the planned driving of the depot according to the route set of different parking schemes obtained in step S5 and the planned route set obtained in steps S2 to S4; Step S7, comparing the impact of the vehicle storage plan obtained in S6, and obtaining a temporary vehicle return plan with the least impact on the vehicle depot's planned operations; In step S1, according to the depot type and route information, the route-based return path tree is constructed as follows: The transfer track is the root node, the signal corresponding to the route on the return path is the intermediate node, the storage track is the leaf node, and the connection between the intermediate nodes represents the route starting from the upper node signal and ending at the lower node signal. In step S1, according to the depot type and route information, the route-based outbound path tree is constructed as follows: The storage track is the root node, the signal corresponding to the approach on the outbound path is the intermediate node, the conversion track is the leaf node, and the connection between the intermediate nodes represents the approach with the upper node signal as the starting point and the lower node signal as the end point.

2. According to the method for optimizing the temporary return of subway trains to the depot based on route conflicts in claim 1, it is characterized in that: The step S2 is specifically as follows: Step S 21 , according to the planned return track and parking location, the return path tree is obtained in combination with step S1, and the path set of the return plan is obtained; Step S 22 , Calculate step S according to the planned return time 21 The passing time of the signal on the return path is obtained, and the route set with time is obtained.

3. The method for optimizing the temporary return of subway trains to the depot based on route conflicts according to claim 1 is characterized in that: The step S3 is specifically as follows: Step S 31 , according to the storage track where the train is located and the planned outbound transfer track, combined with the outbound path tree obtained in step S1, a path set of the outbound plan is obtained; Step S 32 , according to the planned delivery time, calculate step S 31 The passing time of the signal on the outbound path is obtained, and the route set with time is obtained.

4. The method for optimizing the temporary return of subway trains to the depot based on route conflicts according to claim 1 is characterized in that: The step S5 is specifically as follows: Step S 51 , according to the return-to-depot conversion track of the temporary return-to-depot train, combined with the return-to-depot path tree obtained in step S1, find the path set corresponding to different parking schemes; Step S 52 , according to the temporary train return time, calculate step S 51 The passing time of the signal on the obtained path is used to obtain the route set of the temporary return path; Step S 53 , according to the conflict route setting of the vehicle depot and step S 52 The obtained route set of the temporary return path is obtained, and the conflicting route set of the temporary return path is obtained.

5. The method for optimizing the temporary return of subway trains to the depot based on route conflicts according to claim 1 is characterized in that: The step S6 is specifically as follows: Step S 61 , compare the temporary return route set obtained in step S5 with the return route set of the return plan obtained in step S2, and calculate the impact value of the temporary return plan on the return plan; Step S 62 , compare the temporary return route set obtained in step S5 with the departure plan route set obtained in step S3, and calculate the impact value of the temporary return plan on the departure plan; Step S 63 , comparing the temporary return route set obtained in step S5 with the shunting plan route set obtained in step S4, and calculating the impact value of the temporary return scheme on the shunting plan; Step S 64 According to step S 61 The impact value of the return plan obtained, step S 62 The impact value of the outbound plan obtained, step S 63 The impact value of the shunting plan is obtained, and the total impact value of the temporary return plan is calculated.

6. The method for optimizing the temporary return of subway trains to the depot based on route conflicts according to claim 1 is characterized in that: This method optimizes the temporary return path of the train and the storage track.

7. An electronic device comprising a memory and a processor, wherein a computer program is stored in the memory, wherein: When the processor executes the program, the method according to any one of claims 1 to 6 is implemented.

8. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.

Images