CN107130484A - Lay-by method to set up in one kind service residential area auxiliary route - Google Patents

Lay-by method to set up in one kind service residential area auxiliary route Download PDF

Info

Publication number
CN107130484A
CN107130484A CN201710338283.4A CN201710338283A CN107130484A CN 107130484 A CN107130484 A CN 107130484A CN 201710338283 A CN201710338283 A CN 201710338283A CN 107130484 A CN107130484 A CN 107130484A
Authority
CN
China
Prior art keywords
mrow
road
msub
surface concrete
parking
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201710338283.4A
Other languages
Chinese (zh)
Inventor
杜则行健
陈峻
朱翊
宫晓琳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Southeast University
Original Assignee
Southeast 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 Southeast University filed Critical Southeast University
Priority to CN201710338283.4A priority Critical patent/CN107130484A/en
Publication of CN107130484A publication Critical patent/CN107130484A/en
Pending legal-status Critical Current

Links

Classifications

    • EFIXED CONSTRUCTIONS
    • E01CONSTRUCTION OF ROADS, RAILWAYS, OR BRIDGES
    • E01CCONSTRUCTION OF, OR SURFACES FOR, ROADS, SPORTS GROUNDS, OR THE LIKE; MACHINES OR AUXILIARY TOOLS FOR CONSTRUCTION OR REPAIR
    • E01C1/00Design or layout of roads, e.g. for noise abatement, for gas absorption
    • E01C1/002Design or lay-out of roads, e.g. street systems, cross-sections ; Design for noise abatement, e.g. sunken road

Abstract

The invention discloses lay-by method to set up in one kind service residential area auxiliary route, when residential area parking at night demand can not be satisfied, using setting up lay-by berth supply model in auxiliary route, for the parking demand that can not be satisfied, quantification determines the set location and quantity of residential block on-street parking spaces in survey region, so that reached the resident in berth in road after storing cycle, it walks to average distance of house destination to be most short.The inventive method quantification, which is provided, serves parking person and walks to destination average distance most short old residential parking layout optimization scheme, can alleviate the parking supply and demand contradiction of the old residential block of land resource finite sum parking planning missing.

Description

