CN116401873A - Intelligent line selection method considering train running speed curve optimization - Google Patents

Intelligent line selection method considering train running speed curve optimization Download PDF

Info

Publication number
CN116401873A
CN116401873A CN202310379221.3A CN202310379221A CN116401873A CN 116401873 A CN116401873 A CN 116401873A CN 202310379221 A CN202310379221 A CN 202310379221A CN 116401873 A CN116401873 A CN 116401873A
Authority
CN
China
Prior art keywords
train
running
cost
line
energy consumption
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.)
Granted
Application number
CN202310379221.3A
Other languages
Chinese (zh)
Other versions
CN116401873B (en
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.)
East China Jiaotong University
Original Assignee
East China Jiaotong University
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 East China Jiaotong University filed Critical East China Jiaotong University
Priority to CN202310379221.3A priority Critical patent/CN116401873B/en
Publication of CN116401873A publication Critical patent/CN116401873A/en
Application granted granted Critical
Publication of CN116401873B publication Critical patent/CN116401873B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00Computer-aided design [CAD]
    • G06F30/20Design optimisation, verification or simulation
    • 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/10Office automation; Time management
    • G06Q10/103Workflow collaboration or project management
    • 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
    • G06Q30/00Commerce
    • G06Q30/02Marketing; Price estimation or determination; Fundraising
    • G06Q30/0201Market modelling; Market analysis; Collecting market data
    • G06Q30/0206Price or cost determination based on market factors
    • 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
    • G06Q50/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40Business processes related to the transportation industry
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00Three dimensional [3D] modelling, e.g. data description of 3D objects
    • G06T17/05Geographic models
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2111/00Details relating to CAD techniques
    • G06F2111/04Constraint-based CAD
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2111/00Details relating to CAD techniques
    • G06F2111/06Multi-objective optimisation, e.g. Pareto optimisation using simulated annealing [SA], ant colony algorithms or genetic algorithms [GA]
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2111/00Details relating to CAD techniques
    • G06F2111/08Probabilistic or stochastic CAD
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2119/00Details relating to the type or aim of the analysis or the optimisation
    • G06F2119/06Power analysis or power optimisation
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2119/00Details relating to the type or aim of the analysis or the optimisation
    • G06F2119/14Force analysis or force optimisation, e.g. static or dynamic forces

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Strategic Management (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Human Resources & Organizations (AREA)
  • General Business, Economics & Management (AREA)
  • Economics (AREA)
  • Finance (AREA)
  • Development Economics (AREA)
  • Accounting & Taxation (AREA)
  • Geometry (AREA)
  • Marketing (AREA)
  • Data Mining & Analysis (AREA)
  • Tourism & Hospitality (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Computer Hardware Design (AREA)
  • Evolutionary Computation (AREA)
  • Remote Sensing (AREA)
  • Computer Graphics (AREA)
  • Game Theory and Decision Science (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Train Traffic Observation, Control, And Security (AREA)

Abstract

The invention discloses an intelligent railway line selection method considering train running speed curve optimization, which specifically comprises the following steps: establishing a comprehensive geographic information model, dividing the railway route selection design area range into a regular grid consisting of square cells, and discretely storing information required by route selection into the grid; constructing a line optimization model comprising railway initial engineering investment and maintenance operation cost based on the comprehensive geographic information model, and providing a train operation speed curve optimization method, and acquiring train operation energy consumption cost and passenger travel time cost through train operation simulation based on the obtained optimized operation speed curve; based on the railway line optimization model, a line intelligent search method based on a differential evolution algorithm is provided for model solving, and an optimized line scheme is obtained.

Description

Intelligent line selection method considering train running speed curve optimization
Technical Field
The invention relates to the field of railway route selection design, in particular to an intelligent route selection method considering train operation curve optimization.
Background
The railway route selection design is a global core work of railway construction, is a prerequisite for determining project investment, operation, society and environmental protection rationality, is a fundamental decision for controlling the factors, and has the basic task of determining the railway space position according to the functional requirements of design projects and combining natural, economical and social environments of the areas, and once the design is incorrect, the birth defects of the railway are caused, and huge disasters and irreparable losses are brought to later construction and operation.
The present China is in the rapid development period of railways, and the ' schema of advanced planning of railways in the strong China in the new era ' proposes ' about 20 ten thousand kilometers of national railway network by 2035, wherein about 7 ten thousand kilometers of high-speed rail. Railway survey design units will generally face the difficult situation of tight time and heavy tasks. In the face of urgent design time, how to efficiently design an optimized railway line station scheme has become a key problem to be solved in the current urgent need. The intelligent line selection technology can quickly search out a series of valuable line schemes and provide references for designers; meanwhile, the artificial design scheme can be deeply optimized, so that the method is an important way for solving the difficult problem.
The research aiming at intelligent route selection can be traced to the 60 th century, and the main thought is as follows: abstracting the design problem of the iron (public) route as a constraint optimization problem, and obtaining an optimized route scheme by constructing a route optimization model and providing a model solving method. Through development for over 50 years, the line optimization object is developed into plane and longitudinal plane integral optimization of a three-dimensional space from two-dimensional line plane optimization or longitudinal plane optimization; the optimization target is optimized by single targets mainly based on construction cost in early stage, and is expanded into multi-target optimization of comprehensive construction cost and operation cost; the search algorithm gradually improves from an early analytical mathematical algorithm to an intelligent heuristic search represented by particle swarm, genetic algorithm, and the like.
However, the existing intelligent line selection method generally has heavy initial engineering investment and light maintenance operation cost. From the perspective of the whole life cycle of the railway, the railway operation energy consumption cost is far higher than the railway initial engineering investment. Therefore, if the energy consumption problem of train operation is considered in the design stage of the train, the train operation speed curve is optimized, and the train energy-saving operation-friendly train line scheme is obtained, so that the energy consumption cost of train operation is obviously reduced, and the whole life cycle cost of the railway is saved. In this regard, the invention discloses an intelligent route selection method considering train running speed curve optimization.
Disclosure of Invention
In order to solve the problems, the invention aims to provide an intelligent route selection method considering train running speed curve optimization, which comprises the following steps:
s1, establishing a comprehensive geographic information model, dividing a railway route selection design area range into a regular grid composed of square cells, and collecting various geographic information required by route design and discretely storing the various geographic information into the grid, wherein the various geographic information comprises data information to be considered in railway route selection design of topography, geology and population distribution;
s2, constructing a line optimization model comprising initial engineering investment and maintenance operation cost of a railway based on the comprehensive geographic information model, optimizing the running speed of the train, obtaining train running energy consumption and time cost through train running simulation based on the obtained optimized running speed curve, and forming the railway maintenance operation cost together with the track maintenance cost and the locomotive maintenance cost;
And S3, performing intelligent line search based on the railway line optimization model and on a differential evolution algorithm to obtain an optimized line scheme.
Preferably, the initial engineering investment comprises: engineering fee C for earthwork E Bridge engineering fee C B Tunnel engineering fee C T Costs C related to the length of the line, track laying, etc L Cost of land C W Rolling stock purchase fee C ROLL The method comprises the steps of carrying out a first treatment on the surface of the The maintenance operation cost comprises: train operation energy consumption C LE Passenger travel time fee C LU Maintenance cost C for track maintenance MT Maintenance cost C of rolling stock MS The method comprises the steps of carrying out a first treatment on the surface of the To sum up, the railway line optimization model objective function is expressed as:
Min f(X,Y,R,K,H)=C E +C B +C T +C L +C w +C ROLL +C LE +C LU +C MS +C MT
in the process of acquiring initial engineering investment, earth-rock engineering cost C E Expressed as:
Figure BDA0004171511200000021
wherein n is f 、n c 、n f-c The number of the line filling, excavation and half-filling and half-excavation road sections is represented; u (u) fi 、u ci Representing the engineering cost of filling/excavating earth and stone per unit volume 3 ;K i The mileage m is the ith stake mark; a is that fi For the ith fill cross-sectional area m 2 ;A ci For the ith square cross-sectional area m 2 ;A hfi Representing the fill area m in the ith half-fill half-cut 2 ;A hci Representing the square area m in the ith half-filled half-cut section 2
Figure BDA0004171511200000031
Figure BDA0004171511200000032
Figure BDA0004171511200000033
Figure BDA0004171511200000034
Wherein H is l (i) Filling/cutting height m, H for the left side of the i-th half-filling half-cutting section r (i) Filling/excavating height m for the right side of the ith half-filling half-excavation section; s is S f For filling slope, S c Is a digging slope; w is the line cross-sectional width m.
Bridge engineering fee C B Expressed as:
Figure BDA0004171511200000035
wherein n is B Representing the number of bridges; u (u) Bi Representing the building cost per unit length of the ith bridge; l (L) Bi Representing the length m of the ith bridge; c (C) Ai And the construction cost of the ith bridge abutment is represented.
Tunnel engineering fee C T Expressed as:
Figure BDA0004171511200000036
wherein n is T Representing the number of tunnels; u (u) Ti Representing the construction cost per unit length of the ith tunnel; l (L) Ti Represents an ith tunnel length m; c (C) Pi Indicating the construction cost of the ith tunnel portal.
Track laying and other costs C related to the length of the line L Expressed as:
C L =u L ×L total
wherein u is L Is the unit cost (m, L) related to the length of the line total Is the route length m.
Cost of land C W Expressed as:
Figure BDA0004171511200000037
wherein n is cell Representing the number of cells occupied by the line; u (u) wi Land fee/m representing the ith cell 2 The method comprises the steps of carrying out a first treatment on the surface of the d represents the cell length m.
Locomotive vehicle acquisition fee C ROLL Expressed as:
C ROLL =N ROLL ×u ROLL
Figure BDA0004171511200000041
wherein N is ROLL Representing the number of trains required to meet the transportation; u (u) ROLL Indicating the unit price of the train (including locomotives and vehicles); t (T) ROLL The time s representing a single round trip of the train; h(s) represents train departure interval time s; []Representing a rounding symbol.
In the process of acquiring maintenance operation fees, the train operation energy consumption fee C LE Expressed as:
Figure BDA0004171511200000042
Figure BDA0004171511200000043
wherein C is TE The energy consumption cost for the annual operation of the train is; u (U) ENERGY The energy consumption cost per unit operation of the train is per kwh; e (E) round The energy consumption kwh for one round trip of the train; p (P) round The transport capacity person for the train to go to and fro once; p (P) annual People are required for annual transportation of railways; g e The service life growth rate can be consumed for train operation; t is the service life of railway operation; r is the annual expansion percentage of currency.
Passenger travel time cost C LU Expressed as:
Figure BDA0004171511200000044
C U =U USER ×P C ×T round
C TU =C U ×N trip
Figure BDA0004171511200000045
wherein N is trip The travel frequency of annual passengers is; p (P) annual Is a requirement for annual transportation of railways; p (P) C The passenger carrying capacity of the train; t (T) round The train is reciprocated for one time for the operation time h; c (C) U The cost of the time of a train to travel once is the cost of the time of a passenger; u (U) USER The value per hour is the value per hour of the passenger; t (T) round The time h for the train to come and go once; g u Is the passenger time value increase rate; t is the service life of railway operation; r is the annual expansion rate of money; c (C) LU Is the total cost of passenger time in the whole life cycle of the train; c (C) TU The annual train operation passenger time cost is.
Track maintenance cost C MT Expressed as:
Figure BDA0004171511200000046
wherein N is replace T is the number of track changes in the railway operation period R For the service life of the track, m is the number of track sections with curve radius smaller than a given value; l (L) rk A k-th round curve length m with a curve radius smaller than a given value; u (u) track Cost per unit length of track is the same as the cost per unit length of track; g r Is the track cost increase rate; t is the service life of railway operationLimiting; r annual expansion percentage of currency. It should be noted that the track is severely worn in the curved section, especially in the small curved section, so that the present invention mainly considers the small radius curved section when calculating the maintenance cost of the track maintenance.
Maintenance cost C for locomotive vehicle MS
Figure BDA0004171511200000051
C TMS =u MS ×N round ×L total
In the formula g s The maintenance cost increase rate is for the rolling stock maintenance; t is the service life of railway operation; r is the annual expansion rate of currency, u MS Maintenance cost per m for a vehicle to go back and forth every kilometer; n (N) round The annual round trip times; l (L) total The total length m of the line.
C for acquiring train operation energy consumption LE In the process of (2) for train round trip energy consumption E round The calculation method of (2) is as follows:
firstly, calculating the addition gradient of a line, and dividing the line into a plurality of subintervals based on the addition gradient, wherein the addition gradient of each subinterval is the same.
Figure BDA0004171511200000052
Wherein i is a Adding gradient per mill; i is the gradient of the line per mill; r is the radius m of a circular curve; l (L) s Is the tunnel length m.
Then, the train running state is switched in each section according to the current running speed and the target speed of the train, and the method specifically comprises the following steps:
a. at the running speed
Figure BDA0004171511200000053
<Target speed->
Figure BDA0004171511200000054
When the train reaches the target speed of the section, the train enters a cruising stage;
b. at the running speed
Figure BDA0004171511200000055
=target speed +.>
Figure BDA0004171511200000056
When the train is in a constant speed stage, the traction force of the train is equal to the resistance of the train, and the train runs at a constant speed;
c. at the running speed
Figure BDA0004171511200000057
>Target speed->
Figure BDA0004171511200000058
When the train is switched to an idle stage, the traction force of the train is zero, only the resistance of the train acts, and the speed of the train is reduced to the target speed;
d. the braking phase is mainly used for train parking braking, and braking is needed when the running speed of the train downhill section exceeds the limit speed.
The method for calculating the running energy consumption and time of the train in different running states comprises the following steps:
train acceleration running state: the train receives traction force F (v) and running resistance W (v), F (v) > W (v), and under the state of train acceleration running, the acceleration is calculated as follows:
Figure BDA0004171511200000061
wherein a is max Maximum permissible acceleration m/s for passenger comfort 2
Based on the train running acceleration, the running energy consumption and the running time of increasing the train running speed by 1m/s are obtained:
Figure BDA0004171511200000062
Figure BDA0004171511200000063
Figure BDA0004171511200000064
wherein E is tra The energy consumption J for the acceleration operation of the train; m is the weight t of the train; v is the train running speed m/s; w (v) is train running resistance N/t; l (L) tra The length m of the train acceleration operation is the length m; a, a avail (v) For running acceleration m/s of train 2 ;T tra (v) Is the train running time s.
Train constant speed running state: the train receives traction force F (v) and running resistance W (v), and F (v) =w (v), and the running energy consumption and running time calculation formula is as follows:
E cru =w(v)×M×L cru
Figure BDA0004171511200000065
wherein E is cru The energy consumption J for the train to run at a constant speed; m is the weight t of the train; v is the train running speed m/s; w (v) is train running resistance N/t; l (L) cru The constant speed running length m of the train; t (T) cru (v) And the train is operated at a constant speed s.
Train idle running state: the train only receives running resistance W (v), the running energy consumption is 0, and the train running time is calculated as follows:
Figure BDA0004171511200000066
Figure BDA0004171511200000067
wherein M is the weight t of the train; v is the train running speed m/s; a, a coa For the idle acceleration m/s of the train 2 The method comprises the steps of carrying out a first treatment on the surface of the W (v) is train running resistance N/t; t (T) coa (v) For the train idle running time s.
Train braking operation state: the running resistance W (v) and the braking force B (v) of the train are received, the running energy consumption is 0, and the running time of the train is calculated according to the following formula:
Figure BDA0004171511200000071
wherein T is bra1 The train braking operation time s; l (L) bra1 The train braking travel distance m.
Train parking brake status: the running resistance W (v) and the braking force B (v) of the train are received, the running energy consumption is 0, and the calculation formula of the train parking braking time is as follows:
Figure BDA0004171511200000072
Figure BDA0004171511200000073
Wherein T is bra2 Parking brake operating time s for the train; l (L) bra2 The running distance m is the braking and stopping distance of the train; a, a max Maximum permissible acceleration m/s for passenger comfort 2 The method comprises the steps of carrying out a first treatment on the surface of the g is gravity acceleration m/s 2
And calculating the running energy consumption and the running time of the train from the starting point to the end point and from the end point to the starting point based on the running energy consumption and the running time calculation formulas under different running states of the train, and obtaining the running energy consumption and the running time of the train in one round trip.
The train operation target speed optimizing method specifically comprises the following steps:
firstly, a continuous micro-objective function which comprehensively considers the train operation energy consumption and the passenger time cost is established, and the method is specifically as follows:
and (3) calculating train operation energy consumption cost:
Figure BDA0004171511200000074
C ENERGY =E(v)×u ENERGY
wherein E (v) is train operation energy consumption kwh; a. b and c are experimental measurement constants; w (W) a The running resistance N/t of the train; m is the weight t of the train; l (L) U The running distance m of the train; c (C) ENERGY The energy consumption cost m for train operation; u (u) ENERGY The unit energy consumption cost is the unit energy consumption cost per meter.
And (3) calculating the time and cost of the passengers:
Figure BDA0004171511200000075
C USER =T(v)×P c ×u USER
wherein T (v) is train running time h; c (C) USER The time cost for the passengers is; p (P) C The passenger carrying capacity of the train; u (u) USER The time value per hour of the passenger is this/h.
The following formula is established by integrating the train operation energy consumption cost and the passenger time cost:
Figure BDA0004171511200000081
Then, deriving the above formula to obtain the optimal running speed
Figure BDA0004171511200000088
The method comprises the following steps:
Figure BDA0004171511200000082
2c×M×U ENERGY ×v i opt 3 +b×M×U ENERGY ×v i opt 2 -3600×P C ×U USER =0
finally, comprehensively considering the optimal running speed of the train
Figure BDA0004171511200000083
Equalizing speed->
Figure BDA0004171511200000084
Limiting speed->
Figure BDA0004171511200000085
Determining a train operation target speed +.>
Figure BDA0004171511200000086
The method comprises the following steps:
Figure BDA0004171511200000087
the railway line optimization model objective function can be obtained through calculation by the method. In addition, the railway line also needs to meet a plurality of constraint conditions such as minimum circle curve radius, minimum slope length, maximum gradient, maximum bridge height, clearance height and the like, and in order to ensure the transportation requirement, the running time of the trains between adjacent stations needs to meet the time constraint requirement. This patent divides it into geometric constraint, structure constraint, regional constraint and time constraint according to the characteristic of different constraints, and is specific as follows:
(1) Geometric constraints
According to the railway line design Specification (GB 10098-2017), railway lines have to meet the following geometrical constraint requirements: minimum curve radius constraint, minimum circle curve length constraint, minimum clamp straight line length constraint, minimum slope segment length constraint, maximum gradient constraint and gradient algebraic difference constraint are expressed as:
g i (X,Y,R,K,H)≤0
(2) The structure is constrained by the structure,
the structures such as bridges, tunnels, roadbeds and the like are required to meet corresponding constraint requirements, such as: the bridge needs to meet the maximum bridge height constraint, the bridge floor is free from vertical curve constraint, the tunnel needs to meet the maximum tunnel length constraint, the tunnel single slope or the herringbone slope constraint, the roadbed needs to meet the ground transverse slope constraint, and the method is expressed as follows:
h i (X,Y,R,K,H)≤0
(3) Regional constraints
The regional constraints include forbidden zone constraints, must-pass zone constraints, crossing constraints, and elevation trend constraints proposed for tight slope sections, expressed as:
l i (X,Y,R,K,H)≤0
(4) Time constraint, wherein the running time of the trains between adjacent stations meets the time limit requirement for completing the train transportation requirement, and the time constraint is expressed as follows:
T(X,Y,R,K,H)-T lim ≤0
in summary, the railway line optimization model is obtained as follows:
Min f(X,Y,R,K,H)=C E +C B +C T +C L +C w +C ROLL +C LE +C LU +C MS +C MT
s.t.g i (Y)≤0
h i (X,Y,R,K,H)≤0
l i (X,Y,R,K,H)≤0
T(X,Y,R,K,H)-T lim ≤0
the method is based on a differential evolution algorithm to search the space position of the line, an optimized line method is obtained, and model solving is achieved. The method comprises the following steps:
s1, connecting a starting point and a finishing point of a line, and uniformly dividing a cutting surface along the connecting line of the starting point and the finishing point of the line;
s2, randomly laying intersection points on the cutting surface, configuring a circular curve, generating N initial line schemes, and if the line schemes do not meet constraint requirements, regenerating until N initial line schemes are obtained, and establishing an initial line scheme group;
s3, selecting the ith initial scheme Γ i (i=1, 2, …, N), and performing a mutation operation to generate an intermediate mutation line scheme vΓ i
ii,j ) t =Γ rand1i,j ) t +F·(Γ rand2i,j ) trand3i,j ) t )
Wherein V gamma ii,j ) t A j variable which is the i intermediate variant line scheme in the t-th generation scheme; Γ -shaped structure rand1 Is the 1 st random scheme in the t generation scheme; Γ -shaped structure rand2 Is the 2 nd random scheme in the t generation scheme; Γ -shaped structure rand3 Is the 3 rd random scheme in the t generation scheme; f is a scaling factor, typically in [0,2 ] ]In the middle, the patent takes 0.5.
S4, generating an intermediate variation line scheme V gamma i And the ith line scheme Γ i Performing cross operation to generate a new scheme T gamma i
Figure BDA0004171511200000101
In T gamma ii,j ) t A j variable which is the i test line scheme in the t generation scheme; rand is [0,1]Random numbers uniformly distributed among the two; cr is the crossover probability, typically in [0,1 ]]Optionally, 0.1 is taken here.
S5, comparing the newly generated scheme T gamma i And original line scheme Γ i Selecting a better scheme as a next generation scheme;
s6, repeating the steps S2-S5 to traverse all the line schemes to generate a child scheme group;
and S7, repeating the steps S2-S6 until the maximum iteration times are reached.
The invention discloses the following technical effects:
the invention integrates the train running speed curve optimization into the railway line selection process, can consider whether the designed line scheme is favorable for saving the train running energy consumption in the line selection process, and designs the line scheme for saving the whole life cycle cost of the railway according to the railway traffic demand.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions of the prior art, the drawings that are needed in the embodiments will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of the present invention;
FIG. 2 is a plan view of an example circuit design;
fig. 3 is a longitudinal section view of an example circuit design.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the embodiments of the present application more clear, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is apparent that the described embodiments are only some embodiments of the present application, but not all embodiments. The components of the embodiments of the present application, which are generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present application, as provided in the accompanying drawings, is not intended to limit the scope of the application, as claimed, but is merely representative of selected embodiments of the application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present application without making any inventive effort, are intended to be within the scope of the present application.
As shown in fig. 1, the intelligent line selection method considering train operation speed curve optimization according to the present invention includes the following steps:
s1, establishing a comprehensive geographic information model, dividing the range of a certain 37km multiplied by 21km practical railway route selection design area into 1233 x 700 regular grids consisting of square cells with side length of 30m, collecting various information (including topography, ground objects, engineering unit price and the like) required by route selection design, and uniformly and discretely storing the collected various information into the grids.
S2, establishing comprehensive consideration of initial engineering investment (including earth and stone engineering fee C) E Bridge engineering fee C B Tunnel engineering fee C T Track laying and the like and line lengthRelated fee C L Cost of land C W Rolling stock purchase fee C ROLL ) And maintenance operation costs (including: train operation energy consumption C LE Passenger travel time fee C LU Maintenance cost C for track maintenance MT Maintenance cost C of rolling stock MS ) Is a railway line optimization model.
Min f(X,Y,R,K,H)=C E +C B +C T +C L +C w +C ROLL +C LE +C LU +C MS +C MT
s.t.g i (Y)≤0
h i (X,Y,R,K,H)≤0
l i (X,Y,R,K,H)≤0
T(X,Y,R,K,H)-T lim ≤0
The calculation method for each objective function is as follows:
(1) Engineering cost C of earthwork E : the patent calculates the earth and stone engineering cost CE based on the average sectional area method, and the earth and fill engineering cost CE is 18/m 3 20/m of earthwork excavation engineering cost 3 Wherein, the method comprises the steps of, wherein,
Figure BDA0004171511200000111
wherein n is f 、n c 、n f-c The number of the line filling, excavation and half-filling and half-excavation road sections is represented; u (u) fi 、u ci Representing the engineering cost of filling/excavating earth and stone per unit volume 3 ;K i The mileage m is the ith stake mark; a is that fi For the ith fill cross-sectional area m 2 ;A ci For the ith square cross-sectional area m 2 ;A hfi Representing the fill area m in the ith half-fill half-cut 2 ;A hci Representing the square area m in the ith half-filled half-cut section 2
Figure BDA0004171511200000121
Figure BDA0004171511200000122
Figure BDA0004171511200000123
Figure BDA0004171511200000124
Wherein H is l (i) Filling/cutting height m, H for the left side of the i-th half-filling half-cutting section r (i) Filling/excavating height m for the right side of the ith half-filling half-excavation section; s is S f For filling slope, S c Is a digging slope; w is the line cross-sectional width m.
(2) Bridge engineering fee C B : presetting a bridge setting threshold (10 m) according to design experience, automatically setting a bridge when the difference between the line design elevation and the ground elevation exceeds the preset threshold, and setting a bridge height H<50m, bridge engineering cost 37800/m; when the bridge height H is more than or equal to 50m and the bridge length L<At 500m, the bridge engineering cost is 48800/m; when the bridge height H is more than or equal to 50m and the bridge length L is more than or equal to 500m, the bridge engineering cost is 58800/m, wherein,
Figure BDA0004171511200000125
wherein n is B Representing the number of bridges; u (u) Bi Representing the building cost per unit length of the ith bridge; l (L) Bi Representing the length m of the ith bridge; c (C) Ai And the construction cost of the ith bridge abutment is represented.
(3) Tunnel engineering fee C T : the patent presets a tunnel threshold (-15 m) according to design experience, automatically sets a tunnel when the difference between the line design elevation and the ground elevation exceeds the given threshold, and has a tunnel engineering cost of 60000/m when the tunnel length L is more than or equal to 1000m, a tunnel engineering cost of 56000/m when the tunnel length L is more than or equal to 400m, and a tunnel when the tunnel length L is less than 400mTrack engineering fee 54000/m, wherein,
Figure BDA0004171511200000126
wherein n is T Representing the number of tunnels; u (u) Ti Representing the construction cost per unit length of the ith tunnel; l (L) Ti Represents an ith tunnel length m; c (C) Pi Indicating the construction cost of the ith tunnel portal.
(4) Track laying and other costs C related to the length of the line L : track engineering cost of 4000/m, wherein,
C L =u L ×L total
wherein u is L Is the unit cost (m, L) related to the length of the line total Is the route length m.
(5) Cost of land C W : the line design area is divided into units of 30m×30m size. Assuming that the land charge in each unit is uniform, the land charge is 90/m 2 Wherein, the method comprises the steps of, wherein,
Figure BDA0004171511200000131
wherein n is cell Representing the number of cells occupied by the line; u (u) wi Land fee/m representing the ith cell 2 The method comprises the steps of carrying out a first treatment on the surface of the d represents the cell length m.
(6) Rolling stock purchase fee C ROLL : the purchase cost of the rolling stock is 120000000 per train calculated according to the number of trains required for transportation and the unit cost per train, and 8 trains are required in total, wherein,
C ROLL =N ROLL ×u ROLL
Figure BDA0004171511200000132
wherein N is ROLL Representing the number of trains required to meet the transportation; u (u) ROLL Representing train sheetsPrice (including locomotives and vehicles); t (T) ROLL The time s representing a single round trip of the train; h(s) represents train departure interval time s; []Representing a rounding symbol.
(7) Train operation energy consumption C LE : the passenger capacity of the train (the train weight 474t and the power 5300 kW) used by the invention is 1340 people in one round trip. Train departure intervals were assumed to be 15 minutes with 18 hours of daily operation, from 6 a.m. to midnight. Assume that the train is operated for 365 days per year. From these assumptions, the annual traffic demand can be calculated as 35215200. Designed to be 50 years according to the life cycle of a railway; the energy consumption cost is 2.5/kWh; the interest rate is 5 percent per year, the energy consumption cost of the whole life cycle operation of the train is calculated, wherein,
Figure BDA0004171511200000133
Figure BDA0004171511200000134
Wherein C is TE The energy consumption cost for the annual operation of the train is; u (U) ENERGY The energy consumption cost per unit operation of the train is per kwh; e (E) round The energy consumption kwh for one round trip of the train; p (P) round The transport quantity of the train to and fro once; p (P) annual Is a requirement for annual transportation of railways; g e The service life growth rate can be consumed for train operation; t is the service life of railway operation; r is the annual expansion percentage of currency.
(8) Passenger travel time cost C LU : for the special passenger line, calculating the cost of the passenger travel time in a full-load state of the train, wherein the number of passengers in each train is fixed, the relation between the passenger flow and the travel time is not considered, and the cost of the passenger travel time is calculated according to the related data such as the train departure time, the passenger capacity, the annual traffic demand, the interest rate and the like and the time value of the user of 7.5/h,
Figure BDA0004171511200000141
C U =U USER ×P C ×T round
C TU =C U ×N trip
Figure BDA0004171511200000142
wherein N is trip The travel frequency of annual passengers is; p (P) annual Is a requirement for annual transportation of railways; p (P) C The passenger carrying capacity of the train; t (T) round The train is reciprocated for one time for the operation time h; c (C) U The cost of the time of a train to travel once is the cost of the time of a passenger; u (U) USER The value per hour is the value per hour of the passenger; t (T) round The time h for the train to come and go once; g u Is the passenger time value increase rate; t is the service life of railway operation; r is the annual expansion rate of money; c (C) LU Is the total cost of passenger time in the whole life cycle of the train; c (C) TU The annual train operation passenger time cost is.
Energy consumption E for one round trip of train round And time T round
Firstly, calculating the addition gradient of a line, and dividing the line into a plurality of subintervals based on the addition gradient, wherein the addition gradient of each subinterval is the same.
Figure BDA0004171511200000143
Wherein i is a Adding gradient per mill; i is the gradient of the line per mill; r is the radius m of a circular curve; l (L) s Is the tunnel length m.
Then, the train running state is switched in each section according to the current running speed and the target speed of the train, and the method specifically comprises the following steps:
a. at the running speed
Figure BDA0004171511200000144
<Target speed->
Figure BDA0004171511200000145
When the train reaches the target speed of the section, the train enters a cruising stage;
b. at the running speed
Figure BDA0004171511200000146
=target speed +.>
Figure BDA0004171511200000147
When the train is in a constant speed stage, the traction force of the train is equal to the resistance of the train, and the train runs at a constant speed;
c. at the running speed
Figure BDA0004171511200000148
>Target speed->
Figure BDA0004171511200000149
When the train is switched to an idle stage, the traction force of the train is zero, only the resistance of the train acts, and the speed of the train is reduced to the target speed;
d. the braking phase is mainly used for train parking braking, and braking is needed when the running speed of the train downhill section exceeds the limit speed.
The method for calculating the running energy consumption and time of the train in different running states comprises the following steps:
train acceleration running state: the train receives traction force F (v) and running resistance W (v), F (v) > W (v), and under the state of train acceleration running, the acceleration is calculated as follows:
Figure BDA0004171511200000151
wherein a is max Maximum permissible acceleration m/s for passenger comfort 2
Based on the train running acceleration, the running energy consumption and the running time of increasing the train running speed by 1m/s are obtained:
Figure BDA0004171511200000152
Figure BDA0004171511200000153
Figure BDA0004171511200000154
wherein E is tra The energy consumption J for the acceleration operation of the train; m is the weight t of the train; v is the train running speed m/s; w (v) is train running resistance N/t; l (L) tra The length m of the train acceleration operation is the length m; a, a avail (v) For running acceleration m/s of train 2 ;T tra (v) Is the train running time s.
Train constant speed running state: the train receives traction force F (v) and running resistance W (v), and F (v) =w (v), and the running energy consumption and running time calculation formula is as follows:
E cru =w(v)×M×L cru
Figure BDA0004171511200000155
wherein E is cru The energy consumption J for the train to run at a constant speed; m is the weight t of the train; v is the train running speed m/s; w (v) is train running resistance N/t; l (L) cru The constant speed running length m of the train; t (T) cru (v) And the train is operated at a constant speed s.
Train idle running state: the train only receives running resistance W (v), the running energy consumption is 0, and the train running time is calculated as follows:
Figure BDA0004171511200000156
Figure BDA0004171511200000157
Wherein M is the weight t of the train; v is the train running speed m/s; a, a coa For the idle acceleration m/s of the train 2 The method comprises the steps of carrying out a first treatment on the surface of the W (v) is train running resistance N/t; t (T) coa (v) For the train idle running time s.
Train braking operation state: the running resistance W (v) and the braking force B (v) of the train are received, the running energy consumption is 0, and the running time of the train is calculated according to the following formula:
Figure BDA0004171511200000161
wherein T is bra1 The train braking operation time s; l (L) bra1 The train braking travel distance m.
Train parking brake status: the running resistance W (v) and the braking force B (v) of the train are received, the running energy consumption is 0, and the calculation formula of the train parking braking time is as follows:
Figure BDA0004171511200000162
Figure BDA0004171511200000163
wherein T is bra2 Parking brake operating time s for the train; l (L) bra2 The running distance m is the braking and stopping distance of the train; a, a max Maximum permissible acceleration m/s for passenger comfort 2 The method comprises the steps of carrying out a first treatment on the surface of the g is gravity acceleration m/s 2
And calculating the running energy consumption and the running time of the train from the starting point to the end point and from the end point to the starting point based on the running energy consumption and the running time calculation formulas under different running states of the train, and obtaining the running energy consumption and the running time of the train in one round trip.
Target speed for each subinterval
Figure BDA0004171511200000164
Firstly, a continuous micro-objective function which comprehensively considers the train operation energy consumption and the passenger time cost is established, and the method is specifically as follows:
And (3) calculating train operation energy consumption cost:
Figure BDA0004171511200000165
C ENERGY =E(v)×u ENERGY
wherein E (v) is train operation energy consumption kwh; a. b and c are experimental measurement constants; w (W) a The running resistance N/t of the train; m is the weight t of the train; l (L) U The running distance m of the train; c (C) ENERGY The energy consumption cost m for train operation; u (u) ENERGY The unit energy consumption cost is the unit energy consumption cost per meter.
And (3) calculating the time and cost of the passengers:
Figure BDA0004171511200000166
C USER =T(v)×P c ×u USER
wherein T (v) is train running time h; c (C) USER The time cost for the passengers is; p (P) C The passenger carrying capacity of the train; u (u) USER The time value per hour of the passenger is this/h.
The following formula is established by integrating the train operation energy consumption cost and the passenger time cost:
Figure BDA0004171511200000171
then, deriving the above formula to obtain the optimal running speed
Figure BDA0004171511200000172
The method comprises the following steps:
Figure BDA0004171511200000173
2c×M×U ENERGY ×v i opt 3 +b×M×U ENERGY ×v i opt 2 -3600×P C ×U USER =0
finally, comprehensively considering the optimal running speed of the train
Figure BDA0004171511200000174
Equalizing speed->
Figure BDA0004171511200000175
Limiting speed->
Figure BDA0004171511200000176
Determining a train operation target speed +.>
Figure BDA0004171511200000177
The method comprises the following steps:
Figure BDA0004171511200000178
(9) Track maintenance cost C MT : track maintenance costs are dependent on track change frequency, change length and track cost per unit length, with a wear rate of 1mm/10 on a curve with a radius of less than 3600m 6 t, the allowable abrasion loss of the steel rail is 12mm, the track cost is 4000/m, wherein the track replacement frequency can be according to the track replacement frequency N replace And track life T R And (3) calculating:
Figure BDA0004171511200000179
Figure BDA00041715112000001710
wherein N is replace Track replacement times in the life cycle of railway operation; t (T) R Is the service life of the rail; w (W) a Is the allowable rail abrasion loss mm; p (P) annual Is annual traffic demand; w (W) p Is the weight kg, T of a person d Is the daily operating time s; h(s) is the interval s of the transmission train; m is the train weight; w (w) r Is the wear rate of mm/10 per million tons 6 t。
Since the track is severely worn in the curved section, especially in the small curved section, when calculating the track replacement cost, the track section with a smaller horizontal curve radius is mainly considered, and the track replacement cost is obtained by:
Figure BDA00041715112000001711
wherein m is the track section number with the curve radius smaller than a given value; l (L) rk A k-th round curve length m with a curve radius smaller than a given value; u (u) track Cost per unit length of track is the same as the cost per unit length of track; g r Is the track cost increase rate; t is the service life of railway operation; r annual expansion percentage of currency.
(10) Maintenance cost C for locomotive vehicle MS : the annual rolling stock maintenance cost can be calculated according to the annual round trip frequency and the total length of the line, the rolling stock maintenance cost is 19 per kilometer of the train, wherein the rolling stock maintenance cost is expressed as:
Figure BDA0004171511200000181
C TMS =u MS ×N round ×L total
in the formula g s The maintenance cost increase rate is for the rolling stock maintenance; t is the service life of railway operation; r is the annual expansion rate of currency, u MS Maintenance cost for a round trip of a vehicle every kilometer; n (N) round The annual round trip times; l (L) total The total length m of the line.
Aiming at constraint conditions, the invention divides the constraint conditions into geometric constraint, structural constraint, regional constraint and time constraint according to the characteristics of different constraint conditions. Wherein the geometric constraint: minimum curve radius 2800m, maximum gradient 25%, minimum slope segment length 250m, minimum clip straight line length 120, circle curve minimum length 120m, gradient algebraic difference 18%, structure constraint: bridge minimum clearance 5.5m, tunnel maximum allowable bridge height 100m, and maximum tunnel length 10000m; the method comprises the following steps:
(1) Geometric constraints
According to the railway line design Specification (GB 10098-2017), railway lines have to meet the following geometrical constraint requirements: minimum curve radius constraint, minimum circle curve length constraint, minimum clamp straight line length constraint, minimum slope segment length constraint, maximum gradient constraint and gradient algebraic difference constraint are expressed as:
g i (X,Y,R,K,H)≤0
(1) minimum curve radius constraint
R min -R i ≤0i=1,2,L,m
Wherein R is min For defining a minimum circle curve radius m; r is R i The curve radius m of the ith round curve; m is the number of plane intersections.
(2) Minimum circular curve length constraint
K mini ·R i ≤0i=1,2,L,m
Wherein K is min The length m of the minimum circle curve is specified; alpha i Radian rad of the ith circular curve; r is R i The curve radius m of the ith round curve; m is the number of plane intersections.
(3) Minimum clip linear length constraint
Figure BDA0004171511200000191
Wherein D is min The shortest clamp straight line length of the adjacent curves is specified; x is x i ,y i The coordinate m is the i-th plane intersection point coordinate; x is x i-1 ,y i-1 The intersection point coordinate m of the i-1 th plane; r is R i-1 A curve radius m of the ith-1 th round curve; r is R i The curve radius m of the ith round curve; alpha i-1 Is the (i-1)Deflection angle of the circular curve; alpha i Deflection angle of the ith circular curve; m is the number of plane intersections.
(4) Minimum slope segment length constraint
K i+1 -K i ≥d min i=1,2,L,n
Wherein K is i+1 The distance m is the i+1th longitudinal section variable slope point distance m; k (K) i The distance m is the variable slope point of the ith longitudinal section; d, d min For defining a minimum ramp segment length m; n is the number of the longitudinal section slope changing points.
(5) Maximum grade constraint
Figure BDA0004171511200000192
Wherein H is i The design elevation m for the i-th longitudinal section variable slope point; h i-1 The design elevation m for the i-1 th longitudinal section variable slope point; d, d i The distance m between the i-1 th longitudinal section variable slope point and the i longitudinal section variable slope points; g max Is equal to the permillage of the specified maximum gradient value; n is the number of the longitudinal section slope changing points.
(6) Gradient algebraic difference constraint
In order to ensure the running safety of the train, the gradient difference of two adjacent slope sections cannot exceed the maximum value specified by the specification.
Figure BDA0004171511200000193
Wherein H is i+1 Designing an elevation m for an i+1th longitudinal section variable slope point; h i Designing an elevation m for an ith longitudinal section variable slope point; h i-1 The design elevation m for the i-1 th longitudinal section variable slope point; d, d i The horizontal distance m between the ith longitudinal section variable slope point and the (i+1) th longitudinal section variable slope point; d, d i-1 The horizontal distance m between the ith longitudinal section variable slope point and the (i-1) th longitudinal section variable slope point; Δg max The maximum gradient difference of two adjacent slope sections is regulated to be mill; n is the number of the longitudinal section slope changing points.
(2) The structure is constrained by the structure,
the structures such as bridges, tunnels, roadbeds and the like are required to meet corresponding constraint requirements, such as: the bridge needs to meet the maximum bridge height constraint, the bridge floor is free from vertical curve constraint, the tunnel needs to meet the maximum tunnel length constraint, the tunnel single slope or the herringbone slope constraint, the roadbed needs to meet the ground transverse slope constraint, and the method is expressed as follows:
h i (X,Y,R,K,H)≤0
(1) maximum bridge height constraint
BH i -BH max ≤0i=1,2,L,nB
In BH max Is the maximum allowable bridge height m; BH (BH) i The bridge height m is the ith bridge height m; nB is the number of bridges.
(2) No vertical curve constraint is set on open bridge floor
According to the rule of repairing railway bridge tunnel building, the line on the bridge floor should not be provided with a vertical curve. Therefore, the line gradient should remain unchanged in the bridge range, and any pile number Gao Chengying in the bridge range satisfies the following equation.
Figure BDA0004171511200000201
Wherein H is Bi The height m of any pile number in the ith bridge; h s Bi The starting point elevation m of the ith bridge is the starting point elevation m of the ith bridge; k (K) Bi The pile number m is any pile number m in the ith bridge; k (K) s Bi The starting point pile number m of the ith bridge is the starting point pile number m of the ith bridge; g Bi The gradient of the ith bridge (positive ascending slope and negative descending slope) is per mill.
(3) Maximum tunnel length constraint
TL i -TL max ≤0i=1,2,L,nT
In the formula TL max Is the maximum allowable tunnel length m; TL (TL) i The tunnel length m of the ith seat; nT is the number of tunnels.
(4) Tunnel single slope or herringbone slope constraint
Considering the drainage requirement of the tunnel, the line in the tunnel adopts a single slope or a herringbone slope, so that any pile number Gao Chengying in the tunnel meets the following formula.
Figure BDA0004171511200000202
Wherein H is Ti The height m of any pile number in the ith tunnel;
Figure BDA0004171511200000203
the tunnel starting point elevation m of the ith tunnel; />
Figure BDA0004171511200000204
The tunnel endpoint elevation m of the ith tunnel; k (K) Ti Is any pile number m in the ith tunnel; />
Figure BDA0004171511200000205
The tunnel starting point pile number m is the ith tunnel; />
Figure BDA0004171511200000206
And the destination pile number m of the ith tunnel.
(5) Roadbed ground transverse slope constraint
In order to ensure the stability of the roadbed, the route area needs to meet the constraint of the roadbed ground transverse slope.
g c ≤g cmax
In the formula g c The cross section of the roadbed is a ground transverse slope; g cmax The maximum ground cross slope is allowed for the roadbed cross section.
(3) Regional constraints
The regional constraints include forbidden zone constraints, must-pass zone constraints, crossing constraints, and elevation trend constraints proposed for tight slope sections, expressed as:
l i (X,Y,R,K,H)≤0
(1) forbidden zone constraints
In order to protect natural environment and save engineering and operation cost, the railway line should be wound around the wetland and the environment protection area as much as possible. The predefined wetland and environmental protection area is defined as forbidden area, and all the cells (U F ) And railway line passing area cell (U) A ) Should be an empty set.
Figure BDA0004171511200000211
(2) Necessary menstruation region constraint
Railway lines may need to travel through certain cities, factories or mining sites due to economic, military, strategic, etc. requirements. Typically, a designer sets a routing area prior to routing, and to meet routing area requirements, cells (U) M ) Should be included in the line passing area cell (U) A ) And (3) inner part.
Figure BDA0004171511200000212
(3) Crossing constraints
Railway lines inevitably cross existing ground features such as rivers, existing iron (public) roads and the like. When the railway line spans the ground features, the clearance constraint requirement needs to be met. The location of the intersection of a railway line with an existing railway, road or river may be determined based on the location of the line plane. The position of the newly built line plane can be determined according to the intersection point coordinates (X, Y) of the line plane and the curve radius (R). The vertical section of the newly built line can be determined according to the distance (K) and the elevation (H) of the variable slope point. Therefore, the elevation of the intersection of the newly created line with the existing line can be expressed by H (X, Y, R, K, H), and the crossing constraint can be abstracted into the following mathematical expression:
Δh min -|h(X,Y,R,K,H)-h E |≤0
in the formula, deltah min Is the minimum headroom requirement m; h is a E Is the existing railway, highway or river elevation m at the intersection.
(4) Time constraint, wherein the running time of the trains between adjacent stations meets the time limit requirement for completing the train transportation requirement, and the time constraint is expressed as follows:
T(X,Y,R,K,H)-T lim ≤0
s3, solving a railway line optimization model, searching railway space line positions, and obtaining an optimized railway line scheme, wherein the concrete process is as follows:
s1, connecting a starting point and a finishing point of a line, and uniformly dividing a cutting surface along the connecting line of the starting point and the finishing point of the line;
s2, randomly laying intersection points on the cutting surface, configuring a circular curve, generating N initial line schemes, and if the line schemes do not meet constraint requirements, regenerating until N initial line schemes are obtained, and establishing an initial line scheme group;
s3, selecting the ith initial scheme Γ i (i=1, 2, …, N), and performing a mutation operation to generate an intermediate mutation line scheme vΓ i
ii,j ) t =Γ rand1i,j ) t +F·(Γ rand2i,j ) trand3i,j ) t )
Wherein V gamma ii,j ) t A j variable which is the i intermediate variant line scheme in the t-th generation scheme; Γ -shaped structure rand1 Is the 1 st random scheme in the t generation scheme; Γ -shaped structure rand2 Is the 2 nd random scheme in the t generation scheme; Γ -shaped structure rand3 Is the 3 rd random scheme in the t generation scheme; f is a scaling factor, typically in [0,2 ]]In the middle, the patent takes 0.5.
S4, generating an intermediate variation line scheme V gamma i And the ith line scheme Γ i Performing cross operation to generate a new scheme T gamma i
Figure BDA0004171511200000221
In T gamma ii,j ) t A j variable which is the i test line scheme in the t generation scheme; rand is [0,1]Random numbers uniformly distributed among the two; cr is the crossover probability, typically in [0,1 ]]Optionally, 0.1 is taken here.
S5, comparing the newly generated scheme T gamma i And original line scheme Γ i Selecting a better scheme as a next generation scheme;
s6, repeating the steps S2-S5 to traverse all the line schemes to generate a child scheme group;
s7, repeating the steps S2-S6 until the maximum iteration times are reached.
Finally, the total length of the obtained optimized line scheme is 34536m, the initial engineering investment is 13.11 hundred million yuan, the vehicle acquisition cost is 2.40 hundred million yuan, the round-trip energy consumption cost and the user cost of a single train are 4449 yuan, the line full life cycle operation cost is 34.27 hundred million yuan, the train operation energy consumption cost and the user cost are 21.34 hundred million yuan, and the line maintenance cost is 12.92 hundred million yuan.
It will be apparent to those skilled in the art that various modifications and variations can be made to the present invention without departing from the spirit or scope of the invention. Thus, it is intended that the present invention also include such modifications and alterations insofar as they come within the scope of the appended claims or the equivalents thereof.

