Vehicle bottom connection method and device, electronic equipment and storage medium

Abstract

This application provides a method, apparatus, electronic device, and storage medium for train connection. The method includes: selecting multiple candidate departure trains from multiple departure trains that satisfy a connection relationship with a target arrival train; establishing a mixed integer programming model based on the departure delay time and parking area occupation time of the multiple candidate departure trains corresponding to each of the multiple arrival trains; solving the mixed integer programming model to obtain the arrival and departure trains that have a connection relationship with the multiple departure trains and the multiple arrival trains. In other words, the train connection problem is transformed into a linear programming problem that maximizes the number of connections, minimizes the departure delay time, and minimizes the parking area occupation time. By solving the linear programming problem, a train connection scheme is obtained. The obtained train connection scheme not only maximizes the use of train connections but also reduces connection occupation time and train delay adjustments.

Description

Technical Field

[0001] This application relates to the field of train timetable technology, and more particularly to a method, apparatus, electronic device and storage medium for connecting train carriages. Background Technology

[0002] Train timetables are a crucial guide for urban rail transit train operations. Trains complete their scheduled runs according to the timetable, turning back at the planned terminus to continue their planned journeys until they return to the depot. However, with the gradual expansion of the networked operation of urban rail transit systems and the significant increase in passenger volume and intensity, there is an urgent need for efficient trainset connection solutions.

[0003] The current train set connection scheme adjusts the connection time of departing trains to connect departing and arriving trains in the timetable. However, the current train set connection scheme cannot fully utilize the train sets or reduce train delays, thus affecting train operation efficiency. Summary of the Invention

[0004] To address one of the aforementioned technical deficiencies, this application provides a method, apparatus, electronic device, and storage medium for connecting train undercarriages, which not only maximizes the use of undercarriage connections but also reduces connection time and train delay adjustments.

[0005] According to a first aspect of the embodiments of this application, a method for connecting vehicle undercarriages is provided, the method comprising:

[0006] Extract multiple departure and arrival bus routes with the same parking area from the operation map to be processed. All of the multiple departure and arrival bus routes are non-depot bus routes.

[0007] When it is determined that the plurality of departure trains and the target arrival train are connected in the parking area, the departure delay time corresponding to the plurality of departure trains is determined. The target arrival train is any one of the plurality of arrival trains. The departure delay time refers to the time when the departure train needs to be delayed when it is connected to the target arrival train in the parking area.

[0008] Based on the departure delay time and the preset minimum turnaround time corresponding to the target arrival train, multiple candidate departure trains that satisfy the connection relationship with the target arrival train are selected from the multiple departure trains. The preset minimum turnaround time refers to the minimum time required for the target arrival train to pass through the parking area.

[0009] A mixed integer programming model is established based on the departure delay time and parking area occupation time of the multiple candidate departure trains corresponding to the multiple arrival trains.

[0010] Solve the mixed integer programming model to obtain the arrival and departure trains that have a succession relationship with the multiple departure trains and the multiple arrival trains;

[0011] The train schedule is adjusted based on the arriving and departing trains that have a connection to each other in order to obtain the target train schedule.

[0012] According to a second aspect of the embodiments of this application, a vehicle undercarriage connection device is provided, the device comprising:

[0013] The extraction module is used to extract multiple departure and arrival trains with the same parking area from the operation map to be processed, wherein the multiple departure and arrival trains are all non-depot trains;

[0014] The determining module is used to determine the departure delay time corresponding to each of the plurality of departure trains when the plurality of departure trains and the target arrival train are connected in the parking area. The target arrival train is any one of the plurality of arrival trains. The departure delay time refers to the time by which the departure train needs to depart late when the departure train and the target arrival train are connected in the parking area.

[0015] The selection module is used to select multiple candidate departure trains that satisfy the connection relationship with the target arrival train from the multiple departure trains based on the departure delay time and the preset minimum turnaround time corresponding to the target arrival train. The preset minimum turnaround time refers to the minimum time required for the target arrival train to pass through the parking area.

[0016] A module is established to build a mixed integer programming model based on the departure delay time and parking area occupation time of the multiple candidate departure trains corresponding to the multiple arrival trains;

[0017] The solution module is used to solve the mixed integer programming model to obtain the arrival and departure trains that have a succession relationship with the multiple departure trains and the multiple arrival trains.

[0018] The adjustment module is used to adjust the train schedule based on the arriving and departing trains that have a connection relationship, so as to obtain the target train schedule.

[0019] According to a third aspect of the embodiments of this application, an electronic device is provided, the device comprising:

[0020] Memory;

[0021] Processor; and

[0022] Computer programs;

[0023] The computer program is stored in the memory and configured to be executed by the processor to implement the undercarriage splicing method as described in the first aspect.

[0024] According to a fourth aspect of the embodiments of this application, a computer-readable storage medium is provided having a computer program stored thereon; the computer program is executed by a processor to implement the undercarriage splicing method as described in the first aspect.

[0025] The train connection scheme provided in this application embodiment establishes a mixed integer programming model based on the departure delay time and parking area occupation time of multiple candidate departure trains corresponding to multiple arrival trains. The mixed integer programming model is solved to obtain the arrival and departure trains that have a connection relationship with multiple departure trains and multiple arrival trains. In other words, the train connection problem is transformed into a linear programming problem that maximizes the number of connections, minimizes the departure delay time, and minimizes the parking area occupation time. By solving the linear programming problem, the train connection scheme is obtained. The train connection scheme obtained in this way not only maximizes the use of train connections, but also reduces the connection occupation time and train delay adjustment. Attached Figure Description

[0026] The accompanying drawings, which are included to provide a further understanding of this application and form part of this application, illustrate exemplary embodiments of this application and are used to explain this application, but do not constitute an undue limitation of this application. In the drawings:

[0027] Figure 1 A schematic flowchart illustrating a method for connecting the undercarriage of a vehicle, as provided in an embodiment of this application;

[0028] Figure 2 This is a flowchart illustrating a method for determining the departure delay times of multiple departure routes, as provided in an embodiment of this application.

[0029] Figure 3 This application provides an schematic diagram illustrating an method for determining the departure delay time of a first departure train, as provided in an embodiment of this application.

[0030] Figure 4 This is a schematic diagram illustrating a process for selecting multiple candidate departure trains that satisfy a connection relationship with the target arrival train, as provided in an embodiment of this application.

[0031] Figure 5 A flowchart illustrating the process of establishing a mixed integer programming model, provided for an embodiment of this application;

[0032] Figure 6a This is a schematic diagram corresponding to a processing operation diagram provided in an embodiment of this application;

[0033] Figure 6b This is a schematic diagram corresponding to a preprocessed running graph provided in an embodiment of this application;

[0034] Figure 6c This is a schematic diagram corresponding to a target running graph provided in an embodiment of this application;

[0035] Figure 7 A schematic diagram of a vehicle undercarriage connection device provided for an exemplary embodiment of this application;

[0036] Figure 8 To and Figure 7 The diagram shows the structure of the electronic device corresponding to the undercarriage connection device provided in the embodiment. Detailed Implementation

[0037] To make the technical solutions and advantages of the embodiments of this application clearer, the exemplary embodiments of this application will be described in further detail below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of this application, and not an exhaustive list of all embodiments. It should be noted that, unless otherwise specified, the embodiments and features in the embodiments of this application can be combined with each other.

[0038] In developing this application, the inventors discovered that current train set connection schemes handle the connection between departing and arriving trains in the timetable by adjusting the connection time of departing trains. However, with the gradual expansion of the network operation scale of urban rail transit systems and the significant increase in passenger volume and intensity, current train set connection schemes cannot fully utilize the train sets or reduce train delays, thus affecting train operation efficiency. Therefore, an efficient train set connection scheme is urgently needed.

