CN107729663A - A kind of highway geometry three-dimensional optimized method based on multilayer constraint system - Google Patents
A kind of highway geometry three-dimensional optimized method based on multilayer constraint system Download PDFInfo
- Publication number
- CN107729663A CN107729663A CN201710995632.XA CN201710995632A CN107729663A CN 107729663 A CN107729663 A CN 107729663A CN 201710995632 A CN201710995632 A CN 201710995632A CN 107729663 A CN107729663 A CN 107729663A
- Authority
- CN
- China
- Prior art keywords
- dimensional
- optimization
- layer
- point
- constraint
- 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
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/30—Circuit design
- G06F30/32—Circuit design at the digital level
- G06F30/33—Design verification, e.g. functional simulation or model checking
- G06F30/3323—Design verification, e.g. functional simulation or model checking using formal methods, e.g. equivalence checking or property checking
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/12—Computing arrangements based on biological models using genetic models
- G06N3/126—Evolutionary algorithms, e.g. genetic algorithms or genetic programming
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
- G06T17/05—Geographic models
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2111/00—Details relating to CAD techniques
- G06F2111/04—Constraint-based CAD
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2111/00—Details relating to CAD techniques
- G06F2111/06—Multi-objective optimisation, e.g. Pareto optimisation using simulated annealing [SA], ant colony algorithms or genetic algorithms [GA]
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Life Sciences & Earth Sciences (AREA)
- Geometry (AREA)
- General Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Software Systems (AREA)
- Biophysics (AREA)
- General Engineering & Computer Science (AREA)
- Evolutionary Computation (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Bioinformatics & Computational Biology (AREA)
- Evolutionary Biology (AREA)
- Computer Hardware Design (AREA)
- Physiology (AREA)
- Artificial Intelligence (AREA)
- Biomedical Technology (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- General Health & Medical Sciences (AREA)
- Molecular Biology (AREA)
- Computing Systems (AREA)
- Mathematical Physics (AREA)
- Genetics & Genomics (AREA)
- Remote Sensing (AREA)
- Computer Graphics (AREA)
- Processing Or Creating Images (AREA)
Abstract
The invention discloses a kind of highway geometry three-dimensional optimized method based on multilayer constraint system, highway scheme of this method for complete design, by means of three-dimensional geographic information technology and intelligent algorithm, slight change of the Accurate Analysis highway threedimensional model in optimization, the constraints of different levels is introduced in the flat, vertical, horizontal section optimization stage, establish multilayer constraint system, analyze these changing factors, different eliminative mechanisms is used under the constraints of different levels, so as to which amount of calculation be greatly reduced；By computer magnanimity computing, in the case where not changing and walking corridor scheme, optimal case that this method can search out and improve road alignment index, reduce highway construction and running cost.
Description
Technical field
Belong to computer simulation technique, computer graphics, geographical information technology, engineering design technology, artificial intelligence to hand over
The technology-oriented discipline research field of fork.It is three-dimensional more particularly, to utilizing the present invention relates to a kind of route optimization method of existing road
Geographical information technology and intelligent algorithm complete the optimization of road scheme.
Background technology
For the highway layout scheme completed, because its scheme has already been through the demonstration of expert, after this very
Route optimization is carried out less.But route selection is either manually designed, Adjusted Option is still expounded through peer review, to road scheme all
It is a kind of more macroscopical adjustment, in construction drawing design, this adjustment seems not enough, but manually route is gone to carry out this
The less adjustment of amplitude, it is big not only to pay the time, and precision is difficult to control, due to scheme caused by adjustment error easily significantly
Change, run counter to design original intention, lose more than gain on the contrary.Therefore this rear adjustment, rear optimization are often ignored.
It does not change really walk corridor scheme in the case of, if constraints can be controlled accurately, Accurate Analysis highway
The change of model and dimensional topography in optimization, and calculated by computer magnanimity, and apply threedimensional model analytical technology, route
Following optimize can at least be carried out：
1）The adjustment of route alignment, the raising of linear index；
2）In section with a varied topography, local optimizing and revising, which can be reduced, fills out greatly；
3）Area in route by house, can be with the removal quantity in accurate optimization house with reference to three-dimensional geographic information technology；
4）The local shortening of route mileage, directly reduces cost；
5）The reduction of running cost.
The content of the invention
The technical problems to be solved by the invention are the defects of making up above-mentioned prior art, are proposed a kind of in multilayer constraint bar
Under part, by means of three-dimensional geographic information technology and intelligent algorithm, highway plane, vertical section, three, cross section dimension are entered
The method of row optimization.
The multilayer constraints, it is exactly the constraints that different levels are introduced in flat, vertical, horizontal section optimization.First
Layer constraint is to maintain the constraint of existing road design, and second layer constraint is Road Design normal constraint, and third layer constraint is
Design condition constrains.First layer is outermost layer, and third layer is innermost layer, and the judgement of constraints is entered from outermost layer to innermost layer
OK, if outer layer constraints is not met, directly jump out, no longer judge the constraints of internal layer.
This method can totally divide three big steps to realize：
1）It is expounded through peer review existing route plan；
2）Route plan after multilayer leash law optimization and demonstration, selects prioritization scheme；
3）Hand inspection or the prioritization scheme for being expounded through peer review computer generation again, draw final route plan.
Using highway geometry three-dimensional optimized method proposed by the present invention, complete design and it has been expounded through peer review for one
Route plan, after the highway geometry three-dimensional optimized method by being constrained system based on multilayer is optimized, it can at least save about 1% ~
3% highway construction and running cost, for investing huge highway construction, such optimization obviously can produce economic benefit.
In the optimization range of this ratio, due to the introducing of multilayer constraint system, original General layout Plan is almost unchanged, to route
Entire effect is little, and road alignment index is improved on the contrary.At the same time, the global optimization ratio of prescribed percentage is passed through
Control, at the same also can inverse go out road plane, the span of Profile Optimization parameter.
Implementation steps
The technical problem of the present invention is solved by the following technical programs.
Step 1）It is expounded through peer review existing route plan；
Step 2）Establish the road all fronts three-dimensional digitalization model of demonstration scheme；
Step 2-1）The DEM and DOM covered in Route Plane region are obtained using unmanned plane aerial survey, establishes dimensional topography simultaneously
Build highway three-dimensional geographic information platform.
The DEM, refers to digital elevation model（Digital Elevation Model）, it is by limited landform altitude
Data realize the digitized simulation to ground surface or terrain（That is the digital expression of topographical surface form）, it is that have numerical sequence with one group
Array format represents a kind of actual ground model of ground elevation.
The DEM, refers to digital orthophoto map（DOM,Digital Orthophoto Map）, it is to aviation（Or boat
My god）Photograph carries out Differential rectification and inlayed, and the digital orthoimage collection of generation is cut by certain figure amplitude range.
Step 2-2）Prepare the Route Plane data before optimization.
Route Plane data include the data of each intersection point, including at least following information：Intersection point numbering, intersection point X-coordinate, hand over
Point Y-coordinate, circular curve radius, preceding length of transition curve, rear length of transition curve.
Step 2-3）By panel data in step 1-1）The highway three-dimensional geographic information platform established is drawn out；
Step 2-4）The route vertical curve data imported before optimization.
Route vertical curve data comprise at least following information：Knick point sequence number, knick point pile No., knick point elevation, change slope
Point radius of vertical curve；
Step 3）Establish road plane optimized mathematical model
Road plane optimized mathematical model is established, uses construction cost, running cost, maintenance costs sum as object function F.
Affiliated construction cost includes being that roadbed earthwork takes, barricade depressed place work engineering cost, science of bridge building take, Tunnel Engineering
Take, land used expense, the engineering cost directly proportional to line length；
The running cost refers to operation total cost of the various vehicles within the operation phase, and the expense is grown in the different route gradients, route
Different othernesses is shown in degree.Certain vehicle relation of every kilometer of operating charges and the gradient in system-wide section is first obtained, then
The expense that various vehicles are run to full section route within the operation phase is added, and draws operation total cost.
The maintenance costs includes caused expense and maintenance management expense in highway ordinary maintenance, servicing operations, in road
It is main to calculate because route mileage change, side slope area change, route are by factor volumes such as unfavorable geology regions in the optimization process of road
The maintenance costs increased or decreased outside.
Step 4）Establish multilayer constraint system
Step 4-1）Generate DEM header files
The DEM grids of a virtual sufficiently large rectangle cover whole route areas, so, within a grid, can obtain any
The elevation of a bit, and the coordinate of any point is represented using the numbering of DEM grids, is easy to record the position letter of constraint
Breath.
Step 4-2）It will be identified in DEM landform by the key position for being expounded through peer review route plan, must such as led to
Cross certain appointed place, in specified location across or under wear existing road etc., in step 4-1）DEM files in find relevant position
Information, and the tolerance scope of each measuring point is given, as the planar range for allowing change in route optimization.
Step 4-3）According to threedimensional model and the influence of topography, statistics route is by the unfavorable geology region in region, main table
It is now：Avalanche, instable slope, karst, weak soil, tomography, geology, landforms and fracture belt, set in striograph corresponding high
Expense area, and in step 4-1）DEM files in record relevant position information.
Step 4-4）The high cost areas such as the house on route periphery, field, water system, environmental pollution are counted, in striograph
Corresponding high cost area is set, and in step 4-1）DEM files in record relevant position information.
Step 4-5）By step 4-2）To step 4-3）Optimization range region and high cost region one on three-dimensional map
One sign, forms vector quantization information, and as first layer constraints, for optimization routine call below.
Step 5）Cross section linkage optimization
Route cross section information is set, road is established and fills out excavation slope and plane coordinates（x,y）Functional relation.First according to road
Road plane, longitudinal data and width of subgrade information, shoulder point position is obtained in dimensional topography, then with specified side slope
Ratio of slope calculates toe point coordinates, according to step 4-5）The obstacle-avoidance area of statistics and unfavorable geology region, obtain DEM header files letter
Breath and high cost regional model, are adjusted to the former cross section gradient；
If the optimization of construction documents design phase, it is also necessary to which classification side slope is set.
Step 6）Add bridge, tunnel, grade separation structure initialization information；
Count all fronts bridge, tunnel, the structure information such as grade separation, each structure include sequence number, starting point pile No., terminal pile No.,
The information such as angle, across footpath, structural form.
Step 7）Plane optimizing variable is encoded, the coding of whole plane optimizing sets altogether 5 variables, Mei Gebian
Measure in a computer with 6 binary representations, be respectively：
ΔXk：The coordinate X increments of change of k-th of intersection point；
ΔYk：The coordinate X increments of change of k-th of intersection point；
ΔEk：The external distance increments of change of k-th of intersection point；
ΔLS1k：The preceding length of transition curve increments of change of k-th of intersection point；
ΔLS2k：The rear length of transition curve increments of change of k-th of intersection point；
Then the binary numeral of each intersection point is combined as a chromosome, so possesses the length of the chromosome of n intersection point
（Number of bits）For 30n.
Step 8）Optimizing is carried out using the algorithm based on planar multilayer constraint system；
The multilayer constrains system, is exactly the constraints that different levels are introduced in flat, vertical, horizontal section optimization.First layer is about
Beam is to maintain the constraint of existing road design, and second layer constraint is Road Design normal constraint, and third layer constraint is design
Constraint.First layer is outermost layer, and third layer is innermost layer, and the judgement of constraints is carried out from outermost layer to innermost layer, such as
Fruit outer layer constraints is not met, then is directly jumped out, and no longer judges the constraints of internal layer.
Step 8-1）Step 4-5 is combined first）The plane first layer constraints of formation establishes planar multilayer constraint system,
According to step 7）The coding rule of setting, according to the length of each chromosome, utilize a number of individual of generating random number, shape
Into initialization population.
Step 8-2）Decoding operate is carried out to each bar chromosome in population, inverse returns Δ Xk、ΔYk、ΔEk、ΔLS1k、
ΔLS2kNumerical value, then by Δ EkCalculate each circular curve radius increment value Δ R of intersection pointK,By the X of each intersection pointK、YK、RK、
LS1K、LS2KEach add Δ Xk、ΔYk、ΔRk、ΔLS1k、ΔLS2k, the intersection point data of decoded each intersection point can be obtained.
Step 8-3）First layer constraints is checked, the individual for not meeting inspection is directly eliminated, and returns to step 8-1）Again
The individual is generated, until the individual of the first batch initiation population is all qualified.
Step 8-4）Add and check second layer plane restriction condition；
The routinely error checking such as whether route coordinates positions is overlapping, curves overlapped between 2 points are checked for each population,
Go forward side by side trade road normalized checking, including plane point of intersection spacing, radius of horizontal curve, length of transition curve, intermediate straight line length, horizontal curve
The Highway Code accordance inspection such as bag vertical curve, the individual for not meeting inspection are directly eliminated, and return to step 8-1）Regenerate this
Individual, until the individual of the first batch initiation population is all qualified.
Step 9）Add and check third layer plane restriction condition；
Third layer constraint is mainly the constraint of design condition, including the constraint of plane point of intersection position constraint, horizontal curve, easement curve are about
Beam etc., set plane point of intersection excursion, radius of horizontal curve excursion, easement curve change model before optimization by designer
Enclose, so as to calculate the span of these numerical value.
Third layer plane restriction condition is checked, the individual for not meeting inspection requirements is directly eliminated, and returns to step 8-
1）The individual is regenerated, until the individual of the first batch initiation population is all qualified.
Huge population quantity must not be not provided with calculating process, otherwise, whole colony is all without satisfactory individual
In the presence of algorithm will restrain in the first generation, exit computing.
Step 10）Map knick point and bridge tunnel structure pile No.
During previous step plane optimizing, because position of intersecting point, radius are changed, thus the mileage of route also with
Variation, corresponding vertical curve knick point pile No., elevation, radius should all change, and this step adjusts knick point by reflection method
Pile No., elevation, radius.
Step 10-1）The coordinate of pile by pile sampled point of the variation route that each individual is formed in population is calculated, to save
Amount of calculation, straightway are joined directly together, and curved section regards sweep size, between sampled point value 5-100 rice.
Step 10-2）Vertical section vertical curve file, bridge tunnel pile No. corresponding to each individual of change, before finding out optimization first
Vertical curve knick point or bridge tunnel terminus pile No., and calculate corresponding plane coordinates；Then using the point as starting point, the point is solved
With step 10-1）The distance between line segment that coordinate of pile by pile sampled point is formed, find out the minimum intersection point P of distance；
Step 10-3）New pile No. of the intersection point P in variation route is calculated, step by step calculation goes out all knick points and bridge in this manner
The mapping pile No. of tunnel structure pile No..
Step 10-4）Three-dimensional stereo model is generated, the threedimensional model of original scheme is established in three-dimensional geographic information environment,
With reference to original scheme and actual landform situation is combined, further accurate adjustment is carried out to the threedimensional model after mapping.
Step 11）Update the ground data after the changing of the relative positions of plan-position；
Step 11-1）Again the coordinate of pile by pile sampled point of the variation route that each individual is formed in population is calculated, to ensure
Earthwork calculates accurate, the constant value of sampled point.
Step 11-2）Each individual variation route center line is pressed into equidistant peg orientation on three-dimensional geographic information model,
Elevation is directly obtained on DEM, calculates route central point ground elevation, and is extended to the left and right, calculates ground of cross section number
According to.
Step 12）Target function value calculates；
With step 3）The object function F of determination is minimum to be used as optimal Rule of judgment, for step 8-4）Check the initialization passed through
Population is calculated, and utilizes step 10）, step 11-2）The each individual data message obtained calculates corresponding fitness value.
Step 13）Carry out the selection of genetic algorithm, intersection, variation etc. to operate, calculate optimum individual.
Step 14）Set and terminate algebraic value N1, N1 values are subtracted 1, come back to step 10）, loop computation, until N1 is equal to
0, at this moment all individual object function F are close to equal, and optimal solution converges on a fixed value.If optimal solution is received in advance
Hold back, then terminate and calculate.
Step 15）Optimal solution is performed into step 8-2）Decoding operate, obtain final plane point of intersection data, and using should
Data calculate Lu Zhizheng ground elevation in three-dimensional geographical environment, and plane point of intersection data and Lu Zhizheng ground after optimization are high
On the basis of journey value is constant, Profile Optimization is carried out.
Step 16）Profile Optimization variable is encoded, 3 are arranged to after the coding of whole Profile Optimization is simplified
Variable, each variable with 6 binary representations, are respectively in a computer：
ΔZHk：The pile No. increments of change of k-th of knick point；
ΔHk：The elevation increments of change of k-th of knick point；
ΔLk：The vertical curve length change increment of k-th of knick point；
Then the binary numeral of each intersection point is combined as a chromosome, so possesses the length of the chromosome of n intersection point
（Number of bits）For 18n.
Step 17）Optimizing is carried out using the genetic algorithm based on vertical section multilayer constraint system；
Step 17-1）According to step 16）The coding rule of setting, according to the length of each chromosome, utilize generating random number one
The individual of fixed number amount, form initialization population.
Step 17-2）Decoding operate is carried out to each bar chromosome in population, inverse returns Δ ZHk、ΔHk、ΔLkNumerical value, so
Afterwards by vertical curve length Δ LkCalculate each radius of vertical curve increment value Δ R of knick pointK,By the ZH of each knick pointk、Hk、
LkEach add incremental data Δ ZHk、ΔHk、ΔRk, the vertical curve data of decoded each knick point can be calculated.
Step 17-3）Add and check second layer Profile Optimization constraints；
Roadway specification inspection, including the public affairs such as radius of vertical curve, longitudinal slope, length of grade, horizontal curve bag vertical curve are carried out for each population
Road specification accordance inspection, the individual for not meeting inspection are directly eliminated, and return to step 17-1）The individual is regenerated, until the
The individual of one batch initiation population is all qualified.
Step 18）Add and check third layer Profile Optimization constraints；
Third layer constrains the constraint of mainly design condition, including slope change constraint, length of grade change constrain, horizontal curve constrains,
Limit for height constrains, and sets horizontal curve length excursion, length of transition curve excursion, vertical curve before optimization by designer
Length change scope, slope change scope, length of grade excursion etc., so as to draw the span of these numerical value；Limit for height constrains
It is the key of third layer vertical section constraint, obtains separated interchange, bridge terminus, bridge navigation the point stake of all fronts route first
Number, each control point is obtained in three-dimensional geographic information view fills out digging height, and the number changed is then allowed according to user's input
Value, establish limit for height constraint judgment expression.
Third layer plane restriction condition is checked, the individual for not meeting inspection requirements is directly eliminated, and returns to step 17-
1）The individual is regenerated, until the individual of the first batch initiation population is all qualified.
Huge population quantity must not be not provided with calculating process, otherwise, whole colony is all without satisfactory individual
In the presence of algorithm will restrain in the first generation, exit computing.
Step 19）Repeat step 12）, step 13）, until optimal solution converges on a fixed value.If optimal value shifts to an earlier date
Convergence, then terminate and calculate, draw unique optimum individual.
Step 20）Completely after the Profile Optimization of abovementioned steps, the optimum individual that calculates, the individual is construction cost
Minimum individual, decoding operate is carried out by optimum individual with the summation of running cost, the knick point data after being optimized, according to
These data combination steps 15）The plane point of intersection data of acquisition, by the road of all fronts, bridge, tunnel model in three-dimensional geographic information environment
Middle foundation comes out.
Step 21）With reference to step 10-4）The threedimensional model of the original scheme of generation, for the structure start and end of Optimized model
The linear factors of non-rice habitats such as point pile No., slope gradient, are intuitively adjusted in three-dimensional environment, obtain final road optimization mould
Type.
Step 22）Hand inspection or the prioritization scheme for being expounded through peer review computer generation again, draw final route plan, weight
New calculating target function F, all fronts road optimization ratio is calculated, completes highway three-dimensional optimized.
In summary, the beneficial effect that is compared with the prior art of the present invention is：
The inventive method can solve the problems with found in engineering actual mechanical process：
Using highway geometry three-dimensional optimized method proposed by the present invention, for complete design and the route being expounded through peer review
Scheme, after the highway geometry three-dimensional optimized method by being constrained system based on multilayer is optimized, it can at least save about 1% ~ 3%
Highway construction and running cost, for investing huge highway construction, such optimization obviously can produce huge economic benefit.
In the optimization range of this ratio, due to the introducing of multilayer constraint system, original General layout Plan is almost unchanged, satisfies the need
Line entire effect is little, and road alignment index is improved on the contrary.At the same time, the global optimization ratio of prescribed percentage is passed through
Example control, while also can inverse go out road plane, the span of Profile Optimization parameter.The inventive method application when according to
Specifically need to configure corresponding software.
Brief description of the drawings
Without accompanying drawing.
Embodiment
With reference to embodiment, the present invention is further illustrated.
The technical problems to be solved by the invention are the defects of making up above-mentioned prior art, propose one kind in multilayer obligatory point
Under system, by means of three-dimensional geographic information technology and intelligent algorithm, highway plane, vertical section, three, cross section dimension are entered
The method of row optimization.
This method can totally divide three big steps to realize：
1）It is expounded through peer review existing route plan；
2）Route plan after multilayer leash law optimization and demonstration, selects prioritization scheme；
3）Hand inspection or the prioritization scheme for being expounded through peer review computer generation again, draw final route plan.
Using highway geometry three-dimensional optimized method proposed by the present invention, complete design and it has been expounded through peer review for one
Route plan, after the highway geometry three-dimensional optimized method by being constrained system based on multilayer is optimized, it can at least save about 1% ~
3% highway construction and running cost, for investing huge highway construction, such optimization obviously can produce huge economy
Benefit.In the optimization range of this ratio, due to the introducing of multilayer constraint system, original General layout Plan is almost not
Become, little to route entire effect, road alignment index is improved on the contrary.At the same time, the total of prescribed percentage is passed through
Body optimization ratio control, while also can inverse go out road plane, the span of Profile Optimization parameter.
Implementation steps
The technical problem of the present invention is solved by the following technical programs.
Step 1）It is expounded through peer review existing route plan；
Step 2）Establish the road all fronts three-dimensional digitalization model of demonstration scheme；
Step 2-1）The DEM and DOM covered in Route Plane region are obtained using unmanned plane aerial survey, establishes dimensional topography simultaneously
Build highway three-dimensional geographic information platform.
The DEM, refers to digital elevation model（Digital Elevation Model）, it is by limited landform altitude
Data realize the digitized simulation to ground surface or terrain（That is the digital expression of topographical surface form）, it is that have numerical sequence with one group
Array format represents a kind of actual ground model of ground elevation.
The DEM, refers to digital orthophoto map（DOM,Digital Orthophoto Map）, it is to aviation（Or boat
My god）Photograph carries out Differential rectification and inlayed, and the digital orthoimage collection of generation is cut by certain figure amplitude range.
Step 2-2）Prepare the Route Plane data before optimization.
Route Plane data include the data of each intersection point, including at least following information：Intersection point numbering, intersection point X-coordinate, hand over
Point Y-coordinate, circular curve radius, preceding length of transition curve, rear length of transition curve.
Step 2-3）By panel data in step 1-1）The highway three-dimensional geographic information platform established is drawn out；
Step 2-4）The route vertical curve data imported before optimization.
Route vertical curve data comprise at least following information：Knick point sequence number, knick point pile No., knick point elevation, change slope
Point radius of vertical curve；
Step 3）Establish road plane optimized mathematical model
Road plane optimized mathematical model is established, uses construction cost, running cost, maintenance costs sum as object function F.
Affiliated construction cost includes being that roadbed earthwork takes, barricade depressed place work engineering cost, science of bridge building take, Tunnel Engineering
Take, land used expense, the engineering cost directly proportional to line length；
The running cost refers to operation total cost of the various vehicles within the operation phase, and the expense is grown in the different route gradients, route
Different othernesses is shown in degree.Certain vehicle relation of every kilometer of operating charges and the gradient in system-wide section is first obtained, then
The expense that various vehicles are run to full section route within the operation phase is added, and draws operation total cost.
The maintenance costs includes caused expense and maintenance management expense in highway ordinary maintenance, servicing operations, in road
It is main to calculate because route mileage change, side slope area change, route are by factor volumes such as unfavorable geology regions in the optimization process of road
The maintenance costs increased or decreased outside.
Step 4）Add first layer constraints
Step 4-1）Generate DEM header files
The DEM grids of a virtual sufficiently large rectangle cover whole route areas, so, within a grid, can obtain any
The elevation of a bit, and the coordinate of any point is represented using the numbering of DEM grids, is easy to record the position letter of constraint
Breath.
Step 4-2）Recorded the route plan being expounded through peer review is important by position, specify ground as certain must be passed through
Point, in specified location across or under wear existing road etc., in step 4-1）DEM files in find relevant position information, and give
The tolerance scope of fixed each measuring point, as the planar range for allowing change in route optimization.
Step 4-3）According to threedimensional model and the influence of topography, statistics route is by the unfavorable geology region in region, main table
It is now：Avalanche, instable slope, karst, weak soil, tomography, geology, landforms and fracture belt, set in striograph corresponding high
Expense area, and in step 4-1）DEM files in record relevant position information.
Step 4-4）The high cost areas such as the house on route periphery, field, water system, environmental pollution are counted, in striograph
Corresponding high cost area is set, and in step 4-1）DEM files in record relevant position information.
Step 4-5）By step 4-2）To step 4-3）Optimization range region and high cost region one on three-dimensional map
One sign, forms vector quantization information, for optimization routine call below.
Step 5）Cross section linkage optimization
Route cross section information is set, road is established and fills out excavation slope and plane coordinates（x,y）Functional relation.First according to road
Road plane, longitudinal data and width of subgrade information, shoulder point position is obtained in dimensional topography, then with specified side slope
Ratio of slope calculates toe point coordinates, according to step 4-5）The obstacle-avoidance area of statistics and unfavorable geology region, obtain DEM header files letter
Breath and high cost regional model, calculate the corresponding cross section gradient
If the optimization of construction documents design phase, it is also necessary to which classification side slope is set.
Step 6）Add bridge, tunnel, grade separation structure initialization information；
Count all fronts bridge, tunnel, the structure information such as grade separation, each structure include sequence number, starting point pile No., terminal pile No.,
The information such as angle, across footpath, structural form.
Step 7）Plane optimizing variable is encoded, the coding of whole plane optimizing sets altogether 5 variables, Mei Gebian
Measure in a computer with 6 binary representations, be respectively：
ΔXk：The coordinate X increments of change of k-th of intersection point；
ΔYk：The coordinate X increments of change of k-th of intersection point；
ΔEk：The external distance increments of change of k-th of intersection point；
ΔLS1k：The preceding length of transition curve increments of change of k-th of intersection point；
ΔLS2k：The rear length of transition curve increments of change of k-th of intersection point；
Then the binary numeral of each intersection point is combined as a chromosome, so possesses the length of the chromosome of n intersection point
（Number of bits）For 30n.
Step 8）Optimizing is carried out using the algorithm based on planar multilayer constraint system；
Step 8-1）According to step 7）The coding rule of setting, it is certain using generating random number according to the length of each chromosome
The individual of quantity, form initialization population.
Step 8-2）Decoding operate is carried out to each bar chromosome in population, inverse returns Δ Xk、ΔYk、ΔEk、ΔLS1k、
ΔLS2kNumerical value, then by Δ EkCalculate each circular curve radius increment value Δ R of intersection pointK,By the X of each intersection pointK、YK、RK、
LS1K、LS2KEach add Δ Xk、ΔYk、ΔRk、ΔLS1k、ΔLS2k, the intersection point data of decoded each intersection point can be obtained.
Step 8-3）First layer constraints is checked, the individual for not meeting inspection is directly eliminated, and returns to step 8-1）Again
The individual is generated, until the individual of the first batch initiation population is all qualified.
Step 8-4）Add and check second layer plane restriction condition；
The routinely error checking such as whether route coordinates positions is overlapping, curves overlapped between 2 points are checked for each population,
Go forward side by side trade road normalized checking, including plane point of intersection spacing, radius of horizontal curve, length of transition curve, intermediate straight line length, horizontal curve
The Highway Code accordance inspection such as bag vertical curve, the individual for not meeting inspection are directly eliminated, and return to step 8-1）Regenerate this
Individual, until the individual of the first batch initiation population is all qualified.
Step 9）Add and check third layer plane restriction condition；
Third layer constraint is mainly the constraint of design condition, including the constraint of plane point of intersection position constraint, horizontal curve, easement curve are about
Beam etc., set plane point of intersection excursion, radius of horizontal curve excursion, easement curve change model before optimization by designer
Enclose, so as to calculate the span of these numerical value.
Third layer plane restriction condition is checked, the individual for not meeting inspection requirements is directly eliminated, and returns to step 8-
1）The individual is regenerated, until the individual of the first batch initiation population is all qualified.
Huge population quantity must not be not provided with calculating process, otherwise, whole colony is all without satisfactory individual
In the presence of algorithm will restrain in the first generation, exit computing.
Step 10）Map knick point and bridge tunnel structure pile No.
During previous step plane optimizing, because position of intersecting point, radius are changed, thus the mileage of route also with
Variation, corresponding vertical curve knick point pile No., elevation, radius should all change, and this step adjusts knick point by reflection method
Pile No., elevation, radius.
Step 10-1）The coordinate of pile by pile sampled point of the variation route that each individual is formed in population is calculated, to save
Amount of calculation, straightway are joined directly together, and curved section regards sweep size, between sampled point value 5-100 rice.
Step 10-2）Vertical section vertical curve file, bridge tunnel pile No. corresponding to each individual of change, before finding out optimization first
Vertical curve knick point or bridge tunnel terminus pile No., and calculate corresponding plane coordinates；Then using the point as starting point, the point is solved
With step 10-1）The distance between line segment that coordinate of pile by pile sampled point is formed, find out the minimum intersection point P of distance；
Step 10-3）New pile No. of the intersection point P in variation route is calculated, step by step calculation goes out all knick points and bridge in this manner
The mapping pile No. of tunnel structure pile No..
Step 10-4）Three-dimensional stereo model is generated, the threedimensional model of original scheme is established in three-dimensional geographic information environment,
With reference to original scheme and actual landform situation is combined, further accurate adjustment is carried out to the threedimensional model after mapping.
Step 11）Update the ground data after the changing of the relative positions of plan-position；
Step 11-1）Again the coordinate of pile by pile sampled point of the variation route that each individual is formed in population is calculated, to ensure
Earthwork calculates accurate, the constant value of sampled point.
Step 11-2）Each individual variation route center line is pressed into equidistant peg orientation on three-dimensional geographic information model,
Elevation is directly obtained on DEM, calculates route central point ground elevation, and is extended to the left and right, calculates ground of cross section number
According to.
Step 12）Target function value calculates；
With step 3）The object function F of determination is minimum to be used as optimal Rule of judgment, for step 8-4）Check the initialization passed through
Population is calculated, and utilizes step 10）, step 11-2）The each individual data message obtained calculates corresponding fitness value.
Step 13）Carry out the selection of genetic algorithm, intersection, variation etc. to operate, calculate optimum individual.
Step 14）Set and terminate algebraic value N1, N1 values are subtracted 1, come back to step 10）, loop computation, until N1 is equal to
0, at this moment all individual object function F are close to equal, and optimal solution converges on a fixed value.If optimal solution is received in advance
Hold back, then terminate and calculate.
Step 15）Optimal solution is performed into step 8-2）Decoding operate, obtain final plane point of intersection data, and using should
Data calculate Lu Zhizheng ground elevation in three-dimensional geographical environment, and plane point of intersection data and Lu Zhizheng ground after optimization are high
On the basis of journey value is constant, Profile Optimization is carried out.
Step 16）Profile Optimization variable is encoded, 3 are arranged to after the coding of whole Profile Optimization is simplified
Variable, each variable with 6 binary representations, are respectively in a computer：
ΔZHk：The pile No. increments of change of k-th of knick point；
ΔHk：The elevation increments of change of k-th of knick point；
ΔLk：The vertical curve length change increment of k-th of knick point；
Then the binary numeral of each intersection point is combined as a chromosome, so possesses the length of the chromosome of n intersection point
（Number of bits）For 18n.
Step 17）Optimizing is carried out using the genetic algorithm based on vertical section multilayer constraint system；
Step 17-1）According to step 16）The coding rule of setting, according to the length of each chromosome, utilize generating random number one
The individual of fixed number amount, form initialization population.
Step 17-2）Decoding operate is carried out to each bar chromosome in population, inverse returns Δ ZHk、ΔHk、ΔLkNumerical value, so
Afterwards by vertical curve length Δ LkCalculate each radius of vertical curve increment value Δ R of knick pointK,By the ZH of each knick pointk、Hk、
LkEach add incremental data Δ ZHk、ΔHk、ΔRk, the vertical curve data of decoded each knick point can be calculated.
Step 17-3）Add and check second layer Profile Optimization constraints；
The routinely error checking such as whether route coordinates positions is overlapping, curves overlapped between 2 points are checked for each population,
Go forward side by side trade road normalized checking, including the inspection of the Highway Code accordance such as radius of vertical curve, longitudinal slope, length of grade, horizontal curve bag vertical curve
Look into, the individual for not meeting inspection is directly eliminated, and returns to step 17-1）The individual is regenerated, until the first batch initiation population
Individual all it is qualified.
Step 18）Add and check third layer Profile Optimization constraints；
Third layer constrains the constraint of mainly design condition, including slope change constraint, length of grade change constrain, horizontal curve constrains,
Limit for height constrains, and sets horizontal curve length excursion, length of transition curve excursion, vertical curve before optimization by designer
Length change scope, slope change scope, length of grade excursion etc., so as to draw the span of these numerical value；Limit for height constrains
It is the key of third layer vertical section constraint, obtains separated interchange, bridge terminus, bridge navigation the point stake of all fronts route first
Number, each control point is obtained in three-dimensional geographic information view fills out digging height, and the number changed is then allowed according to user's input
Value, establish limit for height constraint judgment expression.
Third layer plane restriction condition is checked, the individual for not meeting inspection requirements is directly eliminated, and returns to step 17-
1）The individual is regenerated, until the individual of the first batch initiation population is all qualified.
Huge population quantity must not be not provided with calculating process, otherwise, whole colony is all without satisfactory individual
In the presence of algorithm will restrain in the first generation, exit computing.
Step 19）Repeat step 12）, step 13）, until optimal solution converges on a fixed value.If optimal value shifts to an earlier date
Convergence, then terminate and calculate, draw unique optimum individual.
Step 20）Completely after the Profile Optimization of abovementioned steps, the optimum individual that calculates, the individual is construction cost
Minimum individual, decoding operate is carried out by optimum individual with the summation of running cost, the knick point data after being optimized, according to
These data combination steps 15）The plane point of intersection data of acquisition, by the road of all fronts, bridge, tunnel model in three-dimensional geographic information environment
Middle foundation comes out.
Step 21）With reference to step 10-4）The threedimensional model of the original scheme of generation, for the structure start and end of Optimized model
The linear factors of non-rice habitats such as point pile No., slope gradient, are intuitively adjusted in three-dimensional environment, obtain final road optimization mould
Type.
Step 22）Hand inspection or the prioritization scheme for being expounded through peer review computer generation again, draw final route plan, weight
New calculating target function F, all fronts road optimization ratio is calculated, completes highway three-dimensional optimized.
In summary, the beneficial effect that is compared with the prior art of the present invention is：
The inventive method can solve the problems with found in engineering actual mechanical process：
Using highway geometry three-dimensional optimized method proposed by the present invention, for complete design and the route being expounded through peer review
Scheme, after the highway geometry three-dimensional optimized method by being constrained system based on multilayer is optimized, it can at least save about 1% ~ 3%
Highway construction and running cost, for investing huge highway construction, such optimization obviously can produce huge economic benefit.
In the optimization range of this ratio, due to the introducing of multilayer constraint system, original General layout Plan is almost unchanged, satisfies the need
Line entire effect is little, and road alignment index is improved on the contrary.At the same time, the global optimization ratio of prescribed percentage is passed through
Example control, while also can inverse go out road plane, the span of Profile Optimization parameter.The inventive method application when according to
Specifically need to configure corresponding software.
Above content is to combine specific preferred embodiment further description made for the present invention, it is impossible to is assert
The specific implementation of the present invention is confined to these explanations.For general technical staff of the technical field of the invention,
Some equivalent substitutes or obvious modification are made on the premise of not departing from present inventive concept, and performance or purposes are identical, then should
It is considered as belonging to the protection domain that the present invention is determined by the claims submitted.
Claims (10)
- A kind of 1. highway geometry three-dimensional optimized method based on multilayer constraint system, it is characterised in that step 1, establish demonstration side The road all fronts three-dimensional digitalization model of case；Step 2, the road all fronts three-dimensional digitalization model of demonstration scheme is established；Step 3, Establish road plane optimized mathematical model；Step 4, first layer constraints is added；Step 5, cross section linkage optimization；Step 6, Add bridge, tunnel, grade separation structure initialization information；Step 7, plane optimizing variable is encoded；Step 8, base is utilized Optimizing is carried out in the algorithm of planar multilayer constraint system；Step 9, add and check third layer plane restriction condition；Step 10, reflect Penetrate knick point and bridge tunnel structure pile No.；Step 11, the ground data after the changing of the relative positions of plan-position is updated；Step 12, object function Value calculates；Step 13, the operation such as the selection of genetic algorithm, intersection, variation is carried out, calculates optimum individual；Step 14, set eventually Only algebraic value N1, N1 values are subtracted 1, come back to step 10）, loop computation, until N1 be equal to 0, at this moment all individual targets Function F is close to equal, and optimal solution converges on a fixed value；If optimal solution restrains in advance, terminate and calculate；Step 15, optimal solution is performed into step 8-2）Decoding operate, obtain final plane point of intersection data, and using the data dimensionally Lu Zhizheng ground elevation is calculated in reason environment, the constant base of plane point of intersection data and Lu Zhizheng ground elevation value after optimization On plinth, Profile Optimization is carried out；Step 16, Profile Optimization variable is encoded, the coding of whole Profile Optimization is through letter 3 variables are arranged to after change, each variable is in a computer with 6 binary representations；Step 17, using based on vertical section multilayer The genetic algorithm of constraint system carries out optimizing；Step 18, add and check third layer Profile Optimization constraints；Step 19, Repeat step 12）, step 13）, until optimal solution converges on a fixed value；If optimal value restrains in advance, terminate and calculate, Draw unique optimum individual；Step 20, optimum individual abovementioned steps calculated carries out decoding operate, after being optimized Knick point data, according to these data combination steps 15）The plane point of intersection data of acquisition, by the road of all fronts, bridge, tunnel model three Establish and come out in dimension geographic information environment；Step 21）With reference to step 10-4）The threedimensional model of the original scheme of generation, for excellent Change the linear factors of non-rice habitats such as structure terminus pile No., the slope gradient of model, intuitively adjusted, obtained in three-dimensional environment Obtain road Optimized model finally.
- 2. a kind of highway geometry three-dimensional optimized method based on multilayer constraint system according to claim 1, its feature exist Whole route areas are covered in the DEM grids of, the virtual sufficiently large rectangle described in step 4, the route in optimization range Indicated one by one on three-dimensional map by key position, unfavorable geology region, high cost region, formation vector quantization information, and with This is first layer constraints.
- 3. a kind of highway geometry three-dimensional optimized method based on multilayer constraint system according to claim 1, its feature exist In cross section linkage optimization, obtains shoulder point position in dimensional topography described in step 5, then with specified slope gradient Toe point coordinates is calculated, establishes high cost regional model, the former cross section gradient is adjusted.
- 4. a kind of highway geometry three-dimensional optimized method based on multilayer constraint system according to claim 1, its feature exist In being encoded to plane optimizing variable described in step 7, the coding of whole plane optimizing sets altogether 5 variables, Mei Gebian Amount is in a computer with 6 binary representations.
- 5. a kind of highway geometry three-dimensional optimized method based on multilayer constraint system according to claim 1, its feature exist In, the multilayer constraint system described in step 8, the constraints of introducing different levels in flat, vertical, horizontal section optimization；First layer Constraint is to maintain the constraint of existing road design, and second layer constraint is Road Design normal constraint, and third layer constraint is to set Count constraint；First layer is outermost layer, and third layer is innermost layer, and the judgement of constraints is carried out from outermost layer to innermost layer, If outer layer constraints is not met, directly jump out, no longer judge the constraints of internal layer.
- 6. a kind of highway geometry three-dimensional optimized method based on multilayer constraint system according to claim 1, its feature exist In addition described in step 9 simultaneously checks third layer plane restriction condition, including the constraint of plane point of intersection position constraint, horizontal curve, slow With curve constraint etc., set before optimization by designer plane point of intersection excursion, radius of horizontal curve excursion, relax it is bent Line excursion etc., so as to calculate the span of these numerical value.
- 7. a kind of highway geometry three-dimensional optimized method based on multilayer constraint system according to claim 1, its feature exist In the mapping knick point described in step 10 and bridge tunnel structure pile No., original scheme is referred in three-dimensional geographic information environment and is tied Actual landform situation is closed, further accurate adjustment is carried out to the threedimensional model after mapping.
- 8. a kind of highway geometry three-dimensional optimized method based on multilayer constraint system according to claim 1, its feature exist In addition described in step 17 simultaneously checks second layer Profile Optimization constraints, can be after plane inspection to change of longitudinal grade Scheme carry out roadway specification inspection.
- 9. a kind of highway geometry three-dimensional optimized method based on multilayer constraint system according to claim 1, its feature exist In addition described in step 18 simultaneously checks third layer Profile Optimization constraints, obtains separated interchange, the bridge of all fronts route Terminus, bridge navigation point a pile No., obtained in three-dimensional geographic information view each control point fills out digging height, then according to Family input allows the numerical value of change, establishes limit for height constraint judgment expression.
- 10. a kind of highway geometry three-dimensional optimized method based on multilayer constraint system according to claim 1, its feature exist In step 21）Described combination step 10-4）The threedimensional model of the original scheme of generation, risen for the structure of Optimized model The linear factor of the non-rice habitats such as terminal pile No., slope gradient, is intuitively adjusted in three-dimensional environment, obtains final road optimization Model.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710995632.XA CN107729663A (en) | 2017-10-23 | 2017-10-23 | A kind of highway geometry three-dimensional optimized method based on multilayer constraint system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710995632.XA CN107729663A (en) | 2017-10-23 | 2017-10-23 | A kind of highway geometry three-dimensional optimized method based on multilayer constraint system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107729663A true CN107729663A (en) | 2018-02-23 |
Family
ID=61213307
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710995632.XA Pending CN107729663A (en) | 2017-10-23 | 2017-10-23 | A kind of highway geometry three-dimensional optimized method based on multilayer constraint system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107729663A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108763775A (en) * | 2018-05-30 | 2018-11-06 | 东南大学 | A kind of routing method and its system carrying out three-dimensional reorganization and expansion to highway based on limiting factor |
| CN109447437A (en) * | 2018-10-17 | 2019-03-08 | 中南大学 | A kind of public affairs (iron) road vertical section method for auto constructing comprising cut-fill transition |
| CN109558689A (en) * | 2018-12-11 | 2019-04-02 | 南京天辰礼达电子科技有限公司 | A method of by highway layout data digitalization and auxiliary construction |
| CN110110645A (en) * | 2019-04-30 | 2019-08-09 | 北京控制工程研究所 | A kind of obstacle method for quickly identifying and system suitable for low signal-to-noise ratio (SNR) images |
| CN111723174A (en) * | 2020-06-19 | 2020-09-29 | 航天宏图信息技术股份有限公司 | Quick region statistical method and system for raster data |
| CN116401873A (en) * | 2023-04-11 | 2023-07-07 | 华东交通大学 | Intelligent line selection method considering train running speed curve optimization |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101540020A (en) * | 2009-04-01 | 2009-09-23 | 江西省交通设计院 | Three-dimensional line-selection method for road |
| CN101872376A (en) * | 2010-06-04 | 2010-10-27 | 中国公路工程咨询集团有限公司 | True three-dimensional road intelligent design method and system |
| CN103399849A (en) * | 2013-06-24 | 2013-11-20 | 中南大学 | Road three-dimensional linear automatic optimization method based on improved particle swarm optimization |
-
2017
- 2017-10-23 CN CN201710995632.XA patent/CN107729663A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101540020A (en) * | 2009-04-01 | 2009-09-23 | 江西省交通设计院 | Three-dimensional line-selection method for road |
| CN101872376A (en) * | 2010-06-04 | 2010-10-27 | 中国公路工程咨询集团有限公司 | True three-dimensional road intelligent design method and system |
| CN103399849A (en) * | 2013-06-24 | 2013-11-20 | 中南大学 | Road three-dimensional linear automatic optimization method based on improved particle swarm optimization |
Non-Patent Citations (3)
| Title |
|---|
| WANG WEN JIA 等: "Two-stage Optimization of Highway Vertical Alignment Using Genetic Algorithms", 《23RD EUROPEAN CONFERENCE FORUM BAUINFORMATIK 2011 CONSTRUCTION INFORMATICS.》 * |
| 刘超群 等: "基于混合编码的粗粒度并行遗传算法在公路选线优化中的研究", 《江西科学》 * |
| 陈国军 等: "基于并行遗传算法的公路线形优化", 《***仿真学报》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108763775A (en) * | 2018-05-30 | 2018-11-06 | 东南大学 | A kind of routing method and its system carrying out three-dimensional reorganization and expansion to highway based on limiting factor |
| CN108763775B (en) * | 2018-05-30 | 2022-03-18 | 东南大学 | Line setting method and system for three-dimensional reconstruction and extension of expressway based on limiting factors |
| CN109447437A (en) * | 2018-10-17 | 2019-03-08 | 中南大学 | A kind of public affairs (iron) road vertical section method for auto constructing comprising cut-fill transition |
| CN109558689A (en) * | 2018-12-11 | 2019-04-02 | 南京天辰礼达电子科技有限公司 | A method of by highway layout data digitalization and auxiliary construction |
| CN110110645A (en) * | 2019-04-30 | 2019-08-09 | 北京控制工程研究所 | A kind of obstacle method for quickly identifying and system suitable for low signal-to-noise ratio (SNR) images |
| CN111723174A (en) * | 2020-06-19 | 2020-09-29 | 航天宏图信息技术股份有限公司 | Quick region statistical method and system for raster data |
| CN116401873A (en) * | 2023-04-11 | 2023-07-07 | 华东交通大学 | Intelligent line selection method considering train running speed curve optimization |
| CN116401873B (en) * | 2023-04-11 | 2023-12-26 | 华东交通大学 | Intelligent line selection method considering train running speed curve optimization |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107729663A (en) | A kind of highway geometry three-dimensional optimized method based on multilayer constraint system | |
| Pu et al. | Mountain railway alignment optimization using stepwise & hybrid particle swarm optimization incorporating genetic operators | |
| CN103955565B (en) | GIS (Geographic Information System) platform-based urban water system construction planning method | |
| Heidemann | Lidar base specification | |
| CN109670277A (en) | A kind of travel time prediction method based on multi-modal data fusion and multiple-model integration | |
| Bogart et al. | Railways, divergence, and structural change in 19th century England and Wales | |
| CN101872376B (en) | True three-dimensional road intelligent design method and system | |
| CN110569538A (en) | Parameterized modeling and design optimization method for construction access road of railway engineering | |
| CN101900546A (en) | Construction method for digital elevation model for discrete expression of landform on earth surface | |
| Karlsson et al. | Life cycle assessment in road infrastructure planning using spatial geological data | |
| CN110175370A (en) | A kind of REGION OF WATER INJECTION OILFIELD recognition methods of city charge for remittance | |
| CN103970837B (en) | Discontinuous DEM classified manufacturing method based on urban land and vertical planning | |
| Aruga | Tabu search optimization of horizontal and vertical alignments of forest roads | |
| CN113344370B (en) | Emergency unit dividing method and device based on urban road network and regional functions | |
| CN113554467A (en) | Railway three-dimensional linear intelligent design method based on co-evolution | |
| CN110440762A (en) | A kind of aerial survey of multi-rotor unmanned aerial vehicle mountain area at figure gridding photo control point distribution method | |
| CN113190892B (en) | Longitudinal section line layout method, system, terminal and readable storage medium | |
| Sukalkar et al. | A Study and Design of Two Lane with Paved Shoulder in Green Filed Corridor, By Using Civil 3D | |
| Akay | Minimizing total cost of* construction, maintenance, and transportation costs with computer-aided forest road design | |
| CN106875382A (en) | Tailings Dam size values extracting method and device | |
| CN112766721B (en) | Method for planning and site selection and scale estimation of check dam | |
| Sui et al. | Extraction of road boundary from MLS data using laser scanner ground trajectory | |
| CN113012286B (en) | Method for constructing road DEM based on dense point cloud data | |
| Rahman et al. | Wyoming Rocky Mountain forest soils: mapping using an ARC/INFO geographic information system | |
| Vichrová et al. | Digital Terrain Model of the Second Military Survey–Part of the Military Training Area Brdy |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20180223 |