Claims (7)

1. An intelligent route selection method considering train running speed curve optimization is characterized by comprising the following steps:
S1, establishing a comprehensive geographic information model, dividing a railway route selection design area range into a regular grid composed of square cells, and collecting various geographic information required by route design and discretely storing the various geographic information into the grid, wherein the various geographic information comprises data information to be considered in railway route selection design of topography, geology, population distribution and the like;
s2, constructing a line optimization model comprising railway initial engineering investment and maintenance operation cost based on the comprehensive geographic information model, optimizing the train operation speed, obtaining train operation energy consumption and time cost through train operation simulation based on an obtained optimized operation speed curve, and forming railway maintenance operation cost together with track maintenance cost and locomotive maintenance cost;
and S3, based on the railway line optimization model, carrying out intelligent line search based on a differential evolution algorithm to obtain an optimized line scheme.
2. An intelligent route selection method taking train operation speed curve optimization into consideration according to claim 1, wherein:
the initial engineering investment includes: engineering fee C for earthwork E Bridge engineering fee C B Tunnel engineering fee C T Costs C related to the length of the line, track laying, etc L Cost of land C W Rolling stock purchase fee C ROLL The method comprises the steps of carrying out a first treatment on the surface of the The maintenance operation fee includes: train operation energy consumption C LE Cost of passenger travel time C LU Maintenance cost C for track maintenance MT Maintenance cost C of rolling stock MS The method comprises the steps of carrying out a first treatment on the surface of the In summary, the railway line optimization model objective function is expressed as:
Min f(X,Y,R,K,H)=C E +C B +C T +C L +C w +C ROLL +C LE +C LU +C MS +C MT
3. an intelligent route selection method taking train operation speed curve optimization into consideration according to claim 2, wherein:
in the process of acquiring initial engineering investment, earth-rock engineering cost C E Expressed as:
Figure FDA0004171511190000011
Figure FDA0004171511190000012
wherein n is f 、n c 、n f-c The number of the line filling, excavation and half-filling and half-excavation road sections is represented; u (u) fi 、u ci Representing the engineering cost of filling/excavating earth and stone per unit volume 3 ;K i The mileage m is the ith stake mark; a is that fi For the ith fill cross-sectional area m 2 ;A ci For the ith square cross-sectional area m 2 ;A hfi Representing the fill area m in the ith half-fill half-cut 2 ;A hci Representing the square area m in the ith half-filled half-cut section 2
Figure FDA0004171511190000021
Figure FDA0004171511190000022
Figure FDA0004171511190000023
Figure FDA0004171511190000024
Wherein H is l (i) Filling/cutting height m, H for the left side of the i-th half-filling half-cutting section r (i) Filling/excavating height m for the right side of the ith half-filling half-excavation section; s is S f For filling slope, S c Is a digging slope; w is the line cross-sectional width m.
Bridge engineering fee C B Expressed as:
Figure FDA0004171511190000025
wherein n is B Representing the number of bridges; u (u) Bi Representing the building cost per unit length of the ith bridge; l (L) Bi Representing the length m of the ith bridge; c (C) Ai And the construction cost of the ith bridge abutment is represented.
Tunnel engineering fee C T Expressed as:
Figure FDA0004171511190000026
wherein n is T Representing the number of tunnels; u (u) Ti Representing the construction cost per unit length of the ith tunnel; l (L) Ti Represents an ith tunnel length m; c (C) Pi Indicating the construction cost of the ith tunnel portal.
Track laying and other costs C related to the length of the line L Expressed as:
C L =u L ×L total
wherein u is L Is the unit cost (m, L) related to the length of the line total Is the route length m.
Cost of land C W Expressed as:
Figure FDA0004171511190000027
wherein n is cell Representing the number of cells occupied by the line; u (u) wi Land fee/m representing the ith cell 2 The method comprises the steps of carrying out a first treatment on the surface of the d represents the cell length m.
Locomotive vehicle acquisition fee C ROLL Expressed as:
C ROLL =N ROLL ×u ROLL
Figure FDA0004171511190000031
wherein N is ROLL Representing the number of trains required to meet the transportation; u (u) ROLL Indicating the unit price of the train; t (T) ROLL The time s representing a single round trip of the train; h(s) represents s at the train departure interval; []Representing a rounding symbol.
4. An intelligent route selection method taking train operation speed curve optimization into consideration according to claim 2, wherein:
in the process of acquiring maintenance operation fees, the train operation energy consumption fee C LE Expressed as:
Figure FDA0004171511190000032
Figure FDA0004171511190000033
wherein C is TE The energy consumption cost for the annual operation of the train is; u (U) ENERGY The energy consumption cost per unit operation of the train is per kwh; e (E) round The energy consumption kwh for one round trip of the train; p (P) round The transport quantity of the train to and fro once; p (P) annual Is a requirement for annual transportation of railways; g e The service life growth rate can be consumed for train operation; t is the service life of railway operation; r is the annual expansion percentage of currency.
Passenger travel time cost C LU Expressed as:
Figure FDA0004171511190000034
C U =U USER ×P C ×T round
C TU =C U ×N trip
Figure FDA0004171511190000035
wherein N is trip The travel frequency of annual passengers is; p (P) annual Is a requirement for annual transportation of railways; p (P) C The passenger carrying capacity of the train; t (T) round The train is reciprocated for one time for the operation time h; c (C) U The cost of the time of a train to travel once is the cost of the time of a passenger; u (U) USER The value per hour is the value per hour of the passenger; t (T) round The time h for the train to come and go once; g u Is the passenger time value increase rate; t is the service life of railway operation; r is the annual expansion rate of money; c (C) LU Is the total cost of passenger time in the whole life cycle of the train; c (C) TU The annual train operation passenger time cost is.
Track maintenance cost C MT Expressed as:
Figure FDA0004171511190000041
wherein N is replace T is the number of track changes in the railway operation period R For the service life of the track, m is the number of track sections with curve radius smaller than a given value; l (L) rk A k-th round curve length m with a curve radius smaller than a given value; u (u) track Cost per unit length of track is the same as the cost per unit length of track; g r Is the track cost increase rate; t is the service life of railway operation; r annual expansion percentage of currency. It should be pointed out that the track is severely worn in the curved section, especially in the small curved section, so that the small curve radius section is mainly considered in the calculation of the maintenance cost of the track.
Maintenance cost C for locomotive vehicle MS Expressed as:
Figure FDA0004171511190000042
C TMS =u MS ×N round ×L total
in the formula g s The maintenance cost increase rate is for the rolling stock maintenance; t is the service life of railway operation; r is the annual expansion rate of currency, u MS Maintenance cost per m for a vehicle to go back and forth every kilometer; n (N) round The annual round trip times; l (L) total The total length m of the line.
5. The intelligent route selection method considering train operation speed curve optimization according to claim 4, wherein:
c for acquiring train operation energy consumption LE In the process of (2) for train round trip energy consumption E round The calculation method of (2) is as follows:
firstly, calculating the addition gradient of a line, and dividing the line into a plurality of subintervals based on the addition gradient, wherein the addition gradient of each subinterval is the same.
Figure FDA0004171511190000043
Wherein i is a Adding gradient per mill; i is the gradient of the line per mill; r is the radius m of a circular curve; l (L) s Is the tunnel length m.
Then, the train running state is switched in each section according to the current running speed and the target speed of the train, and the method specifically comprises the following steps:
a. at the running speed
Figure FDA0004171511190000044
When the train reaches the target speed of the section, the train enters a cruising stage;
b. at the running speed
Figure FDA0004171511190000045
When the train is in a constant speed stage, the traction force of the train is equal to the resistance of the train, and the train runs at a constant speed;
c. at the running speed
Figure FDA0004171511190000051
When the train is switched to an idle stage, the traction force of the train is zero, only the resistance of the train acts, and the speed of the train is reduced to the target speed;
d. the braking phase is mainly used for train parking braking, and braking is needed when the running speed of the train downhill section exceeds the limit speed.
The method for calculating the running energy consumption and time of the train in different running states comprises the following steps:
train acceleration running state: the train receives traction force F (v) and running resistance W (v), F (v) > W (v), and under the state of train acceleration running, the acceleration is calculated as follows:
Figure FDA0004171511190000052
wherein a is max Maximum permissible acceleration m/s for passenger comfort 2
Based on the train running acceleration, the running energy consumption and the running time of increasing the train running speed by 1m/s are obtained:
Figure FDA0004171511190000053
Figure FDA0004171511190000054
Figure FDA0004171511190000055
wherein E is tra The energy consumption for the acceleration operation of the train is reduced; m is the weight of the train; v is the train running speed m/s; w (v) is train running resistance N/t; l (L) tra The length m of the train acceleration operation is the length m; a, a avail (v) For running acceleration m/s of train 2 ;T tra (v) Is the train running time s.
Train constant speed running state: the train receives traction force F (v) and running resistance W (v), and F (v) =w (v), and the running energy consumption and running time calculation formula is as follows:
E cru =w(v)×M×L cru
Figure FDA0004171511190000056
wherein E is cru The energy consumption J for the train to run at a constant speed; m is the weight t of the train; v is the train running speed m/s; w (v) is train running resistance N/t; l (L) cru The constant speed running length m of the train; t (T) cru (v) And the train is operated at a constant speed s.
Train idle running state: the train only receives running resistance W (v), the running energy consumption is 0, and the train running time is calculated as follows:
Figure FDA0004171511190000057
Figure FDA0004171511190000061
wherein M is the weight t of the train; v is the train running speed m/s; a, a coa For the idle acceleration m/s of the train 2 The method comprises the steps of carrying out a first treatment on the surface of the W (v) is train running resistance N/t; t (T) coa (v) For the train idle running time s.
Train braking operation state: the running resistance W (v) and the braking force B (v) of the train are received, the running energy consumption is 0, and the running time of the train is calculated according to the following formula:
Figure FDA0004171511190000062
wherein T is bra1 The train braking operation time s; l (L) bra1 The train braking travel distance m.
Train parking brake status: the running resistance W (v) and the braking force B (v) of the train are received, the running energy consumption is 0, and the calculation formula of the train parking braking time is as follows:
Figure FDA0004171511190000063
Figure FDA0004171511190000064
Wherein T is bra2 Parking brake operating time s for the train; l (L) bra2 The running distance m is the braking and stopping distance of the train; a, a max Maximum permissible acceleration m/s for passenger comfort 2 The method comprises the steps of carrying out a first treatment on the surface of the g is gravity acceleration m/s 2
And calculating the running energy consumption and the running time of the train from the starting point to the end point and from the end point to the starting point based on the running energy consumption and the running time calculation formulas under different running states of the train, and obtaining the running energy consumption and the running time of the train in one round trip.
6. The intelligent route selection method considering train operation speed curve optimization according to claim 5, wherein the method comprises the following steps:
the train operation target speed optimizing method specifically comprises the following steps:
firstly, a continuous micro-objective function which comprehensively considers the train operation energy consumption and the passenger time cost is established, and the method is specifically as follows:
and (3) calculating train operation energy consumption cost:
Figure FDA0004171511190000065
C ENERGY =E(v)×u ENERGY
wherein E (v) is train operation energy consumption kwh; a. b and c are experimental measurement constants; w (W) a The running resistance N/t of the train; m is the weight t of the train; l (L) U The running distance m of the train; c (C) ENERGY The energy consumption cost m for train operation; u (u) ENERGY The unit energy consumption cost is the unit energy consumption cost per meter.
And (3) calculating the time and cost of the passengers:
Figure FDA0004171511190000071
C USER =T(v)×P c ×u USER
wherein T (v) is train running time h; c (C) USER The time cost for the passengers is; p (P) C The passenger carrying capacity of the train; u (u) USER The time value per hour of the passenger is this/h.
The following formula is established by integrating the train operation energy consumption cost and the passenger time cost:
Figure FDA0004171511190000072
then, deriving the above formula to obtain the optimal running speed v i opt The method is characterized by comprising the following steps:
Figure FDA0004171511190000073
Figure FDA0004171511190000074
finally, comprehensively considering the optimal running speed of the train
Figure FDA0004171511190000075
Equalizing speed->
Figure FDA0004171511190000076
Limiting speed->
Figure FDA0004171511190000077
Determining a train operation target speed +.>
Figure FDA0004171511190000078
The method comprises the following steps:
Figure FDA0004171511190000079
7. an intelligent route selection method taking train operation speed curve optimization into consideration according to claim 1, wherein:
the intelligent circuit searching process based on the differential evolution algorithm is as follows:
s1, connecting a starting point and a finishing point of a line, and uniformly dividing a cutting surface along the connecting line of the starting point and the finishing point of the line;
s2, randomly laying intersection points on the cutting surface, configuring a circular curve, generating N initial line schemes, and if the line schemes do not meet constraint requirements, regenerating until N initial line schemes are obtained, and establishing an initial line scheme group;
s3, selecting the ith initial scheme Γ i (i=1, 2, …, N), and performing a mutation operation to generate an intermediate mutation line scheme vΓ i
S4, generating an intermediate variation line scheme V gamma i And the ith line scheme Γ i Performing cross operation to generate a new scheme T gamma i
S5, comparing the newly generated scheme T gamma i And original line scheme Γ i Selecting a better scheme as a next generation scheme;
s6, repeating the steps S2-S5 to traverse all the line schemes to generate a child scheme group;
s7, repeating the steps S2-S6 until the maximum iteration times are reached.
CN202310379221.3A 2023-04-11 2023-04-11 Intelligent line selection method considering train running speed curve optimization Active CN116401873B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310379221.3A CN116401873B (en) 2023-04-11 2023-04-11 Intelligent line selection method considering train running speed curve optimization

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310379221.3A CN116401873B (en) 2023-04-11 2023-04-11 Intelligent line selection method considering train running speed curve optimization

