CN111409673A - Train quasi-point energy-saving operation method based on dynamic programming algorithm - Google Patents
Train quasi-point energy-saving operation method based on dynamic programming algorithm Download PDFInfo
- Publication number
- CN111409673A CN111409673A CN201910830553.2A CN201910830553A CN111409673A CN 111409673 A CN111409673 A CN 111409673A CN 201910830553 A CN201910830553 A CN 201910830553A CN 111409673 A CN111409673 A CN 111409673A
- Authority
- CN
- China
- Prior art keywords
- train
- energy consumption
- energy
- kth
- time
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Withdrawn
Links
Images
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B61—RAILWAYS
- B61L—GUIDING RAILWAY TRAFFIC; ENSURING THE SAFETY OF RAILWAY TRAFFIC
- B61L27/00—Central railway traffic control systems; Trackside control; Communication systems specially adapted therefor
Landscapes
- Engineering & Computer Science (AREA)
- Mechanical Engineering (AREA)
- Train Traffic Observation, Control, And Security (AREA)
Abstract
The invention discloses a train punctual energy-saving operation method based on a dynamic planning algorithm, which is characterized in that a train model and an operation environment thereof are established by setting train operation line data and train parameters, an energy-saving optimization model for train operation is established by taking train punctuality and train traction energy consumption as optimization targets, constraint conditions such as travel time, speed limit, maximum train addition and deceleration and the like are fully considered, a train operation constraint function, namely an energy-saving optimization model constraint condition, is established, and the optimization model is solved by using the dynamic planning algorithm, so that an optimal train operation strategy of a train is obtained. The invention effectively improves the precision of train energy-saving optimization, has high optimization speed, has the advantage of wide optimal solution search range and reduces train energy consumption.
Description
Technical Field
The invention belongs to the field of train operation control, and particularly relates to a train punctual energy-saving operation method based on a dynamic programming algorithm.
Background
At present, rail transit has developed into an important component in an urban rail transit system due to the advantages of large traffic volume and high speed. While the urban rail transit is rapidly developed, the construction cost and the operation cost of each urban rail transit are also increased year by year. According to the statistical result of the power consumption and energy consumption of the urban rail transit, the energy consumption of the urban rail transit system mainly comprises the following steps: the system comprises a train traction power supply system, an air conditioning system, a lighting system, an escalator and the like, wherein the traction power supply accounts for 50% of all power consumption, and huge energy consumption is a very serious problem facing urban rail transit at present. Therefore, how to effectively reduce the train traction energy consumption becomes a task to be solved urgently for each subway operation company, and has important practical significance.
The existing energy-saving scheme reduces energy consumption mostly in an indirect mode, has low energy-saving rate and complex objective function, and can not directly make the system enter a next-stage operation strategy of the train in the multi-decision problem.
Disclosure of Invention
The invention aims to provide a train punctual energy-saving operation method based on a dynamic programming algorithm.
The technical solution for realizing the purpose of the invention is as follows: a train punctual energy-saving operation method based on a dynamic planning algorithm comprises the following steps:
Step 3, establishing a train operation quasi-point energy-saving optimization model, wherein the target function of the train operation quasi-point energy-saving optimization model is that the sum of train operation energy consumption and time offset is minimum, the constraint condition is a train operation limiting index and the basic parameters, and the solution is an optimal train operation strategy;
Step 4, determining an energy consumption-time cost function of the kth subinterval according to the target function;
Step 5, establishing a recursion relation model of energy consumption-time cost;
And 6, determining an optimal operation strategy of the train by utilizing a dynamic programming algorithm according to the recursive relation model of the energy consumption-time cost and the energy consumption-time cost function of the kth subinterval.
Preferably, the line data includes a ramp start-stop kilometer post and a corresponding gradient, a curve section start-stop kilometer post and a corresponding curvature, a speed limit section start-stop kilometer post and a corresponding speed limit, and the train parameters include a train marshalling mode, a length, a load grade, a davis equation, a maximum acceleration, a maximum speed, a traction characteristic curve and a braking characteristic curve.
Preferably, the train operation waypoint energy-saving optimization model established in step 3 includes:
An objective function:
Wherein J is the minimum value of energy consumption and time offset, f (v) is the unit traction force of the full level of the train at the speed v, u kffor the tractive force usage coefficient, Delta S, of the train in the kth sub-interval kfor the length of the kth sub-interval in the operating line,. DELTA.t kThe running time of the train in the kth subinterval is T, and the T is the travel time given by the timetable;
Constraint conditions are as follows:
Wherein M is the current total mass of the train, V is the running speed of the train, f is the frictional resistance borne by the train, s is the required parking position, sp is the actual parking position, C is the resultant force borne by the train, i is the line gradient thousandth, C is the line curvature data, V Tfor temporarily limiting the speed of the line, L cIs a train model parameter;
Preferably, the energy consumption-time cost function of the kth sub-interval determined in step 4 is specifically:
gk(ΔSk,ukf)＝ukff(v)ΔSk+λΔtk。
Preferably, the recursive relationship model of energy consumption-time cost established in step 5 is specifically:
Wherein J is the minimum value of energy consumption and time offset, f (v) is the unit traction force of the full-level position of the train when the speed v is kffor the tractive force usage coefficient, Delta S, of the train in the kth sub-interval kfor the length of the kth sub-interval in the operating line,. DELTA.t kThe operation time of the train in the kth subinterval is shown, and lambda is a relation coefficient of absolute value offset of energy consumption and time; g kEnergy consumption-time cost over the kth decision interval, J kThe minimum energy consumption-time cost is accumulated for the stages from nth to kth.
Preferably, the specific step of determining the optimal operation strategy of the train by using a dynamic programming algorithm according to the recursive relation model of the energy consumption-time cost and the energy consumption-time cost function of the kth sub-interval in the step 6 is as follows:
6.1, discretizing the train operation punctual energy-saving optimization model according to train operation subintervals, dividing the train operation process into N decision-making stages, and setting the end state of the last decision-making stage as 0;
6.2, obtaining a plurality of effective speed connections of the last decision stage according to the terminal state of the kth decision stage and a recursion relation model of energy consumption-time cost;
Respectively substituting the effective speed connections into an energy consumption time cost function to obtain a plurality of energy consumption time costs, and taking the speed connection corresponding to the lowest energy consumption time cost as the terminal state of the last decision stage;
6.3, repeating the step 6.2 to obtain the terminal state of each decision stage, and expressing the optimal decision from the terminal state of each stage to the terminal state of the last stage as a state transition equation;
And 6.4, storing the optimal decision of each stage and the intermediate calculation result in the backtracking recursion process into a backtracking record table to obtain the optimal operation strategy of the train.
Preferably, the state transition equation is:
xk+1＝h(xk,uk)
xkIs the state of the kth stage, u k(xk) For the decision of the kth stage, x k+1Is the state of the (k + 1) th stage.
Preferably, if the train operation time is adjusted at a later time or in the original schedule, λ is directly increased, λ is a coefficient of relation between energy consumption and an absolute value offset of time, an adjustment formula is that λ 2 is (λ 0+ λ 1)/2, (λ 1 is a coefficient greater than λ 2), and the step 6.2 is returned to, and the optimal decision of each stage is obtained again.
Compared with the prior art, the invention has the following remarkable advantages: when the train runs in a plurality of intervals, the state of the current stage is determined, and the selection can be made according to the current state variable, and the backtracking is carried out forward, so that the system directly enters the next stage, and the energy-saving efficiency is greatly improved.
Drawings
Fig. 1 is a flow chart of a train punctual energy-saving operation method based on a dynamic programming algorithm in the invention.
Fig. 2 is a diagram of the train punctual energy-saving optimal operating speed and energy consumption in the invention.
Detailed Description
As shown in fig. 1, a train quasi-point energy-saving operation method based on a dynamic programming algorithm includes the following steps:
And 3, establishing a train operation quasi-point energy-saving optimization model, wherein the target function of the train operation quasi-point energy-saving optimization model is that the sum of the energy consumption and the time offset of train operation is minimum, the constraint condition is the limiting index of train operation and the basic parameter, and the solution is the optimal operation strategy of the train.
In a further embodiment, the objective function of the train operation quasi-point energy-saving optimization model is as follows:
The optimization model is the minimum of the sum of the energy consumption and the travel time offset.
Wherein J is the minimum value of energy consumption and time offset, f (v) is the unit traction force of the full-level position of the train when the speed v is kffor the tractive force usage coefficient, Delta S, of the train in the kth sub-interval kfor the length of the kth sub-interval in the operating line,. DELTA.t kFor the running time of the train in the kth sub-interval, T is the corresponding travel time given by the timetable. And lambda is the relation coefficient of the absolute offset of the energy consumption and the time.
The constraint conditions are specifically as follows:
Wherein M is the current total mass of the train, V is the running speed of the train, f is the frictional resistance borne by the train, s is the required parking position, sp is the actual parking position, C is the resultant force borne by the train, i is the line gradient thousandth, C is the line curvature data, V Tfor temporarily limiting the speed of the line, L cThe train model and other parameters.
Step 4, determining an energy consumption-time cost function of the kth subinterval according to the objective function, specifically:
gk(ΔSk,ukf)＝ukff(v)ΔSk+λΔtk
Step 5, establishing a recursive relation model of energy consumption-time cost, wherein the recursive relation model of energy consumption-time cost is as follows:
Wherein: j is the minimum value of energy consumption and time offset, f (v) is the unit traction force of the full level of the train at the speed v, u kffor the tractive force usage coefficient, Delta S, of the train in the kth sub-interval kfor the length of the kth sub-interval in the operating line,. DELTA.t kThe operation time of the train in the kth subinterval is shown, and lambda is a relation coefficient of absolute value offset of energy consumption and time; g kEnergy consumption-time cost over kth decision interval; j. the design is a square kAccumulating the minimum energy consumption-time cost for the nth phase to the kth phase; the initial value of the energy consumption-time cost is 0.
Step 6, according to the recursive relation model of the energy consumption-time cost and the energy consumption-time cost function of the kth subinterval, the optimal operation strategy of the train is obtained by using a dynamic programming algorithm, and the specific steps are as follows:
6.1, discretizing the train operation punctual energy-saving optimization model according to train operation subintervals, dividing the train operation process into N decision-making stages, and setting the end state of the last decision-making stage as 0;
6.2, obtaining a plurality of effective speed connections of the last decision stage according to the terminal state of the kth decision stage and a recursion relation model of energy consumption-time cost;
Respectively substituting the effective speed connections into an energy consumption time cost function to obtain a plurality of energy consumption time costs, and taking the speed connection corresponding to the lowest energy consumption time cost as the terminal state of the last decision stage;
The effective speed connection is a motion process that the train can be shifted from the state of the current stage to the state of the next stage within the owned traction braking characteristic range;
The state of the train in any decision stage is the current speed of the train, an effective speed connection between adjacent decision stages forms state transition, the train is transitioned from a known initial state to a next state, on the premise that constraint conditions of a train operation punctual energy-saving optimization model are met, a plurality of possibilities exist, and the effective speed connection with the lowest energy consumption time cost can be obtained by substituting the possibilities meeting the constraint conditions into the energy consumption time cost function in the step 2.
6.3, repeating the step 6.2 to obtain the terminal state of each decision stage;
Expressing the optimal decision of the end state of each stage to the end state of the last stage as a state transition equation:
xk+1＝h(xk,uk)
The above equation shows that once state x kAnd decision u k(xk) The state of the next stage is determined and can be expressed by the above formula. I.e. if the initial state and a set of policies u are known 1(x1),u2(x2),...,uN(xN) And solving the state of the whole system process according to the state transition equation.
According to the energy consumption-time cost recursive relation model, backtracking is carried out from the kth subinterval to the previous subinterval according to the energy consumption-time cost recursive relation model, so that a plurality of effective speed connections of the train in each stage can be obtained, all possible energy consumption-time costs in the subinterval are continuously compared in each decision stage, the minimum value is found, and the minimum value is substituted in the next decision stage, so that the optimal decision and the corresponding state transfer equation in the corresponding state of each stage in the whole process can be obtained.
The train has only one state in the N +1 stage, namely V N+10, and in this state the train is at the end The minimum energy consumption-time cost and the time to reach the end point are obviously 0. The braking force coefficient u2 at this time is-1. The backtracking calculation is started from the Nth decision stage, because the end point has only one state, the energy consumption-time cost corresponding to the effective speed connection of any state and the end point in the Nth decision stage is the minimum energy consumption-time cost of the state, the energy consumption-time cost is counted into the corresponding table in the kth stage, and for any state i delta v kConsider all the states j Δ v for the next phase that make the speed connection active k+1And calculating and comparing all energy consumption-time costs, selecting the minimum value and the corresponding arrival time and traction/braking force coefficient thereof, recording the minimum value and the corresponding arrival time and traction/braking force coefficient into a corresponding table, and backtracking to the starting station to finish calculation.
And 6.4, storing the optimal decision of each stage and the intermediate calculation result in the backtracking recursion process into a backtracking record table to obtain the optimal operation strategy of the train. The intermediate calculation result comprises the minimum energy consumption-time cost when the state of the kth decision stage is operated to the last stage, the expected time reaching the last stage corresponding to the minimum energy consumption-time cost, and the optimal traction/braking force use coefficient to be exerted in the state;
the operation strategies of each subinterval obtained in the backtracking process can be recorded into a backtracking record table, as shown in table 1, the rows in the backtracking record table represent each decision stage, and the columns represent the speed of the train at that stage, and the elements when the speed is i △ v are recorded in the kth decision stage of the backtracking record table (J △ v) ki,tki,ukif/ukib). Wherein J kiIs the minimum energy consumption-time cost, t, for the state of the kth decision stage to run to the previous stage kiIs the predicted time to last phase, u, corresponding to the minimum energy consumption-time cost kif/ukibIs the optimum traction/braking force usage factor to be exerted in this state.
TABLE 1
In a further embodiment, if the train operation time is adjusted at a later point of the train or in the original schedule, the lambda is directly adjusted to be lambda 2, the step 6.2 is returned, the optimal decision of each stage is obtained again, the optimized train speed curve meets the requirement of effective connection of four working condition speeds, and the energy consumption per kilometer is reduced compared with that before the optimization. The method for determining the lambda 2 comprises the following steps:
If λ is adjusted to λ 1 so that the deviation of the expected operating time from the given operating time is less than the threshold value, the coefficient of the absolute deviation of the adjusted energy consumption from time is λ 2 ═ λ 0+ λ 1)/2.
Claims (8)
1. A train punctual energy-saving operation method based on a dynamic planning algorithm is characterized by comprising the following steps:
Step 1, setting train running line data and train parameters to construct a train model and a running environment thereof;
Step 2, dividing a train running interval with the length of S into N sub-intervals according to line parameters, ensuring that each divided sub-interval contains a specific slope value, a curve radius and a speed limit value, and ensuring that the length of each sub-interval is delta S k；
Step 3, establishing a train operation quasi-point energy-saving optimization model, wherein the target function of the train operation quasi-point energy-saving optimization model is that the sum of train operation energy consumption and time offset is minimum, the constraint condition is a train operation limiting index and the basic parameters, and the solution is an optimal train operation strategy;
Step 4, determining an energy consumption-time cost function of the kth subinterval according to the target function;
Step 5, establishing a recursion relation model of energy consumption-time cost;
And 6, determining an optimal operation strategy of the train by utilizing a dynamic programming algorithm according to the recursive relation model of the energy consumption-time cost and the energy consumption-time cost function of the kth subinterval.
2. The train waypoint energy-saving operation method based on the dynamic programming algorithm according to claim 1 wherein the route data includes a ramp start and stop kilometer post and a corresponding gradient, a curve section start and stop kilometer post and a corresponding curvature, a speed limit section start and stop kilometer post and a corresponding speed limit, and the train parameters include a train formation mode, a length, a load level, a davis equation, a maximum acceleration, a maximum speed, a traction characteristic curve and a braking characteristic curve.
3. The train quasi-point energy-saving operation method based on the dynamic programming algorithm according to claim 1, wherein the train operation quasi-point energy-saving optimization model established in the step 3 comprises:
An objective function:
Wherein J is the minimum value of energy consumption and time offset, f (v) is the unit traction force of the full level of the train at the speed v, u kffor the tractive force usage coefficient, Delta S, of the train in the kth sub-interval kfor the length of the kth sub-interval in the operating line,. DELTA.t kThe running time of the train in the kth subinterval is T, and the T is the travel time given by the timetable;
Constraint conditions are as follows:
Wherein M is the current total mass of the train, V is the running speed of the train, f is the frictional resistance borne by the train, s is the required parking position, sp is the actual parking position, C is the resultant force borne by the train, i is the line gradient thousandth, C is the line curvature data, V Tfor temporarily limiting the speed of the line, L cIs a train model parameter;
4. The train punctual energy-saving operation method based on the dynamic programming algorithm according to claim 1, characterized in that the energy consumption-time cost function of the kth subinterval determined in step 4 is specifically:
gk(ΔSk,ukf)＝ukff(v)ΔSk+λΔtk。
5. The train punctual energy-saving operation method based on the dynamic programming algorithm according to claim 1, characterized in that the recursive relational model of energy consumption-time cost established in step 5 is specifically:
Wherein J is the minimum value of energy consumption and time offset, f (v) is the unit traction force of the full-level position of the train when the speed v is kffor the tractive force usage coefficient, Delta S, of the train in the kth sub-interval kfor the length of the kth sub-interval in the operating line,. DELTA.t kThe operation time of the train in the kth subinterval is shown, and lambda is a relation coefficient of absolute value offset of energy consumption and time; g kEnergy consumption-time cost over the kth decision interval, J kThe minimum energy consumption-time cost is accumulated for the stages from nth to kth.
6. The train punctual energy-saving operation method based on the dynamic programming algorithm according to claim 1, characterized in that, the specific steps of determining the optimal operation strategy of the train by using the dynamic programming algorithm according to the recursive relation model of energy consumption-time cost and the energy consumption-time cost function of the kth subinterval in step 6 are as follows:
6.1, discretizing the train operation punctual energy-saving optimization model according to train operation subintervals, dividing the train operation process into N decision-making stages, and setting the end state of the last decision-making stage as 0;
6.2, obtaining a plurality of effective speed connections of the last decision stage according to the terminal state of the kth decision stage and a recursion relation model of energy consumption-time cost;
Respectively substituting the effective speed connections into an energy consumption time cost function to obtain a plurality of energy consumption time costs, and taking the speed connection corresponding to the lowest energy consumption time cost as the terminal state of the last decision stage;
6.3, repeating the step 6.2 to obtain the terminal state of each decision stage, and expressing the optimal decision from the terminal state of each stage to the terminal state of the last stage as a state transition equation;
And 6.4, storing the optimal decision of each stage and the intermediate calculation result in the backtracking recursion process into a backtracking record table to obtain the optimal operation strategy of the train.
7. The train punctual energy-saving operation method based on the dynamic programming algorithm according to claim 6, characterized in that the state transition equation is:
xk+1＝h(xk,uk)
xkIs the state of the kth stage, u k(xk) For the decision of the kth stage, x k+1Is the state of the (k + 1) th stage.
8. The train punctual energy-saving operation method based on the dynamic programming algorithm according to claim 6, characterized in that, if the train operation time in the train late or original schedule is adjusted, λ is directly adjusted to λ 2, and the step 6.2 is returned to, and the optimal decision of each stage is obtained again, wherein the determination method of λ 2 is as follows: if λ is adjusted to λ 1 so that the deviation of the expected operating time from the given operating time is less than the threshold value, the coefficient of the absolute deviation of the adjusted energy consumption from time is λ 2 ═ λ 0+ λ 1)/2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910830553.2A CN111409673A (en) | 2019-09-04 | 2019-09-04 | Train quasi-point energy-saving operation method based on dynamic programming algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910830553.2A CN111409673A (en) | 2019-09-04 | 2019-09-04 | Train quasi-point energy-saving operation method based on dynamic programming algorithm |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111409673A true CN111409673A (en) | 2020-07-14 |
Family
ID=71486902
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910830553.2A Withdrawn CN111409673A (en) | 2019-09-04 | 2019-09-04 | Train quasi-point energy-saving operation method based on dynamic programming algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111409673A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112109775A (en) * | 2020-07-31 | 2020-12-22 | 中铁第四勘察设计院集团有限公司 | Dynamic optimization system for train operation curve |
| CN112380605A (en) * | 2020-11-16 | 2021-02-19 | 广州地铁设计研究院股份有限公司 | Method and device for optimizing subway longitudinal section design and energy-saving operation scheme |
| CN112498420A (en) * | 2020-07-31 | 2021-03-16 | 中铁第四勘察设计院集团有限公司 | ATO curve optimization method after disturbance of train operation |
| CN113536204A (en) * | 2021-06-30 | 2021-10-22 | 武汉理工光科股份有限公司 | Intelligent fire fighting force dispatching method and device and storage medium |
| CN113971472A (en) * | 2020-07-23 | 2022-01-25 | 南京理工大学 | Train operation energy-saving method based on dynamic planning and time distribution |
| WO2022051922A1 (en) * | 2020-09-09 | 2022-03-17 | 中车株洲电力机车研究所有限公司 | Energy-saving control method for automatic train operation, and related device and readable storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2923913A1 (en) * | 2014-03-25 | 2015-09-30 | Hitachi, Ltd. | Automatic train operation system |
| CN109615135A (en) * | 2018-12-12 | 2019-04-12 | 广州地铁集团有限公司 | A kind of train operation optimization method based on dynamic programming algorithm |
| CN109978350A (en) * | 2019-03-13 | 2019-07-05 | 北京工业大学 | A kind of subway train energy conservation optimizing method based on regime decomposition dynamic programming algorithm |
-
2019
- 2019-09-04 CN CN201910830553.2A patent/CN111409673A/en not_active Withdrawn
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2923913A1 (en) * | 2014-03-25 | 2015-09-30 | Hitachi, Ltd. | Automatic train operation system |
| CN109615135A (en) * | 2018-12-12 | 2019-04-12 | 广州地铁集团有限公司 | A kind of train operation optimization method based on dynamic programming algorithm |
| CN109978350A (en) * | 2019-03-13 | 2019-07-05 | 北京工业大学 | A kind of subway train energy conservation optimizing method based on regime decomposition dynamic programming algorithm |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113971472A (en) * | 2020-07-23 | 2022-01-25 | 南京理工大学 | Train operation energy-saving method based on dynamic planning and time distribution |
| CN112109775A (en) * | 2020-07-31 | 2020-12-22 | 中铁第四勘察设计院集团有限公司 | Dynamic optimization system for train operation curve |
| CN112498420A (en) * | 2020-07-31 | 2021-03-16 | 中铁第四勘察设计院集团有限公司 | ATO curve optimization method after disturbance of train operation |
| WO2022051922A1 (en) * | 2020-09-09 | 2022-03-17 | 中车株洲电力机车研究所有限公司 | Energy-saving control method for automatic train operation, and related device and readable storage medium |
| AU2020467390B2 (en) * | 2020-09-09 | 2023-12-14 | Crrc Zhuzhou Electric Locomotive Research Institute Co., Ltd. | Energy-saving control method for automatic train operation, and related device and readable storage medium |
| CN112380605A (en) * | 2020-11-16 | 2021-02-19 | 广州地铁设计研究院股份有限公司 | Method and device for optimizing subway longitudinal section design and energy-saving operation scheme |
| CN112380605B (en) * | 2020-11-16 | 2024-04-19 | 广州地铁设计研究院股份有限公司 | Subway longitudinal section design and energy-saving operation scheme optimization method and device |
| CN113536204A (en) * | 2021-06-30 | 2021-10-22 | 武汉理工光科股份有限公司 | Intelligent fire fighting force dispatching method and device and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111409673A (en) | Train quasi-point energy-saving operation method based on dynamic programming algorithm | |
| CN108764571B (en) | Multi-objective optimization method for heavy-duty train operation | |
| CN109815536B (en) | Urban rail transit energy-saving timetable and operation curve optimization method | |
| CN109615135A (en) | A kind of train operation optimization method based on dynamic programming algorithm | |
| CN107180282B (en) | Energy-saving optimization method for multiple trains in high peak time period | |
| CN111125831B (en) | Track traffic train energy-saving speed track curve optimization method | |
| CN110795834B (en) | Urban rail train energy consumption optimization method with intermittent power supply | |
| CN111169508A (en) | Train energy-saving speed curve optimization method based on position discretization dynamic planning | |
| CN113401173B (en) | Train operation control method and device, electronic equipment and storage medium | |
| CN110188401B (en) | Tramcar operation energy consumption optimization method based on improved PSO | |
| CN106056238B (en) | Planning method for train interval running track | |
| AU2020474272A1 (en) | Train power distribution method and device | |
| CN114148325B (en) | Method for managing predictive energy of heavy-duty hybrid commercial vehicle | |
| CN113821966A (en) | Energy-saving optimization method and system for high-speed maglev train operation and storage medium | |
| CN108376190A (en) | A kind of method of the vehicle-mounted ultracapacitor group parameter of determining municipal rail train | |
| CN109398426A (en) | Energy-saving driving strategy optimization method based on discrete ant group algorithm under a kind of timing condition | |
| CN113276829B (en) | Vehicle running energy-saving optimization weight-changing method based on working condition prediction | |
| CN106740998A (en) | Urban track traffic CBTC system onboard ATO energy-conservation control methods | |
| CN117273371A (en) | Method and system for optimizing heavy-load train group running track based on virtual coupling | |
| Licheng et al. | Optimization of train speed curve based on ATO tracking control strategy | |
| CN111598434A (en) | Method for determining configuration scheme of super-capacitor energy storage device of mountain urban rail transit | |
| Arıkan et al. | Optimizing of speed profile in electrical trains for energy saving with dynamic programming | |
| CN109101672B (en) | Rail transit system train operation energy efficiency research method | |
| Keskin et al. | Energy efficient motion control for a light rail vehicle using the big bang big crunch algorithm | |
| CN112989553B (en) | Construction and application of CEBs (common electronic devices and controllers) speed planning model based on battery capacity loss control |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WW01 | Invention patent application withdrawn after publication | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20200714 |