[0039] To address the aforementioned issues, this application provides a novel undercarriage connection scheme. By employing an integer programming method, a hybrid integer programming model is constructed with the objectives of maximizing the number of connections, minimizing departure delays, and minimizing time spent in parking areas. Solving this hybrid integer programming model yields the undercarriage connection scheme; essentially, the undercarriage connection problem is transformed into a linear programming problem. Solving this linear programming problem provides the undercarriage connection scheme, which maximizes the use of undercarriage connections while reducing connection time and delay adjustments.

[0040] The following describes in detail a solution provided by an embodiment of this application, with reference to the accompanying drawings.

[0041] Figure 1 This is a flowchart illustrating a method for connecting the undercarriage of a vehicle, as provided in an embodiment of this application; see attached document. Figure 1As shown, specifically, the method may include the following steps:

[0042] 101. Extract multiple departure trains and multiple arrival trains with the same parking area from the operation diagram to be processed. All departure trains and multiple arrival trains are non-depot trains.

[0043] 102. When multiple departure trains connect with a target arrival train in the parking area, the departure delay times for each departure train are determined. The target arrival train is any one of the multiple arrival trains. The departure delay time refers to the time when the departure train needs to depart later than the target arrival train when connecting with the target arrival train in the parking area.

[0044] 103. Based on the departure delay time and the preset minimum turnaround time corresponding to the target arrival train, select multiple candidate departure trains from multiple departure trains that meet the connection relationship with the target arrival train. The preset minimum turnaround time refers to the minimum time required for the target arrival train to pass through the parking area.

[0045] 104. Based on the departure delay time and parking area occupation time of multiple candidate departure trains corresponding to multiple arrival trains, establish a mixed integer programming model.

[0046] 105. Solve the mixed integer programming model to obtain the arrival and departure train numbers that have a succession relationship with multiple departure train numbers and multiple arrival train numbers.

[0047] 106. Adjust the train schedule based on the arriving and departing trains that have a connection to each other to obtain the target train schedule.

[0048] The undercarriage connection scheme provided in this application embodiment can be used to optimize the connection relationship of each undercarriage in the operation diagram to obtain the optimal undercarriage connection scheme. Specifically, when performing undercarriage connection processing on each train in the operation diagram, multiple departure trains and multiple arrival trains with the same parking area are first extracted from the operation diagram to be processed. All multiple departure trains and multiple arrival trains are non-depot trains.

[0049] In this context, "parking area" refers to the equivalent parking area at the train's starting turnaround point, the train's ending turnaround point, and cross-turnaround points in the train timetable. "Departure train number" refers to a train that departs from a parking area, and "arrival train number" refers to a train that travels to a parking area and then turns back. In this embodiment, the extracted non-depot-entry train numbers with the same parking area for both departure and arrival train numbers are not limited by whether their starting and ending points are the same, or whether their departure and arrival times are the same; they only require that the departure and arrival train numbers share the same parking area.

[0050] Furthermore, this embodiment does not limit the specific implementation method for extracting multiple departure trains and multiple arrival trains with the same parking area from the operation diagram to be processed. Those skilled in the art can set it according to specific application and design requirements. For example, multiple non-depot arrival trains and multiple non-depot departure trains can be obtained from the operation diagram to be processed. The multiple arrival trains can be grouped according to the train destination corresponding to each arrival train, and the arrival trains with the same train destination can be grouped into the same arrival train sequence to obtain multiple arrival trains corresponding to each destination. Similarly, multiple departure trains can be grouped according to the train origin corresponding to each departure train, and the departure trains with the same train origin can be grouped into the same departure train sequence to obtain multiple departure trains corresponding to each origin. Then, by comparing the train origin or train destination, the arrival trains and departure trains that meet the requirement of having the same parking area can be extracted from the multiple arrival trains corresponding to each destination and the multiple departure trains corresponding to each origin.

[0051] When performing continuity processing on a train schedule, to minimize adjustments to individual train sets within the schedule, the adjustment range can be determined first, and then the continuity processing can be performed on the trains within that range. Therefore, when extracting multiple departure and arrival trains with the same stopping area from the train schedule to be processed, only the multiple departure and arrival trains with the same stopping area within the adjustment range need to be extracted.

[0052] Specifically, in one optional embodiment, multiple non-depot arriving trains with unconnected destinations and multiple non-depot departing trains with unconnected origins in the operation diagram to be processed can be obtained first. Then, according to the train destinations corresponding to each arriving train, the non-depot arriving trains are grouped, with arriving trains having the same train destination grouped into the same arriving train sequence to obtain the arriving train sequence corresponding to each destination. Similarly, according to the train origins corresponding to each departing train, multiple non-depot departing trains are grouped, with departing trains having the same train origin grouped into the same departing train sequence to obtain the departing train sequence corresponding to each origin. Next, from the multiple arriving train sequences and multiple departing train sequences, target arriving train sequences and target departing train sequences that satisfy spatial continuity (same stopping area) are extracted. It also obtains the arriving and departing trains that have a spatial connection between two train sequences, breaks the connection between the arriving and departing trains, adds the arriving trains with the broken connection to the target arriving train sequence, and adds the departing trains with the broken connection to the target departing train sequence.

[0053] As described above, by obtaining multiple non-inbound arrival trains and multiple non-inbound departure trains that are not connected at the destination and at the starting point of the operation map to be processed, the range to be adjusted is determined. Multiple arrival trains and multiple departure trains that meet the spatial continuity relationship within the range to be adjusted are extracted and processed. Then, the multiple arrival trains and multiple departure trains that meet the spatial continuity relationship within the range to be adjusted are connected.

[0054] After obtaining multiple departure and arrival bus routes within the same parking area, the system determines the departure delay times for each departure bus when it connects with the target arrival bus within the parking area. The target arrival bus is any one of the multiple arrival buses, and the departure delay time refers to the time a departure bus needs to be delayed when connecting with the target arrival bus.

[0055] For example, if arriving train 1 and departing train 1 connect at parking area A, and the preset arrival time of arriving train 1 at parking area A is 10:00, and the preset departure time of departing train 1 from parking area A is 9:58, then if departing train 1 connects with arriving train 1 at parking area A, the departing train will depart after arriving train 1 arrives at parking area A. In this case, the actual departure time of the departing train will be later than the preset departure time. The time interval between the actual departure time and the preset departure time is the corresponding departure delay time of the departing train when it connects with the target arriving train at the parking area.

[0056] In addition, in this embodiment of the application, the departure delay time corresponding to the departure number cannot be delayed indefinitely, as this may affect subsequent trains. Therefore, in order to avoid the departure delay of the departure number affecting subsequent trains, the departure delay time corresponding to the multiple departure numbers is determined as the maximum possible delay time corresponding to the multiple departure numbers when the multiple departure numbers and the target arrival train are connected in the parking area.

[0057] The target arrival train can be any one of multiple arrival trains. The aforementioned method can be used to determine the departure delay times of each of the multiple departure trains when connecting with each arrival train in the parking area; these details will not be elaborated further here. Furthermore, since the connection processing for each arrival train is consistent with the connection processing for the target arrival train, this embodiment will use the specific processing for the target arrival train as an example.

[0058] In an optional embodiment, when multiple departure trains are determined to connect with a target arrival train in the parking area, the specific implementation method for the departure delay times corresponding to the multiple departure trains can be as follows: The departure delay times corresponding to the multiple departure trains are determined based on the preset arrival time of the target arrival train, the turnaround time of the target arrival train, and the preset departure time corresponding to each departure train. Here, the turnaround time refers to the time required for the target arrival train to pass through the parking area.

[0059] When multiple departure trains are determined to connect with the target arrival train in the parking area, and considering the departure delay times of each departure train, multiple candidate departure trains that satisfy the connection relationship with the target arrival train are selected from the multiple departure trains based on the departure delay times and the preset minimum turnaround time corresponding to the target arrival train. The preset minimum turnaround time refers to the minimum time required for the target arrival train to cross the parking area.

