A clearing method, device, terminal equipment and storage medium

Abstract

The present invention discloses a sorting method, apparatus, terminal device, and storage medium. The method includes: determining a starting station and an ending station in a line network diagram; determining a first valid path with the minimum total impedance between the starting station and the ending station based on the impedance value between two adjacent stations in the line network diagram; adjusting the impedance value between two adjacent stations in the first valid path, and determining N second valid paths between the starting station and the ending station based on the impedance values ​​between all two adjacent stations after the adjustment; selecting K third valid paths from the first valid path and the second valid path, where K is less than or equal to N+1; establishing a station sorting model based on the third valid path, the station sorting model including multiple parameters to be determined; calculating the parameters to be determined based on the travel parameters of the third valid path, obtaining a target sorting model, and performing sorting using the target sorting model. The embodiments of the present invention solve the technical problem of low sorting efficiency in the prior art.

Description

Technical Field

[0001] The embodiments of the present application relate to the field of clearing, and in particular to a clearing method, apparatus, terminal device and storage medium. Background Art

[0002] With the expansion of subway lines, the complexity of subway network maps has increased dramatically, and subway ticketing services have become more and more diversified, making the settlement of subway tickets a key issue in the field of rail transit.

[0003] Current rail transit clearing technology lacks effective path algorithms for complex line network systems. Commonly used traversal methods often consume large computing resources, resulting in excessively long clearing times and greatly reducing clearing efficiency.

[0004] In summary, in the prior art, the selection process of an effective path takes a long time, resulting in a technical problem of low clearing efficiency. Summary of the Invention

[0005] The embodiments of the present invention provide a clearing method, apparatus, terminal device and storage medium, which solve the technical problem in the prior art that the effective path selection process takes a long time, resulting in low clearing efficiency.

[0006] In a first aspect, an embodiment of the present invention provides a clearing method, comprising the following steps:

[0007] Determine the start and end sites in the online network diagram;

[0008] Determine, based on the impedance value between two adjacent stations in the network diagram, a first valid path with the minimum total impedance value between the starting station and the ending station;

[0009] Adjusting the impedance value between two adjacent sites in the first valid path, and determining N second valid paths between the starting site and the ending site based on the adjusted impedance values ​​between all two adjacent sites;

[0010] Selecting K third valid paths from the first valid path and the second valid path, where K is less than or equal to N+1;

[0011] Establishing a site clearing model according to the third valid path, wherein the site clearing model includes a plurality of parameters to be determined;

[0012] The parameters to be determined are calculated based on the travel parameters of the third effective path to obtain a target clearing model, and the clearing is performed using the target clearing model.

[0013] Preferably, the specific process of determining the first valid path with the minimum total impedance between the starting site and the ending site based on the first impedance value between two adjacent sites in the network diagram is:

[0014] Determine all accessible paths between the starting site and the ending site;

[0015] Calculating the total impedance value of each of the passage paths according to the impedance values ​​between two adjacent stations in the line network diagram;

[0016] The travel path with the smallest total impedance value is used as the first valid path between the starting site and the ending site.

[0017] Preferably, the specific process of adjusting the impedance value between two adjacent sites in the first valid path and determining N second valid paths between the starting site and the ending site based on the impedance values ​​between all two adjacent sites after the adjustment is:

[0018] Initializing a valid path set and a deviation path set, adding the first valid path to the valid path set, and setting the number of second valid paths in the valid path set to N;

[0019] An iterative step is performed, wherein the specific process of the iterative step is as follows: the impedance value between two adjacent sites in the first valid path is adjusted to infinity in sequence, and a deviated path is determined each time based on the impedance value between all two adjacent sites after the adjustment, and the deviated path is placed in the deviated path set; a second valid path is selected from the deviated paths in the deviated path set and placed in the valid path set; the second valid path is used as the first valid path, and the iterative step is re-performed until N second valid paths are obtained.

[0020] Preferably, the specific process of the iterative step is:

[0021] In the first valid path, the impedance value between the i-th station and the i-1-th station is set to infinity, and the station before the i-th station is used as a necessary station of the deviated path. Based on the necessary stations and the impedance values ​​between all two adjacent stations after adjustment, a deviated path with the minimum total impedance between the starting station and the ending station is determined, and the deviated path is added to the deviated path set. Let i = i + 1, and the iterative step is repeated until the i-1-th station is the last station in the first valid path; wherein i = 2 when the iterative step is first performed;

[0022] Selecting a deviation path with the smallest total impedance value from the deviation path set as a second valid path, removing the second valid path from the deviation path set, and adding the second valid path to the valid path set;

[0023] Determining whether the number of the second valid paths in the valid path set is N;

[0024] If not, taking the second valid path as the first valid path and re-performing the iterative step;

[0025] If so, obtain N second valid paths according to the valid path set.

[0026] Preferably, the specific process of selecting K third valid paths from the first valid path and the second valid path is:

[0027] K third valid paths are selected from the first valid path and the second valid path according to a preset size difference function.

[0028] Preferably, the specific process of selecting K third valid paths from the first valid path and the second valid path according to the preset size difference function is:

[0029] determining a maximum difference percentage between effective path impedances based on a preset size difference function, the first effective path, and the second effective path;

[0030] K third effective paths are selected from the first effective path and the second effective path according to the maximum difference percentage between the effective path impedances.

[0031] Preferably, the specific process of calculating the to-be-determined parameter based on the travel parameter of the third effective path to obtain the target clearing model is:

[0032] obtaining a quantized vector of the third effective path based on a run parameter of the third effective path;

[0033] The parameters to be determined of the site clearing model are calculated according to the quantized vector to obtain a target clearing model.

[0034] Preferably, the specific process of obtaining the quantized vector of the third effective path based on the run parameter of the third effective path is:

[0035] quantizing the stroke parameters to obtain quantized stroke parameters;

[0036] Initializing parameters to be determined in the site clearing model, inputting the quantized travel parameters of the third valid path into the site clearing model, and obtaining a utility vector of the third valid path;

[0037] A quantization vector of the third effective path is obtained according to the utility vector of the third effective path.

[0038] Preferably, the specific process of calculating the parameters to be determined of the site clearing model according to the quantized vector to obtain the target clearing model is:

[0039] The quantization vector is calibrated to obtain a calibrated quantization vector, and the parameters to be determined of the site classification model are calculated based on the calibrated quantization vector to obtain a target classification model.

[0040] Preferably, the specific process of using the target clearing model for clearing is:

[0041] Calculating a target quantization vector for each of the third valid paths according to the target classification model;

[0042] According to the target quantization vector, the line clearing ratio of each fixed train line is calculated, and clearing is performed according to the line clearing ratio.

[0043] In a second aspect, an embodiment of the present invention provides a clearing device, including a site determination module, a first valid path determination module, a second valid path determination module, a third valid path determination module, a clearing model establishment module, and a clearing module;