Lay-by method to set up in one kind service residential area auxiliary route
Technical field
The present invention relates to Traffic Systems planning and administrative skill, belong to city parking traffic management technology field, have Body is related to lay-by method to set up in a kind of service residential area auxiliary route, lacks and should have mainly for metropolitan old residential block Building's parking requirements berth, and the limited situation in actual land used space.
Background technology
With Chinese Urbanization's and the fast development of motorization, the parking contradiction of the old residential block in big city is increasingly Seriously.Due to problem left over by history, parking layout is unreasonable, parking facility berth wretched insufficiency, parking planning and control measures Serious loss, cause old residential block night to produce supersaturated demand.Old residential parking facility is delayed and without science Rational parking layout has had a strong impact on the daily life of resident.The parking contradiction in some areas is not only brought not to local resident Just, can also harmful effect be produced to regional traffic environment.Therefore, auxiliary road-surface concrete is set for old residential block Band, formulates rational parking layout's scheme, for reducing regional area parking contradiction and weight being respectively provided with to urban traffic safety Want meaning.
" road-surface concrete " sets convenient, workable, is not take up extra land resource and is adapted to night for a long time Park.These characteristics all with old residential block land used resource-constrained, traffic is more, resident's parking demand is mainly night for residential block commuting Between agree with very much the features such as stop for a long time.
Parking layout's scheme of existing old residential block stopping at release contradiction is more to carry out cloth from qualitatively angle Office is set, and proposes appropriate parking measure and strategy, meets regional parking layout strategic requirement, but propose that macro policy lacks Specific operation measure, does not clearly state overfull demand and whither shifts, and is not given to reasonable, effective berth and sets bar Part, it is difficult to effective stopping at release contradiction.
The content of the invention
Goal of the invention:For the excessive situation of down town berth demand of old residential block night, the present invention proposes a kind of Lay-by method to set up in the auxiliary route of residential area is serviced, is supplied lay-by in auxiliary route as extra berth, based on parking person Walk to that destination average distance is most short, the parking demand and supply for the interior lay-by that satisfies the need is set up parking layout and optimized.
Technical scheme:To achieve these goals, lay-by method to set up in the auxiliary route of residential area, bag are serviced in the present invention Include following steps:
Step (1):Obtain the service residential area parking at night demand peaks total amount and with building berth total supply (residential block Internal berth number), if the parking at night demand peaks total amount, which is more than, determines road-surface concrete demand with building berth total supply Total amount, the then basis in subsequent step《Berth sets specification in urban road road》Set up lay-by in auxiliary route.
Specifically, the parking at night demand peaks total amount of the service residential area is divided into matching somebody with somebody and builds internal parking demand and Lu Nei Parking demand, in order to prevent that berth is overloaded because of external factor (such as visitor's vehicle) inside residential block, and allocation criterion is set For:With the 90%-100% for building internal parking demand and being set as berth number inside residential block, remaining parking demand is road Interior parking demand, i.e., excessive parking demand.
Step (2):It can arbitrarily be taken, set up as x-axis, y-axis and origin using the road at the service residential area gateway Two-dimensional plane coordinate system in survey region, abscissa and ordinate are space length, and unit is rice.
Step (3):Road-surface concrete demand point is determined based on the residential building and the distance of gateway in the service residential area Position and quantity, set standby on alternative road-surface concrete band according to the road width and length situation at service residential area gateway The position of parking supply point and quantity in routing, and fasten expression in two-dimensional plane coordinate.
Position and the quantity of road-surface concrete demand point, including following step are determined based on the residential building in the service residential area Suddenly:
1) residential building in the service residential area is divided into three road-surface concrete demand regions, it is specific as follows:Apart from resident The distance of area gateway is not more than R/3 resident's housing-group as parking demand region in the first via, apart from residential block gateway Distance is more than R/3 and no more than 2R/3 resident's housing-group as the second road-surface concrete demand region, apart from residential block gateway Resident's housing-group that distance is more than 2R/3 is used as the 3rd road-surface concrete demand region;R is the maximum appearance that parking person walks to destination Bear distance;
2) respectively using the geometric centroid of each road-surface concrete demand region as the parking area road-surface concrete demand point.
According to《Berth sets specification in urban road road》It is determined that alternative road-surface concrete band position, it is determined that alternative road-surface concrete Feed point quantity and coordinate, it is determined that the upper and lower limit in the berth of alternative road-surface concrete feed point.
1. alternative road-surface concrete band is arranged at road where the motor vehicle gateway of residential block, according to《Urban road road Nei Bo Position sets specification》Trackside berth, specification such as following table are set:
Table 1 sets the road width unit of on-street parking spaces to be rice
2. alternative road-surface concrete band is cut,《Berth sets specification in urban road road》Provide multiple parking positions During connected combination, every group of length takes every 50 meters alternative road-surface concrete bands to be supplied as an alternative road-surface concrete preferably in 60m Point;
3. alternative road-surface concrete feed point is set to the midpoint of this 50 meters alternative road-surface concrete bands.
Step (4):Position and the pool of the feed point of alternative road-surface concrete band are carried out with the table dispatching method in operational research The resource allocation of position supply, obtains result of calculation.
Using the service residential area as survey region, if parking information variable and the expression of supply and demand point coordinates in survey region It is as follows:Old residential block parking at night demand peaks total amount is D, is D with internal parking demand is built1, the parking of road-surface concrete band Demand is D2, D=D1+D2
Set up in survey region and walk to destination average distance most short object function and be:
Wherein, T is the average distance that all parking persons walk to destination in survey region, and unit is rice;tijFor research Walking distance of i-th of road-surface concrete demand point to j-th of alternative road-surface concrete feed point in region;AijFor j-th of alternative road Interior parking supply point serves the parking position quantity of i-th of road-surface concrete demand point;pjFor j-th of alternative road-surface concrete supply The corresponding configurable parking position quantity of point;M is the road-surface concrete feed point total number for intending selecting in survey region;N is research Road-surface concrete demand point total number in region;
Set up bound for objective function formula as follows:
In formula:tijFor walking of i-th of road-surface concrete demand point to j-th of alternative road-surface concrete feed point in survey region Distance, because old residential block belongs to small range region, parking person's walking distance is not over 300 meters, by parking person in supply and demand It is too big that walking distance between point is directly expressed as the distance between 2 points of coordinate error, therefore order (xi,yi) for the position coordinates of road-surface concrete demand point in survey region;For alternative road-surface concrete supply in survey region The position coordinates of point;aijFor Boolean variable, aij=1 represents that i-th of road-surface concrete demand point can be by j-th of alternative road-surface concrete Feed point is serviced, aij=0 represent i-th road-surface concrete demand point can not being serviced arrive;Respectively j-th alternative Configurable minimum, the most parking position quantity of road-surface concrete feed point, wherein most berth numbers are by alternative road-surface concrete band Length is determined;pjFor the corresponding configurable parking position quantity of j-th of alternative road-surface concrete feed point;diFor i-th of road-surface concrete The parking demand of demand point;The road-surface concrete feed point quantity that m selects for plan;M is alternative road-surface concrete feed point quantity;R The maximum tolerance distance of destination, i.e. resident are walked to for parking person, and to walk to destination tolerable apart from higher limit, can be with Take 300 meters.
Step (5):Road-surface concrete demand and stopping that alternative berth in road is supplied are carried out with table dispatching method in operational research Car layout optimization, obtains result of calculation, obtains the lay-by plan of establishment in the auxiliary route based on most short average walking distance.Specifically For:
1) with reference to the transportation problem algorithm of integer programming in linear programming, it regard road-surface concrete demand number in region as " pin The amount of selling ", using Berth number in road as " yield ", parking person is walked to destination as " freight ", due to each standby Parking supply point has the limitation of berth construction quantity in routing, therefore this algorithm can be summarized as the unbalanced transport of production and marketing and ask Topic, the walking distance table for building i-th of road-surface concrete demand point to j-th of alternative road-surface concrete feed point is as follows,
The parking demand point of table 2 is to alternative road-surface concrete feed point apart from table
As shown in table 2,Represent respectively under the configurable berth number of j-th of alternative road-surface concrete feed point, The upper limit, tij, to the distance of j-th of alternative road-surface concrete feed point, work as t for i-th of road-surface concrete demand point in survey regionij>R When (walking distance), t is takenijFor infinitely great (can not service).
2) berth allocation initial solution, Vogel method are calculated using Vogel method (Vogel Approximation Method) It can obtain compromise well at the accurate aspect of required amount of calculation and initial solution;
3) judge whether initial solution is optimal using potential method, judge check number λ, find out the negative test number of maximum absolute value, It is adjusted with loop circuit adjusting method, until all check number non-negative;
4) obtain selecting road-surface concrete feed point, corresponding berth number pjWith berth allocation amount Aij, algorithm terminates.
Beneficial effect:Lay-by method to set up utilizes strong operability in the auxiliary route of service residential area provided by the present invention Road-surface concrete facility fills up the unappeasable residential parking demand in berth inside old residential block, and can alleviate land resource has The parking supply and demand contradiction of the old residential block of limit and parking planning missing;It is parking demand information in known survey region, old Under conditions of old residential block inside parking facility information and alternative road-surface concrete facilities information, by layout optimization model really Fixed, quantification provides road-surface concrete feed point and walks to destination average distance most short old residential parking layout optimization side Case, including:Road-surface concrete band sets length, position and berth supply scale, realizes the quantification point configured to parking resource Analysis.
Brief description of the drawings
Fig. 1 for the present invention in service residential area auxiliary route in lay-by method to set up flow chart;
Fig. 2 is the space plane two-dimensional coordinate system figure of survey region parking information;
Fig. 3 is the knot being allocated using the inventive method to the road-surface concrete demand of old residential block in embodiment Really.
Embodiment
Technical scheme is described in detail below in conjunction with the accompanying drawings.
As shown in figure 1, servicing lay-by method to set up in the auxiliary route of residential area in the present invention, comprise the following steps:
Step 1:Obtain the parking at night demand peak value of old residential block and with berth total supply is built, as shown in table 3:
The residential block supply and demand amount of table 3
Residential block title Parking at night demand peak value With building berth total supply
The cell of Xikang road 3 213 120
Parking at night demand peak value, which is more than to match somebody with somebody, builds internal parking position quantity, therefore should set lay-by in auxiliary route Meet excessive parking demand.Parking demand total amount is divided into match somebody with somebody and builds internal parking demand and road-surface concrete demand.With building Internal parking demand is 113 (account for matching somebody with somebody and build the 94% of berth total supply), and road-surface concrete demand (overfull demand) is 100.
Step 2:It can arbitrarily be taken, set up in survey region as x-axis, y-axis and origin using the urban road that alternatively stops Two-dimensional plane coordinate system, abscissa and ordinate are space length, and unit is rice.
Step 3:Road-surface concrete demand point and position and the quantity of alternative road-surface concrete band are determined, it is determined that alternative road-surface concrete The position of the alternative road-surface concrete feed point taken and quantity, and fasten expression in two-dimensional plane coordinate.
Wherein, the position of road-surface concrete demand point and quantity are determined, are specially:
1) it is 300 meters apart from R destination maximum tolerance to be walked to after resident's parking.The residential building of whole residential block is divided into Several road-surface concrete demand regions, criteria for classification is as follows:Apart from no more than 100 meters of resident of residential block motor vehicle gateway distance Housing-group (a residential building part is also calculated within 100 meters is not more than 100 meters) is as one piece of road-surface concrete desired region, apart from residential block Resident's housing-group of the motor vehicle gateway distance more than 100 meters and no more than 200 meters (within 200 meters also calculates by a residential building part No more than 200 meters) as another piece of road-surface concrete demand region, apart from residential block motor vehicle gateway, distance is more than 200 meters Resident's housing-group is used as last block road-surface concrete demand region.
2) geometric centroid of road-surface concrete demand region as the parking area road-surface concrete demand point.
As shown in Fig. 2 being that resident is divided into 3 road-surface concretes in the parking information of the survey region got, Fig. 2 to need Region is asked, the centre of form in each region has road-surface concrete demand point 3 as road-surface concrete demand point, and on-street parking spaces are needed The amount of asking is respectively A points 40, B points 40 and C points 20.
There is one 300 meters of two-way two lane segment in the other region, the section width of roadway is about 14 meters and led to Residential block motor vehicle gateway is crossed, the section is set to alternative road-surface concrete band and supplied using 50 meters as one alternative road-surface concrete Cut to, obtain 6 alternative road-surface concrete feed points, i.e.,:Alternative road-surface concrete feed point 1,2,3,4,5,6, with 50 The center of the alternative road-surface concrete band of rice alternately road-surface concrete feed point, using 5 meters long as a parking stall, in both sides of the road Parking stall is set, and each alternative road-surface concrete feed point maximum can plan 20 parking positions.This example will with parking person from The average distance of feed point to demand point is most short to require, carries out parking layout's optimization.
Related parking information see the table below.
The survey region parking demand point distribution table of table 4
The alternative road-surface concrete feed point position of the survey region of table 5 and berth upper limit tables can be built
Step 3:Make { (xi,yi)={ (150,17), (75,130), (31,207) }, i=1-3 is road-surface concrete demand point Coordinate set,I=1-6 is to stop in alternative road Car feed point coordinate set,To be each alternative The upper and lower limit of road-surface concrete feed point berth supply.
Step 4:Step 2 and step 3 are brought into survey region and walk to destination average distance most short object function And constraint equation, and solution is calculated with table dispatching method, it can obtain that result is calculated as below:
In the example Road of table 6 parking demand point to alternative road-surface concrete feed point apart from table (unit:Rice)
Parking demand point is to alternative road-surface concrete feed point allocation table in the example Road of table 7
It was found from above parking resource allocation result, road-surface concrete is supplied to stop in point selection feed point 1,2,3,4,5, i.e. road Car band starting point coordinate is (- 25,0), and terminal point coordinate is (225,0).The road-surface concrete band berth of planning is 100, supply and demand ratio For 100%.Total walking distance of the allocative decision is 13140 meters (berth allocation problem is multiplied by distance matrix), and average walking distance is 131.4 meters (total walking distance/parking position aggregate supply).Specific parking demand allocation result, as shown in figure 3, being demand point A 20 parking demands are transferred to feed point 4,20 parking demands are transferred to feed point 5, wherein demand point A and feed point in addition 4 distance is 42 meters, and the distance with feed point 5 is 42 meters;20 parking demands are transferred to feed point 2 by demand point B, and in addition 20 Individual parking demand is transferred to feed point 3, and wherein demand point B and feed point 2 distance are 180 meters, and the distance with feed point 3 is 130 meters;20 parking demands are transferred to feed point 1 by demand point C, and the distance of wherein demand point C and feed point 1 is 263 meters.

Claims (3)

1. lay-by method to set up in one kind service residential area auxiliary route, it is characterised in that this method comprises the following steps:
(1) the service residential area parking at night demand peaks total amount is obtained and with berth total supply is built, if parking demand peak value Total amount is more than and then parking demand peak value total amount is divided into building internal parking demand quantity and Lu Nei stops with building berth total supply Car quantity required, according to berth total supply setting is built with internal parking demand quantity is built, remaining is then road-surface concrete demand Quantity;
(2) using the road at the service residential area gateway as x-axis, y-axis is arbitrarily chosen, and builds two-dimensional plane coordinate system;
(3) the position sum of road-surface concrete demand point is determined based on the residential building and the distance of gateway in the service residential area Amount, sets in the alternative road on alternative road-surface concrete band according to the road width and length situation at service residential area gateway and stops The position of car feed point and quantity;
(4) location-based coordinates table reaches, most short with road-surface concrete demand point and the distance between alternative road-surface concrete feed point Restricted problem is built for optimization aim, what the position and berth for carrying out alternative road-surface concrete feed point with table dispatching method were supplied Resource allocation, obtains result of calculation.
2. lay-by method to set up in the auxiliary route of service residential area according to claim 1, it is characterised in that step (3) In position and the quantity of road-surface concrete demand point are determined based on the residential building in the service residential area, comprise the following steps:
1) residential building in the service residential area is divided into three road-surface concrete demand regions, it is specific as follows:Go out apart from residential block The distance of entrance is not more than R/3 resident's housing-group as parking demand region in the first via, the distance apart from residential block gateway Resident's housing-group more than R/3 and no more than 2R/3 is as the second road-surface concrete demand region, the distance apart from residential block gateway Resident's housing-group more than 2R/3 is used as the 3rd road-surface concrete demand region;R be parking person walk to the maximum tolerance of destination away from From;
2) respectively using the geometric centroid of each road-surface concrete demand region as the parking area road-surface concrete demand point.
3. lay-by method to set up in the auxiliary route of service residential area according to claim 1, it is characterised in that step (4) In constructed restricted problem be:
Optimization aim:
<mrow> <mi>m</mi> <mi>i</mi> <mi>n</mi> <mrow> <mo>(</mo> <mi>T</mi> <mo>)</mo> </mrow> <mo>=</mo> <mi>m</mi> <mi>i</mi> <mi>n</mi> <mrow> <mo>(</mo> <mfrac> <mrow> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </munderover> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>m</mi> </munderover> <msub> <mi>t</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>&amp;CenterDot;</mo> <msub> <mi>A</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> </mrow> <mrow> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>m</mi> </munderover> <msub> <mi>p</mi> <mi>j</mi> </msub> </mrow> </mfrac> <mo>)</mo> </mrow> <mo>,</mo> </mrow>
Constraints:
<mrow> <mi>s</mi> <mi>t</mi> <mo>.</mo> <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mrow> <msub> <mi>t</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>=</mo> <mo>|</mo> <msub> <mi>x</mi> <mi>i</mi> </msub> <mo>-</mo> <msub> <mover> <mi>x</mi> <mo>&amp;OverBar;</mo> </mover> <mi>j</mi> </msub> <mo>|</mo> <mo>+</mo> <mo>|</mo> <msub> <mi>y</mi> <mi>i</mi> </msub> <mo>-</mo> <msub> <mover> <mi>y</mi> <mo>&amp;OverBar;</mo> </mover> <mi>j</mi> </msub> <mo>|</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <msub> <mi>a</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>=</mo> <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mn>1</mn> </mtd> <mtd> <mrow> <msub> <mi>t</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>&amp;le;</mo> <mi>R</mi> </mrow> </mtd> </mtr> <mtr> <mtd> <mn>0</mn> </mtd> <mtd> <mrow> <msub> <mi>t</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>&amp;GreaterEqual;</mo> <mi>R</mi> </mrow> </mtd> </mtr> </mtable> </mfenced> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <munderover> <mi>&amp;Sigma;</mi> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>m</mi> </munderover> <msub> <mi>a</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>&amp;GreaterEqual;</mo> <mn>1</mn> <mo>,</mo> <mi>i</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mn>...</mn> <mo>,</mo> <mi>n</mi> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <munderover> <mi>&amp;Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </munderover> <msub> <mi>a</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>&amp;GreaterEqual;</mo> <mn>1</mn> <mo>,</mo> <mi>j</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mn>...</mn> <mo>,</mo> <mi>m</mi> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mn>1</mn> <mo>&amp;le;</mo> <mi>m</mi> <mo>&amp;le;</mo> <mi>M</mi> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <munderover> <mi>&amp;Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </munderover> <msub> <mi>A</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>=</mo> <msub> <mi>p</mi> <mi>j</mi> </msub> <mo>,</mo> <mi>j</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mn>...</mn> <mo>,</mo> <mi>m</mi> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <munderover> <mi>&amp;Sigma;</mi> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>m</mi> </munderover> <msub> <mi>A</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>=</mo> <msub> <mi>d</mi> <mi>i</mi> </msub> <mo>,</mo> <mi>i</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mn>...</mn> <mo>,</mo> <mi>n</mi> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <msubsup> <mi>p</mi> <mi>j</mi> <mi>min</mi> </msubsup> <mo>&lt;</mo> <msub> <mi>p</mi> <mi>j</mi> </msub> <mo>&lt;</mo> <msubsup> <mi>p</mi> <mi>j</mi> <mi>max</mi> </msubsup> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <msub> <mi>A</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>&amp;GreaterEqual;</mo> <mn>0</mn> <mo>,</mo> <mi>i</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mn>...</mn> <mo>,</mo> <mi>n</mi> <mo>,</mo> <mi>j</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mn>...</mn> <mo>,</mo> <mi>m</mi> </mrow> </mtd> </mtr> </mtable> </mfenced> </mrow>
In formula, tijFor i-th of service residential area road-surface concrete demand point to j-th of alternative road-surface concrete feed point walking away from From orderAijI-th road-surface concrete demand point is served for j-th of alternative road-surface concrete feed point Parking position quantity, (xi,yi) be road-surface concrete demand point position coordinates;For the position of alternative road-surface concrete feed point Put coordinate;aijFor Boolean variable, aij=1 represents that i-th of road-surface concrete demand point can be by j-th of alternative road-surface concrete feed point Service, aij=0 represent i-th road-surface concrete demand point can not being serviced arrive;pjFor j-th of alternative road-surface concrete feed point correspondence Configurable parking position quantity;Respectively j-th alternative road-surface concrete feed point it is configurable it is minimum, at most stop Car berth number;diFor the parking demand of i-th of road-surface concrete demand point;The number for the road-surface concrete feed point that m selects for plan Amount, n is the quantity of road-surface concrete demand point;M is alternative road-surface concrete feed point quantity;R is that parking person walks to destination Maximum tolerance distance.
CN201710338283.4A 2017-05-15 2017-05-15 Lay-by method to set up in one kind service residential area auxiliary route Pending CN107130484A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710338283.4A CN107130484A (en) 2017-05-15 2017-05-15 Lay-by method to set up in one kind service residential area auxiliary route

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710338283.4A CN107130484A (en) 2017-05-15 2017-05-15 Lay-by method to set up in one kind service residential area auxiliary route

