CN107704975A - Subway train energy-saving run optimization method and system based on biogeography algorithm - Google Patents

Subway train energy-saving run optimization method and system based on biogeography algorithm Download PDF

Info

Publication number
CN107704975A
CN107704975A CN201711060491.9A CN201711060491A CN107704975A CN 107704975 A CN107704975 A CN 107704975A CN 201711060491 A CN201711060491 A CN 201711060491A CN 107704975 A CN107704975 A CN 107704975A
Authority
CN
China
Prior art keywords
train
mrow
msub
energy
represent
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.)
Pending
Application number
CN201711060491.9A
Other languages
Chinese (zh)
Inventor
秦斌
王欣
梁枫
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hunan University of Technology
Original Assignee
Hunan University of Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Hunan University of Technology filed Critical Hunan University of Technology
Publication of CN107704975A publication Critical patent/CN107704975A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q50/40

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Marketing (AREA)
  • Game Theory and Decision Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Train Traffic Observation, Control, And Security (AREA)

Abstract

The present invention is directed to rail transit train operation energy consumption problem, it is proposed that a kind of subway train energy-saving run optimization method and system based on biogeography algorithm.Biogeography algorithm proposed by the present invention optimizes in two stages, the optimal energy-saving driving curve of biogeography algorithm thorough search train is utilized in the first stage, the rate curve of optimized operation is obtained on the premise of meeting running conditions of vehicle, run time and langding accuracy and constraining, reaches the effect of energy-conservation.Second stage optimizes for timetable run time, biogeography algorithm optimizes to dwell time increment of each train in each website, table at the time of optimizing original train operation, make same service area there are more trains the same time simultaneously out of the station, improve the utilization rate of regeneration energy.Multiple target of the present invention to train, high-dimensional problem has preferable improvement, convergence rate and precision for Optimal Parameters also have obvious effect, and under the given normal service condition of train, the formulation for the energy-saving run and timetable of train in actual track has good result with optimization.

Description