[0044] The site determination module is used to determine the starting site and the ending site in the online network map;

[0045] The first valid path determination module is configured to determine a first valid path with the minimum total impedance between the starting station and the ending station according to the impedance value between two adjacent stations in the network diagram;

[0046] The second valid path determination module is used to adjust the impedance value between two adjacent sites in the first valid path, and determine N second valid paths between the starting site and the ending site based on the adjusted impedance values ​​between all two adjacent sites;

[0047] The third valid path determination module is configured to select K third valid paths from the first valid path and the second valid path, where K is less than or equal to N+1;

[0048] The clearing model establishing module is used to establish a site clearing model according to the third valid path, wherein the site clearing model includes a plurality of parameters to be determined;

[0049] The clearing module is used to calculate the parameters to be determined based on the travel parameters of the third valid path, obtain a target clearing model, and use the target clearing model to perform clearing.

[0050] In a third aspect, an embodiment of the present invention provides a terminal device, the terminal device including a processor and a memory;

[0051] The memory is used to store a computer program and transmit the computer program to the processor;

[0052] The processor is configured to execute a clearing method as described in the first aspect according to instructions in the computer program.

[0053] In a fourth aspect, an embodiment of the present invention provides a storage medium storing computer-executable instructions, which, when executed by a computer processor, are used to execute a clearing method as described in the first aspect.

[0054] As described above, an embodiment of the present invention provides a clearing method, apparatus, terminal device and storage medium, and the method includes the following steps: determining a starting station and an ending station in a line network diagram; determining a first valid path with the minimum total impedance value between the starting station and the ending station based on the impedance value between two adjacent stations in the line network diagram; adjusting the impedance value between two adjacent stations in the first valid path, and determining N second valid paths between the starting station and the ending station based on the impedance value between all two adjacent stations after adjustment; selecting K third valid paths from the first valid path and the second valid path, where K is less than or equal to N+1; establishing a station clearing model based on the third valid path, the station clearing model including multiple parameters to be determined; calculating the parameters to be determined based on the travel parameters of the third valid path, obtaining a target clearing model, and using the target clearing model for clearing.

[0055] An embodiment of the present invention provides a clearing method. When selecting a valid path during the clearing process, based on the first valid path with the smallest impedance value, the impedance value between two adjacent sites in the first valid path is dynamically adjusted, and according to the impedance values ​​between all two adjacent sites after the adjustment, a second valid path is selected from the line network diagram, and then a third valid path is selected from the first valid path and the second valid path, thereby avoiding traversal calculation of the entire network cable, greatly improving the efficiency of selecting the valid path and shortening the time, improving the clearing efficiency, and solving the technical problem in the prior art of low clearing efficiency due to the long time consumed in the effective path selection process. BRIEF DESCRIPTION OF THE DRAWINGS

[0056] Figure 1 The present invention provides a flowchart of a clearing method.

[0057] Figure 2 A schematic diagram of a wire mesh diagram provided in an embodiment of the present invention.

[0058] Figure 3 Schematic diagram of the first valid path in the network diagram.

[0059] Figure 4 Schematic diagram of a second valid path in the network diagram.

[0060] Figure 5 Schematic diagram of a second valid path in the network diagram.

[0061] Figure 6 Schematic diagram of a second valid path in the network diagram.

[0062] Figure 7 A schematic structural diagram of a sorting device provided in an embodiment of the present invention.

[0063] Figure 8 A schematic structural diagram of a terminal device provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0064] The following description and accompanying drawings sufficiently illustrate specific embodiments of the present application to enable those skilled in the art to practice them. The examples represent only possible variations. Unless explicitly required, individual components and functions are optional, and the order of operations may vary. Portions and features of some embodiments may be included in or replace portions and features of other embodiments. The scope of the embodiments of the present application includes the entire scope of the claims, as well as all available equivalents of the claims. In this document, each embodiment may be referred to individually or collectively by the term "invention," which is merely for convenience and is not intended to automatically limit the scope of the application to any single invention or inventive concept if more than one invention is actually disclosed. In this document, relational terms such as first and second, etc., are used solely to distinguish one entity or operation from another, and do not require or imply any actual relationship or order between these entities or operations. Furthermore, the terms "comprise," "include," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, or terminal device comprising a series of elements includes not only those elements, but also other elements not explicitly listed. The various embodiments herein are described in a progressive manner, with each embodiment focusing on the differences from the other embodiments. Reference can be made to the common and similar parts between the various embodiments. For structures, products, etc. disclosed in the embodiments, the description is relatively simple because they correspond to the parts disclosed in the embodiments. For relevant parts, refer to the method description.

[0065] Example 1

[0066] like Figure 1 As shown, Figure 1This is a flow chart of a sorting method provided by an embodiment of the present invention. The sorting method provided by an embodiment of the present invention can be executed by a sorting device, which can be implemented through software and / or hardware. The sorting device can be composed of two or more physical entities, or it can be composed of a single physical entity. For example, the sorting device can be a computer, a host computer, a tablet, or other device. The method includes the following steps:

[0067] Step 101: Determine the starting site and the ending site in the online network diagram.

[0068] In this embodiment, it is first necessary to determine the starting station and the ending station in the rail transit network diagram. It can be understood that the starting station and the ending station can be selected according to actual needs. In this embodiment, the starting station and the ending station are not limited.

[0069] Step 102: Determine a first valid path with the minimum total impedance between the starting site and the ending site based on the impedance between two adjacent sites in the network diagram.

[0070] After determining the starting and ending stations, the impedance value between two adjacent stations in the network diagram is calculated. Then, based on the impedance value between the two adjacent stations in the network diagram, a first valid path with the minimum total impedance between the starting and ending stations is determined. For example, in one embodiment, after calculating the impedance value between the two adjacent stations, based on the impedance value between the two adjacent stations on each pass path between the starting and ending stations, the pass path with the minimum total impedance is selected as the first valid path.

[0071] Based on the above embodiment, the specific process of determining the first valid path with the minimum total impedance between the starting site and the ending site based on the first impedance value between two adjacent sites in the network diagram in step 102 is performed from step 1021 to step 1023, specifically as follows:

[0072] Step 1021: Determine all travel paths between the starting site and the ending site.

[0073] First, all the travel paths between the starting and ending stations are determined in the online network diagram.

[0074] Step 1022: Calculate the total impedance value of each pass path based on the impedance value between two adjacent stations in the network diagram.

[0075] After all the traffic paths are determined, the total impedance value of each traffic path is calculated based on the impedance value between two adjacent stations in the network diagram.

[0076] Step 1023: The travel path with the smallest total impedance value is used as the first valid path between the starting site and the ending site.