Publications (2)

Publication Number Publication Date
CN116401873A true CN116401873A (en) 2023-07-07
CN116401873B CN116401873B (en) 2023-12-26

Family

ID=87013865

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310379221.3A Active CN116401873B (en) 2023-04-11 2023-04-11 Intelligent line selection method considering train running speed curve optimization

Country Status (1)

Country Link
CN (1) CN116401873B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117892519A (en) * 2024-01-10 2024-04-16 高速铁路建造技术国家工程研究中心 Hump longitudinal section pushing and sliding collaborative design method and computer equipment

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107729663A (en) * 2017-10-23 2018-02-23 陈国� A kind of highway geometry three-dimensional optimized method based on multilayer constraint system
CN112307564A (en) * 2020-11-10 2021-02-02 交控科技股份有限公司 Method and device for optimizing ATO target running speed curve of train
CN113361150A (en) * 2021-08-11 2021-09-07 华东交通大学 Multi-objective optimization method and system for urban train operation

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107729663A (en) * 2017-10-23 2018-02-23 陈国� A kind of highway geometry three-dimensional optimized method based on multilayer constraint system
CN112307564A (en) * 2020-11-10 2021-02-02 交控科技股份有限公司 Method and device for optimizing ATO target running speed curve of train
CN113361150A (en) * 2021-08-11 2021-09-07 华东交通大学 Multi-objective optimization method and system for urban train operation
US11390306B1 (en) * 2021-08-11 2022-07-19 East China Jiaotong University Method and system for multi-objective optimization of urban train operation

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117892519A (en) * 2024-01-10 2024-04-16 高速铁路建造技术国家工程研究中心 Hump longitudinal section pushing and sliding collaborative design method and computer equipment
CN117892519B (en) * 2024-01-10 2024-06-11 高速铁路建造技术国家工程研究中心 Hump longitudinal section pushing and sliding collaborative design method and computer equipment