Publications (1)

Publication Number Publication Date
CN107130484A true CN107130484A (en) 2017-09-05

Family

ID=59732256

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710338283.4A Pending CN107130484A (en) 2017-05-15 2017-05-15 Lay-by method to set up in one kind service residential area auxiliary route

Country Status (1)

Country Link
CN (1) CN107130484A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109448360A (en) * 2018-07-25 2019-03-08 招商局重庆交通科研设计院有限公司 The method for improving road complicated utilization rate

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101339693A (en) * 2008-08-05 2009-01-07 东南大学 Urban off road public parking facilities position and scale control method
US20090261988A1 (en) * 2005-09-20 2009-10-22 Tuplaza Movilidad Y Desarrollo, S.L. System, Access Control Device and Method for Enabling the Exchange and Shared Use of Parking Spaces
CN102376162A (en) * 2011-09-28 2012-03-14 东南大学 Method for setting optimal distance between curb parking lot of intersection exit lane and intersection
CN102855405A (en) * 2012-09-13 2013-01-02 东南大学 Calculation model of scale of urban off-road public parking lot

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090261988A1 (en) * 2005-09-20 2009-10-22 Tuplaza Movilidad Y Desarrollo, S.L. System, Access Control Device and Method for Enabling the Exchange and Shared Use of Parking Spaces
CN101339693A (en) * 2008-08-05 2009-01-07 东南大学 Urban off road public parking facilities position and scale control method
CN102376162A (en) * 2011-09-28 2012-03-14 东南大学 Method for setting optimal distance between curb parking lot of intersection exit lane and intersection
CN102855405A (en) * 2012-09-13 2013-01-02 东南大学 Calculation model of scale of urban off-road public parking lot

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109448360A (en) * 2018-07-25 2019-03-08 招商局重庆交通科研设计院有限公司 The method for improving road complicated utilization rate
CN109448360B (en) * 2018-07-25 2021-04-06 招商局重庆交通科研设计院有限公司 Method for improving road composite utilization rate

