CN107458424A - A kind of more train energy-saving operating methods applied on multi-site - Google Patents
A kind of more train energy-saving operating methods applied on multi-site Download PDFInfo
- Publication number
- CN107458424A CN107458424A CN201710641570.2A CN201710641570A CN107458424A CN 107458424 A CN107458424 A CN 107458424A CN 201710641570 A CN201710641570 A CN 201710641570A CN 107458424 A CN107458424 A CN 107458424A
- Authority
- CN
- China
- Prior art keywords
- train
- habitat
- dwell time
- energy
- site
- 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
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
- B61L27/10—Operations, e.g. scheduling or time tables
- B61L27/12—Preparing schedules
Landscapes
- Engineering & Computer Science (AREA)
- Mechanical Engineering (AREA)
- Train Traffic Observation, Control, And Security (AREA)
Abstract
The present invention relates to a kind of more train energy-saving operating methods applied on multi-site, train, which enters the station to brake, produces electric energy（Referred to as braking electric energy）Outbound traction of the electric energy for train will be braked, reach energy-conservation purpose, for the multi-train movement in a circuit, by adjusting the dwell time of each train in each site, another train is just outbound when train is entered the station as far as possible, the braking electric energy of train is supplied that another train is outbound to be used at once once producing, reduce the conversion process of electric energy conversion storage conversion, improve the utilization rate of regenerating braking energy, more train overall operation energy consumptions are minimized, and reach energy-conservation purpose.
Description
Technical field
The present invention relates to a kind of more train energy-saving operating methods applied on multi-site.
Background technology
With economic development, while bringing convenient, it consumes energy the train spread out everywhere in driving procedure
The problem of serious, also allows people to have a headache, and is shown according to research, most of energy consumption of power network is all the train system as caused by train system
System has become a rich and influential family of power network energy consumption.
The content of the invention
The purpose of the present invention is to improve deficiency of the prior art, and provides a kind of more train sections applied on multi-site
Energy operation method, makes the purpose for reaching energy-conservation during train operation.
The purpose of the present invention is achieved through the following technical solutions：
A kind of more train energy-saving operating methods applied on multi-site are provided, adjust each train respectively in each website
In dwell time, same website has another train just outbound when train is entered the station；Train in the process of entering the station
Another train that electric energy caused by middle braking is used for starting and drawing same website is outbound.
Wherein, the dwell time of each train in each site is adjusted respectively by performing following steps：
Setting steps：Habitat quantity n and habitat population maximum capacity S in BBO algorithms is setmax, and dwelt each
Cease the maximum sudden change probability M on groundmaxSet equal, to each habitat, maximum is moved into rate I, maximum emigration E and migration is general
Rate PmodAll it is adjusted to maximum；
Generation step：To each habitat, the random dwell time correction square for generating train quantity i × website quantity j
Battle array Xn；
Calculation procedure：To each habitat, its dwell time is corrected moment matrix XnBBO algorithms are substituted into dwell so as to calculate this
Cease the suitability degree H on grounda；
Comparison step：Contrast the fitness value H of each habitata, choose wherein minimum fitness value Ha_min, judging should
Minimum fitness value Ha_minWhether corresponding energy consumption in train journey is less than predetermined threshold value, if otherwise iteration performs iteration step
Suddenly, if then exporting the minimum fitness value Ha_minCorresponding dwell time amendment moment matrix Xn, and when being stopped according to this
Between correct moment matrix XnTo adjust the dwell time of each train in each site；
Iterative step：To each habitat, difference computation migration rateAnd mutation rate
Wherein S is the species number of habitat, PSCorresponding probability when for species quantity in habitat being S, according to mobility λSWith it is prominent
Variability MSTo dwell time amendment moment matrix XnMigrated and mutation operation, to obtain new dwell time amendment moment matrix Xn,
With dwell time amendment moment matrix XnTo recalculate the fitness value H of habitata, finally return to and re-execute comparison step.
Wherein, in generation step, generation dwell time amendment moment matrix XnWhen need to meet constraints：For actual feelings
The big website of the volume of the flow of passengers, dwell time only increase in condition.
Wherein, the train is not included in train quantity i if the operation of train is smaller than 800m.
Wherein, in comparison step, by HaIt is ascending to arrange to choose wherein minimum fitness value Ha_min。
Wherein, in comparison step, the turnover rate a of habitat is adjusted to maximum.
Beneficial effects of the present invention：
Train, which enters the station to brake, produces electric energy (referred to as braking electric energy), will brake outbound traction of the electric energy for train, reaches
Purpose is saved, it is most by adjusting the dwell time of each train in each site for the multi-train movement in a circuit
Amount make train when entering the station another train it is just outbound so that the braking electric energy of train supplies another train and gone out once producing at once
Station is used, and to reduce the conversion process of electric energy conversion-storage-conversion, improves the utilization rate of regenerating braking energy, more trains are overall
Operation energy consumption is minimized, and reaches energy-conservation purpose.
Brief description of the drawings
Invention is described further using accompanying drawing, but the embodiment in accompanying drawing does not form any limitation of the invention,
For one of ordinary skill in the art, on the premise of not paying creative work, it can also be obtained according to the following drawings
Its accompanying drawing.
Energy flow schematic diagram when Fig. 1 is multi-train movement.
Structural representation when Fig. 2 is multi-train movement.
Fig. 3 is the flow chart for applying more train energy-saving operating methods on multi-site.
Embodiment
Such as Fig. 1 to Fig. 3, this method is based on biogeography algorithm (i.e. BBO algorithms), under certain constraints,
More train time operating schemes are adjusted, so as to obtain more preferable Energy Saving Strategy.Outbound traction in train travelling process
Operation consumption power network electric energy, running under braking of entering the station feedback power network electric energy, by the traction of the energy utilization fed back when braking to train
Operation, can reach energy-saving effect.Run simultaneously for more trains in a circuit, if having the same time in same service area
More trains are simultaneously out of the station, then more braking energies can be made to be absorbed and used, improve the utilization of regenerating braking energy
Rate, reach the purpose of energy-conservation.Specifically, when train A enters the station, train A braking brakes, at this moment it is placed in the electricity of train A underbody
Chance produces braking electric energy, and the braking electric energy is absorbed by the train B that running under power is being carried out in synchronization, if not
Be utilized, just will braking power storage into energy-storage travelling wave tube (such as super capacitor), to be energized to other equipment, or be
The train C energy supplies of running under power are performed after this.Certain this braking electric energy can also be braked resistance absorption and with heat energy
Form discharges, but can so cause energy dissipation.And when train B is outbound, train B traction Accelerating runnings, braking electric energy arrives
Train B, energized for train B.From above-mentioned, if in the same time, more trains can be made simultaneously out of the station, like this
The energy consumption that train traction starts is exactly braking electric energy caused by train braking brake, what this braking electric energy mutually absorbed
Process can reduce consumption of the whole train system to urban distribution network energy.Therefore adjustment problem shifts to the time operation of train
In the adjustment of scheme, in the case where ensureing circuit normal operation, change and adjust the website dwell time of train, make with for the moment
Between have more trains simultaneously it is out of the station, reach the minimum of energy expenditure.Saving knowledge according to existing track traffic can be with
Obtain the overall energy consumption of system line and more train time operating scheme matrix Emin~T functional relation, it may be determined that BBO is calculated
The adjustment object function of more train time operating schemes of method is as follows：
In formula, E (Ti) represent train running interval total energy consumption, unit kwh；TiFor i the train operations when
Between.
It is in view of safety index and energy consumption index, the setting of basic constraints is as follows:
(1) only increased for the larger website of the part volume of the flow of passengers, dwell time, i.e. tI, j>=0, i represent i-th train,
J represents j-th of website, unit s；
(2) same time, the energy consumption of incoming train are all absorbed by train departure, i.e. ESystem=ELead, unit kw
h；
(3) the total time change in train operation cycle is limited between -12s~12s, i.e. -12s≤tI, j≤12s；
(4) in train travelling process, the loss of energy in a variety of ways, i.e. Δ E=0 are not considered；
(5) the operation minimum spacing of train can not be less than 800m, i.e. Δ S >=800, unit m.
It is assumed that train line is made up of i car parallel connection, j website, then i × j time allocation matrix X can be formedn,
N represents the n-th generation time matrix after iteration, altogether ij element.Each one train of element representation is in website when stopping
Between correction, during with BBO algorithms as, this matrix is regarded to one group of solution of corresponding energy consumption in train journey.Each group of solution is corresponding
An Adjusted Option, i.e. train dwelling time complexity curve scale.
Simplify train model, the model after simplifying is：Model 6 website compositions, then can form one 6 by 5 car parallel connections
× 5 time allocation matrix, altogether 30 elements.Dwell time amendment of each one train of element representation in a website
Amount, according to the fluctuation range of the dwell time of each train, the model of the dwell time correction of all trains may finally be determined
Enclose for [- 5,5], unit s.When the difference of dwell time and the given dwell time of timetable are in the range of amendment, then correspond to
Time complexity curve amount will change.Such as：Dwell time in timetable is 25s, and it is actual generally when stopping
Between be 22s, the dwell time correction of script is [- 5,5], but dwell time correction now should be [- 5,3].So
When using BBO algorithms, this matrix is regarded as one group of solution.When each group of solution correspond to an Adjusted Option, i.e. train dwelling
Between table.Initial matrix is most to start without the dwell time correction before adjustment, i.e., comes according to the actual time without adjustment
Generation：
The matrix shares the row of 5 row 6,5 trains is represented in 6 website parallel runnings, not comprising the station of first and last two.In matrix
Each element represents correction of which train in the berthing time at which station.Such as t3,4=0s, represent the 4th
Residence time correction of the train at the 3rd station is 0s.All it is the generation come according to the situation of actual motion before adjustment, therefore when
Between be all 0s.
It is adjusted afterwards using BBO algorithms, step is as follows：
Setting steps：Algorithm parameter, parameter initialization, habitat quantity n=20, habitat population maximum capacity are set
Smax=50, rate I=1 is moved into the maximum of each habitat, to the maximum emigration E=1, migration probability P of each habitatmod
=1, maximum sudden change probability Mmax=0.05；
Generation step：To each habitat, initial habitat dimension N=30 is generated at random, i.e., at the beginning of dwell time correction
Beginning matrix X0, validity screening is first carried out according to constraints；
Calculation procedure：By dwell time correction initial matrix X0BBO algorithms are substituted into, is calculated by BBO algorithms and each dwelt
Cease the fitness value H on grounda, for different fitness value Ha, habitat is arranged from good to secondary, i.e., by HaValue by it is small to
Longer spread, the turnover rate a=1 of habitat is typically taken during this；
Comparison step：Pass through the fitness value H corresponding to more all habitatsa, choose wherein minimum fitness
Value Ha_min, judge this fitness value Ha_minWhether it is required optimal result, that is, judges the minimum fitness value Ha_minInstitute is right
Whether the energy consumption in train journey answered is less than predetermined threshold value, if optimal result, then exports its power consumption valuesAnd
The fitness value H minimum to thisa_minCorresponding dwell time amendment moment matrix Xn, then according to the dwell time correction square
Battle array XnTo adjust the dwell time of each train in each site；If not optimal result, continues follow-up iterative step.
Iterative step：Iterative step calculates the mobility λ of each habitatSWith mutation rate MS, according to mobility λSAnd mutation
Rate MSTo dwell time amendment moment matrix XnMigrated and mutation operation, to obtain new dwell time amendment moment matrix Xn, and
Dwell time amendment moment matrix XnTo recalculate the fitness value of habitatFinally return to and re-execute and compare
Step.Wherein mobility λSCalculated by below equation：
In formula, S represents the species number of habitat, SmaxRepresent the species maximum number of habitat, λsRepresent mobility.
Mutation rate MSCalculated by below equation：
In formula, MmaxRepresent current mutation rate, MmaxRepresent maximum sudden change rate；PmaxRepresent maximum mobility；PSFor habitat
Middle species quantity is probability corresponding to S.
After n times iteration, finally give the matrix for the adjustment time correction for meeting optimization aim, according to the matrix come
The dwell time of each train in each site in practice is adjusted, so as to obtain Train Schedule Adjusted Option, according to row
Car run time Adjusted Option carrys out the operation energy consumption of computing system train, wherein, energy consumption adjustment index calculation formula is as follows：
In formula, η is expressed as energy consumption regulation, i.e. fractional energy savings, W0、W1, Δ W be expressed as adjustment before, adjustment rank rear
Car operation energy consumption and its difference between the two, unit kwh.
If η is just, represents Adjusted Option power consumption values and be less than former scheme.η is bigger, the integrated regulation effect of adjustment operating mode scheme
Fruit is better.
Finally it should be noted that the above embodiments are merely illustrative of the technical solutions of the present invention, rather than the present invention is protected
The limitation of scope is protected, although being explained with reference to preferred embodiment to the present invention, one of ordinary skill in the art should
Work as understanding, technical scheme can be modified or equivalent substitution, without departing from the reality of technical solution of the present invention
Matter and scope.
Claims (6)
1. a kind of more train energy-saving operating methods applied on multi-site, it is characterized in that：Each train is adjusted respectively each
Dwell time in website, same website has another train just outbound when train is entered the station；Train is being entered the station
During braking caused by electric energy be used for start and draw same website another train it is outbound.
A kind of 2. more train energy-saving operating methods applied on multi-site according to claim 1, it is characterized in that passing through
Following steps are performed to adjust the dwell time of each train in each site respectively：
Setting steps：Habitat quantity n and habitat population maximum capacity S in BBO algorithms is setmax, and each habitat
Maximum sudden change probability MmaxSet equal, to each habitat, maximum is moved into rate I, maximum emigration E and migration probability Pmod
All it is adjusted to maximum；
Generation step：To each habitat, the random dwell time amendment moment matrix X for generating train quantity i × website quantity jn；
Calculation procedure：To each habitat, its dwell time is corrected moment matrix XnBBO algorithms are substituted into so as to calculate the habitat
Suitability degree Ha；
Comparison step：Contrast the fitness value H of each habitata, choose wherein minimum fitness value Ha_min, judge the minimum
Fitness value Ha_minWhether corresponding energy consumption in train journey is less than predetermined threshold value, if otherwise iteration performs iterative step, if
It is to export the minimum fitness value Ha_minCorresponding dwell time amendment moment matrix Xn, and corrected according to the dwell time
Moment matrix XnTo adjust the dwell time of each train in each site；
Iterative step：To each habitat, difference computation migration rateAnd mutation rate
Wherein S is the species number of habitat, PSCorresponding probability when for species quantity in habitat being S, according to mobility λSWith it is prominent
Variability MSTo dwell time amendment moment matrix XnMigrated and mutation operation, to obtain new dwell time amendment moment matrix Xn,
With dwell time amendment moment matrix XnTo recalculate the fitness value H of habitata, finally return to and re-execute comparison step.
A kind of 3. more train energy-saving operating methods applied on multi-site according to claim 2, it is characterized in that in life
Into in step, generation dwell time amendment moment matrix XnWhen need to meet constraints：For the big station of the volume of the flow of passengers in actual conditions
Point, dwell time only increase.
4. a kind of more train energy-saving operating methods applied on multi-site according to claim 3, it is characterized in that：If row
The operation of car is smaller than 800m and the train is not included in train quantity i then.
5. a kind of more train energy-saving operating methods applied on multi-site according to claim 2, it is characterized in that：Than
Compared with step, by HaIt is ascending to arrange to choose wherein minimum fitness value Ha_min。
6. a kind of more train energy-saving operating methods applied on multi-site according to claim 5, it is characterized in that：Than
Compared with step, the turnover rate a of habitat is adjusted to maximum.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710641570.2A CN107458424A (en) | 2017-07-31 | 2017-07-31 | A kind of more train energy-saving operating methods applied on multi-site |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710641570.2A CN107458424A (en) | 2017-07-31 | 2017-07-31 | A kind of more train energy-saving operating methods applied on multi-site |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107458424A true CN107458424A (en) | 2017-12-12 |
Family
ID=60547078
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710641570.2A Withdrawn CN107458424A (en) | 2017-07-31 | 2017-07-31 | A kind of more train energy-saving operating methods applied on multi-site |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107458424A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108985662A (en) * | 2018-08-27 | 2018-12-11 | 广州地铁集团有限公司 | A kind of train operation optimization method based on parallel immunity particle cluster algorithm |
| CN110395299A (en) * | 2019-07-29 | 2019-11-01 | 交控科技股份有限公司 | Train braking energy utilization method in urban track traffic |
| CN112278015A (en) * | 2020-10-13 | 2021-01-29 | 通号城市轨道交通技术有限公司 | Train operation plan determining method and device and electronic equipment |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2684761A2 (en) * | 2012-07-09 | 2014-01-15 | General Electric Company | A method and system for timetable optimization utilizing energy consumption factors |
| CN106828547A (en) * | 2017-03-06 | 2017-06-13 | 北京交通大学 | A kind of train scheduling method and system utilized towards regenerating braking energy |
-
2017
- 2017-07-31 CN CN201710641570.2A patent/CN107458424A/en not_active Withdrawn
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2684761A2 (en) * | 2012-07-09 | 2014-01-15 | General Electric Company | A method and system for timetable optimization utilizing energy consumption factors |
| CN106828547A (en) * | 2017-03-06 | 2017-06-13 | 北京交通大学 | A kind of train scheduling method and system utilized towards regenerating braking energy |
Non-Patent Citations (1)
| Title |
|---|
| 梁枫: ""基于生物地理算法的地铁节能优化研究"", 《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108985662A (en) * | 2018-08-27 | 2018-12-11 | 广州地铁集团有限公司 | A kind of train operation optimization method based on parallel immunity particle cluster algorithm |
| CN110395299A (en) * | 2019-07-29 | 2019-11-01 | 交控科技股份有限公司 | Train braking energy utilization method in urban track traffic |
| CN112278015A (en) * | 2020-10-13 | 2021-01-29 | 通号城市轨道交通技术有限公司 | Train operation plan determining method and device and electronic equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110053521B (en) | Urban rail transit traction power supply system and vehicle-network coordination parameter optimization method | |
| CN106651009B (en) | Energy-saving optimization control method for any multi-vehicle cooperation of urban rail transit | |
| CN107458424A (en) | A kind of more train energy-saving operating methods applied on multi-site | |
| CN109672200B (en) | Distributed coordination control optimization method for urban rail transit ground super-capacitor energy storage system | |
| CN107704975A (en) | Subway train energy-saving run optimization method and system based on biogeography algorithm | |
| CN102831478B (en) | Metro energy consumption comprehensive prediction method based on BP neural network | |
| CN107316125A (en) | A kind of active distribution network economical operation evaluation method based on economical operation domain | |
| CN104537580B (en) | The construction method of distribution network structure based on K means clusters | |
| Ning et al. | A synergistic energy-efficient planning approach for urban rail transit operations | |
| CN107681654A (en) | Consider the Multi-Objective Electric Power Network Planning method and apparatus of new energy consumption and environmental benefit | |
| CN105552940A (en) | Distributed global optimum energy management system based on an alternating direction method of multipliers | |
| CN106571646A (en) | Dynamic active power frequency modulation method and apparatus of photovoltaic power generation system | |
| CN108539231B (en) | Coordination control method and system for multiple sets of fuel cell systems | |
| CN108510127B (en) | Urban rail train operation process optimization method based on renewable energy utilization | |
| CN106427607A (en) | Energy distribution method of electric vehicle hybrid energy storage system | |
| CN102315489B (en) | Method for formation of colloid storage battery of electric vehicle | |
| CN112467739B (en) | Urban rail power supply system configuration method of hybrid regenerative braking energy utilization device | |
| CN105071378B (en) | Day-ahead optimal dispatching method for distribution company with flexible loads | |
| CN106505630A (en) | Isolated island micro-capacitance sensor frequency voltage control method for coordinating based on event trigger mechanism | |
| CN110867903B (en) | Intelligent power grid system real-time optimal power distribution method based on deep neural network | |
| CN113792953A (en) | Virtual power plant optimal scheduling method and system | |
| Sun et al. | An integrated control strategy for the composite braking system of an electric vehicle with independently driven axles | |
| CN111680413B (en) | Tramcar timing energy-saving operation optimization method and system based on double-layer algorithm | |
| CN106169772B (en) | A kind of energy feedback system starting control method and control system based on floating gate threshold value | |
| CN115329160A (en) | Global optimal energy-saving speed curve generation method for high-speed train |
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: 20171212 |