[0077] After calculating the total impedance value of each pass path, the pass path with the smallest total impedance value is selected from all the pass paths as the first valid path between the starting site and the ending site.

[0078] For example, in one embodiment, the wire mesh diagram is as follows Figure 2 As shown, in Figure 2 The starting site is designated as site S and the ending site is designated as site T. Figure 2 The figure shows the impedance values ​​between the nine sites and each site. The impedance from site S to site B is 5, the impedance from site B to site C is 23, the impedance from site S to site D is 16, the impedance from site B to site E is 30, the impedance from site C to site F is 17, the impedance from site D to site E is 12, the impedance from site E to site F is 13, the impedance from site D to site G is 18, the impedance from site E to site H is 23, the impedance from site F to site T is 15, the impedance from site G to site H is 21, and the impedance from site H to site T is 11. By calculating the total impedance value of each path between site S and site T, we find that the path with the minimum total impedance is SDEFT, with a total impedance of 56. Therefore, path SDEFT is selected as the first valid path, as shown in Figure 3 shown.

[0079] Step 103: Adjust the impedance value between two adjacent sites in the first valid path, and determine N second valid paths between the starting site and the ending site based on the adjusted impedance values ​​between all two adjacent sites.

[0080] After obtaining the first valid path, the impedance values ​​between two adjacent stations in the first valid path are sequentially adjusted. After each adjustment of the impedance value between two adjacent stations in the first valid path, a second valid path with the smallest total impedance value is reselected from all available paths between the starting station and the ending station until N second valid paths are selected. It will be appreciated that the specific value of N can be set according to actual needs and is not limited in this embodiment.

[0081] Based on the above embodiment, the specific process of adjusting the impedance value between two adjacent stations in the first valid path in step 103 and determining N second valid paths between the starting station and the ending station based on the adjusted impedance values ​​between all two adjacent stations is performed by steps 1031 and 1032, which are specifically as follows:

[0082] Step 1031: Initialize the valid path set and the deviation path set, put the first valid path into the valid path set, and set the number of second valid paths in the valid path set to N.

[0083] In this embodiment, a valid path set and a deviation path set are first created, and the valid path set and the deviation path set are initialized, and the number of second valid paths in the valid path set is set to N.

[0084] Step 1032: Execute the iteration step. The specific process of the iteration step is as follows: sequentially adjust the impedance value between two adjacent stations in the first valid path to infinity, and each time determine a deviated path based on the impedance value between all two adjacent stations after adjustment, add the deviated path to the deviated path set, select a second valid path from the deviated paths in the deviated path set and add it to the valid path set, use the second valid path as the first valid path, and repeat the iteration step until N second valid paths are obtained.

[0085] After initializing the valid path set and the deviation path set, an iterative step is performed to sequentially adjust the impedance value between two adjacent stations in the first valid path to infinity. After each adjustment of the impedance value between two adjacent stations to infinity, the deviation path between the starting station and the ending station is determined based on the impedance values ​​between all two adjacent stations in the network diagram, and the deviation path is placed in the deviation path set. After traversing all two adjacent stations in the first valid path, a second valid path is selected from the deviation paths in the deviation path set and placed in the valid path set. The second valid path is used as the first valid path, and the iterative step is repeated until N second valid paths are obtained.

[0086] Based on the above embodiment, the specific process of the iterative step in step 1032 is performed by steps 10321 to 10325, specifically:

[0087] Step 10321: In the first valid path, the impedance value between the i-th station and the i-1-th station is set to infinity, and the station before the i-th station is used as the necessary station of the deviated path. Based on the necessary stations and the impedance values ​​between all two adjacent stations after adjustment, the deviated path with the minimum total impedance value between the starting station and the ending station is determined, and the deviated path is placed in the deviated path set. Let i = i + 1, and re-execute the iterative step until the i-1-th station is the last station in the first valid path; wherein i = 2 when the iterative step is first executed.

[0088] In this embodiment, an iterative step is performed on the first valid path as follows: First, the impedance between the first and second stations in the first valid path is set to infinity. Station 1 is designated as the station that the deviated path must pass through, and Station 1 is used as the starting station. Based on the adjusted impedance values ​​between all two adjacent stations, a deviated path with the minimum total impedance between the starting and ending stations is determined from the network diagram. It is understood that since the impedance between Station 1 and Station 2 is infinite, the deviated path cannot contain the first valid path. The deviated path is then added to the set of deviated paths, and i = i + 1, i.e., i = 3. The iterative step is repeated, adjusting the impedance between Station 2 and Station 3 in the first valid path to infinity, and also adjusting the impedance between Station 2 and Station 3 to infinity. The deviated path with the minimum total impedance is again selected from the network diagram and added to the set of deviated paths. Iteration is repeated until i = i + 1, and Station i-1 is the last station in the first valid path.

[0089] Step 10322: Select the deviation path with the smallest total impedance value from the deviation path set as the second valid path, remove the second valid path from the deviation path set, and add the second valid path to the valid path set.

[0090] Afterwards, a deviation path with the smallest total impedance value is further selected from the deviation path set as a second valid path, the second valid path is removed from the deviation path set, and the second valid path is added to the valid path set.

[0091] Step 10323: Determine whether the number of second valid paths in the valid path set is N.

[0092] It should be further explained that, in this embodiment, the number N is at least 2.

[0093] Step 10324: If not, use the second valid path as the first valid path and re-execute the iterative step.

[0094] After the iteration is completed, if the number of second valid paths in the valid path set is not N, the second valid path selected in this iteration is used as the first valid path, and the iteration step is executed again.

[0095] Step 10325: If yes, obtain N second valid paths according to the valid path set.

[0096] If the number of second valid paths in the valid path set is N, the iteration is stopped, and N second valid paths can be obtained according to the valid path set.

[0097] For example, in one embodiment, continue with Figure 2 For example, assume that P is the valid path set, C is the deviation path set, and P[x] represents the xth valid path in the valid path set. Figure 2 As shown, from the starting site S to the ending site T, the first valid path is P[1]: SDEFT, with an impedance of 56.

[0098] The first iteration of P[1] is as follows:

[0099] (1) Using the partial basic path (i.e., P[1]) SD, the impedance between the SD paths is set to infinity, and the deviation path with the minimum total impedance between site S and site T is determined. The deviation path is SBCFT, with a total impedance of 60, and this deviation path is added to the deviation path set C.

[0100] (2) In the SDE path of the partial basic path (i.e., P[1]), the impedance value between the DE paths is set to infinity, and the deviation path with the minimum total impedance value between site S and site T is determined. The deviation path is obtained: SDGHT, with a total impedance value of 66. This deviation path is added to the deviation path set C;