[0060] In practical applications, when arriving and departing trains connect within the same parking area, both spatial and temporal continuity relationships must be satisfied. Therefore, when selecting multiple candidate departing trains that satisfy these continuity relationships for each arriving train, both spatial and temporal continuity relationships must be met. Since the extracted departing trains and target arriving trains share the same parking area, thus satisfying the spatial continuity relationship, it is only necessary to select candidate departing trains that satisfy the temporal continuity relationship from among the multiple departing trains. Spatial continuity means that the arriving and departing trains share the same parking area, making it possible for them to connect within that parking area. Temporal continuity means that the departing train departs only after the arriving train has reached and passed through the parking area; that is, the departing train's preset departure time from the parking area must be greater than or equal to the sum of the arriving train's preset arrival time at the parking area and the preset minimum turnaround time for the arriving train to pass through the parking area.

[0061] In one optional embodiment, to maximize the fulfillment of continuity requirements, it is permissible for departures to be later than a preset departure time. That is, the continuity requirement can be that the sum of the preset departure time and the delayed departure time of a departure is greater than or equal to the sum of the preset arrival time of the arriving vehicle at the parking area and the preset minimum turnaround time for the arriving vehicle to cross the parking area. However, departures cannot be delayed indefinitely; that is, the delayed departure time cannot exceed the preset allowed delay time.

[0062] After selecting multiple candidate departure trains for each of the multiple arriving trains, a mixed-integer programming model is established based on the departure delay time and parking area occupation time of each candidate departure train. Here, the parking area occupation time of a candidate departure train refers to the time the candidate departure train spends in the parking area.

[0063] In this embodiment, when performing train connection processing on multiple arriving and departing trains in the operation diagram, the main objective is to solve the connection problem of minimizing connection time and train delay adjustments while maximizing the number of train connections. Therefore, the connection process can be transformed into a linear programming problem to solve for maximizing the number of train connections while minimizing the time candidate departing trains occupy parking areas and their departure delays. Thus, after selecting multiple candidate departing trains for each arriving train, a mixed-integer programming model can be established based on the departure delay times and parking area occupancy times of the candidate departing trains corresponding to each arriving train. A solver is then used to solve the mixed-integer programming model to obtain the optimal train connection scheme.

[0064] The departure delay time of a candidate train directly affects the adjustment of subsequent trains. A shorter departure delay time for a candidate train means fewer trains need to be adjusted, and the overall operational efficiency is improved. The time a candidate train occupies the parking area refers to the time it spends in the parking area. This time directly affects the connection time; the longer the time a candidate train occupies the parking area, the longer the connection time required. In other words, the time a candidate train occupies the parking area determines the connection time. Therefore, to improve connection efficiency, the time a candidate train occupies the parking area and its departure delay time need to be reduced.

[0065] In one optional embodiment, a mixed-integer programming model can be established based on the Big M method, with continuity constraints and continuity conflict constraints as conditions, aiming to maximize the number of connections, minimize the time spent occupying parking areas, and minimize train delays. Specifically, the continuity relationships between multiple arriving trains and multiple candidate departing trains are determined as decision variables, and the continuity constraints and continuity conflict constraints are determined as the constraints satisfied by the decision variables. The objective function is set according to the decision variables, the departure delay times of multiple candidate departing trains, and the time spent occupying parking areas. Here, the continuity constraint means that an arriving train can only connect with one departing train, and a departing train can only connect with one arriving train. The continuity conflict constraint means that a turnaround area can only be entered after the previous train has turned around and departed; that is, two connecting trains cannot be in the turnaround area simultaneously.

[0066] Next, the mixed integer programming model is solved to obtain the arrival and departure trains that have a succession relationship with multiple departure trains and multiple arrival trains. Based on the arrival and departure trains with succession relationships, the train schedule is adjusted to obtain the target train schedule. In this adjusted target train schedule, each train can satisfy the requirements of maximizing the number of succession trains, minimizing the delay time of departure trains, and minimizing the time occupied in the parking area.

[0067] In this embodiment, when multiple departure trains connect with a target arrival train in the parking area, the departure delay times corresponding to the multiple departure trains are determined. Based on the departure delay times and the preset minimum turnaround time corresponding to the target arrival train, multiple candidate departure trains that satisfy the connection relationship with the target arrival train are selected from the multiple departure trains. Based on the departure delay times and parking area occupation times of the multiple candidate departure trains corresponding to each of the multiple arrival trains, a mixed integer programming model is established. The mixed integer programming model is solved to obtain the arrival and departure trains that have a connection relationship with the multiple departure trains. That is, the train connection problem is transformed into a linear programming problem that maximizes the number of connections, minimizes the departure delay times, and minimizes the parking area occupation time. By solving the linear programming problem, a train connection scheme is obtained. The train connection scheme obtained in this way not only maximizes the use of train connections, but also reduces connection occupation time and train delay adjustments.

[0068] The above embodiments describe the specific implementation process of the train connection processing for each train in the operation diagram to be processed. When performing the train connection processing for each train, the departure delay time corresponding to each of the multiple departure trains and the target arrival train can be determined when they connect in the parking area. Based on the departure delay time corresponding to each of the multiple departure trains, multiple candidate departure trains that meet the time connection relationship with the target arrival train are selected from the multiple departure trains.

[0069] To facilitate understanding of the specific implementation process of determining the departure delay times of multiple departing trains when connecting with the target arriving train in the parking area, the above process is described in conjunction with the appendix. Figure 2 The specific implementation process of determining the departure delay time of each of the multiple departure trains when connecting with the target arrival train in the parking area is illustrated by an example.

[0070] Figure 2 This application provides a flowchart illustrating how to determine the departure delay times for multiple train services, as illustrated in the attached diagram. Figure 2 As shown in the embodiment of this application, a method is provided to determine the departure delay time of each of the multiple departure trains when they connect with a target arrival train in a parking area. Specifically, the method may include the following steps:

[0071] 201. Determine whether there is a connection between multiple departing trains after they each reach their respective destinations.

[0072] 202. If the first departing train has a connecting arriving train, then obtain the preset arrival time of the first departing train to the train's destination and the preset departure time of the connecting arriving train from the train's destination. The first departing train can be any one of the multiple departing trains.

[0073] 203. Determine the third difference between the preset departure time and the preset arrival time.

[0074] 204. Determine the fourth difference between the third difference and the preset minimum turnaround time. The turnaround time refers to the time required for a train to pass through the parking area corresponding to the train's destination.

[0075] 205. Obtain the preset maximum delay time corresponding to the first departure train.

[0076] 206. The smaller value between the fourth difference and the preset maximum delay time is determined as the departure delay time corresponding to the first departure train.

[0077] When processing the train connection of each train in the timetable, assuming that multiple departing trains can connect with the target arriving train, the departure delay time of each of the multiple departing trains can be determined according to the preset maximum delay time and the preset arrival time of the multiple departing trains to the train terminal.

[0078] Specifically, firstly, it is determined whether there are any connecting trains after the first train arrives at its destination. If there are connecting trains after the first train, the preset arrival time of the first train to the destination and the preset departure time of the connecting train from the destination are obtained. The first train can be any one of the multiple trains. Next, a third difference between the preset departure time and the preset arrival time is determined, and a fourth difference between the third difference and the preset minimum turnaround time is determined. The turnaround time refers to the time required for the train to pass through the stopping area corresponding to the destination. Then, the preset maximum allowable delay time for the first train is obtained, and the smaller value between the fourth difference and the preset maximum allowable delay time is determined as the departure delay time for the first train. Furthermore, if there are no connecting trains after the first train arrives at its destination, the preset maximum allowable delay time is directly determined as the departure delay time for the first train.

[0079] It should be noted that the third and fourth differences do not have specific meanings; they are simply named as such for ease of description. Furthermore, the departure delay times for other departure trains can be determined using the same method as when the first departure train connects with the target arrival train in the parking area, based on the departure delay time of the first departure train. This will not be elaborated upon further here.

[0080] When the first departing train connects with the target arriving train, a delayed departure of the first departing train will affect its arrival time at the destination, causing it to arrive later than the preset arrival time. Therefore, a delayed arrival of the first departing train will affect the departure times of other arriving trains connected to it. To avoid impacting subsequent trains with existing connections and to ensure the first departing train can connect with another arriving train after arriving at its destination, the delay time of the first departing train when connecting with the target arriving train cannot exceed the time exceeding the difference between the preset arrival time of the first departing train and the preset departure time of the other arriving train, provided that the difference satisfies the preset minimum turnaround time.

