Empty train dispatching method and system based on railway dispatching contour plan
By using empty vehicle deployment methods and systems in the railway dispatch profile plan, the empty vehicle deployment path and quantity are optimized, and the problem of low efficiency and difficulty in obtaining the optimal dispatching plan in the existing technology is solved, and the optimal empty vehicle deployment plan is achieved. , improves the compilation efficiency and applicability of the program.
Patent Information
- Application Number
- CN202410991897.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-23
- Publication Date
- 2024-11-29
AI Technical Summary
The existing railway scheduling profile plan mainly relies on manual compilation, which is inefficient and difficult to obtain an optimal scheduling plan, and is difficult to meet the needs of the full-channel scheduling network.
The empty vehicle allocation method and system based on the railway dispatch profile plan is adopted. By obtaining the cost and constraint information of empty vehicle travel, the relationship between the empty vehicle flow and the allocation quantity is established, and the allocation path and quantity is optimized using greedy algorithms and preset optimization strategies. Ensure that all empty cars are minimal.
It realizes the allocation plan with the lowest cost of all empty vehicles while meeting the site needs and traffic capacity, improves the compilation efficiency, generates the most suitable allocation plan for the same day, and replaces manual compilation.
Smart Images

Figure CN119037509A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of railway dispatching, and in particular to an empty car allocation method and system based on railway dispatching profile plan. Background Art
[0002] At present, the daily railway dispatching outline plan is completed manually, and the outline plan is compiled based on the staff's own experience by referring to the previous day's outline plan, daily plan, and the current month's dispatching monthly plan. On the one hand, this compilation method relies on the personal experience of the staff, consumes a lot of manpower, and has low work efficiency. On the other hand, the manually compiled outline plan is difficult to obtain the optimal dispatching plan from the perspective of the entire railway dispatching network due to time constraints and limited personnel capabilities. Summary of the invention
[0003] The purpose of the present invention is to provide an empty car allocation method and system based on railway dispatching profile plan to solve the above problems. In order to achieve the above purpose, the technical solution adopted by the present invention is as follows:
[0004] On the one hand, the present application provides an empty car allocation method based on a railway scheduling profile plan, comprising:
[0005] Acquire first information, empty vehicle travel costs and constraint information of an arc segment, wherein the first information includes a station set, a vehicle type set, and an arc segment set;
[0006] Establishing a relationship between the empty vehicle flow rate of the arc segment and the number of empty vehicle deployments between stations according to the first information;
[0007] Calculate all empty vehicle running costs according to the empty vehicle flow and empty vehicle running costs of the arc segment, and take the minimum of all empty vehicle running costs as the objective function;
[0008] Establish constraint conditions according to constraint information, make the objective function meet the constraint conditions, and obtain the empty car deployment model;
[0009] Solve the empty car dispatch model through the greedy algorithm to obtain the dispatch path set and the dispatch quantity corresponding to each dispatch path;
[0010] The deployment paths and the deployment quantities corresponding to each deployment path are optimized through preset optimization strategies to obtain the optimal deployment path and optimal deployment quantity for each site.
[0011] On the other hand, the present application also provides an empty car allocation system based on railway dispatching profile plan, comprising:
[0012] A first acquisition unit is used to acquire first information, empty vehicle running costs and constraint information of an arc segment, wherein the first information includes a station set, a vehicle type set and an arc segment set;
[0013] A first calculation unit, used for establishing a relationship between the empty vehicle flow rate of the arc segment and the number of empty vehicle deployments between stations according to the first information;
[0014] The second calculation unit is used to calculate all empty vehicle running costs according to the empty vehicle flow rate of the arc segment and the empty vehicle running costs of the arc segment, with the minimum of all empty vehicle running costs as the objective function;
[0015] A modeling unit is used to establish constraint conditions according to constraint information, so that the objective function satisfies the constraint conditions and obtains an empty vehicle deployment model;
[0016] The preliminary solution unit is used to solve the empty car allocation model through a greedy algorithm to obtain a set of allocation paths and the allocation quantity corresponding to each allocation path;
[0017] The optimization unit is used to optimize the deployment path and the deployment quantity corresponding to each deployment path through a preset optimization strategy to obtain the optimal deployment path and optimal deployment quantity of each site.
[0018] The beneficial effects of the present invention are:
[0019] The present invention minimizes the running costs of all empty vehicles under the premise of meeting the number of empty vehicles required by the station, the station capacity and the arc capacity, thereby establishing an empty vehicle allocation model, solving and optimizing the empty vehicle allocation model through a greedy algorithm and a preset optimization strategy to obtain the optimal allocation plan. The empty vehicle allocation method proposed by the present invention replaces manual compilation, improves the compilation efficiency, and does not need to refer to historical data. The actual loading and unloading difference of the railway bureau every day is used as the allocation basis to obtain the allocation plan most suitable for the day.
[0020] Other features and advantages of the present invention will be described in the following description, and partly become apparent from the description, or be understood by implementing the embodiments of the present invention. The purpose and other advantages of the present invention can be realized and obtained by the structures particularly pointed out in the written description, claims, and drawings. BRIEF DESCRIPTION OF THE DRAWINGS
[0021] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following briefly introduces the drawings required for use in the embodiments. It should be understood that the following drawings only show certain embodiments of the present invention and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without creative work.
[0022] Figure 1 It is a schematic flow chart of the empty car allocation method of the present invention;
[0023] Figure 2 The flow diagram of the deployment scheme obtained for the embodiment;
[0024] Figure 3 It is a structural schematic diagram of the empty car allocation system of the present invention.
[0025] Markings in the figure:
[0026] 700, empty car allocation system; 710, first acquisition unit; 720, first calculation unit; 730, second calculation unit; 740, modeling unit; 750, preliminary solution unit; 760, optimization unit. DETAILED DESCRIPTION
[0027] In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, rather than all of the embodiments. The components of the embodiments of the present invention generally described and shown in the drawings herein can be arranged and designed in various different configurations. Therefore, the following detailed description of the embodiments of the present invention provided in the drawings is not intended to limit the scope of the claimed invention, but merely represents selected embodiments of the present invention. Based on the embodiments in the present invention, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present invention.
[0028] It should be noted that similar reference numerals and letters represent similar items in the following drawings, so once an item is defined in one drawing, it does not need to be further defined and explained in the subsequent drawings. At the same time, in the description of the present invention, the terms "first", "second", etc. are only used to distinguish the description and cannot be understood as indicating or implying relative importance.
[0029] Embodiment 1:
[0030] like Figure 1 As shown, an empty car allocation method based on railway scheduling profile plan includes the following steps:
[0031] S1. Obtain first information, empty vehicle running costs and constraint information of an arc segment, wherein the first information includes a site set, a vehicle type set and an arc segment set.
[0032] It should be noted that this embodiment simplifies the complex national railway network. There are 18 railway bureaus in the national railway network. For each railway bureau, a main technical station under its jurisdiction is selected to represent the railway bureau. This method calls it a bureau-surrogate station. Different bureau-surrogate stations are regarded as different sites, and different decomposition ports between bureau-surrogate stations are also regarded as different sites. The union of the bureau-surrogate station set and the decomposition port station set is called a site set. The loading and unloading difference of the railway bureau is regarded as the loading and unloading difference of the bureau-surrogate station, and the departure and arrival stations of the railway bureau for handing over empty cars are regarded as the bureau-surrogate station of the bureau. This processing can simplify the complexity of the national railway network, facilitate the design of the empty car allocation model and achieve rapid solution.
[0033] The calculation method of the empty car running cost of the arc segment is to multiply the arc segment length by the empty car running unit price per unit length. The arc segment length, the empty car running unit price per unit length, the first information and the constraint information can all be obtained through the railway dispatching profile plan.
[0034] The arc segment set is a set of paths formed between sites that can realize links.
[0035] S2. Establish a relationship between the empty vehicle flow rate of the arc segment and the number of empty vehicle allocations between stations based on the first information.
[0036] The relationship is:
[0037]
[0038] In the formula, K represents the set of vehicle types; N represents the set of stations; A represents the set of arcs; F(m, l) represents the empty vehicle flow of the arc (m, l); represents the number of empty vehicles of type k delivered from station i to station j; Indicates whether the k-th empty vehicle transported from station i to station j passes through the arc segment (m, l). The value is 1 if it passes, and 0 if it does not.
[0039] S3. Calculate all empty vehicle running costs according to the empty vehicle flow rate of the arc segment and the empty vehicle running costs of the arc segment, and take the minimum of all empty vehicle running costs as the objective function.
[0040] The objective function is:
[0041]
[0042] Where Z is the objective function; C(m, l) represents the arc segment (m, l ) is the empty vehicle running cost of the arc segment (m, l); F(m, l) represents the empty vehicle flow rate of the arc segment (m, l).
[0043] S4. Establish constraint conditions according to the constraint information so that the objective function satisfies the constraint conditions and obtains an empty vehicle allocation model.
[0044] It should be noted that the constraint information includes the traffic capacity of each arc segment, the loading and unloading difference of each station, and the traffic capacity of each station. Step S4 includes:
[0045] S41. According to the fact that the total empty vehicle flow rate of each arc segment is less than or equal to the capacity of the arc segment, the arc segment capacity constraint is obtained.
[0046] The arc capacity constraint expression is:
[0047]
[0048] Where F(m, l) represents the arc segment (m, l ) of empty vehicle flow; Cap(m, l) represents the arc segment (m, l )'s traffic capacity.
[0049] S42. The flow rate of empty cars flowing out of each station minus the flow rate of empty cars flowing into the station should be less than or equal to the loading and unloading difference of the station, thereby obtaining the station flow balance constraint.
[0050] The site traffic balance constraint expression is:
[0051]
[0052] In the formula, represents the flow of the kth empty vehicle outflowing from station m; represents the flow of the k-th empty car into station m; N represents the loading and unloading difference of the kth empty car at station m; b represents the set of bureau stations, N b ∈N, and N b ∪N a =N,N a Indicates the set of boundary stations between bureau stations; Indicates whether the k-th empty vehicle transported from station i to station j passes through the arc segment (l, m). The value is 1 if it passes, and 0 if it does not.
[0053] It should be noted that there are three cases of loading and unloading differences at a station: the first is a bureau station with a positive loading and unloading difference, where unloading is greater than loading, indicating that the bureau station can supply empty cars, and the number of empty cars supplied from the station must not exceed the number of empty cars owned; the second is a bureau station with a negative loading and unloading difference, where loading is greater than unloading, indicating that the bureau station needs empty cars, and the number of empty cars flowing into the station must at least meet the number of empty cars required by the station; the third is a loading and unloading difference of 0, indicating that the number of empty cars flowing in and out of the station is equal, indicating that the station is a boundary station to ensure path continuity.
[0054] S43. According to the total number of vehicles passing through the station being less than or equal to the station's traffic capacity, a station traffic capacity constraint is obtained.
[0055] The site capacity constraint expression is:
[0056]
[0057] In the formula, F (m,l) Cap represents the empty vehicle flow of arc segment (m, l); m Represents the traffic capacity of station m.
[0058] S44. According to the fact that the number of empty vehicles transported between sites is greater than or equal to 0, a quantity constraint of empty vehicles transported between sites is obtained.
[0059] The constraint expression for the number of empty vehicles transported between the stations is:
[0060]
[0061] In the formula, represents the number of empty vehicles of type k delivered from station i to station j; Indicates whether the k-th empty vehicle transported from station i to station j passes through the arc segment (m, l). The value is 1 if it passes through, and 0 if it does not. K represents the set of vehicle types; N represents the set of stations; A represents the set of arc segments.
[0062] Before solving the empty car allocation model, a flow graph G(A, N) is first established according to the first information, where N represents the site set and A represents the arc set. The site set is divided into a site set D(v1, type, n1) with empty car demand and a site set S(v1, type, n2) that can provide excess empty cars, where N=D∪S; v1 represents a site with empty car demand; v2 represents a site that can provide excess empty cars; n1 represents the number of empty cars required; n2 represents the number of empty cars that can be supplied; type is the type of empty car, including boxcar P and opencar C. Steps S5 and S6 are both performed on the flow graph, and the optimal allocation path and the allocation quantity corresponding to the optimal allocation path are marked and displayed on the flow graph to visualize the allocation plan.
[0063] S5. Solve the empty car allocation model through the greedy algorithm to obtain the allocation path set and the allocation quantity corresponding to each allocation path.
[0064] S51, search: starting from one of the first sites, searching for a second site that meets the same empty vehicle type based on the greedy algorithm proximity principle to obtain a dispatching path; the first site is a site with empty vehicle demand, and the second site is a site with excess empty vehicles.
[0065] S52: Setting a dispatch quantity for the dispatch path, wherein the dispatch quantity is the smaller value between the number of empty vehicles required by the first station and the number of empty vehicles available at the second station.
[0066] S53: Update constraint information, the number of empty vehicles required at the first station, and the number of empty vehicles available at the second station.
[0067] To update the constraint information specifically means that after obtaining the dispatch path and dispatch quantity, the capacity of the boundary station is occupied, and the capacity of the boundary station is updated:
[0068] Cap k =Cap k -min(n d , n s )
[0069] In the formula, Cap′ k represents the capacity of the boundary station k on the updated dispatching path; n d Indicates the number of empty cars required; Cap k represents the capacity of the boundary station k on the dispatching path before updating; n d Indicates the number of empty vehicles required at the first station; n s Indicates the number of empty vehicles available at the second station; min(n d , n s ) represents n d and n s The smaller value in .
[0070] Update the number of empty vehicles required at the first station:
[0071] n′ d =n d -min(n d , n s )
[0072] Where n′ d Indicates the number of empty vehicles required at the first station after update; n d Indicates the number of empty vehicles required at the first station before the update; n s Indicates the number of empty vehicles available at the second station; min(n d , n s ) represents n d and n s The smaller value in .
[0073] Updating the available number of empty vehicles at the second station is similar to updating the required number of empty vehicles at the first station.
[0074] S54, return to the search step, traverse all the first stations until the number of empty vehicles required at all the first stations is 0, and obtain the allocation path set and the allocation quantity corresponding to each allocation path.
[0075] It is understandable that the greedy algorithm selects the optimal solution in the current state each time without searching the entire solution space, which makes the greedy algorithm suitable for solving large-scale problems and can provide a feasible solution in a shorter time. By solving the empty car allocation model with the greedy algorithm, a allocation plan can be quickly generated. The allocation plan includes the allocation path and the allocation quantity corresponding to the allocation path, but the allocation plan is often not the optimal allocation plan, so it needs to be further optimized.
[0076] S6. Optimize the deployment paths and the deployment quantities corresponding to each deployment path through a preset optimization strategy to obtain the optimal deployment path and optimal deployment quantity for each site.
[0077] In some specific embodiments, step S6 includes step S61, step S62, step S63, step S64, step S65, step S66 and step S67.
[0078] S61. Calculate the score of each deployment path in the deployment path set according to a preset formula.
[0079] Specifically, step S61 includes:
[0080] S611. Calculate the empty vehicle running cost of each deployment path based on the arc segment of each deployment path and the deployment quantity of each deployment path to obtain the empty vehicle running cost of each deployment path.
[0081] The calculation formula for the empty vehicle running cost of each dispatching path is:
[0082]
[0083] In the formula, cost total Indicates the empty vehicle running cost of the dispatching path; cost ij It represents the empty vehicle running cost from station i to station j, that is, the empty vehicle running cost of the arc segment (i, j); It represents the number of k-th empty vehicles dispatched from station i to station j.
[0084] S612. Deduct the number of available empty vehicles on each dispatching path from the number of empty vehicles required on each dispatching path to obtain a penalty value on each dispatching path.
[0085] The penalty value calculation formula for each deployment path is:
[0086]
[0087] In the formula, penalty represents the penalty value; represents the number of empty cars demanded by station h for the k-th empty car; It represents the number of k-th empty vehicles deployed from station i to station j; station h is the boundary station between station i and station j.
[0088] S613. Obtain the passing cost of each station and the number of empty vehicles passing each station.
[0089] It should be noted that the passing cost of each station is existing data.
[0090] S614. Calculate the passing cost of each dispatching path based on the passing cost of each station and the number of empty vehicles passing through each station.
[0091] The calculation formula for the passing fee of each deployment path is:
[0092]
[0093] In the formula, cost node Indicates the cost of passing; cost h represents the passing cost of site h; Represents the number of empty vehicles passing through station h.
[0094] S615. Add up the empty vehicle travel cost, penalty value and passing cost of each deployment path to obtain the score of each deployment path.
[0095] The scoring formula for each deployment path is:
[0096] fitness=cost total +cost node +penalty
[0097] In the formula, fitness is the score of the deployment path; cost total Indicates the empty vehicle running cost of the dispatching path; penalty indicates the penalty value; cost node Indicates the cost of passing.
[0098] In this application, the smaller the score, the better the allocation path.
[0099] S62: Sort the allocation paths in ascending order according to the scores, and select the allocation path with the highest ranking according to a first preset ratio to obtain a first candidate solution.
[0100] In this embodiment, the first preset ratio is fifty percent.
[0101] S63: randomly select allocation paths in the first candidate solutions according to a second preset ratio, perform random reorganization, and obtain a second candidate solution.
[0102] In this embodiment, the second preset ratio is fifty percent.
[0103] S64: Randomly select a deployment path in the second candidate solution according to a third preset ratio for mutation to obtain a third candidate solution.
[0104] In this embodiment, the third preset ratio is 10%.
[0105] S65: Combine the first candidate solution, the second candidate solution, and the third candidate solution to obtain a combined path.
[0106] S66, return to step S61 and loop step S61-step S65 until the combined path does not change or the number of loops reaches a preset number, and the optimal deployment path for each site is obtained.
[0107] S67. Adjust the dispatch quantity corresponding to the optimal dispatch path of each station so that the number of empty vehicles required at all stations is 0, thereby obtaining the optimal dispatch quantity of each station.
[0108] It is understandable that the greedy algorithm may fall into a local optimal solution, so step S6 uses a preset optimization strategy to enable the deployment plan to jump out of the local optimal solution and find the global optimal solution.
[0109] Embodiment 2:
[0110] This embodiment provides a specific example, using symbols '1'-'7' to represent seven different stations, and the arc set of each station, the length of each arc and the traffic capacity of each arc are shown in Table 1:
[0111] Table 1:
[0112] (Starting point, end point) Arc length (km) Arc capacity (vehicles) ('1','2') 800 100 ('1','3') 600 100 ('1','4') 500 100 ('2','1') 800 100 ('2','4') 600 100 ('2','5') 700 100 ('3','1') 600 100 ('3','4') 400 100 ('3','6') 300 100 ('4','1') 500 100 ('4','2') 600 100 ('4','3') 400 100 ('4','5') 300 100 ('4','6') 400 100 ('4','7') 300 100 ('5','2') 700 100 ('5','4') 300 100 ('5','7') 500 100 ('6','3') 300 100 ('6','4') 400 100 ('6','7') 300 100 ('7','4') 300 100 ('7','5') 500 100 ('7','6') 300 100
[0113] The stations with empty car demand and their required empty car numbers, the stations that can provide excess empty cars and their available empty car numbers and types of empty cars are shown in Table 2:
[0114] Table 2
[0115]
[0116]
[0117] In Table 2, C represents a convertible and P represents a covered wagon.
[0118] Using the empty car allocation method in Example 1, the optimal allocation scheme is as follows Figure 2 As shown, the circle represents the station, the arc with the arrow represents the deployment path, the arrow points to the end point of the deployment path, C represents an open car, P represents a covered car, and the number after C or P represents the deployment quantity.
[0119] Embodiment 3:
[0120] Corresponding to the method embodiment in embodiment 1, this embodiment provides an empty car allocation system based on railway scheduling profile plan, such as Figure 3 As shown, the empty vehicle allocation system 700 includes:
[0121] A first acquisition unit 710 is used to acquire first information, empty vehicle running costs and constraint information of an arc segment, wherein the first information includes a station set, a vehicle type set and an arc segment set;
[0122] A first calculation unit 720, configured to establish a relationship between the empty vehicle flow rate of the arc segment and the number of empty vehicle deployments between stations according to the first information;
[0123] The second calculation unit 730 is used to calculate all empty vehicle running costs according to the empty vehicle flow rate of the arc segment and the empty vehicle running costs of the arc segment, with the minimum of all empty vehicle running costs as the objective function;
[0124] A modeling unit 740 is used to establish constraint conditions according to the constraint information so that the objective function satisfies the constraint conditions and obtains an empty vehicle deployment model;
[0125] A preliminary solution unit 750 is used to solve the empty vehicle allocation model by using a greedy algorithm to obtain an allocation path set and an allocation quantity corresponding to each allocation path;
[0126] The optimization unit 760 is used to optimize the deployment path and the deployment quantity corresponding to each deployment path through a preset optimization strategy to obtain the optimal deployment path and optimal deployment quantity of each site.
[0127] Specifically, the modeling unit 740 includes:
[0128] The first constraint unit is used to obtain the arc segment traffic capacity constraint according to the total empty vehicle flow of each arc segment being less than or equal to the traffic capacity of the arc segment;
[0129] The second constraint unit is used to obtain the site flow balance constraint according to the flow of empty cars outflowing from each site minus the flow of empty cars inflowing to the site should be less than or equal to the loading and unloading difference of the site;
[0130] A third constraint unit is used to obtain a station capacity constraint according to the total number of vehicles passing through the station being less than or equal to the station capacity;
[0131] The fourth constraint unit is used to obtain the quantity constraint of empty vehicles transported between sites according to the fact that the quantity of empty vehicles transported between sites is greater than or equal to 0.
[0132] Specifically, the preliminary solution unit 750 includes:
[0133] A search unit is used to take one of the first stations as a starting point and search for a second station that meets the same type of empty vehicles based on a greedy algorithm and proximity principle to obtain a dispatching path; the first station is a station with empty vehicle demand, and the second station is a station with excess empty vehicles;
[0134] A setting unit, used for setting a dispatching quantity for a dispatching path, wherein the set dispatching quantity is the smaller value of the number of empty vehicles required by the first station and the number of empty vehicles available at the second station;
[0135] An updating unit, used for updating constraint information, the number of empty vehicles required at the first station and the number of empty vehicles available at the second station;
[0136] The first loop unit is used to return to the search step, traverse all the first stations until the number of empty vehicles required at all the first stations is 0, and obtain a set of deployment paths and the deployment quantity corresponding to each deployment path.
[0137] Specifically, the optimization unit 760 includes:
[0138] A scoring unit, used to calculate the score of each deployment path in the deployment path set according to a preset formula;
[0139] A sorting unit, used to sort the deployment paths from small to large according to the scores, and select the deployment path with the highest ranking according to a first preset ratio to obtain a first candidate solution;
[0140] A reorganization unit, configured to randomly select a deployment path in the first candidate solution according to a second preset ratio, perform random reorganization, and obtain a second candidate solution;
[0141] A mutation unit, configured to randomly select a deployment path in the second candidate solution according to a third preset ratio for mutation, so as to obtain a third candidate solution;
[0142] a combining unit, configured to combine the first candidate solution, the second candidate solution and the third candidate solution to obtain a combined path;
[0143] The second loop unit returns to the scoring step and loops until the combined path does not change or the number of loops reaches a preset number, thereby obtaining the optimal deployment path for each site;
[0144] The adjustment unit is used to adjust the dispatch quantity corresponding to the optimal dispatch path of each station, so that the number of empty vehicles required at all stations is 0, and the optimal dispatch quantity of each station is obtained.
[0145] Specifically, the scoring unit includes:
[0146] The third calculation unit is used to calculate the empty vehicle running cost of each deployment path according to the empty vehicle running cost of the arc segment of each deployment path and the deployment quantity of each deployment path, so as to obtain the empty vehicle running cost of each deployment path;
[0147] A fourth calculation unit, configured to obtain a penalty value for each dispatching path by subtracting the number of available empty vehicles on each dispatching path from the number of empty vehicles required on each dispatching path;
[0148] The second acquisition unit is used to acquire the passing cost of each station and the number of empty vehicles passing each station;
[0149] A fifth calculation unit, used for calculating the passing cost of each deployment path according to the passing cost of each station and the number of empty vehicles passing through each station;
[0150] The sixth calculation unit is used to add up the empty vehicle running cost, penalty value and passing cost of each deployment path to obtain the score of each deployment path.
[0151] This embodiment is used to implement the method steps in Embodiment 1.
[0152] This application uses the method of building models and designing solution algorithms to replace the traditional manual experience compilation method, provides a basic template and optimization strategy for compiling contour plans, and is conducive to saving time in compiling contour plans; provides a scientific method for determining the number of empty car handovers between bureaus in the contour plan, and automatically and quickly generates an empty car allocation plan between bureaus; the traditional compilation method refers to historical data, the day's construction plan, and the road bureau report, and combines personal experience to obtain an allocation plan, which cannot be guaranteed to be the best plan. The allocation plan generated by the algorithm in this application does not refer to historical data, but is modeled based on actual conditions, thereby performing macro-allocation, and meets the requirement of the lowest running cost for all empty cars, and can provide the optimal solution for contour plan compilation.
[0153] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.
[0154] The above is only a specific embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed by the present invention, which should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention should be based on the protection scope of the claims.
Claims
1. An empty car allocation method based on railway dispatching profile plan, characterized in that: include: Acquire first information, empty vehicle travel costs and constraint information of an arc segment, wherein the first information includes a station set, a vehicle type set, and an arc segment set; Establishing a relationship between the empty vehicle flow rate of the arc segment and the number of empty vehicle deployments between stations according to the first information; Calculate all empty vehicle running costs according to the empty vehicle flow and empty vehicle running costs of the arc segment, and take the minimum of all empty vehicle running costs as the objective function; Establish constraint conditions according to constraint information, make the objective function meet the constraint conditions, and obtain the empty car deployment model; Solve the empty car dispatch model through the greedy algorithm to obtain the dispatch path set and the dispatch quantity corresponding to each dispatch path; The deployment paths and the deployment quantities corresponding to each deployment path are optimized through preset optimization strategies to obtain the optimal deployment path and optimal deployment quantity for each site.
2. The empty car deployment method based on railway dispatching profile plan according to claim 1, wherein the constraint information includes the traffic capacity of each arc segment, the loading and unloading difference of each station, and the traffic capacity of each station, characterized in that: Establish constraint conditions based on constraint information, including: According to the total empty vehicle flow of each arc segment being less than or equal to the passing capacity of the arc segment, the arc segment passing capacity constraint is obtained; According to the flow of empty cars out of each station minus the flow of empty cars into each station, it should be less than or equal to the loading and unloading difference of the station, and the station flow balance constraint is obtained; The station capacity constraint is obtained based on the total number of vehicles passing through the station being less than or equal to the station's capacity; According to the fact that the number of empty vehicles transported between sites is greater than or equal to 0, the number constraint of empty vehicles transported between sites is obtained.
3. The empty car allocation method based on railway dispatching profile plan according to claim 1 is characterized in that: The empty car dispatch model is solved by the greedy algorithm to obtain the dispatch path set and the dispatch quantity corresponding to each dispatch path, including: Search: Starting from one of the first stations, based on the principle of proximity based on the greedy algorithm, search for a second station that meets the same empty vehicle type, and obtain a dispatching path; the first station is a station with empty vehicle demand, and the second station is a station with excess empty vehicles; Set the dispatch quantity for the dispatch path, and the dispatch quantity is the smaller value between the number of empty vehicles required by the first station and the number of empty vehicles available at the second station; Update constraint information, the number of empty cars required at the first station and the number of empty cars available at the second station; Return to the search step and traverse all first stations until the number of empty vehicles required at all first stations is 0, and obtain the set of dispatch paths and the dispatch quantity corresponding to each dispatch path.
4. The empty car allocation method based on railway dispatching profile plan according to claim 1 is characterized in that: The deployment paths and the deployment quantities corresponding to each deployment path are optimized through the preset optimization strategy to obtain the optimal deployment path and optimal deployment quantity for each site, including: Scoring: Calculate the score of each deployment path in the deployment path set according to the preset formula; Sort the allocation paths from small to large according to the scores, and select the allocation path with the highest ranking according to a first preset ratio to obtain a first candidate solution; Randomly selecting the deployment paths in the first candidate solution according to a second preset ratio and reorganizing them in a disorderly order to obtain a second candidate solution; Randomly select a deployment path in the second candidate solution according to a third preset ratio for mutation to obtain a third candidate solution; Combining the first candidate solution, the second candidate solution and the third candidate solution to obtain a combined path; Return to the scoring step and loop until the combined path does not change or the number of loops reaches the preset number, and the optimal deployment path for each site is obtained; Adjust the dispatch quantity corresponding to the optimal dispatch path of each station so that the number of empty vehicles required at all stations is 0, and obtain the optimal dispatch quantity of each station.
5. The empty car allocation method based on railway dispatching profile plan according to claim 4 is characterized in that: The score of each deployment path in the deployment path set is calculated according to a preset formula, including: The empty vehicle running cost of each deployment path is calculated based on the empty vehicle running cost of the arc segment of each deployment path and the deployment quantity of each deployment path, so as to obtain the empty vehicle running cost of each deployment path; The penalty value of each dispatch path is obtained by subtracting the number of empty vehicles available on each dispatch path from the number of empty vehicles required on each dispatch path. Obtain the passing cost of each station and the number of empty vehicles passing through each station; The passing cost of each dispatching path is calculated based on the passing cost of each station and the number of empty vehicles passing through each station; The empty vehicle running costs, penalty values, and passing costs of each dispatching path are added together to obtain the score of each dispatching path.
6. An empty car dispatching system based on railway dispatching profile plan, characterized in that: include: A first acquisition unit is used to acquire first information, empty vehicle running costs and constraint information of an arc segment, wherein the first information includes a station set, a vehicle type set and an arc segment set; A first calculation unit, used to establish a relationship between the empty vehicle flow rate of the arc segment and the number of empty vehicle deployments between stations according to the first information; The second calculation unit is used to calculate all empty vehicle running costs according to the empty vehicle flow rate of the arc segment and the empty vehicle running costs of the arc segment, with the minimum of all empty vehicle running costs as the objective function; A modeling unit is used to establish constraint conditions according to constraint information, so that the objective function satisfies the constraint conditions and obtains an empty vehicle deployment model; The preliminary solution unit is used to solve the empty car allocation model through a greedy algorithm to obtain a set of allocation paths and the allocation quantity corresponding to each allocation path; The optimization unit is used to optimize the deployment path and the deployment quantity corresponding to each deployment path through a preset optimization strategy to obtain the optimal deployment path and optimal deployment quantity of each site.
7. The empty car allocation system based on railway dispatching profile plan according to claim 6 is characterized in that: The modeling unit comprises: The first constraint unit is used to obtain the arc segment traffic capacity constraint according to the total empty vehicle flow of each arc segment being less than or equal to the traffic capacity of the arc segment; The second constraint unit is used to obtain the site flow balance constraint according to the flow of empty cars outflowing from each site minus the flow of empty cars inflowing to the site should be less than or equal to the loading and unloading difference of the site; A third constraint unit is used to obtain a station capacity constraint according to the total number of vehicles passing through the station being less than or equal to the station's capacity; The fourth constraint unit is used to obtain the quantity constraint of empty vehicles transported between sites according to the fact that the quantity of empty vehicles transported between sites is greater than or equal to 0.
8. The empty car allocation system based on railway dispatching profile plan according to claim 6 is characterized in that: The preliminary solution unit comprises: A search unit is used to take one of the first stations as a starting point and search for a second station that meets the same empty vehicle type based on a greedy algorithm and proximity principle to obtain a dispatching path; the first station is a station with empty vehicle demand, and the second station is a station with excess empty vehicles; A setting unit, used for setting a dispatching quantity for a dispatching path, wherein the set dispatching quantity is the smaller value of the number of empty vehicles required by the first station and the number of empty vehicles available at the second station; An updating unit, used for updating constraint information, the number of empty vehicles required at the first station and the number of empty vehicles available at the second station; The first loop unit is used to return to the search step, traverse all the first stations until the number of empty vehicles required at all the first stations is 0, and obtain a set of deployment paths and the deployment quantity corresponding to each deployment path.
9. The empty car allocation system based on railway dispatching profile plan according to claim 6, characterized in that: The optimization unit includes: A scoring unit, used to calculate the score of each deployment path in the deployment path set according to a preset formula; A sorting unit, used to sort the deployment paths from small to large according to the scores, and select the deployment path with the highest ranking according to a first preset ratio to obtain a first candidate solution; A reorganization unit, configured to randomly select a deployment path in the first candidate solution according to a second preset ratio, perform random reorganization, and obtain a second candidate solution; A mutation unit, configured to randomly select a deployment path in the second candidate solution according to a third preset ratio for mutation, so as to obtain a third candidate solution; a combining unit, configured to combine the first candidate solution, the second candidate solution and the third candidate solution to obtain a combined path; The second loop unit returns to the scoring step and loops until the combined path does not change or the number of loops reaches a preset number, thereby obtaining the optimal deployment path for each site; The adjustment unit is used to adjust the dispatch quantity corresponding to the optimal dispatch path of each station, so that the number of empty vehicles required at all stations is 0, and the optimal dispatch quantity of each station is obtained.
10. The empty car allocation system based on railway dispatching profile plan according to claim 9, characterized in that: The scoring unit comprises: The third calculation unit is used to calculate the empty vehicle running cost of each deployment path according to the empty vehicle running cost of the arc segment of each deployment path and the deployment quantity of each deployment path, so as to obtain the empty vehicle running cost of each deployment path; A fourth calculation unit, configured to obtain a penalty value for each dispatching path by subtracting the number of available empty vehicles on each dispatching path from the number of empty vehicles required on each dispatching path; The second acquisition unit is used to acquire the passing cost of each station and the number of empty vehicles passing each station; A fifth calculation unit, used for calculating the passing cost of each deployment path according to the passing cost of each station and the number of empty vehicles passing through each station; The sixth calculation unit is used to add up the empty vehicle running cost, penalty value and passing cost of each deployment path to obtain the score of each deployment path.