[0101] (3) In the partial basic path (i.e., P[1]) SDEF path, the impedance value between the EF paths is set to infinity, and the deviation path with the minimum total impedance value between site S and site T is determined. The deviation path is obtained: SDEHT, with a total impedance value of 62. This deviation path is added to the deviation path set C;

[0102] (4) In the SDEFT path of the partial basic path (i.e., P[1]), the impedance value between the FT paths is set to infinity, and there is no offset path at this time;

[0103] The first valid path iteration is completed. At this time, there are three deviation paths in the set C: SBCFT, SDGHT, and SDEHT. The deviation path SBCFT with the smallest total impedance is selected as the second valid path. The second valid path is removed from the deviation path set C and placed in the valid path set P. At this time, P[2] = SBCFT, as shown in Figure 4 shown.

[0104] Perform the second iteration on P[2], and the iterative steps are as follows:

[0105] (1) Using a partial basic path (i.e., P[2]) SB, the impedance between the SB paths is set to infinity, and the deviation path with the minimum total impedance between site S and site T is determined. The deviation path is obtained: SDEFT. However, this path already exists in the valid path set P, so no processing is performed.

[0106] (2) Taking B as the starting point in the partial basic path (i.e., P[2]) SBC path, setting the impedance value between the BC paths to infinity, determine the deviation path with the minimum total impedance between site S and site T, and obtain the deviation path: SBEFT, with a total impedance value of 63. This deviation path is added to the deviation path set C;

[0107] (3) In the SBCF path of the partial basic path (i.e., P[2]), the impedance value between the CF paths is set to infinity, and there is no offset path at this time;

[0108] (4) Take the SBCFT path of the partial basic path (i.e., P[2]) as the starting point, and set the impedance value between the FT paths to infinity. At this time, there is no offset path;

[0109] The second iteration is completed, and there are three deviation paths in the C set: SDGHT, SDEHT, and SBEFT. The deviation path SDEHT with the smallest total impedance is selected as the second valid path, and the second valid path is removed from the deviation path set C set, and the second valid path is placed in the valid path set P. At this time, P[3] = SDEHT, as shown in Figure 5 shown.

[0110] The same steps are repeated in the third iteration to obtain the second effective path P[4]=SBEFT with an impedance of 63. Figure 6 When the number of second valid paths in the P set is equal to N, the iteration is stopped.

[0111] Step 104: Select K third valid paths from the first valid path and the second valid path, where K is less than or equal to N+1.

[0112] After obtaining the first valid path and N second valid paths, K third valid paths are selected from the first and second valid paths. It should be understood that K is less than or equal to N+1, meaning that the number of third valid paths is less than or equal to the sum of the number of first and second valid paths. For example, in one embodiment, N+1 is 5 and K is 3, so three third valid paths are selected from the valid path set.

[0113] Based on the above embodiment, the specific process of selecting K third valid paths from the first valid path and the second valid path in step 104 is performed by step 1041, which is specifically as follows:

[0114] Step 1041 : Select K third valid paths from the first valid path and the second valid path according to a preset size difference function.

[0115] In this embodiment, a size difference function of the third effective path needs to be established in advance, and the maximum difference percentage between the impedances of the third effective paths is calculated using the size difference function. K third effective paths are selected from the first effective path and the second effective path based on the maximum difference percentage.

[0116] Based on the above embodiment, the specific process of selecting K third valid paths from the first valid path and the second valid path according to the preset size difference function in step 1041 is performed by steps 10411 and 10412. The specific process is as follows:

[0117] Step 10411: Determine the maximum difference percentage between the effective path impedances based on the preset size difference function, the first effective path, and the second effective path.

[0118] In one embodiment, the size difference function D is constructed st for:

[0119]

[0120] Among them, the size difference function D st According to the travel type, it is divided into piecewise functions, D st Indicates the maximum acceptable difference percentage between the impedances of the third effective path; when D st When it is 0.12, it is a short distance. st When it is 0.15, it is the middle distance. st When it is 0.20, it is a long distance. s Indicates the number of stations on the Sth valid path; where 1≤S≤N+1. min(Q1,Q2,…,Q N+1 ) represents the minimum number of sites in the N+1 valid paths; q is a constant, representing the number of basic sites, which is assumed to be 8 here. Note that the above constants can be dynamically configured according to the actual network conditions. The valid paths include the first valid path and the second valid path.

[0121] In this embodiment, Figure 2 For example, by calculating the distance from site S to site T as the shortest, that is, D st =0.12, that is, the maximum difference percentage between the impedances of the third effective path cannot exceed 12%.

[0122] Step 10412: Select K third valid paths from the first valid path and the second valid path according to the maximum difference percentage between the valid path impedances.

[0123] Finally, K third effective paths can be selected from the first effective path and the second effective path according to the maximum difference percentage between the effective path impedances.

[0124] Step 105: Establish a site clearing model according to the third valid path. The site clearing model includes a plurality of parameters to be determined.

[0125] After K third valid paths are selected, a site clearing model may be established according to the number of the third valid paths. The site clearing model includes a plurality of parameters to be determined.

[0126] In one embodiment, the site clearing model is expressed by the following formula:

[0127] V mt =β0+λ m *α m *β1*X mt1 +...+β j *X mtL ...+β g *X mtg

[0128] Among them, V mt represents the benefit of the mth third effective path from the starting site to the ending site; β j represents the j+1th parameter to be determined; λ m represents the congestion coefficient of the mth third effective path; α m represents the coefficient of the originating station of the mth third effective path; X mtL Represents the Lth first trip parameter of the mth third valid path, where 1≤m≤K, 0≤j≤g, and 1≤L≤g.

[0129] Step 106: Calculate the parameters to be determined based on the travel parameters of the third valid path, obtain a target clearing model, and use the target clearing model for clearing.

[0130] After establishing the station clearing model, the parameters to be determined in the station clearing model are calculated based on the travel parameters of the third valid path. After solving for the parameters to be determined, a target clearing model is obtained, and the target clearing model is then used to clear the tickets. In one embodiment, a quantized vector for each third valid path is calculated based on the travel parameters of each third valid path. The parameters to be determined in the station clearing model are then calculated based on the quantized vectors of each third valid path to obtain the target clearing model, and the target clearing model is used to clear the tickets.

[0131] Based on the above embodiment, the specific process of calculating the parameters to be determined based on the travel parameters of the third valid path in step 106 to obtain the target clearing model is performed in steps 1061 and 1062, specifically:

[0132] Step 1061: Obtain a quantized vector of the third effective path based on the run parameter of the third effective path.