[0081] Furthermore, different preset maximum delay times are usually set for different routes. The delay time corresponding to the first departure train cannot exceed the preset maximum delay time. This is a hard limit set for each route.

[0082] In other words, when determining the connection between multiple departure and arrival trains in the parking area, the departure delay time for each departure train is determined by comprehensively considering the maximum allowable delay time for the current route and whether the delay of a departure train will affect the subsequent connecting trains. This results in a more accurate departure delay time and avoids impacting subsequent trains.

[0083] In specific implementation, in conjunction with the appendix Figure 3 This document explains the specific implementation process of the departure delay time for the first departing train when it is determined that the first departing train and the target arriving train will connect in the parking area. Assume that the target arriving train 1 connects with the first departing train 1 in parking area A, and the first departing train 1 connects with the arriving train 2 at the train's final destination B. The preset maximum delay time is 2 minutes, the preset minimum turnaround time is 1 minute, the preset arrival time of the target arriving train 1 at parking area A is T1, and the preset departure time of the first departing train 1 from parking area A is T2. Assume that the preset arrival time T3 of the first departing train 1 at the train's final destination is 10:00, and the preset departure time T4 of the arriving train 2 from the train's final destination is 10:04. First, the third difference between the preset departure time T4 of arriving train number 2 and the preset arrival time T3 of the first departing train number 1 is determined to be 4 minutes. The fourth difference between the third difference and the preset minimum turnaround time is determined to be 3 minutes. The fourth difference is compared with the preset maximum allowable delay time. The smaller value is determined as the departure delay time corresponding to the first departing train number 1 when the first departing train number 1 and the target arriving train number 1 connect in parking area A. That is, the departure delay time corresponding to the first departing train number 1 is 2 minutes.

[0084] In this embodiment, by determining the departure delay times of multiple departing trains when they connect with the target arriving train in the parking area based on the preset maximum allowable delay time and the preset arrival times of multiple departing trains to the train's destination, this not only effectively ensures the accuracy and reliability of obtaining the departure delay times of each of the multiple departing trains, but also ensures the accuracy of determining the multiple candidate departing trains corresponding to the target arriving train based on the departure delay times, further improving the stability and reliability of the method.

[0085] For two train services to achieve seamless connection, they need to satisfy not only spatial connection but also temporal connection. Therefore, after determining the departure delay times of multiple departure trains and the target arrival train in the parking area, multiple candidate departure trains that satisfy the connection relationship with the target arrival train can be selected from the multiple departure trains based on their respective departure delay times and the preset minimum turnaround time of the target arrival train.

[0086] To better understand the specific implementation process of selecting multiple candidate departure trains that satisfy the continuity relationship with the target arrival train from multiple departure trains, based on the departure delay times corresponding to multiple departure trains and the preset minimum turnaround time corresponding to the target arrival train, combined with the appendix... Figure 4 An exemplary description is provided of the specific implementation process for selecting multiple candidate departure trains that satisfy the connection relationship with the target arrival train.

[0087] Figure 4 This application provides a schematic diagram illustrating a process for selecting multiple candidate departure trains that satisfy a connection relationship with a target arrival train; see attached diagram. Figure 4 As shown in the embodiment of this application, a method is provided to select multiple candidate departure trains that satisfy the connection relationship with the target arrival train from multiple departure trains based on the departure delay time corresponding to multiple departure trains and the preset minimum turnaround time corresponding to the target arrival train. Specifically, the method may include the following steps:

[0088] 401. Obtain the first sum between the preset departure time and departure delay time of multiple departure routes from the parking area.

[0089] 402. Determine the fifth difference between the first sum value corresponding to each of the multiple departure trains and the preset arrival time of the target arrival train at the parking area.

[0090] 403. If the fifth difference corresponding to the second departure train among multiple departure trains is greater than or equal to the preset minimum turnaround time corresponding to the target arrival train, and the departure delay time of the second departure train is less than or equal to the preset maximum delay time, then the second departure train is determined as a candidate departure train that satisfies the connection relationship with the target arrival train. The second departure train refers to any one of the multiple departure trains.

[0091] When a target arrival train connects with multiple departure trains, a time continuity relationship must be maintained. To maximize this continuity, departure trains are allowed to depart later than their preset departure time. Specifically, the continuity relationship is defined as the sum of the preset departure time and the delayed departure time of the departing train being greater than or equal to the sum of the preset arrival time of the arrival train at the parking area and the preset minimum turnaround time for the arrival train to cross the parking area. However, departure trains cannot be delayed indefinitely; that is, the delayed departure time cannot exceed the preset maximum allowable delay time.

[0092] Therefore, when selecting multiple candidate departure trains that satisfy the connection relationship for the target arrival train, we can first determine whether the sum of the preset departure time and the departure delay time of the multiple departure trains is greater than or equal to the sum of the preset arrival time of the target arrival train to the parking area and the preset minimum turnaround time of the target arrival train to pass through the parking area.

[0093] Specifically, the process involves obtaining the first sum between the preset departure times and departure delay times of multiple departure routes from the parking area; determining the fifth difference between the first sum for each departure route and the preset arrival time of the target arrival route at the parking area; and identifying the second departure route as a candidate departure route if its fifth difference is greater than or equal to the preset minimum turnaround time of the target arrival route, and its departure delay time is less than or equal to the preset maximum allowable delay time. Here, "second departure route" refers to any one of the multiple departure routes.

[0094] In practical implementation, continuing with the above example, assume that arriving train number 1 is the target arriving train, with a preset arrival time of 10:00, a preset minimum turnaround time of 1 minute, and a preset maximum delay time of 2 minutes. Departure train number 1 has a preset departure time of 9:56 and a delay time of 2 minutes. Departure train number 2 has a preset departure time of 9:58 and a delay time of 2 minutes. Departure train number 3 has a preset departure time of 10:00 and a delay time of 1 minute.

[0095] First, the first sum between the preset departure time and departure delay time of departure train 1 is 9:58. The fifth difference between the first sum of departure train 1 and the preset arrival time of the target train is determined to be -2 minutes. Since this fifth difference is less than the preset minimum turnaround time of the target train, departure train 1 does not meet the time continuity requirement for connecting with the target train. Next, the first sum between the preset departure time and departure delay time of departure train 2 is 10:00. The fifth difference between the first sum of departure train 2 and the preset arrival time of the target train is determined to be 0 minutes. Since this fifth difference is less than the preset minimum turnaround time of the target train, departure train 2 does not meet the time continuity requirement for connecting with the target train. The first sum between the preset departure time and the departure delay time of departure train number 3 is 10:01. The fifth difference between the first sum corresponding to departure train number 3 and the preset arrival time of the target arrival train is determined to be 1 minute. The fifth difference is equal to the preset minimum turnaround time corresponding to the target arrival train. Then, departure train number 3 is determined as the candidate departure train corresponding to the target arrival train.

[0096] As described above, when selecting multiple candidate departure trains that satisfy the connection relationship with the arriving train, the consideration of time connection relationship is added, so that the two connecting trains not only satisfy the spatial connection relationship, but also the time connection relationship, so as to ensure that the multiple candidate departure trains obtained can be connected with the target arriving train.

[0097] Alternatively, in an optional embodiment, it can be first determined whether the departure delay times of multiple departure trains are less than or equal to a preset maximum allowable delay time. If the departure delay time of the target departure train among the multiple departure trains is less than or equal to the preset maximum allowable delay time, then a first sum between the preset departure time and departure delay time of the target departure train is obtained, and a fifth difference between the first sum corresponding to the target departure train and the preset arrival time of the target arrival train is determined. If the fifth difference corresponding to the target departure train is greater than or equal to the preset minimum turnaround time corresponding to the target arrival train, then the target departure train is determined as a candidate departure train that satisfies a connection relationship with the target arrival train. The target departure train refers to any one of the multiple departure trains. It can be set according to actual needs, and the execution order is not limited in this embodiment.