Similar Documents

Publication Publication Date Title
CN103942948B (en) Based on the generation method of the urban public bus lines network of sectionally smooth join
CN107330547A (en) A kind of city bus dynamic dispatching optimization method and system
CN201278215Y (en) Adaptive entrance ramp afflux control appliance for road
CN100425768C (en) Zero commuter station structure of bus and zero transferring fast public traffic system
CN108830399B (en) Optimization and adjustment method for supply and demand balance of rail transit station connection facility
CN103729724A (en) Natural-mixing scheduling method of public bike system
CN107527137A (en) Urban mass transit network maturity determines method
CN107274035A (en) A kind of transportation network and the method for electric automobile charging station coordinated planning
CN105489047B (en) City bus intelligence system
CN111691249A (en) Underground transportation system and method for transporting objects
CN107704964A (en) Ultra-large antiblocking personalization high-speed traffic system and its operation method
CN107967590A (en) A kind of optimization constructing method of Urban Underground Logistics System
CN110084397A (en) A kind of subway straightforward line planing method
CN106828167A (en) Double source fills pure electronic many car dynamic power balance control systems and control method soon
CN112465211B (en) Rail transit train full load rate control method and application
CN112580866B (en) Bus route bunching optimization method based on whole-course vehicle and inter-vehicle combined scheduling
CN102063791B (en) Public transport travelling control method by combining signal control with positioning monitoring
CN108364093A (en) The road network passenger flow Collaborative Control optimization method of strategy is discongested based on ability bottleneck
CN106320116A (en) Optimization design method of exit ramp of pedestrian-bicycle shared road at the crossings in cities
CN113724498B (en) Method for parking and building TOD project in central urban area
CN107130484A (en) Lay-by method to set up in one kind service residential area auxiliary route
CN110264704B (en) Pedestrian and vehicle crossing device based on moving sidewalk and control method thereof
CN110148297B (en) Parking transfer system using regular bus connection and optimization method
Zakharov et al. The efficiency of some activities for the development of urban infrastructure for public transport, cyclists and pedestrians
CN103241268A (en) Subway departure time optimizing method for reducing transfer time of tunnel transfer stations

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20170905

RJ01 Rejection of invention patent application after publication