[0133] In this embodiment, the trip parameters of each third valid path are first characterized and quantified, thereby obtaining a quantized vector for each third valid path. The quantized vector reflects the probability of the third valid path being selected by the passenger. In one embodiment, the trip parameters of the third valid path include a first trip parameter, a congestion coefficient, and a departure station coefficient. The first trip parameter includes path distance, number of transfers, and transfer time. By characterizing the path distance and number of transfers to reflect the subjective utility of passengers when choosing a path, and characterizing the transfer time and congestion coefficient to reflect the objective utility of passengers when choosing a path, the target clearing model is calculated based on the distance alone, avoiding the need to calculate the target clearing model based solely on the distance. This allows the target clearing model to more closely reflect the passenger flow and the usage of each station.

[0134] Based on the above embodiment, the specific process of obtaining the quantized vector of the third effective path based on the run parameters of the third effective path in step 1061 is performed by steps 10611 to 10613, specifically as follows:

[0135] Step 10611: quantize the stroke parameters to obtain quantized stroke parameters.

[0136] In one embodiment, the travel parameters can be quantified based on different line network characteristics and subway passenger flow characteristics. The processing method can refer to the following method:

[0137] The feature quantification processing of path distance is as follows:

[0138] X mt1 / min(X 1t1 ,X 2t1 ,…,X kt1 )

[0139] Among them, X mt1 Indicates the path distance of the mth third valid path.

[0140] The feature quantification processing of the number of transfers is as follows:

[0141] X mt2 -min(X it2 ,X it2 ,…,X kt2 )

[0142] Among them, X mt2 Indicates the number of transfers for the mth third valid path.

[0143] The feature quantification processing of transfer time is as follows:

[0144] X mt3 *60

[0145] Among them, X mt3 represents the transfer time of the mth third valid path.

[0146] For the congestion coefficient and the origin station coefficient, parameter initialization can be performed as follows:

[0147] For the crowding coefficient λ m The parameters are initialized as follows:

[0148]

[0149] For the originating station coefficient α m The parameters are initialized as follows:

[0150]

[0151] In one embodiment, Figure 2 Taking the three third valid paths P[1]: SDEFT, P[2]: SBCFT and P[3]: SDEHT as examples, the travel parameters of the three third valid paths are shown in Table 1:

[0152] Table 1

[0153]

[0154] After quantizing the features of the travel parameters of the three third effective paths, the quantized travel parameters are shown in Table 2:

[0155] Table 2

[0156] The third effective path Path Description <![CDATA[X mt1 ]]> <![CDATA[X mt2 ]]> <![CDATA[X mt3 ]]> <![CDATA[λ m ]]> <![CDATA[α m ]]> P[1] SDEFT 56 0 180 1 1 P[2] SBCFT 60 1 300 1 1 P[3] SDEHT 62 2 540 1 1

[0157] Step 10612: Initialize the parameters to be determined in the site clearing model, input the quantized travel parameters of the third effective path into the site clearing model, and obtain the utility vector of the third effective path.

[0158] After quantifying the features of the trip parameters, the parameters to be determined in the site clearing model are initialized. Then, the quantified trip parameters of the third effective path are input into the site clearing model to obtain the utility vector of each third effective path (the utility vector is the benefit V mt). For example, in one embodiment, β0 can be initialized to 0, which does not affect the allocation result, β1 is the path distance parameter, initialized to -1.2, β2 is the number of transfer parameters, initialized to -0.6, and β3 is the transfer time parameter, initialized to -0.01. The utility vector is calculated according to the formula of the station clearing model as shown in Table 3.

[0159] Table 3

[0160] The third effective path Path Description <![CDATA[V mt ]]> P[1] SDEFT -3 P[2] SBCFT -4.8 P[3] SDEHT -7.8

[0161] Step 10613: Obtain the quantization vector of the third effective path according to the utility vector of the third effective path.

[0162] In one embodiment, the calculation formula of the quantization vector is:

[0163]

[0164] Wherein, P(m) represents the quantized vector of the m-th third effective path, e is a constant approximately equal to 2.718281828, and 1≤h≤K.

[0165] The quantization vectors calculated based on the utility vectors in Table 3 are shown in Table 4:

[0166] Table 4

[0167]

[0168] Step 1062: Calculate the parameters to be determined of the site classification model based on the quantized vector to obtain the target classification model.

[0169] After obtaining the quantized vector for each third valid path, the quantized vector can be used to solve for the parameters to be determined for the site clearing model, thereby obtaining the target clearing model. In one embodiment, the quantized vector for each third valid path is used as an independent variable parameter to calculate the parameters to be determined for the site clearing model, thereby obtaining the target clearing model.

[0170] Based on the above embodiment, the specific process of calculating the parameters to be determined of the site clearing model based on the quantization vector in step 1062 and obtaining the target clearing model is performed in step 10621. The specific process is as follows:

[0171] Step 10621: Calibrate the quantization vector to obtain a calibrated quantization vector, calculate the parameters to be determined of the site classification model based on the calibrated quantization vector, and obtain the target classification model.

[0172] After obtaining the quantization vector of each third valid path, the quantization vector of each third valid path is further calibrated to obtain a calibrated quantization vector. For example, in one embodiment, the quantization vector can be calibrated using survey data to obtain a quantization vector with greater practicality. For the three third valid paths P[1], P[2], and P[3] in Table 4, it is assumed that the survey values ​​of the quantization vectors obtained through the survey are:

[0173] P'(1)=85%, P'(2)=14%, P'(3)=1%

[0174] Among them, P'(1), P'(2) and P'(3) are the quantized vector survey values ​​of P[1], P[2] and P[3] respectively.

[0175] The idea of ​​ordinary least squares (OLS) is used to calculate the sum of squared errors between the calculated value of the quantization vector and the survey value of the quantization vector. Since each OD (starting site - ending site) pair will produce multiple results, the error is calculated using the relative error value. Then, the corresponding proportion is selected according to the number of third valid paths to obtain the relative mean square error (RSS). The calculation formula is as follows:

[0176] RSS[m]=[(P'(m)-P(m)] / [P(m)] 2 / k

[0177] Using the relative mean square error function as the objective function, and using the planning parameter solution method to adjust the parameters to minimize the objective function, the parameter results obtained at this time are the optimal parameters of the site classification model. The error value is minimized when the parameter results are the following values:

[0178] β0=0, β1=-1.226, β2=-0.962, β3=-0.0733.

[0179] The calculation results of the relative mean square error RSS are shown in Table 5:

[0180] The third effective path Path Description P(m) P'(m) RSS[m] P[1] SDEFT 85.0000001％ 85％ 0.00394 P[2] SBCFT 14.00000036％ 14％ 0.00272 P[3] SDEHT 0.999999546％ 1％ 0.00003

[0181] The target classification model can be expressed as follows:

[0182] V mt =λ m *α m *(-1.226)*X mt1 -0.962X mt2 -0.0733X mt3 .

[0183] Based on the above embodiment, the specific process of using the target liquidation model to perform liquidation in step 106 is performed by steps 1063 to 1065. The specific process is as follows:

[0184] Step 1063: Calculate the target quantization vector of each third valid path according to the target classification model.

[0185] After obtaining the target clearing model, the travel parameters of each third effective path are input into the target clearing model to calculate the target utility vector of each third effective path, and then the target quantization vector of each third effective path is further calculated based on the target utility vector.

[0186] Step 1064: Calculate the line clearing ratio of each fixed train line based on the target quantization vector, and perform clearing based on the line clearing ratio.

[0187] After obtaining the target quantization vector of each third effective path, the line clearing ratio of each train fixed line is calculated based on the target quantization vector, and finally the clearing is performed according to the line clearing ratio. In one embodiment, the target quantization vector of the mth third effective path calculated using the target clearing model is recorded as P" (m), and the ratio of the yth train fixed line on the third effective path is recorded as α (m) y The clearing ratio of the yth train fixed line under the mth third effective path of a certain OD pair is Q(m) y =P”(m)*α(m) y , so the clearing ratio Q of all the third effective paths of the y-th train fixed line under this OD pair is y for:

[0188] Q y =[P”(1),P”(2),...,P”(K)]*[α(1) y ,α(2) y ,...,α(K) y ] T

[0189] Where T is the transposition symbol.

[0190] In one embodiment, for the third valid path P[1], the third valid path P[2], and the third valid path P[3], it is assumed that the occupancy ratios of the train fixed lines line01-line04 are as shown in Table 6:

[0191] Table 6

[0192]

[0193] In one embodiment, the target quantization vectors calculated by the third effective path P[1], the third effective path P[2], and the third effective path P[3] are respectively: P”(1)=85%, P”(2)=14%, P”(3)=1%. According to the calculation of the clearable ratio, the following results can be obtained:

[0194] P(line01)=85%*100%+14%*0%+1%*45%=89.5%

[0195] P(line02)=85%*0%+14%*47%+1%*37%=10.2%

[0196] P(line03)=85%*0%+14%*53%+1%*0%=7.5%

[0197] P(line04)=85%*0%+14%*0%+1%*18%=1.8%

[0198] Due to decimal point calculation, the accumulated line clearing ratio value is not exactly equal to 1. In this embodiment, the difference can be subtracted from the line with the maximum line clearing ratio to make the overall clearing ratio 1. The results of adjusting the ratio are as follows:

[0199] P(line01)=85%*100%+14%*0%+1%*45%=89.5%-9%=80.5%

[0200] P(line02)=85%*0%+14%*47%+1%*37%=10.2%

[0201] P(line03)=85%*0%+14%*53%+1%*0%=7.5%

[0202] P(line04)=85%*0%+14%*0%+1%*18%=1.8%

[0203] The calculation results of OD for clearing can be seen in Table 7:

[0204] Table 7

[0205]

[0206] As described above, an embodiment of the present invention provides a clearing method. When selecting a valid path during the clearing process, based on the first valid path with the smallest impedance value, the impedance value between two adjacent sites in the first valid path is dynamically adjusted, and according to the impedance values ​​between all two adjacent sites after adjustment, a second valid path is selected from the line network diagram, and then a third valid path is selected from the first valid path and the second valid path, thereby avoiding the traversal calculation of the entire network cable, greatly improving the efficiency of selecting the valid path and shortening the time, improving the clearing efficiency, and solving the technical problem in the prior art that the effective path selection process takes a long time, resulting in low clearing efficiency.

[0207] Secondly, when establishing a station clearing model, the present invention selects travel parameters including the congestion coefficient and the origin station coefficient, path distance, number of transfers, and transfer time. By characterizing the path distance and number of transfers to reflect the subjective utility of passengers when choosing a path, and characterizing the transfer time and congestion coefficient to reflect the objective utility of passengers when choosing a path, it avoids calculating the target clearing model based solely on the length of the journey, making the target clearing model closer to the use of each station by passenger flow, thereby improving the accuracy of clearing.

[0208] Example 2

[0209] like Figure 7 As shown, Figure 7 A clearing device provided in an embodiment of the present invention includes a site determination module 201, a first valid path determination module 202, a second valid path determination module 203, a third valid path determination module 204, a clearing model establishment module 205, and a clearing module 206;

[0210] The site determination module 201 is used to determine the starting site and the ending site in the online network diagram;

[0211] The first valid path determination module 202 is configured to determine a first valid path with the minimum total impedance between a starting station and an ending station according to the impedance between two adjacent stations in the network diagram;

[0212] The second valid path determination module 203 is configured to adjust the impedance value between two adjacent sites in the first valid path, and determine N second valid paths between the starting site and the ending site based on the adjusted impedance values ​​between all two adjacent sites;

[0213] The third valid path determination module 204 is configured to select K third valid paths from the first valid path and the second valid path, where K is less than or equal to N+1;

[0214] The clearing model establishing module 205 is used to establish a site clearing model according to the third valid path, where the site clearing model includes a plurality of parameters to be determined;

[0215] The sorting module 206 is used to calculate the parameters to be determined based on the travel parameters of the third valid path, obtain a target sorting model, and perform sorting using the target sorting model.

[0216] Based on the above embodiment, the first valid path determining module 202 is configured to determine the first valid path with the minimum total impedance between the starting station and the ending station according to the first impedance value between two adjacent stations in the network diagram as follows:

[0217] Used to determine all the travel paths between the starting site and the ending site;

[0218] According to the impedance value between two adjacent stations in the line network diagram, the total impedance value of each pass path is calculated;

[0219] The path with the smallest total impedance value is taken as the first valid path between the starting site and the ending site.

[0220] Based on the above embodiment, the second valid path determination module 203 is configured to adjust the impedance value between two adjacent sites in the first valid path, and determine N second valid paths between the starting site and the ending site based on the adjusted impedance values ​​between all two adjacent sites. Specifically, the N second valid paths are:

[0221] Used to initialize the valid path set and the deviation path set, put the first valid path into the valid path set, and set the number of second valid paths in the valid path set to N;

[0222] An iterative step is performed. The specific process of the iterative step is as follows: the impedance value between two adjacent sites in the first valid path is adjusted to infinity in sequence, and a deviated path is determined each time based on the impedance value between all two adjacent sites after the adjustment, and the deviated path is placed in a deviated path set. A second valid path is selected from the deviated paths in the deviated path set and placed in the valid path set. The second valid path is used as the first valid path, and the iterative step is performed again until N second valid paths are obtained.

[0223] Based on the above embodiment, the second valid path determination module 203 is configured to perform the following iterative steps:

[0224] For setting the impedance value between the i-th station and the i-1-th station in a first valid path to infinity, taking the station before the i-th station as a necessary station of the deviated path, determining a deviated path with the minimum total impedance between the starting station and the ending station based on the necessary stations and the impedance values ​​between all two adjacent stations after adjustment, placing the deviated path in a set of deviated paths, setting i=i+1, and re-performing the iterative step until the i-1-th station is the last station in the first valid path; wherein i=2 when the iterative step is first performed;

[0225] Selecting a deviation path with the smallest total impedance value from the deviation path set as a second valid path, removing the second valid path from the deviation path set, and adding the second valid path to the valid path set;

[0226] Determine whether the number of second valid paths in the valid path set is N;

[0227] If not, the second valid path is used as the first valid path and the iterative steps are performed again;

[0228] If so, obtain N second valid paths according to the valid path set.

[0229] Based on the above embodiment, the third valid path determining module 204 is configured to select K third valid paths from the first valid path and the second valid path as follows:

[0230] It is used to select K third valid paths from the first valid path and the second valid path according to a preset size difference function.

[0231] Based on the above embodiment, the third valid path determining module 204 is configured to select K third valid paths from the first valid path and the second valid path according to a preset size difference function. Specifically, the K third valid paths are:

[0232] for determining a maximum difference percentage between effective path impedances based on a preset size difference function, a first effective path, and a second effective path;

[0233] K third effective paths are selected from the first effective path and the second effective path according to the maximum difference percentage between the effective path impedances.

[0234] Based on the above embodiment, the settlement module 206 is used to calculate the parameters to be determined based on the travel parameters of the third valid route, and obtain the target settlement model specifically as follows:

[0235] for obtaining a quantized vector of the third effective path based on the run parameter of the third effective path;

[0236] The parameters to be determined of the site classification model are calculated according to the quantized vector to obtain the target classification model.

[0237] On the basis of the above embodiment, the sorting module 206 is configured to obtain the quantized vector of the third valid path based on the run parameter of the third valid path as follows:

[0238] Used to quantify the characteristics of the stroke parameters to obtain quantized stroke parameters;

[0239] Initializing the parameters to be determined in the site clearing model, inputting the quantized travel parameters of the third effective path into the site clearing model, and obtaining the utility vector of the third effective path;

[0240] A quantization vector of the third effective path is obtained according to the utility vector of the third effective path.

[0241] Based on the above embodiment, the clearing module 206 is used to calculate the parameters to be determined of the site clearing model according to the quantization vector, and obtain the target clearing model as follows:

[0242] It is used to calibrate the quantization vector to obtain a calibrated quantization vector, calculate the parameters to be determined of the site classification model based on the calibrated quantization vector, and obtain the target classification model.

[0243] Based on the above embodiment, the clearing module 206 is configured to use the target clearing model to perform clearing specifically as follows:

[0244] Used to calculate the target quantization vector of each third effective path according to the target classification model;

[0245] According to the target quantization vector, the line clearing ratio of each fixed train line is calculated, and clearing is performed according to the line clearing ratio.

[0246] Example 3

[0247] This embodiment also provides a terminal device, such as Figure 8 As shown, a terminal device 30 includes a processor 300 and a memory 301;

[0248] The memory 301 is used to store a computer program 302 and transmit the computer program 302 to the processor;

[0249] The processor 300 is configured to execute the steps in the above-mentioned embodiment of the clearing method according to the instructions in the computer program 302 .

[0250] Exemplarily, the computer program 302 may be divided into one or more modules / units, which are stored in the memory 301 and executed by the processor 300 to implement the present application. The one or more modules / units may be a series of computer program instruction segments capable of performing specific functions, and the instruction segments are used to describe the execution process of the computer program 302 in the terminal device 30.

[0251] The terminal device 30 may be a computing device such as a desktop computer, a notebook, a PDA, or a cloud server. The terminal device 30 may include, but is not limited to, a processor 300 and a memory 301. Those skilled in the art will understand that Figure 8 It is only an example of the terminal device 30 and does not constitute a limitation of the terminal device 30. It may include more or fewer components than shown in the figure, or a combination of certain components, or different components. For example, the terminal device 30 may also include input and output devices, network access devices, buses, etc.

[0252] The processor 300 may be a central processing unit (CPU), other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA), other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor.

[0253] The memory 301 may be an internal storage unit of the terminal device 30, such as a hard disk or memory of the terminal device 30. The memory 301 may also be an external storage terminal device of the terminal device 30, such as a plug-in hard disk, a smart media card (SMC), a secure digital (SD) card, a flash card, etc. equipped on the terminal device 30. Furthermore, the memory 301 may include both an internal storage unit of the terminal device 30 and an external storage device. The memory 301 is used to store the computer program and other programs and data required by the terminal device 30. The memory 301 may also be used to temporarily store data that has been output or is about to be output.

[0254] Those skilled in the art will clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0255] In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.