[0098] In this embodiment, by obtaining the first sum between the preset departure time and departure delay time of multiple departure trains, a fifth difference is determined between the first sum corresponding to each of the multiple departure trains and the preset arrival time of the target arrival train. If the fifth difference corresponding to one of the multiple departure trains is greater than or equal to the preset minimum turnaround time corresponding to the target arrival train, and the departure delay time of the target departure train is less than or equal to the preset maximum allowable delay time, then the target departure train is determined as a candidate departure train that satisfies the connection relationship with the target arrival train. This can effectively ensure the accuracy and reliability of obtaining multiple candidate departures, so as to ensure that the obtained multiple candidate departure trains can be connected with the target arrival train.

[0099] The above embodiments describe the specific implementation process of determining multiple candidate departure trains corresponding to each of the multiple arriving trains. After determining the multiple candidate departure trains corresponding to each of the multiple arriving trains, a mixed-integer programming model is established based on the departure delay time and parking area occupation time of the multiple candidate departure trains corresponding to each of the multiple arriving trains. To facilitate understanding of the specific implementation process of establishing a mixed-integer programming model based on the departure delay time and parking area occupation time of the multiple candidate departure trains corresponding to each of the multiple arriving trains in the above processing procedure, the appendix is ​​provided below. Figure 5 The specific implementation process of establishing a mixed integer programming model is illustrated by an example.

[0100] Figure 5 This application provides a flowchart illustrating the process of establishing a mixed-integer programming model; see attached diagram. Figure 5 As shown, this application provides an implementation method for establishing a mixed integer programming model based on the departure delay time and parking area occupation time of multiple candidate departure trains corresponding to multiple arrival trains. Specifically, the method may include the following steps:

[0101] 501. Determine the time each of the multiple candidate departure trains corresponding to the target arrival train occupies the parking area when connecting with the target arrival train.

[0102] 502. Based on the target arrival train and the multiple candidate departure trains corresponding to the target arrival train, determine the multiple decision variables corresponding to the target arrival train under the multiple candidate departure trains.

[0103] 503. Determine the objective function based on the various decision variables corresponding to multiple arrival trains, the departure delay time and parking area occupation time of multiple candidate departure trains.

[0104] 504. According to the preset rules, determine the first constraint conditions that the decision variables corresponding to the multiple arrival trains must satisfy. The preset rules are that each arrival train can only be connected with one departure train and each departure train can only be connected with one arrival train.

[0105] 505. Determine the first departure train and the first arrival train that have a time conflict with the target arrival train and the target candidate departure train. The target candidate departure train is any one of the multiple candidate departure trains corresponding to the target arrival train.

[0106] 506. Based on the first departure and first arrival trains with time conflicts, determine the second constraints that the decision variables corresponding to each of the multiple arrival trains need to satisfy.

[0107] 507. Based on the multiple decision variables, objective function, first constraint, and second constraint corresponding to each of the multiple arrival trains, establish a mixed integer programming model.

[0108] In this embodiment, a mixed-integer programming model can be constructed based on the Big M method. Specifically, firstly, the parking area occupancy time for each of the multiple candidate departure trains corresponding to the target arrival train is determined when they connect with the target arrival train. The parking area occupancy time refers to the time the candidate departure train spends in the parking area. In other words, after selecting the multiple candidate departure trains corresponding to the target arrival train, the parking area occupancy time for each candidate departure train is determined when they connect with the target arrival train in the parking area.

[0109] In an optional embodiment, the specific implementation process of determining the parking area occupation time of each of the multiple candidate departure trains corresponding to the target arrival train when connecting with the target arrival train may include: obtaining a first sum between the preset departure time and departure delay time of the multiple candidate departure trains from the parking area; determining a sixth difference between the first sum of the multiple candidate departure trains and the preset arrival time of the target arrival train at the parking area; and determining the sixth difference of the multiple departure trains as the parking area occupation time of the multiple departure trains.

[0110] In practice, assuming that train number 1 is the target arrival train, there are three candidate departure trains: candidate departure train number 1, candidate departure train number 2, and candidate departure train number 3. The preset arrival time of the target arrival train is 10:00. The preset departure time of candidate departure train number 1 is 10:00, with a delay of 1 minute. The preset departure time of candidate departure train number 2 is 10:01, with a delay of 2 minutes. The preset departure time of candidate departure train number 3 is 10:03, with a delay of 1 minute. First, the first sum between the preset departure time and the delay time of candidate departure train number 1 is obtained, which is 10:01. The sixth difference between the first sum of candidate departure train number 1 and the preset arrival time of the target arrival train is determined to be 1 minute. This sixth difference is determined as the time that candidate departure train number 1 occupies the parking area. Based on this method, the time spent occupying the parking area corresponding to candidate departure train number 2 and candidate departure train number 3 are calculated respectively.

[0111] In other words, when determining the time spent occupying the parking area corresponding to the candidate departure train, the departure delay time of the train is taken into consideration. This can maximize the satisfaction of connection needs and make the obtained parking area time more accurate, thereby improving the accuracy of the final connection plan.

[0112] After determining the parking area occupancy time of multiple candidate departure trains corresponding to the target arrival train when connecting with the target arrival train, and based on the target arrival train and its multiple candidate departure trains, determine multiple decision variables corresponding to the target arrival train under the corresponding multiple candidate departure trains. For example, target arrival train 1 has 3 candidate departure trains: candidate departure train 1, candidate departure train 2, and candidate departure train 3. The decision variables for target arrival train 1 under candidate departure train 1 are determined as follows: The decision variable corresponding to the target arrival train 1 under the candidate departure train 2 is: The decision variable corresponding to the target arrival train 1 under the candidate departure train 3 is: in, i represents the parking area i.

[0113] Next, the objective function is determined based on the multiple decision variables corresponding to each of the multiple arriving trains, the departure delay times and parking area occupancy times of the multiple candidate departure trains. Since the goal of train connection is to minimize parking area occupancy time and minimize departure delay time while maximizing connection, the objective function can be determined based on the multiple decision variables corresponding to each of the multiple arriving trains, the departure delay times and parking area occupancy times of the multiple candidate departure trains.

[0114] In an optional embodiment, the specific implementation process of determining the objective function based on multiple decision variables corresponding to multiple arriving trains, and the departure delay time and parking area occupation time of multiple candidate departure trains, may include: randomly selecting a maximum value; obtaining a first difference between the maximum value and the parking area occupation time of the target candidate departure train; obtaining a first product of the departure delay time of the target candidate departure train and a set coefficient; determining a second difference between the first difference and the first product; determining a second product of the second difference and a first decision variable; and determining the objective function based on the second product. Here, the first decision variable refers to the decision variable corresponding to the target arriving train under the target candidate departure trains.

[0115] In practice, assuming the randomly selected maximum value is M, the target arrival train number is n, the target candidate departure train number is m, and the departure delay time of the target candidate departure train number is... The time spent occupying the parking area is The first decision variable is The first difference between the maximum value and the time the target candidate train occupies the parking area is the value of the first difference. The first product of the departure delay time of the target candidate train and the set coefficient is obtained. The second difference between the first difference and the first product value is determined to be... The second product of the second difference and the first decision variable is determined to be... Based on the second product value corresponding to each of the multiple candidate departure trains, the objective function is determined as follows:

[0116] As can be seen from the above description, when setting the objective function, the time for departure delay and the time occupied in the parking area are taken into consideration. This helps to obtain the vehicle connection scheme with the maximum number of connections while minimizing the time for departure delay and the time occupied in the parking area.

[0117] Next, the constraints that the decision variables corresponding to multiple arriving trains need to satisfy are determined. In determining the constraints, not only connection constraints but also connection conflict constraints are considered. Based on the connection constraints, the first constraint that the multiple decision variables need to satisfy is determined, and based on the connection conflict constraints, the second constraint that the multiple decision variables need to satisfy is determined. Specifically, according to preset rules, the first constraint that the multiple decision variables corresponding to each of the multiple arriving trains need to satisfy is determined. The preset rules are that each arriving train can only connect with one departing train, and each departing train can only connect with one arriving train.