Also Published As

Publication number Publication date
CN116401873B (en) 2023-12-26

Similar Documents

Publication Publication Date Title
CN107886186A (en) A kind of charging pile method to set up based on travelling data and Wei Nuotu zonings
Lai et al. Optimization of rail transit alignments considering vehicle dynamics
CN116401873B (en) Intelligent line selection method considering train running speed curve optimization
Shen et al. Optimized public parking location modelling for green intelligent transportation system using genetic algorithms
Yi Principles of railway location and design
Takatsu The history and future of high-speed railways in Japan
CN114707727B (en) Carbon emission prediction method for railway route selection design stage
Luin et al. Modeling the impact of road network configuration on vehicle energy consumption
Mahanpoor et al. An optimization model for synchronous road geometric and pavement enhancements
CN114819286A (en) Deep reinforcement learning method for optimizing mountain railway line
Zhang et al. Railway alignment optimization considering lifecycle costs
Wang et al. Optimization of metro vertical alignment for minimized construction costs and traction energy: A dynamic programming approach
Sharma Principles, practice and design of Highway Engineering
Shafahi et al. Optimum railway alignment
CN103318186B (en) Braking method based on railway loading siding
Aghastya et al. Geometry Design of Railway Track for High-Speed Railways Bandung-Cirebon KM 00+ 000-KM 33+ 850
Gustian et al. The Horizontal Alignment Redesign of Connecting Roads in the Coal Area: A Case of the Section Sulit Air –Rawang STA 6+ 300 –6+ 600 West Sumatera
Merrill et al. A land ferry system to alleviate increasing costs of maintaining the I-80 transportation corridor: an economic assessment
Wang et al. Layout Methods and Location-Selecting Optimization for Highway Service Area
Wang et al. Optimizing vertical alignment of underground metro for energy saving of train operation
Abebe Evaluation Ofalternative Track Alignments on Whole Life Cost of Lot 11 Section of the Awash Weldiya Railway Line
Gorbunova et al. Problems of designing transport systems of “Siberian Antrazit”
Zeng et al. Study on route selection of highway heavy cargo transportation considering traffic control
Liao et al. Research on Low Carbon Planning Method of Resource Based City Based on Coupling of City Region and Central City--A Case Study of Xingtai City
Yu Expressway Route and Interchange Design

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
GR01 Patent grant
GR01 Patent grant