[0256] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0257] In addition, the functional units in the various embodiments of the present invention may be integrated into a single processing unit, each unit may exist physically separately, or two or more units may be integrated into a single unit. The aforementioned integrated units may be implemented in the form of hardware or software functional units.

[0258] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes various media that can store computer programs, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.

[0259] Example 4

[0260] An embodiment of the present invention further provides a storage medium containing computer-executable instructions, wherein the computer-executable instructions, when executed by a computer processor, are used to perform a clearing method, the method comprising the following steps:

[0261] Determine the start and end sites in the online network diagram;

[0262] According to the impedance value between two adjacent stations in the network diagram, determine the first valid path with the minimum total impedance value between the starting station and the ending station;

[0263] Adjust the impedance value between two adjacent sites in the first valid path, and determine N second valid paths between the starting site and the ending site based on the adjusted impedance values ​​between all two adjacent sites;

[0264] Select K third valid paths from the first valid path and the second valid path, where K is less than or equal to N+1;

[0265] Establishing a site clearing model according to the third effective path, the site clearing model including a plurality of parameters to be determined;

[0266] The parameters to be determined are calculated based on the travel parameters of the third valid path, a target clearing model is obtained, and clearing is performed using the target clearing model.

[0267] Note that the above are only preferred embodiments of the present invention and the technical principles used. Those skilled in the art will understand that the embodiments of the present invention are not limited to the specific embodiments described herein, and that various obvious changes, readjustments, and substitutions can be made by those skilled in the art without departing from the scope of protection of the embodiments of the present invention. Therefore, although the embodiments of the present invention are described in more detail through the above embodiments, the embodiments of the present invention are not limited to the above embodiments. Without departing from the concept of the embodiments of the present invention, the embodiments of the present invention may also include more other equivalent embodiments, and the scope of the embodiments of the present invention is determined by the scope of the appended claims.

Claims