[0118] Next, the first departure train and the first arrival train that have a time conflict with the target arrival train and the target candidate departure train are determined. The target candidate departure train is any one of multiple candidate departure trains corresponding to the target arrival train. Based on the time-conflicting first departure train and first arrival train, the second constraints that the multiple decision variables corresponding to each of the multiple arrival trains must satisfy are determined. Here, a time conflict means that the preset departure time of the first departure train or the preset arrival time of the first arrival train is within the time interval between the preset arrival time of the target arrival train and the preset departure time of the target candidate departure train. The time conflict occurs when the target candidate departure train and the target arrival train are connected.

[0119] In an optional embodiment, the specific implementation process of determining the second constraints that need to be satisfied by multiple decision variables corresponding to multiple arriving trains based on the time-conflicting departure and arrival trains may include: obtaining the second decision variables corresponding to the time-conflicting arriving trains under the time-conflicting departure trains; and determining the second constraints that need to be satisfied by multiple decision variables corresponding to the target arriving train based on the maximum value, the first decision variable, and the second decision variable. That is, by adding consideration of connection conflict constraints when setting constraints, the accuracy of the final train connection result is improved, and the occurrence of turnaround conflicts can be avoided.

[0120] After determining the multiple decision variables, objective function, first constraint, and second constraint corresponding to each of the multiple arriving trains, a mixed integer programming model is established based on the multiple decision variables, objective function, first constraint, and second constraint corresponding to each of the multiple arriving trains.

[0121] As described above, when constructing the mixed integer programming model, the consideration of continuity constraints and continuity conflict constraints was added. The mixed integer programming model was constructed with the objectives of maximizing the number of continuity, minimizing the departure delay time, and minimizing the time occupied in the parking area. Solving the mixed integer programming model yields a vehicle bottom connection scheme that can maximize the use of vehicle bottom connections while reducing connection time and delay adjustments.

[0122] In this embodiment, multiple decision variables corresponding to the target arrival train under multiple candidate departure trains are determined. Based on the multiple decision variables corresponding to each arrival train, the departure delay time of the multiple candidate departure trains, and the time spent occupying parking areas, an objective function is determined. According to preset rules, a first constraint condition is determined for the multiple decision variables corresponding to each arrival train. Based on time-conflicting departure and arrival trains, a second constraint condition is determined for the multiple decision variables corresponding to each arrival train. Based on the multiple decision variables corresponding to each arrival train, the objective function, the first constraint condition, and the second constraint condition, a mixed-integer programming model is established. This model considers connection constraints and connection conflict constraints, aiming to maximize the number of connections, minimize departure delay time, and minimize parking area occupation time. Solving the mixed-integer programming model yields a train connection scheme. This train connection scheme maximizes the use of train connections while reducing connection occupation time and train delay adjustments.

[0123] To facilitate understanding of the specific process of handling the connection between each train in the operation diagram in the above embodiments, examples are provided in conjunction with specific application scenarios.

[0124] In practical applications, the first step is to obtain the running graph to be processed, as shown in the attached figure. Figure 6a The operation diagram shown is used to preprocess the operation to be processed, extracting multiple non-depot arriving trains with the same parking area but no consecutive destination, and multiple non-depot departing trains with no consecutive origin. Then, according to the train destination corresponding to each arriving train, the non-depot arriving trains are grouped, and arriving trains with the same train destination are grouped into the same arriving train sequence to obtain the arriving train sequence Arr corresponding to each destination. end Based on the train origin corresponding to each departure train, multiple non-depot departure trains are grouped, and departure trains with the same train origin are assigned to the same departure train sequence to obtain the departure train sequence Dep corresponding to each origin. start Next, from multiple arrival and departure train sequences, a target arrival train sequence Arr is extracted where the arrival and departure trains satisfy a spatial continuity relationship (same parking area). end ={0011105, 0021106, ..., 0081112} and the target departure train sequence Dep start ={0142105, 0152106, ..., 0212112}. And obtain the arriving and departing trains that have a spatial continuity relationship between two train sequences, then break the continuity relationship between the arriving and departing trains, such as... Figure 6aThe train numbers 0051109 and 0052108 in the shown timetable have a spatial connection. Disconnect the connection between the arriving and departing trains, as shown in the attached diagram. Figure 6b The processed operation diagram is shown below. Arriving trains with disconnected connections are added to the target arrival train sequence, and departing trains with disconnected connections are added to the target departure train sequence, resulting in the final target arrival train sequence: Arr end，1 ={0011105, 0021106, ..., 0081112}, and the final target departure sequence is: Dep start，1 ={0142105, 0152106, ..., 0212112}.

[0125] Next, when multiple departure trains connect with the target arrival train in the parking area, the departure delay times of the multiple departure trains are determined, and the target arrival train is any one of the multiple arrival trains. Based on the departure delay times and the preset minimum turnaround time corresponding to the target arrival train, multiple candidate departure trains that satisfy the connection relationship with the target arrival train are selected from the multiple departure trains.

[0126] For two train services to be connected, they must satisfy both spatial and temporal continuity. Therefore, to maximize the fulfillment of these continuity requirements, trains are allowed to depart later to meet the temporal continuity requirement. For example, the departure time of the m-th train might be delayed by... The preset departure time for the m-th train is The preset arrival time for the nth arriving train is The preset minimum turnaround time for the nth arriving train is: therefore and The two train services meet the time constraints. Then the two train services can be connected, meaning the m-th departure train is a candidate departure train for the n-th arrival train. Wherein, This indicates that in order to meet the departure delay time of the connecting train, the train delay cannot be unlimited. Therefore, the departure delay time of the train must be less than the preset maximum delay time.

[0127] After identifying multiple candidate departure trains corresponding to multiple arrival trains, a mixed integer programming model is established based on the departure delay time and parking area occupation time of the multiple candidate departure trains corresponding to each of the multiple arrival trains.

[0128] Specifically, first, multiple decision variables are established for multiple arriving trains. Based on the multiple arriving trains and their corresponding candidate departure trains, multiple decision variables are determined for each arriving train under its respective candidate departure train. For example, if arriving train 0011105 has a connection with the first departing train 0142105, then a decision variable is obtained. get The corresponding departure sequences for multiple candidate trains that satisfy the succession relationship are, i.e., the succession sequences are: Based on the successive sequence, determine multiple decision variables corresponding to the arriving train.

[0129] After obtaining multiple decision variables corresponding to multiple arrival trains, the objective function is determined based on the decision variables corresponding to each arrival train, the departure delay time of multiple candidate departure trains, and the time spent occupying the parking area. For example, the objective function can be set as: Where M is a randomly selected maximum value, n is the nth arriving train, and m is the mth departing train. Let m be the departure delay time of the m-th train. When the nth arriving train connects with the mth departing train, the time the mth departing train occupies the parking area is calculated. Let n be the decision variable for the nth arriving train and the mth departing train.

[0130] Then, first and second constraints are set for the decision variables corresponding to multiple arriving trains. Specifically, according to preset rules, the first constraints that the decision variables corresponding to each of the multiple arriving trains must satisfy are determined. The preset rules are that each arriving train can only connect with one departing train, and each departing train can only connect with one arriving train. That is, the decision variables corresponding to arriving train n satisfy the first constraints. The first constraint condition that the multiple decision variables corresponding to departure train number 1 satisfy is: in, Let represent the decision variable for the nth arriving train in the i-th arrival sequence (i.e., parking area i) under any k departure trains. Let represent the decision variable for any m arriving trains in the i-th arrival sequence (parking area i) under the first arriving train.