Subway train energy-saving run optimization method and system based on biogeography algorithm
1 technical field
The present invention relates to a kind of optimization method of rail transit train energy saving in running, specifically, it is related to a kind of base In the subway train energy-saving run optimization method of biogeography algorithm.
2 background technologies
It is train power supply that 33kV three-phase alternating voltages are formed 1500V DC voltages by traction substation through 24 pulse wave rectifiers, Train obtains traction voltage to carry out a running under power of standing using pantograph or conductor rail, and running is according to operating mode between whole station The number of transfer point and position adjust, and different Adjusted Options obtains different speed operation curves.
During multi-train movement, during train braking, regenerative braking energy feedback is produced to power network or the 3rd rail, is Energy is provided in the tractor-trailer train of same service area's synchronization.Run time and the dwell time of train are adjusted, is obtained same The quantity of service area's synchronization train out of the station is different.
In single vehicles running, due to the difference of train operating mode so that energy consumption during train operation is not Together;During multi-train movement, due to the run time of train and the difference of dwell time so that same in same service area Regeneration capacity usage ratio is different caused by the braking at moment.The energy consumption of train in the process of running how is saved, reaches energy consumption Minimum, saving financial cost becomes the problem of control field technical staff needs to consider at present.
3 content of the invention
Technical problem:Train is many in the affected factor of running, and many uncertain factors occurred, Energy consumption can be caused to have unnecessary loss.But the process often optimized is all independent, the situation of optimization is also relatively simple, right In high-dimensional optimization aim also without effective solution.For the train run between station, it is difficult to ensure parameter Accuracy, so as to be difficult to ensure that the effect of energy saving optimizing.
Technical scheme:In order to overcome above mentioned problem, a kind of new intelligent algorithm biogeography algorithm and track traffic are arranged Car operation two benches energy saving optimizing combines, i.e. optimal speed performance curve in the first stage, by the speed operating mode after optimization Application of curve is on second stage multi-train movement, the timetable that stops of adjusting and optimizing train.It so both compensate for traditional intelligence The deficiency of algorithm, also meet train and more effectively save in the process of running.Also reached while train normal operation is ensured The purpose of energy-conservation is arrived.
A kind of track traffic energy-saving run prioritization scheme based on biogeography algorithm proposed by the present invention, it is characterised in that Based on biogeography algorithm, the process of two independent operatings of train is combined.Ensure it is punctual on schedule under conditions of, The train speed performance curve of first stage is optimized, using the number of change working point and position as variable, after obtaining optimization Speed-optimization curve, be finally reached the effect of energy saving optimizing;The rate curve that train is run between station applies to more trains In operation, by changing adjustment train in the dwell time of website, make there are more trains to enter in unified service area synchronization It is outbound, finally regenerating braking energy is fully used, reach energy-saving effect.
Stage 1:Train selection operating mode operation target be under train normal operation, one station between run when, Change the operating mode rate curve of train, every kind of operating scheme can obtain corresponding power consumption values, realize the minimum of train power consumption. The object function of Optimized model can be described as:
In formula, TiFor the Train Schedule of section i timetables requirement, unit s;E(Ti) it is train actual motion energy Consumption, unit kwh;SiThe actual range of train operation between station, unit m;TsFor after optimization during train actual motion Between, unit s;EsFor energy consumption in train journey after optimization, unit kwh;SSFor the train operation distance after optimization, unit is m。
In formula, a+b+c=1.A is the weight of Train Schedule, and b is the weight of energy consumption in train journey, and c is train operation The weight of distance.D is the late penalty factor of train operation, e be train operation range difference away from penalty factor, a, b and c's takes Value is set according to the demand of practical problem, and their value depends on the requirement on schedule to run time, and operation energy consumption is most Small requirement and the required precision of range ability.According to pertinent literature.
The constraints of rate curve Optimized model
Ts≤Ti (2)
D1≥lcoast (3)
Di-1≤Di (4)
v0=0, vn=0,0≤vi≤vmax (5)
ai≤amax (7)
(2) actual run time can not be more than the given standard time between formula represents train station;(3) formula represents that train enters first The constraint that row coasting operation has to comply with, D1Represent the position of first time coasting, lcoastRepresent train coasting since starting to Necessary beeline;(4) formula represents the position constraint of train coasting transfer point;(5) formula represents train in the process of running Speed is no more than maximal rate, v0Represent the initial velocity of train operation, vnRepresent the end speed of train operation, viRepresent row The initial velocity that car is currently run, vmaxRepresent the maximal rate of train operation;(6) a in formulaFRepresent to add caused by the hauling capacity of a locomotive Speed, agRepresent acceleration caused by grade resistance, afRepresent datum drag caused by acceleration, Δ s represent train operation away from From;vi-1Represent the end speed that train is currently run.(7) a iniRepresent train acceleration, amaxRepresent peak acceleration.Reference columns Car operation relevant parameter setting, launch train peak acceleration is 0.56m/s2, braking peak acceleration is -1m/s2.When wherein Between unit be s, the unit of distance is m, and the unit of speed is km/h, and the unit of acceleration is m/s2
With { s0,s1,s2,…sN-1Represent a circuit on each change working point position, optimization dimension is N, BBO The specific optimization process of algorithm is as follows:
Step 1 sets BBO algorithm parameters;Since section 1;
Step 2 generates the index vector of multiple N-dimensionals, as change working point according to the line length run between train station Number, wherein N is even number;
Step 3 generates initial habitat population, any H for choosing habitatiIndex vector XiInitialized.
Step 4 calculates the suitability degree of each habitat, for different suitability degree Hi, habitat is arranged from good to secondary Row;
Step 5 determines whether required optimal result by comparing, if optimal result, then output valve, and flow Terminate.Otherwise step Step 6 is continued;
Step 6 calculates the mobility and mutation rate of each habitat, is migrated and mutation operation, recalculates and inhabites The suitability degree H on groundi, return to step Step 4;
If each Dimensionality optimizations of Step 7 are completed, terminate;If also dimension does not optimize completion, return to step Step 2 carry out next range optimization.
By the change working point number of train operation station and the optimization of position, changing operation side between the station of train Formula, it is rational to increase coasting operating condition, it is finally reached the purpose of energy-conservation.
Stage 2:In order to obtain more preferable energy-saving effect, while energy-saving train operation strategy is studied, also by timetable Optimization problem account for, the two is combined and modeled with bilayer model, designs a two stage prioritization scheme, Also global timetable is optimized while using algorithm optimization train driving strategy, so as to obtain more preferable Energy Saving Strategy. It is required that the energy that consumption is minimum, as follows to the object function of overall control of consuming energy:
In formula, E (Ti) represent train running interval total energy consumption, unit kwh;TiFor i-th train operation when Between.
Invention considers safety index and energy consumption index, to obtain optimal energy conservation object.Therefore basic constraints is set Put 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 Represent 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 in rational time range;
(4) in train travelling process, the loss of energy in a variety of ways is not considered;
(5) the operation minimum spacing of train can not be less than Δ S, unit m.
Subway line m platform composition, then can be formed m × n time allocation matrix, had altogether by n car parallel connection Mxn element.Each correction of one train of element representation in the dwell time of a website, during with BBO algorithms, by this Individual matrix regards one group of solution of corresponding energy consumption in train journey as.Each group of solution correspond to a prioritization scheme, i.e. train dwelling time Correction table.
The step of BBO algorithm optimizations, is as follows:
Step 1 sets algorithm parameter, parameter initialization;
Step 2 generates initial habitat dimension, i.e. dwell time correction initial matrix X0, first entered according to constraints Row validity is screened;
Step 3 calculates the suitability degree H of each habitati, for different suitability degree Hi, habitat is arranged from good to secondary Row;
Step 4 determines whether required optimal result by comparing, if optimal result, then output valve, and flow Terminate.Otherwise step Step 5 is continued;
Step 5 calculates the mobility and mutation rate of each habitat, is migrated and mutation operation, recalculates and inhabites The suitability degree H on groundi, return to step Step 3.
Updated by iteration, the train time table after being optimized, when adjusting train actual run time and stopping Between, regenerative braking energy consumption is fully used, be finally reached the purpose of energy-conservation.
Finally obtain energy optimization index:
η is expressed as energy optimization rate, i.e. fractional energy savings;
W0、W1, Δ W be expressed as optimization before, optimization after energy consumption in train journey and its difference between the two, unit kWh.
If η is just, representing optimized scheme power consumption values is less than former scheme.η is bigger, the global optimization effect of optimization operating mode scheme Fruit is better.
Beneficial effect:For biogeography optimized algorithm of the present invention not only to high-dimensional, the control of multiple target has good result, and And also there are quick optimization characteristics to parameter.In the case where keeping normal operation, speed performance curve is not only optimized, and make The dwell time of train website can also be adjusted according to physical condition.The optimization in two stages causes the overall energy consumption drop of train It is low, it is finally reached the effect of energy-saving and emission-reduction.
Brief description of the drawings
Fig. 1 is the control structure figure of the track train running optimizatin based on biogeography algorithm.
Embodiment:
Rail transit train running optimizatin method combination accompanying drawing proposed by the present invention based on biogeography algorithm and specific Details are as follows for embodiment:
The present invention is that parameter is optimized under normal operation in guarantee subway train using biogeography algorithm optimization Method.Stage 1:The target of train selection operating mode operation is under train normal operation, when being run between a station, is changed The operating mode rate curve of changing train, every kind of operating scheme can obtain corresponding power consumption values, realize the minimum of train power consumption.It is excellent Changing the object function of model can be described as:
In formula, TiFor the Train Schedule of section i timetables requirement, unit s;E(Ti) it is train actual motion energy Consumption, unit kwh;SiThe actual range of train operation between station, unit m;TsFor when train actual motion is total after optimization Between, unit s;EsFor energy consumption in train journey after optimization, unit kwh;SSFor the train operation distance after optimization, unit is m。
In formula, a+b+c=1.A is the weight of Train Schedule, and b is the weight of energy consumption in train journey, and c is train operation The weight of distance.D is the late penalty factor of train operation, e be train operation range difference away from penalty factor, a, b and c's takes Value is set according to the demand of practical problem, and their value depends on the requirement on schedule to run time, and operation energy consumption is most Small requirement and the required precision of range ability.According to pertinent literature, a=0.3, b=0.4, c=0.3.
The constraints of rate curve Optimized model
Ts≤Ti (11)
D1≥lcoast (12)
Di-1≤Di (13)
v0=0, vn=0,0≤vi≤vmax (14)
ai≤amax (16)
(2) actual run time can not be more than the given standard time between formula represents train station;(3) formula represents that train enters first The constraint that row coasting operation has to comply with, D1Represent the position of first time coasting, lcoastRepresent train coasting since starting to Necessary beeline;(4) formula represents the position constraint of train coasting transfer point;(5) formula represents train in the process of running Speed is no more than maximal rate, v0Represent the initial velocity of train operation, vnRepresent the end speed of train operation, viRepresent row The initial velocity that car is currently run, vmaxRepresent the maximal rate of train operation;(6) a in formulaFRepresent to add caused by the hauling capacity of a locomotive Speed, agRepresent acceleration caused by grade resistance, afRepresent datum drag caused by acceleration, Δ s represent train operation away from From;vi-1Represent the end speed that train is currently run.(7) a iniRepresent train acceleration, amaxRepresent peak acceleration.Reference columns Car operation relevant parameter setting, launch train peak acceleration is 0.56m/s2, braking peak acceleration is -1m/s2.When wherein Between unit be s, the unit of distance is m, and the unit of speed is km/h, and the unit of acceleration is m/s2
With { s0,s1,s2,…sN-1Represent a circuit on each change working point position, optimization dimension is N, BBO The specific optimization process of algorithm is as follows:
Step 1 sets BBO algorithm parameters;Since first section;
Step 2 generates the index vector of multiple N-dimensionals, as change working point according to the line length run between train station Number, wherein N is even number;
Step 3 generates initial habitat population, any H for choosing habitatiIndex vector XiInitialized.
Step 4 calculates the suitability degree of each habitat, for different suitability degree Hi, habitat is arranged from good to secondary Row, typically take the turnover rate i=1 of habitat;
Step 5 determines whether required optimal result by comparing, if optimal result, then output valve, and flow Terminate.Otherwise step Step 6 is continued;
Step 6 calculates the mobility and mutation rate of each habitat, is migrated and mutation operation, recalculates and inhabites The suitability degree H on groundi, return to step Step 4;
Step 7 takes N=2 respectively, and 4,6,8, if each Dimensionality optimization is completed, terminate;If also dimension has not optimized Cheng Ze, return to step Step 2 carry out next range optimization.
By the change working point number of train operation station and the optimization of position, changing operation side between the station of train Formula, it is rational to increase coasting operating condition, it is finally reached the purpose of energy-conservation.
Stage 2:In order to obtain more preferable energy-saving effect, while energy-saving train operation strategy is studied, also by timetable Optimization problem account for, the two is combined and modeled with bilayer model, designs a two stage prioritization scheme, Also global timetable is optimized while using algorithm optimization train driving strategy, so as to obtain more preferable Energy Saving Strategy. It is required that the energy that consumption is minimum, as follows to the object function of overall control of consuming energy:
In formula, E (Ti) represent train running interval total energy consumption, unit kwh;TiFor i-th train operation when Between.
Invention considers safety index and energy consumption index, to obtain optimal energy conservation object.Therefore basic constraints is set Put 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.
Subway line m platform composition, then can be formed m × n time allocation matrix, had altogether by n car parallel connection Mxn element.Each correction of one train of element representation in the dwell time of a website, during with BBO algorithms, by this Individual matrix regards one group of solution of corresponding energy consumption in train journey as.Each group of solution correspond to a prioritization scheme, i.e. train dwelling time Correction table.
The step of BBO algorithm optimizations, is as follows:
Step 1 sets algorithm parameter, parameter initialization;
Step 2 generates initial habitat dimension, i.e. dwell time correction initial matrix X0, first entered according to constraints Row validity is screened;
Step 3 calculates the suitability degree H of each habitati, for different suitability degree Hi, habitat is arranged from good to secondary Row, typically take the turnover rate i=1 of habitat;
Step 4 determines whether required optimal result by comparing, if optimal result, then output valve, and flow Terminate.Otherwise step Step 5 is continued;
Step 5 calculates the mobility and mutation rate of each habitat, is migrated and mutation operation, recalculates and inhabites The suitability degree H on groundi, return to step Step 3.
Updated by iteration, the train time table after being optimized, when adjusting train actual run time and stopping Between, regenerative braking energy consumption is fully used, be finally reached the purpose of energy-conservation.
Finally obtain energy optimization index:
η is expressed as energy optimization rate, i.e. fractional energy savings;
W0、W1, Δ W be expressed as optimization before, optimization after energy consumption in train journey and its difference between the two, unit kWh.
If η is just, representing optimized scheme power consumption values is less than former scheme.η is bigger, the global optimization effect of optimization operating mode scheme Fruit is better.
Above-mentioned specific implementation is the preferable realization of the present invention, and certainly, the present invention can also have other various embodiments, In the case of without departing substantially from spirit of the invention and essence, those skilled in the art work as can make various phases according to the present invention The change and deformation answered, but these corresponding changes and deformation should all belong to the scope of the claims of the present invention.

Claims (2)

1. a kind of subway train energy-saving run optimized algorithm, it is characterised in that this method utilizes biogeography algorithm by train operation Two independent stages combine, the high-dimensional optimization problem of multiple target is completed using biogeography algorithm.In the first rank Section, train motor self-characteristic, line slope and bend speed limit are taken into account, complete the authenticity of train actual motion; Second stage, the flow of the people actually got on or off the bus is taken into account, while ensureing that the stream of people gets on or off the bus safely, complete the excellent of train Change operation.Two independent stages are combined into optimization with biogeography algorithm, compensate for traditional intelligence algorithm for higher-dimension The weak point of multi-objective problem is spent, while train is reached more preferable energy-saving effect.
2. according to a kind of subway train energy-saving run optimized algorithm of the requirement of right 1, it is characterised in that train motor itself is led Draw the utilization ratio that characteristic decides train energy in the process of running, line slope and bend speed limit decide the actual mistake of train The authenticity and validity of journey, make train travelling process closer to reality.During train dwelling, according to the people that gets on or off the bus of reality Flow completes stopping for train, while ensureing safe, improves the utilization rate to the time, makes train Effec-tive Function.Specifically such as Under:
It is interior in the first stage, using the number of change working point and position as variable, and with train train motor self-characteristic, The conditions such as circuit, the gradient and bend speed limit optimize as reference frame and constraints, and the object function of Optimized model is:
<mrow> <mi>M</mi> <mi>i</mi> <mi>n</mi> <mi>W</mi> <mo>=</mo> <mi>a</mi> <mo>|</mo> <mfrac> <mrow> <msub> <mi>T</mi> <mi>s</mi> </msub> <mo>-</mo> <msub> <mi>T</mi> <mi>i</mi> </msub> </mrow> <msub> <mi>T</mi> <mi>i</mi> </msub> </mfrac> <mo>|</mo> <mo>&amp;CenterDot;</mo> <mi>d</mi> <mo>+</mo> <mi>b</mi> <mo>|</mo> <mfrac> <mrow> <mi>E</mi> <mrow> <mo>(</mo> <msub> <mi>T</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi>E</mi> <mi>s</mi> </msub> <mo>-</mo> <mi>E</mi> <mrow> <mo>(</mo> <msub> <mi>T</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>|</mo> <mo>+</mo> <mi>c</mi> <mo>|</mo> <mfrac> <mrow> <msub> <mi>S</mi> <mi>s</mi> </msub> <mo>-</mo> <msub> <mi>S</mi> <mi>i</mi> </msub> </mrow> <msub> <mi>S</mi> <mi>i</mi> </msub> </mfrac> <mo>|</mo> <mo>&amp;CenterDot;</mo> <mi>e</mi> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow>
In formula, TiFor the Train Schedule of section i timetables requirement, unit s;TsFor train actual run time after optimization, Unit is s;E(Ti) it is train actual motion energy consumption, unit kwh;EsFor energy consumption in train journey after optimization, unit kw h;SiThe actual range of train operation between station, unit m;SSFor the train operation distance after optimization, unit m, a are row The weight of car run time, b be energy consumption in train journey weight, c be train operation distance weight, a+b+c=1.D is train Run late penalty factor, e be train operation range difference away from penalty factor, a, b and c value is according to the need of practical problem Ask and set, their value depends on the requirement on schedule to run time, and the minimum of operation energy consumption requires and range ability Required precision.
The constraints of rate curve Optimized model
Ts≤Ti (2)
D1≥lcoast (3)
Di-1≤Di (4)
v0=0, vn=0,0≤vi≤vmax (5)
<mrow> <mi>a</mi> <mo>=</mo> <mfrac> <mrow> <msubsup> <mi>v</mi> <mi>t</mi> <mn>2</mn> </msubsup> <mo>-</mo> <msubsup> <mi>v</mi> <mrow> <mi>t</mi> <mo>-</mo> <mn>1</mn> </mrow> <mn>2</mn> </msubsup> </mrow> <mrow> <mn>2</mn> <mo>&amp;CenterDot;</mo> <mi>&amp;Delta;</mi> <mi>s</mi> </mrow> </mfrac> <mo>=</mo> <msub> <mi>a</mi> <mi>F</mi> </msub> <mo>+</mo> <msub> <mi>a</mi> <mi>g</mi> </msub> <mo>+</mo> <msub> <mi>a</mi> <mi>f</mi> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>6</mn> <mo>)</mo> </mrow> </mrow>
ai≤amax (7)
(2) actual run time can not be more than the given standard time between formula represents train station;(3) it is lazy to represent that train is carried out first for formula The constraint that row operation has to comply with, D1Represent the position of first time coasting, lcoastRepresent that coasting must since starting to for train The beeline of palpus;(4) formula represents the position constraint of train coasting transfer point;(5) formula represents train speed in the process of running No more than maximal rate, v0Represent the initial velocity of train operation, vnRepresent the end speed of train operation, viRepresent that train is worked as The initial velocity of preceding operation, vmaxRepresent the maximal rate of train operation;(6) a in formulaFAcceleration caused by the hauling capacity of a locomotive is represented, agRepresent acceleration caused by grade resistance, afAcceleration caused by datum drag is represented, Δ s represents the distance of train operation; vi-1Represent the end speed that train is currently run.(7) a iniRepresent train acceleration, amaxRepresent peak acceleration.Reference train The relevant parameter setting of operation, launch train peak acceleration is 0.56m/s2, braking peak acceleration is -1m/s2.When wherein Between unit be s, the unit of distance is m, and the unit of speed is km/h, and the unit of acceleration is m/s2
With { s0,s1,s2,…sN-1The position of each change working point on a circuit in section is represented, optimization dimension is N, The specific optimization process of BBO algorithms is as follows:
Step 1 sets BBO algorithm parameters;Since section 1;
Step 2 generates the index vector of multiple N-dimensionals, as change working point is individual according to the line length run between train station Number, wherein N is even number;
Step 3 generates initial habitat population, any H for choosing habitatiIndex vector XiInitialized.
Step 4 calculates the suitability degree of each habitat, for different suitability degree Hi, habitat is arranged from good to secondary;
Step 5 determines whether required optimal result, if optimal result, then output valve, flow terminate by comparing. Otherwise step Step 6 is continued;
Step 6 calculates the mobility and mutation rate of each habitat, is migrated and mutation operation, recalculates habitat Suitability degree Hi, return to step Step 4;
If each Dimensionality optimizations of Step 7 are completed, terminate;If also dimension does not optimize completion, return to step Step 2 enters The next range optimization of row.
By the way that the change working point number of train operation station and continuing to optimize for position, the data after each renewal are carried out Comparative analysis, the power consumption values according to needed for system, realize continuing to optimize for system.
Matrix timetable is formed as variable in the dwell time increment of each website using each train in second stage, and with The flow of the people actually got on or off the bus is reference frame and constraints, and the object function of Optimized model is:
<mrow> <mi>m</mi> <mi>i</mi> <mi>n</mi> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </munderover> <mi>E</mi> <mrow> <mo>(</mo> <msub> <mi>T</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>8</mn> <mo>)</mo> </mrow> </mrow>
In formula, E (Ti) represent train running interval total energy consumption, unit kwh;TiFor the time of i-th train operation.
Invention considers safety index and energy consumption index, to obtain optimal energy conservation object.Therefore the setting of basic constraints is such as Under:
(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 tables Show 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 kwh;
(3) the total time change in train operation cycle was limited in certain reasonable time;
(4) in train travelling process, the loss of energy in a variety of ways is not considered;
(5) the operation minimum spacing of train can not be less than Δ S, unit m.
Subway line is made up of n car parallel connection, m platform, then can form m × n time allocation matrix, and i represents optimization Which for habitat, mxn element altogether.Amendment of each one train of element representation in the dwell time of a website Amount, 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 correspond to one it is excellent Change scheme, i.e. train dwelling time complexity curve scale.
The step of BBO algorithm optimizations, is as follows:
Step 1 sets algorithm parameter, parameter initialization;
Step 2 generates initial habitat dimension, i.e. dwell time correction initial matrix X0, first carried out according to constraints effective Property screening;
Step 3 calculates the suitability degree H of each habitati, for different suitability degree Hi, habitat is arranged from good to secondary;
Step 4 determines whether required optimal result, if optimal result, then output valve, flow terminate by comparing. Otherwise step Step 5 is continued;
Step 5 calculates the mobility and mutation rate of each habitat, is migrated and mutation operation, recalculates habitat Suitability degree Hi, return to step Step 3.
Table data read-out at the time of constantly updating, by the judgement comparative analysis to the data after each iteration, according to required The power consumption values for the system wanted, realize continuing to optimize for system.
CN201711060491.9A 2017-06-30 2017-11-02 Subway train energy-saving run optimization method and system based on biogeography algorithm Pending CN107704975A (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710522273 2017-06-30
CN2017105222736 2017-06-30

Publications (1)

Publication Number Publication Date
CN107704975A true CN107704975A (en) 2018-02-16

Family

ID=61176861

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711060491.9A Pending CN107704975A (en) 2017-06-30 2017-11-02 Subway train energy-saving run optimization method and system based on biogeography algorithm

Country Status (1)

Country Link
CN (1) CN107704975A (en)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108764571A (en) * 2018-05-28 2018-11-06 西南交通大学 A kind of Multipurpose Optimal Method of heavy haul train operation
CN109101672A (en) * 2018-06-12 2018-12-28 同济大学 Rail Transit System train operation efficiency Methods
CN109398426A (en) * 2018-09-19 2019-03-01 中南大学 Energy-saving driving strategy optimization method based on discrete ant group algorithm under a kind of timing condition
CN109858154A (en) * 2019-01-31 2019-06-07 广州地铁设计研究院股份有限公司 A kind of energy-saving train operation method based on multiple-objection optimization
CN110155827A (en) * 2019-05-13 2019-08-23 北京化工大学 A kind of intelligence control system of group's elevator
CN110738369A (en) * 2019-10-15 2020-01-31 西南交通大学 Operation speed optimization method of urban rail transit trains
CN112528212A (en) * 2020-12-24 2021-03-19 交控科技股份有限公司 Engineering truck EBI curve calculation method and device with ATP protection
CN112590867A (en) * 2020-12-21 2021-04-02 中车青岛四方车辆研究所有限公司 Urban rail train group speed optimization method and system based on vehicle-to-vehicle communication
CN115860339A (en) * 2023-02-17 2023-03-28 天津津轨汇海科技发展有限公司 Big data analysis-based rail transit energy consumption management method and related components

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108764571B (en) * 2018-05-28 2020-04-14 西南交通大学 Multi-objective optimization method for heavy-duty train operation
CN108764571A (en) * 2018-05-28 2018-11-06 西南交通大学 A kind of Multipurpose Optimal Method of heavy haul train operation
CN109101672A (en) * 2018-06-12 2018-12-28 同济大学 Rail Transit System train operation efficiency Methods
CN109101672B (en) * 2018-06-12 2023-05-12 同济大学 Rail transit system train operation energy efficiency research method
CN109398426A (en) * 2018-09-19 2019-03-01 中南大学 Energy-saving driving strategy optimization method based on discrete ant group algorithm under a kind of timing condition
CN109398426B (en) * 2018-09-19 2020-06-16 中南大学 Energy-saving driving strategy optimization method based on discrete ant colony algorithm under timing condition
CN109858154A (en) * 2019-01-31 2019-06-07 广州地铁设计研究院股份有限公司 A kind of energy-saving train operation method based on multiple-objection optimization
CN110155827B (en) * 2019-05-13 2020-08-04 北京化工大学 Intelligent control system of group elevator
CN110155827A (en) * 2019-05-13 2019-08-23 北京化工大学 A kind of intelligence control system of group's elevator
CN110738369A (en) * 2019-10-15 2020-01-31 西南交通大学 Operation speed optimization method of urban rail transit trains
CN112590867A (en) * 2020-12-21 2021-04-02 中车青岛四方车辆研究所有限公司 Urban rail train group speed optimization method and system based on vehicle-to-vehicle communication
CN112590867B (en) * 2020-12-21 2022-05-27 中车青岛四方车辆研究所有限公司 Urban rail train group speed optimization method and system based on vehicle-to-vehicle communication
CN112528212A (en) * 2020-12-24 2021-03-19 交控科技股份有限公司 Engineering truck EBI curve calculation method and device with ATP protection
CN115860339A (en) * 2023-02-17 2023-03-28 天津津轨汇海科技发展有限公司 Big data analysis-based rail transit energy consumption management method and related components
CN115860339B (en) * 2023-02-17 2023-05-05 天津津轨汇海科技发展有限公司 Rail transit energy consumption management method and device based on big data analysis

Similar Documents

Publication Publication Date Title
CN107704975A (en) Subway train energy-saving run optimization method and system based on biogeography algorithm
CN104590333B (en) A kind of railroad train smart steering Optimal Control System
CN105460048B (en) Comprehensive energy-saving control method and method integrating optimized manipulation and traffic scheduling for urban rail transit
Ning et al. A synergistic energy-efficient planning approach for urban rail transit operations
CN104260759B (en) A kind of urban track traffic energy conservation optimizing method and system
CN107180282A (en) A kind of peak period many train energy conservation optimizing methods
CN108510127B (en) Urban rail train operation process optimization method based on renewable energy utilization
CN106651009B (en) Energy-saving optimization control method for any multi-vehicle cooperation of urban rail transit
CN107187442A (en) The plug-in hybrid electric automobile EMS predicted based on operating mode
CN109583125B (en) Optimization method for improving utilization rate of regenerative braking energy of subway train
CN107368920A (en) A kind of off-peak period multi-train movement energy conservation optimizing method
CN107704950A (en) A kind of city rail train figure optimization method based on trip requirements and energy saving of system
CN102495934B (en) Design method for railway transport drawing power balanced run chart based on particle swarm algorithm
CN104656452B (en) A kind of subway train optimal control method discrete based on matrix and device
CN105551337A (en) Driving auxiliary method and system for train driver
Cipek et al. Comparative analysis of conventional diesel-electric and hypothetical battery-electric heavy haul locomotive operation in terms of fuel savings and emissions reduction potentials
Li et al. Energy-constraint operation strategy for high-speed railway
CN106056238B (en) Planning method for train interval running track
CN108883784A (en) The method and train driver consulting system of drive advice are provided to train driver
CN111680413B (en) Tramcar timing energy-saving operation optimization method and system based on double-layer algorithm
CN109109913B (en) A kind of information processing method for Rail Transit System efficiency organization of driving
CN109376437A (en) A kind of vehicle-mounted energy storage optimal control method of new energy based on multi-objective genetic algorithm
CN106740998A (en) Urban track traffic CBTC system onboard ATO energy-conservation control methods
CN106143535B (en) A kind of subway train optimization of operating parameters method based on immune algorithm
Sun et al. Timetable optimization for maximization of regenerative braking energy utilization in traction network of urban rail transit

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20180216

WD01 Invention patent application deemed withdrawn after publication