1. A sorting method, characterized in that: The following steps are involved: Determine the start and end sites in the online network diagram; Determine, based on the impedance value between two adjacent stations in the network diagram, a first valid path with the minimum total impedance value between the starting station and the ending station; Adjusting the impedance value between two adjacent sites in the first valid path, and determining N second valid paths between the starting site and the ending site based on the adjusted impedance values ​​between all two adjacent sites; Selecting K third valid paths from the first valid path and the second valid path, where K is less than or equal to N+1; Establishing a site clearing model according to the third valid path, wherein the site clearing model includes a plurality of parameters to be determined; Calculating the to-be-determined parameter based on the travel parameter of the third valid path to obtain a target clearing model, and performing clearing using the target clearing model; The specific process of adjusting the impedance value between two adjacent sites in the first valid path and determining N second valid paths between the starting site and the ending site based on the adjusted impedance values ​​between all two adjacent sites is as follows: Initializing a valid path set and a deviation path set, adding the first valid path to the valid path set, and setting the number of second valid paths in the valid path set to N; An iterative step is performed, wherein the specific process of the iterative step is as follows: the impedance value between two adjacent sites in the first valid path is adjusted to infinity in sequence, and a deviated path is determined each time based on the impedance value between all two adjacent sites after the adjustment, and the deviated path is placed in the deviated path set; a second valid path is selected from the deviated paths in the deviated path set and placed in the valid path set; the second valid path is used as the first valid path, and the iterative step is re-performed until N second valid paths are obtained.

2. A sorting method according to claim 1, characterized in that: The specific process of determining the first valid path with the minimum total impedance between the starting site and the ending site according to the first impedance value between two adjacent sites in the network diagram is as follows: Determine all accessible paths between the starting site and the ending site; Calculating the total impedance value of each of the passage paths according to the impedance values ​​between two adjacent stations in the line network diagram; The travel path with the smallest total impedance value is used as the first valid path between the starting site and the ending site.

3. A sorting method according to claim 1, characterized in that: The method sequentially adjusts the impedance values ​​between two adjacent sites in the first valid path to infinity, and each time determines a deviated path based on the impedance values ​​between all two adjacent sites after the adjustment, places the deviated path into the deviated path set, selects a second valid path from the deviated paths in the deviated path set and places it into the valid path set, uses the second valid path as the first valid path, and re-executes the iterative step until N second valid paths are obtained, including: In the first valid path, the impedance value between the i-th station and the i-1-th station is set to infinity, and the station before the i-th station is used as a necessary station of the deviated path. Based on the necessary stations and the impedance values ​​between all two adjacent stations after adjustment, a deviated path with the minimum total impedance between the starting station and the ending station is determined, and the deviated path is added to the deviated path set. Let i = i + 1, and the iterative step is repeated until the i-1-th station is the last station in the first valid path; wherein i = 2 when the iterative step is first performed; Selecting a deviation path with the smallest total impedance value from the deviation path set as a second valid path, removing the second valid path from the deviation path set, and adding the second valid path to the valid path set; Determining whether the number of the second valid paths in the valid path set is N; If not, taking the second valid path as the first valid path and re-performing the iterative step; If so, obtain N second valid paths according to the valid path set.

4. A sorting method according to claim 1, characterized in that: The specific process of selecting K third valid paths from the first valid path and the second valid path is: K third valid paths are selected from the first valid path and the second valid path according to a preset size difference function.

5. A sorting method according to claim 4, characterized in that: The specific process of selecting K third valid paths from the first valid path and the second valid path according to the preset size difference function is as follows: determining a maximum difference percentage between effective path impedances based on a preset size difference function, the first effective path, and the second effective path; K third effective paths are selected from the first effective path and the second effective path according to the maximum difference percentage between the effective path impedances.

6. A sorting method according to claim 1, characterized in that: The specific process of calculating the to-be-determined parameter based on the travel parameter of the third valid path to obtain the target clearing model is as follows: obtaining a quantized vector of the third effective path based on a run parameter of the third effective path; The parameters to be determined of the site clearing model are calculated according to the quantized vector to obtain a target clearing model.

7. A sorting method according to claim 6, characterized in that: The specific process of obtaining the quantized vector of the third effective path based on the run parameter of the third effective path is: quantizing the stroke parameters to obtain quantized stroke parameters; Initializing parameters to be determined in the site clearing model, inputting the quantized travel parameters of the third valid path into the site clearing model, and obtaining a utility vector of the third valid path; A quantization vector of the third effective path is obtained according to the utility vector of the third effective path.

8. A sorting method according to claim 6, characterized in that: The specific process of calculating the parameters to be determined of the site clearing model according to the quantized vector to obtain the target clearing model is as follows: The quantization vector is calibrated to obtain a calibrated quantization vector, and the parameters to be determined of the site classification model are calculated based on the calibrated quantization vector to obtain a target classification model.

9. A sorting method according to claim 1, characterized in that: The specific process of using the target clearing model for clearing is as follows: Calculating a target quantization vector for each of the third valid paths according to the target classification model; According to the target quantization vector, the line clearing ratio of each fixed train line is calculated, and clearing is performed according to the line clearing ratio.

10. A sorting device, characterized in that: It includes a site determination module, a first valid path determination module, a second valid path determination module, a third valid path determination module, a clearing model establishment module and a clearing module; The site determination module is used to determine the starting site and the ending site in the online network map; The first valid path determination module is configured to determine a first valid path with the minimum total impedance between the starting station and the ending station according to the impedance value between two adjacent stations in the network diagram; The second valid path determination module is used to adjust the impedance value between two adjacent sites in the first valid path, and determine N second valid paths between the starting site and the ending site based on the adjusted impedance values ​​between all two adjacent sites; The third valid path determination module is configured to select K third valid paths from the first valid path and the second valid path, where K is less than or equal to N+1; The clearing model establishing module is used to establish a site clearing model according to the third valid path, wherein the site clearing model includes a plurality of parameters to be determined; The clearing module is used to calculate the to-be-determined parameter based on the travel parameter of the third valid route, obtain a target clearing model, and perform clearing using the target clearing model; The second valid path determination module is specifically configured to: Initializing a valid path set and a deviation path set, adding the first valid path to the valid path set, and setting the number of second valid paths in the valid path set to N; An iterative step is performed, wherein the specific process of the iterative step is as follows: the impedance value between two adjacent sites in the first valid path is adjusted to infinity in sequence, and a deviated path is determined each time based on the impedance value between all two adjacent sites after the adjustment, and the deviated path is placed in the deviated path set; a second valid path is selected from the deviated paths in the deviated path set and placed in the valid path set; the second valid path is used as the first valid path, and the iterative step is re-performed until N second valid paths are obtained.

11. A terminal device, characterized in that: The terminal device includes a processor and a memory; The memory is used to store a computer program and transmit the computer program to the processor; The processor is configured to execute a clearing method according to any one of claims 1 to 9 according to instructions in the computer program.

12. A storage medium storing computer executable instructions, characterized in that: When the computer executable instructions are executed by a computer processor, they are used to perform a sorting method according to any one of claims 1 to 9.

Images