[0131] Identify the departure and arrival trains that conflict with both the target arrival train and the target candidate departure train. The target candidate departure train is any one of multiple candidate departure trains corresponding to the target arrival train. Based on the time-conflicting departure and arrival trains, determine the second constraints that each of the multiple arrival trains' corresponding decision variables must satisfy. That is, determine the trains that conflict with both the target arrival train n and the target candidate departure train m. The second constraint that needs to be satisfied by determining the multiple decision variables corresponding to the target arrival train is: M equals set The number of consecutive occurrences is increased by 1, that is... When the value is 1, none of its conflicting train numbers can be 1. When it is 0, the set The continuation in the value can take any value.

[0132] For example, appendix Figure 6b The decision variable corresponding to arrival train number 0011105 and departure train number 0162107 is: The arrival train 0021006 and departure train 0152016 have time conflicts with arrival train 0011105 and departure train 0162107, respectively. The decision variable for arrival trains with time conflicts is... The time conflict set is The decision variable corresponding to arrival train number 0011105 and departure train number 0162107 is: The second constraint that needs to be satisfied is The second constraint conditions that need to be satisfied are obtained in the same way for obtaining multiple decision variables corresponding to other arrival trains.

[0133] A mixed-integer programming model is established based on the multiple decision variables, objective function, first constraint, and second constraint corresponding to each of the multiple arrival trains. The mixed-integer programming model is solved to obtain the arrival and departure trains that have successive relationships with the multiple departure trains. Based on these successive arrival and departure trains, the train schedule is adjusted to obtain the target train schedule.

[0134] Specifically, multiple decision variables, the objective function, and the first and second constraints are input into the mixed-integer programming model solver to obtain the solution. Based on the solution, Perform connection processing on the arriving and departing train numbers in variable 1, and determine the target timetable, as shown in the attached figure. Figure 6c The target operation diagram is shown below. Trains arriving without consecutive arrivals are trains that need to be put into the depot, and trains departing without consecutive departures are trains that need to be taken out of the depot.

[0135] Figure 7 A schematic diagram of a vehicle undercarriage connection device provided as an exemplary embodiment of this application is shown below. Figure 7 As shown, the device includes: an extraction module 11, a determination module 12, a selection module 13, a creation module 14, a solution module 15, and an adjustment module 16;

[0136] Extraction module 11 is used to extract multiple departure trains and multiple arrival trains with the same parking area from the operation map to be processed, wherein the multiple departure trains and multiple arrival trains are all non-depot trains.

[0137] The determining module 12 is used to determine the departure delay time corresponding to each of the plurality of departure trains when the plurality of departure trains and the target arrival train are connected in the parking area. The target arrival train is any one of the plurality of arrival trains. The departure delay time refers to the time when the departure train needs to depart later when the departure train and the target arrival train are connected in the parking area.

[0138] Selection module 13 is used to select multiple candidate departure trains that satisfy the connection relationship with the target arrival train from the multiple departure trains based on the departure delay time and the preset minimum turnaround time corresponding to the target arrival train. The preset minimum turnaround time refers to the minimum time required for the target arrival train to pass through the parking area.

[0139] Module 14 is used to establish a mixed integer programming model based on the departure delay time and parking area occupation time of the multiple candidate departure trains corresponding to the multiple arrival trains.

[0140] The solution module 15 is used to solve the mixed integer programming model to obtain the arrival and departure trains that have a succession relationship with the multiple departure trains and the multiple arrival trains.

[0141] The adjustment module 16 is used to adjust the train schedule according to the arriving and departing trains that have a connection relationship, so as to obtain the target train schedule.

[0142] In an optional embodiment, the establishment module 14 may be specifically used to: determine the parking area occupancy time of each of the multiple candidate departure trains corresponding to the target arrival train when connecting with the target arrival train; determine multiple decision variables corresponding to the target arrival train under the corresponding multiple candidate departure trains based on the target arrival train and the multiple candidate departure trains corresponding to the target arrival train; and determine the objective function based on the multiple decision variables corresponding to each of the multiple arrival trains, the departure delay time and parking area occupancy time of the multiple candidate departure trains.

[0143] According to preset rules, first constraints are determined for the decision variables corresponding to each of the multiple arriving trains. These preset rules stipulate that each arriving train can only connect with one departing train, and each departing train can only connect with one arriving train. Trains that conflict with the target arriving train and the target candidate departing train are identified. The target candidate departing train is any one of the multiple candidate departing trains corresponding to the target arriving train. A time conflict occurs when the preset departure time of the conflicting departing train or the preset arrival time of the conflicting arriving train falls within the time interval between the preset arrival time of the target arriving train and the preset departure time of the target candidate departing train. The time conflict occurs when the target candidate departing train connects with the target arriving train. Based on the conflicting departing and arriving trains, second constraints are determined for the decision variables corresponding to each of the multiple arriving trains.

[0144] A mixed integer programming model is established based on the multiple decision variables corresponding to each of the multiple arrival trains, the objective function, the first constraint, and the second constraint.

[0145] In an optional embodiment, the establishment module 14 may be specifically used to: randomly select a maximum value; obtain a first difference between the maximum value and the time the target candidate departure train occupies the parking area; obtain a first product of the departure delay time of the target candidate departure train and a set coefficient; determine a second difference between the first difference and the first product; determine a second product of the second difference and a first decision variable, wherein the first decision variable refers to the decision variable corresponding to the target arrival train under the target candidate departure train; and determine an objective function based on the second product.

[0146] In an optional embodiment, the establishment module 14 can be specifically used to: obtain the second decision variable corresponding to the arrival train of the time conflict under the departure train of the time conflict; and determine the second constraint conditions that the multiple decision variables corresponding to the target arrival train need to satisfy based on the maximum value, the first decision variable and the second decision variable.

[0147] In an optional embodiment, the determining module 12 may specifically be used to: determine whether there are any connecting trains after the first train arrives at the train's destination; if there are connecting trains for the first train, obtain the preset arrival time of the first train arriving at the train's destination and the preset departure time of the connecting train departing from the train's destination, wherein the first train is any one of the multiple trains; determine a third difference between the preset departure time and the preset arrival time; determine a fourth difference between the third difference and a preset minimum turnaround time, wherein the turnaround time refers to the time required for the train to pass through the parking area corresponding to the train's destination; obtain the preset maximum allowable delay time corresponding to the first train; and determine the smaller of the fourth difference and the preset maximum allowable delay time as the departure delay time corresponding to the first train.

[0148] In an optional embodiment, the selection module 13 may be specifically used to: obtain a first sum between the preset departure time and departure delay time of the plurality of departure buses from the parking area; determine a fifth difference between the first sum corresponding to each of the plurality of departure buses and the preset arrival time of the target arrival bus arriving at the parking area; if the fifth difference corresponding to the second departure bus among the plurality of departure buses is greater than or equal to the preset minimum turnaround time corresponding to the target arrival bus, and the departure delay time of the second departure bus is less than or equal to the preset maximum allowable delay time, then the second departure bus is determined as a candidate departure bus that satisfies a connection relationship with the target arrival bus, wherein the second departure bus refers to any one of the plurality of departure buses.

[0149] In an optional embodiment, the establishing module 14 may further be used to: obtain a first sum between the preset departure time and departure delay time of the plurality of candidate departure buses from the parking area; determine a sixth difference between the first sum corresponding to each of the plurality of candidate departure buses and the preset arrival time of the target arrival bus arriving at the parking area; and determine the sixth difference corresponding to each of the plurality of departure buses as the parking area occupation time corresponding to each of the plurality of departure buses.

[0150] Figure 7 The device shown can perform the steps described in the foregoing embodiments. For detailed execution process and technical effects, please refer to the description in the foregoing embodiments, which will not be repeated here.

[0151] In one possible design, the above Figure 7 The structure of the undercarriage connection device shown can be implemented as an electronic device, such as... Figure 8As shown, the electronic device may include: a memory 22, a processor 21, and a communication interface 23. The memory 22 stores executable code, which, when executed by the processor 21, enables the processor 21 to at least implement the undercarriage splicing method provided in the foregoing embodiments.

[0152] In addition, embodiments of the present invention provide a non-transitory machine-readable storage medium storing executable code, which, when executed by a processor of an electronic device, enables the processor to at least implement the undercarriage splicing method provided in the foregoing embodiments.

[0153] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code. The solutions in the embodiments of this application can be implemented in various computer languages, such as C, VHDL, Verilog, the object-oriented programming language Java, and the interpreted scripting language JavaScript.

[0154] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this application. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart... Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0155] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0156] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0157] Furthermore, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of this application, "multiple" means at least two, such as two, three, etc., unless otherwise explicitly specified.

Claims

1. A method for splicing the undercarriage of a vehicle, characterized in that, include: Extract multiple departure and arrival bus routes with the same parking area from the operation map to be processed. All of the multiple departure and arrival bus routes are non-depot bus routes. When it is determined that the plurality of departure trains and the target arrival train are connected in the parking area, the departure delay time corresponding to the plurality of departure trains is determined. The target arrival train is any one of the plurality of arrival trains. The departure delay time refers to the time when the departure train needs to be delayed when it is connected to the target arrival train in the parking area. Based on the departure delay time and the preset minimum turnaround time corresponding to the target arrival train, multiple candidate departure trains that satisfy the connection relationship with the target arrival train are selected from the multiple departure trains. The preset minimum turnaround time refers to the minimum time required for the target arrival train to pass through the parking area. A mixed integer programming model is established based on the departure delay time and parking area occupation time of the multiple candidate departure trains corresponding to the multiple arrival trains. Solve the mixed integer programming model to obtain the arrival and departure train numbers that have a succession relationship with the multiple departure train numbers and the multiple arrival train numbers; The train schedule is adjusted based on the arriving and departing trains that have a connection to each other in order to obtain the target train schedule.

2. The method according to claim 1, characterized in that, The step of establishing a mixed-integer programming model based on the departure delay time and parking area occupation time of the multiple candidate departure trains corresponding to the multiple arrival trains includes: Determine the time each of the multiple candidate departure trains corresponding to the target arrival train occupies the parking area when connecting with the target arrival train; Based on the target arrival train and the multiple candidate departure trains corresponding to the target arrival train, determine multiple decision variables corresponding to the target arrival train under the multiple candidate departure trains; The objective function is determined based on the multiple decision variables corresponding to each of the multiple arriving trains, the departure delay time of the multiple candidate departure trains, and the time occupied in the parking area. According to preset rules, the first constraint conditions that each of the multiple decision variables corresponding to the multiple arriving trains must satisfy are determined. The preset rules are that each arriving train can only be connected to one departing train and each departing train can only be connected to one arriving train. Identify departure and arrival trains that have time conflicts with the target arrival train and the target candidate departure train. The target candidate departure train is any one of multiple candidate departure trains corresponding to the target arrival train. The time conflict refers to the time interval between the preset departure time of the time-conflicting departure train or the preset arrival time of the time-conflicting arrival train and the preset departure time of the target arrival train and the target candidate departure train. The time conflict occurs when the target candidate departure train and the target arrival train are connected. Based on the departure and arrival train numbers of the time conflict, determine the second constraints that the decision variables corresponding to each of the multiple arrival train numbers need to satisfy; A mixed integer programming model is established based on the multiple decision variables corresponding to each of the multiple arrival trains, the objective function, the first constraint, and the second constraint.

3. The method according to claim 2, characterized in that, The objective function is determined based on the various decision variables corresponding to the multiple arriving trains, the departure delay time of the multiple candidate departure trains, and the time spent occupying the parking area, including: Randomly select a maximum value; Obtain the first difference between the maximum value and the time the target candidate departure train occupies the parking area; Obtain the first product of the departure delay time of the target candidate departure train and a set coefficient; Determine a second difference between the first difference and the first product value; Determine the second product value of the second difference and the first decision variable, where the first decision variable refers to the decision variable corresponding to the target arrival train number under the target candidate departure train number; The objective function is determined based on the second product value.

4. The method according to claim 3, characterized in that, The step of determining the second constraint conditions that need to be satisfied by the multiple decision variables corresponding to each of the multiple arrival trains based on the departure and arrival trains with time conflicts includes: Obtain the second decision variable corresponding to the arrival train of the time conflict under the departure train of the time conflict; Based on the maximum value, the first decision variable, and the second decision variable, determine the second constraint conditions that the multiple decision variables corresponding to the target arrival train need to satisfy.

5. The method according to claim 1, characterized in that, When determining that the plurality of departing trains and the target arriving train will connect in the parking area, the departure delay times corresponding to the plurality of departing trains include: Determine whether there is a connecting relationship between the multiple departing trains after they each reach their respective train destinations; If the first departing train has a connecting arriving train, then obtain the preset arrival time of the first departing train to the train's destination and the preset departure time of the connecting arriving train from the train's destination, wherein the first departing train is any one of the plurality of departing trains. Determine a third difference between the preset departure time and the preset arrival time; Determine a fourth difference between the third difference and the preset minimum turnaround time, wherein the turnaround time refers to the time required for the departing train to pass through the parking area corresponding to the train's terminus; Get the preset maximum possible delay time for the first departure train; The smaller value between the fourth difference and the preset maximum allowable delay time is determined as the departure delay time corresponding to the first departure train.

6. The method according to claim 1, characterized in that, The step of selecting multiple candidate departure trains from the multiple departure trains that satisfy a connection relationship with the target arrival train, based on the departure delay time and the preset minimum turnaround time corresponding to the target arrival train, includes: Obtain the first sum between the preset departure time and departure delay time of each of the multiple departure routes from the parking area; Determine the fifth difference between the first sum value corresponding to each of the plurality of departure times and the preset arrival time of the target arrival time at the parking area; If the fifth difference corresponding to the second departure train among the plurality of departure trains is greater than or equal to the preset minimum turnaround time corresponding to the target arrival train, and the departure delay time of the second departure train is less than or equal to the preset maximum delay time, then the second departure train is determined as a candidate departure train that satisfies the connection relationship with the target arrival train. The second departure train refers to any one of the plurality of departure trains.

7. The method according to claim 2, characterized in that, The determination of the parking area occupancy time for each of the multiple candidate departure trains corresponding to the target arrival train when connecting with the target arrival train includes: Obtain the first sum between the preset departure time and departure delay time of each of the multiple candidate departure routes from the parking area; Determine the sixth difference between the first sum value corresponding to each of the multiple candidate departure trains and the preset arrival time of the target arrival train at the parking area; The sixth difference corresponding to each of the multiple departure trains is determined as the time the train occupies the parking area for each of the multiple departure trains.

8. A vehicle undercarriage connection device, characterized in that, include: The extraction module is used to extract multiple departure and arrival trains with the same parking area from the operation map to be processed, wherein the multiple departure and arrival trains are all non-depot trains; The determining module is used to determine the departure delay time corresponding to each of the multiple departure trains when the multiple departure trains and the target arrival train are connected in the parking area. The target arrival train is any one of the multiple arrival trains. The departure delay time refers to the time when the departure train needs to be delayed when it is connected to the target arrival train in the parking area. The selection module is used to select multiple candidate departure trains that satisfy the connection relationship with the target arrival train from the multiple departure trains based on the departure delay time and the preset minimum turnaround time corresponding to the target arrival train. The preset minimum turnaround time refers to the minimum time required for the target arrival train to pass through the parking area. A module is established to build a mixed integer programming model based on the departure delay time and parking area occupation time of the multiple candidate departure trains corresponding to the multiple arrival trains; The solution module is used to solve the mixed integer programming model to obtain the arrival and departure trains that have a succession relationship with the multiple departure trains and the multiple arrival trains. The adjustment module is used to adjust the train schedule based on the arriving and departing trains that have a connection relationship, so as to obtain the target train schedule.

9. An electronic device, characterized in that, include: Memory; processor; as well as Computer programs; The computer program is stored in the memory and configured to be executed by the processor to implement the undercarriage splicing method as described in any one of claims 1-7.

10. A computer-readable storage medium, characterized in that, It stores a computer program; the computer program is executed by a processor to implement the undercarriage splicing method as described in any one of claims 1-7.

Images