CN110533227A - A kind of method of determining variable line formula public transport fixed station and Dynamic Website - Google Patents
A kind of method of determining variable line formula public transport fixed station and Dynamic Website Download PDFInfo
- Publication number
- CN110533227A CN110533227A CN201910728875.6A CN201910728875A CN110533227A CN 110533227 A CN110533227 A CN 110533227A CN 201910728875 A CN201910728875 A CN 201910728875A CN 110533227 A CN110533227 A CN 110533227A
- Authority
- CN
- China
- Prior art keywords
- passenger
- website
- dynamic website
- fixed station
- vehicle
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 42
- 230000002068 genetic effect Effects 0.000 claims abstract description 7
- 230000035772 mutation Effects 0.000 claims description 6
- 238000004364 calculation method Methods 0.000 claims description 3
- 238000003780 insertion Methods 0.000 claims description 3
- 230000037431 insertion Effects 0.000 claims description 3
- 230000009191 jumping Effects 0.000 claims description 3
- 238000006467 substitution reaction Methods 0.000 claims description 3
- 238000002921 genetic algorithm search Methods 0.000 claims 1
- 230000001737 promoting effect Effects 0.000 abstract description 2
- 238000011160 research Methods 0.000 description 2
- 230000002860 competitive effect Effects 0.000 description 1
- 230000000295 complement effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000033772 system development Effects 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
- 230000003245 working effect Effects 0.000 description 1
Classifications
-
- 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
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Theoretical Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Life Sciences & Earth Sciences (AREA)
- General Physics & Mathematics (AREA)
- Biophysics (AREA)
- Tourism & Hospitality (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- General Health & Medical Sciences (AREA)
- Development Economics (AREA)
- Evolutionary Biology (AREA)
- Bioinformatics & Computational Biology (AREA)
- Genetics & Genomics (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Computing Systems (AREA)
- Molecular Biology (AREA)
- Educational Administration (AREA)
- Evolutionary Computation (AREA)
- Data Mining & Analysis (AREA)
- Mathematical Physics (AREA)
- Biomedical Technology (AREA)
- Primary Health Care (AREA)
- Artificial Intelligence (AREA)
- Physiology (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Traffic Control Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present invention provides the methods of a kind of determining variable line formula public transport fixed station and Dynamic Website, and this method comprises the following steps: service area divides block, and counts to passenger vehicle demand in block；According to passenger vehicle demand and certain restrictive condition, fixed station and Dynamic Website to be selected are determined；With passenger's Trip Costs and the minimum target of bus operation cost weighted sum, objective function is established, the optimal Dynamic Website of day part is obtained using Genetic algorithm searching.The position planning of website and Dynamic Website is fixed with passenger's Trip Costs and the minimum target of bus operation cost weighted sum in the present invention.In the case where promoting most passengers' trip service quality, bus operation cost has been taken into account.This method is adaptable, there is higher application value.
Description
Technical field
The present invention relates to the methods of a kind of determining variable line formula public transport fixed station and Dynamic Website, belong to traffic circulation
And dispatching technique field.
Background technique
The flexibility of bus operation can be substantially improved as a kind of Novel bus method of service in the public transport of variable line formula, will
Routine bus system switchs to complementary relationship by competitive relation with mass rapid transit mode, promotes public transport integrity service water with this
It is flat, excite routine bus system development vitality.
Variable line formula public transport can be described as: vehicle is in certain coverage, along fixed link travel, in fixation
Website is stopped, and under certain condition, is stopped according to Dynamic Website of passenger's actual demand other than fixed route, if multiplying without other
Objective demand, then return to line operation.Certain condition is that vehicle deviates delay caused by reference route and multiplied by residue on vehicle
Visitor receives.Generally whether receive the passenger remaining on vehicle to be quantified as vehicle whether meet minimum vehicle along the speed that reference line is run
Speed.
Currently, domestic, there has been no variable line formula public transport operation cases, stop to the research of variable line formula public transport resonable
It is not perfect for variable line formula site design by the stage.When website is as the collecting and distributing place of passenger, directly decision passenger's walking
Between, and it is as the necessary point of public transport, and determines public transport line length and seeervice cycle indirectly.For fixed station
Rationally setting, has ensured the stability of variable line bus service, affects public transport clothes if fixed station setting is overstocked
The flexibility of business.Meanwhile Dynamic Website is rationally effectively arranged, passenger's walking time can be effectively reduced, improve public
The flexibility of transport services and comfort, and then Quality of Public Transport Service is promoted, improve public transport share rate.
Summary of the invention
Goal of the invention: being directed to the above demand, and the present invention proposes a kind of variable line public transport fixed station and Dynamic Website
Determine method, the method with passenger's Trip Costs and the minimum target of bus operation cost weighted sum, be fixed website and
It plans the position of Dynamic Website.In the case where promoting most passengers' trip service quality, bus operation cost has been taken into account.
This method is adaptable, there is higher application value.
Technical solution: to achieve the purpose of the present invention, the technical scheme adopted by the invention is that:
A kind of method of determining variable line formula public transport fixed station and Dynamic Website, this method comprises the following steps:
(1) service area is divided into block, and passenger vehicle demand in block is counted；
(2) according to passenger vehicle demand and certain restrictive condition, fixed station and Dynamic Website to be selected are determined；
(3) with passenger's Trip Costs and the minimum target of bus operation cost weighted sum, objective function is established, using heredity
Algorithm search obtains the optimal Dynamic Website position of day part.
Further, the method for step (1) is specific as follows: coverage is divided into n block, every block be set as with
Passenger is subjected to the square that walking distance is side length, counts whole periods and day part passenger goes on a journey beginning or end each
Number in block, it is desirable that per period passenger demand is met by same regular bus.
Further, the method for determination fixed station described in step (2) is as follows: complete with counting according to step (1)
Number of portion's period passenger vehicle demand in each block rearranges each block, by number is descending with fixed station
Station spacing controls between bound, and vehicle must not be control condition lower than minimum speed along the baseline speed of service, sentences in order
Whether all blocks that break can be set to fixed station, and the block center for the condition that meets is fixed tentatively as fixed station.
Further, it determines that the method for Dynamic Website to be selected is as follows described in step (2): being counted according to step (1)
Number, is not zero and is not the center of 1 block by number of the day part passenger vehicle demand in each block and number is 1
Transport need point fix tentatively as Dynamic Website, if Dynamic Website is overlapped with fixed station or spacing is less than regulation between fixed station
Minimum station interval Smin, then the Dynamic Website is deleted；If the website spacing of Dynamic Website, which is less than passenger, is subjected to walking distance,
Then retain the big Dynamic Website of number, delete the small Dynamic Website of number, if number is identical, retains close away from baseline vertical range
Dynamic Website, delete apart from remote Dynamic Website, remaining Dynamic Website is Dynamic Website to be selected.
Further, objective function is established in step (3), the method for determining optimal Dynamic Website is as follows:
(3.1) with the minimum target of the weighted sum of passenger's Trip Costs and bus operation cost, objective function W is established, is multiplied
The Trip Costs of visitor include passenger waiting time Twt, passenger walking time TwkWith riding time TbThree parts；Bus operation cost
It is unified metric unit, with time of vehicle operation T depending on vehicle driving distancerSubstitution；Passenger's Trip Costs and bus operation
The weight of cost is w1,w2, and w1+w2=1；
(3.2) fixed station is linked in sequence along base direction and perpendicular to base direction, initial roadway is generated
Diameter；
(3.3) with the minimum target of the weighted sum of passenger's Trip Costs and bus operation cost, using Genetic algorithm searching
Meet the optimal Dynamic Website that vehicle must not be lower than minimum speed condition along the baseline speed of service, generates the optimal dynamic station of day part
Point selection.
Further, described that minimum speed must not be lower than as control condition, specifically along the baseline speed of service using vehicle
The each website passed through to vehicle judges, when judging vehicle by each website, if meets vehicle along baseline and runs speed
Degree is unsatisfactory for control condition if there is a website to be unsatisfactory for not less than minimum speed.
Further, calculation method of parameters involved by step (3.1) are as follows:
Passenger waiting timeWherein,For passenger's i waiting time；
Passenger's walking timeWherein, N is ridership, vwkFor passenger's walking speed,For passenger i with
Manhatton distance between nearest website；
Passenger's riding timeWherein,For passenger's i riding time；
Time of vehicle operationWherein, L is vehicle by driving towards the length of the planning driving path of terminal, v at first stopbFor public transport
Vehicle average speed；
Objective function W=w1×(Twt+Twk+Tb)+w2×Tr。
Further, the optimal Dynamic Website of Genetic algorithm searching is used described in step (3.3), search process is as follows:
(1) coding constructs alternative set of sites: being encoded to 1 for the Dynamic Website of stop, other are encoded to 0；
(2) fitness function F (x) is constructed: withConstruct fitness function, wherein
WmaxFor maximum value in initial population；
(3) initial population generates: the sequence of Dynamic Website insertion route is randomly assigned, if Dynamic Website meets control condition
It is then inserted into route, recycles e generation initial population；
(4) by roulette method selection individual, probability selection operation: is randomly generatedCorresponding fitness value, adapts to
Biggish individual is spent, the probability selected is just high, recycles f times altogether, generates f male parent；
(5) crossover operation: crossover probability is set as px, new daughter is the result intersected two-by-two to f male parent；It is random to produce
Raw probabilityProbability crossover node corresponding with the product of interstitial content；
(6) mutation operation: mutation probability is set as py, probability is randomly generatedProbability and interstitial content multiply
The corresponding variation node of product；
(7) newly generated individual is checked, retains the node for meeting control condition, the section of control condition will be unsatisfactory for
It is 0 that point, which recompiles,；
(8) terminate Rule of judgment: the end loop if meeting cycle-index or reaching plateau exports as a result, otherwise jumping
Go to step (4).
Further, when the judgement vehicle passes through each website, if meet vehicle and be not less than along the baseline speed of service
The specific method of minimum speed is: calculating vehicle and runs to website i planning driving path length Li, vehicle runs to website i and is parallel to
Baseline running length x, ifThen meet, be otherwise unsatisfactory for, wherein vminFor minimum speed, vbIt is average for vehicle
Speed.
The utility model has the advantages that compared with prior art, technical solution of the present invention has the advantages that
(1) present invention determine that fixed station is from passenger's actual angle, so that the fixed station determined, with root at this stage
It is compared according to website spacing or empirically determined fixed station, can both reduce passenger's walking distance, improve Public Transport Service
Quality, and variable line formula public transport requirement on flexibility can be met.
(2) present invention determine that Dynamic Website is not based on passenger demand singly, and in view of public transport integrity service is horizontal
The passengers quantity being met by with each Dynamic Website is set compared to existing with the Dynamic Website that passenger demand is unique reference
It sets, can satisfy the trip requirements of more passengers.
Detailed description of the invention
Fig. 1 is variable line public transport path profile.
Fig. 2 is baseline and x schematic diagram.
Fig. 3 determines variable line public transport fixed station and Dynamic Website flow chart.
Specific embodiment
Further description of the technical solution of the present invention with reference to the accompanying drawings and examples.
(1) coverage is divided into n block, every block be set as using passenger be subjected to walking distance as side length just
It is rectangular, it is generally that passenger is subjected to walking distance with 100m, counts whole periods and day part passenger trip beginning or end exists
Number in each block.It is required that per period passenger demand is met by same regular bus.
(2) number of the whole period passenger beginning or ends counted according to step (1) in each block, by each block
It is rearranged by number is descending, with the control of fixed station station spacing between bound, general setting is limited to up and down
1000m-3000m, vehicle must not be control condition lower than minimum speed along the baseline speed of service, judge that all blocks are in order
It is no to be set to fixed station, the block center for the condition that meets is fixed tentatively as fixed station.
(3) number is not by number of the day part passenger beginning or end counted according to step (1) in each block
Zero and for 1 block center and number be 1 transport need point to fix tentatively be Dynamic Website, if Dynamic Website and fixed station
It is overlapped or spacing is less than defined minimum station interval S between fixed stationmin, generally desirable 300m is minimum station spacing, then deletes
The Dynamic Website.If the website spacing of Dynamic Website, which is less than passenger, is subjected to walking distance, retain the big Dynamic Website of number,
The small Dynamic Website of number is deleted, if number is identical, retain the Dynamic Website close away from baseline vertical range, it is remote to delete distance
Dynamic Website, remaining Dynamic Website are Dynamic Website to be selected.
(4) with the minimum target of the weighted sum of passenger's Trip Costs and bus operation cost, objective function W, passenger are established
Trip Costs include passenger waiting time Twt, passenger walking time TwkWith riding time TbThree parts, bus operation cost take
It is unified metric unit, with time of vehicle operation T certainly in vehicle driving distancerSubstitution.Passenger's Trip Costs and bus operation at
This weight is w1,w2, generally setting w1=0.6, w2=0.4, it can be according to being actually configured in real work, but need to infuse
Anticipate w1+w2=1.
(5) fixed station is linked in sequence along base direction and perpendicular to base direction, initial planning driving path is generated,
Such as Fig. 1.
(6) full using Genetic algorithm searching with the minimum target of the weighted sum of passenger's Trip Costs and bus operation cost
Sufficient vehicle must not be lower than the optimal Dynamic Website of minimum speed condition along the baseline speed of service, generate the optimal Dynamic Website of day part
Selection.
Further, judge whether vehicle meets along the baseline speed of service not less than minimum speed mentioned by step (2) (6)
Control condition method are as follows: each website passed through to vehicle judges, when judging vehicle by each website, if full
Sufficient vehicle is unsatisfactory for not less than minimum speed if there is a website to be unsatisfactory for along the baseline speed of service.
Further, judge whether vehicle meets vehicle along the baseline speed of service not less than minimum speed by website i
Method are as follows: calculate vehicle and run to website i planning driving path length Li, vehicle runs to website i and is parallel to baseline running length x,
IfThen meet, is otherwise unsatisfactory for.Wherein vminFor minimum speed, vbFor vehicle average speed.
Further, the calculation method of some parameters mentioned by step (4) are as follows:
(a) passenger waiting timeWherein,For passenger's i waiting time.
(b) passenger's walking timeWherein, N is ridership, vwkFor passenger's walking speed,For passenger i
With the manhatton distance between nearest website.
(c) passenger's riding timeWherein,For passenger's i riding time.
(d) time of vehicle operationWherein, L is vehicle by driving towards the length of the planning driving path of terminal, v at first stopbFor
Bus average speed.
(e) objective function W=w1×(Twt+Twk+Tb)+w2×Tr。
Further, meeting vehicle using Genetic algorithm searching mentioned by step (6) must not be lower than along the baseline speed of service
The method of the optimal Dynamic Website of minimum speed condition are as follows:
(a) coding constructs alternative set of sites: being encoded to 1 for the Dynamic Website of stop, other are encoded to 0.
(b) fitness function F (x) is constructed: withConstruct fitness function, wherein
WmaxFor maximum value in initial population.
(c) initial population generates: the sequence of Dynamic Website insertion route is randomly assigned, if Dynamic Website meets control condition
It is then inserted into route, recycles e generation initial population.
(d) by roulette method selection individual, probability selection operation: is randomly generatedCorresponding fitness value, adapts to
Biggish individual is spent, the probability selected is just high, recycles f times altogether, generates f male parent.
(e) crossover operation: crossover probability is set as px, may be configured as 0.4, new daughter is intersected two-by-two to f male parent
Result；Probability is randomly generatedProbability crossover node corresponding with the product of interstitial content.
(f) mutation operation: mutation probability is set as py, may be configured as 0.1, probability be randomly generatedProbability with
The product of interstitial content corresponds to variation individual.
(g) newly generated individual is checked, retains the node for meeting control condition, the section of control condition will be unsatisfactory for
It is 0 that point, which recompiles,.
(h) terminate Rule of judgment: the end loop if meeting cycle-index or reaching plateau exports as a result, otherwise jumping
Go to step (d)
Since variable line public transport is not yet runed at home, so the research for starting variable line public transport for the country only limits
In theory, for the operation of variable line public transport, Ying Tiqian does the hypothesis of running environment:
The A public transit vehicle speed of service uses average speed vb, passenger's leg speed is using average speed vwk；
The bearing capacity of B public transit vehicle absolutely meets passenger demand；
C assumes service area locating for public transport, and Regional Road Network is intensive enough, and public transport can be transported along baseline or perpendicular to base direction
Row.
It should be noted that above-described embodiment is only used to illustrate structure and its working effect of the invention, and it is not used as
It limits the scope of the invention.One of ordinary skilled in the art is right without prejudice to thinking of the present invention and structure
The adjustment or optimization that above-described embodiment carries out, should regard as the claims in the present invention and be covered.
Claims (9)
1. a kind of method of determining variable line public transport fixed station and Dynamic Website, which is characterized in that this method includes following
Step:
(1) service area is divided into block, and passenger vehicle demand in block is counted；
(2) according to passenger vehicle demand and certain restrictive condition, fixed station and Dynamic Website to be selected are determined；
(3) with passenger's Trip Costs and the minimum target of bus operation cost weighted sum, objective function is established, using genetic algorithm
Search obtains the optimal Dynamic Website position of day part.
2. the method for a kind of determining variable line public transport fixed station and Dynamic Website according to claim 1, feature
It is, the method for step (1) is specific as follows: coverage is divided into n block, every block is set as with the acceptable step of passenger
Row distance is the square of side length, counts the number of whole periods and day part passenger trip beginning or end in each block
Mesh, it is desirable that per period passenger demand is met by same regular bus.
3. the method for a kind of determining variable line public transport fixed station and Dynamic Website according to claim 1 or 2, special
Sign is, determines that the method for fixed station is as follows described in step (2): handing over the whole period passengers counted according to step (1)
Logical number of the demand in each block, each block is rearranged by number is descending, is existed with the control of fixed station station spacing
Between bound, vehicle must not be control condition lower than minimum speed along the baseline speed of service, judge that all blocks are in order
It is no to be set to fixed station, the block center for the condition that meets is fixed tentatively as fixed station.
4. the method for a kind of determining variable line public transport fixed station and Dynamic Website according to claim 1 or 2, special
Sign is that the method for determination Dynamic Website to be selected described in step (2) is as follows: being multiplied according to the day part that step (1) counts
Number of the objective transport need in each block, number is not zero and for 1 block center and number be 1 traffic need
It asks and a little fixes tentatively as Dynamic Website, if Dynamic Website is overlapped with fixed station or spacing is less than defined minimum station between fixed station
Interval Smin, then the Dynamic Website is deleted；If the website spacing of Dynamic Website, which is less than passenger, is subjected to walking distance, encumbrance
The big Dynamic Website of mesh deletes the small Dynamic Website of number, if number is identical, retains the dynamic station close away from baseline vertical range
Point is deleted apart from remote Dynamic Website, and remaining Dynamic Website is Dynamic Website to be selected.
5. the method for a kind of determining variable line public transport fixed station and Dynamic Website according to claim 1, feature
It is, step establishes objective function in (3), and the method for determining optimal Dynamic Website is as follows:
(3.1) with the minimum target of the weighted sum of passenger's Trip Costs and bus operation cost, objective function W is established, passenger's
Trip Costs include passenger waiting time Twt, passenger walking time TwkWith riding time TbThree parts, bus operation cost depend on
It is unified metric unit, with time of vehicle operation T in vehicle driving distancerSubstitution, passenger's Trip Costs and bus operation cost
Weight be w1,w2, and w1+w2=1；
(3.2) fixed station is linked in sequence along base direction and perpendicular to base direction, initial planning driving path is generated；
(3.3) with the minimum target of the weighted sum of passenger's Trip Costs and bus operation cost, met using Genetic algorithm searching
Vehicle must not be lower than the optimal Dynamic Website of minimum speed condition along the baseline speed of service, generate the optimal Dynamic Website choosing of day part
It selects.
6. the method for a kind of determining variable line public transport fixed station and Dynamic Website according to claim 3, feature
Be, the vehicle along the baseline speed of service must not lower than minimum speed be control condition be to vehicle pass through each website into
Row judgement, when judging vehicle by each website, if meet vehicle along the baseline speed of service not less than minimum speed, if having one
Website is unsatisfactory for, then is unsatisfactory for control condition.
7. the method for a kind of determining variable line public transport fixed station and Dynamic Website according to claim 5, feature
It is, calculation method of parameters involved by step (3.1) are as follows:
Passenger waiting timeWherein,For passenger's i waiting time；
Passenger's walking timeWherein, N is ridership, vwkFor passenger's walking speed,For passenger i and nearest station
Manhatton distance between point；
Passenger's riding timeWherein,For passenger's i riding time；
Time of vehicle operationWherein, L is vehicle by driving towards the length of the planning driving path of terminal, v at first stopbIt is flat for bus
Equal speed；
Objective function W=w1×(Twt+Twk+Tb)+w2×Tr。
8. the method for a kind of determining variable line public transport fixed station and Dynamic Website according to claim 5, feature
It is, the optimal Dynamic Website of Genetic algorithm searching is used described in step (3.3), and search process is as follows:
(1) coding constructs alternative set of sites: being encoded to 1 for the Dynamic Website of stop, other are encoded to 0；
(2) fitness function F (x) is constructed: withConstruct fitness function, wherein WmaxFor
Maximum value in initial population；
(3) initial population generates: being randomly assigned the sequence of Dynamic Website insertion route, inserts if Dynamic Website meets control condition
Enter route, recycles e generation initial population；
(4) by roulette method selection individual, probability selection operation: is randomly generatedCorresponding fitness value, fitness compared with
Big individual, the probability selected is just high, recycles f times altogether, generates f male parent；
(5) crossover operation: crossover probability is set as px, new daughter is the result intersected two-by-two to f male parent；It is randomly generated general
RateProbability crossover node corresponding with the product of interstitial content；
(6) mutation operation: mutation probability is set as py, probability is randomly generatedThe product pair of probability and interstitial content
Strain heteromerism point；
(7) newly generated individual is checked, retains the node for meeting control condition, the node weight of control condition will be unsatisfactory for
Newly encoded is 0；
(8) terminate Rule of judgment: the end loop if meeting cycle-index or reaching plateau exports as a result, otherwise jumping to
Step (4).
9. the method for a kind of determining variable line public transport fixed station and Dynamic Website according to claim 6, feature
It is, when the judgement vehicle passes through each website, if meet the tool that vehicle is not less than minimum speed along the baseline speed of service
Body method is: calculating vehicle and runs to website i planning driving path length Li, vehicle runs to website i and is parallel to baseline running length
X, ifThen meet, is otherwise unsatisfactory for.Wherein vminFor minimum speed, vbFor vehicle average speed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910728875.6A CN110533227B (en) | 2019-08-08 | 2019-08-08 | Method for determining fixed station and dynamic station of variable-line type bus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910728875.6A CN110533227B (en) | 2019-08-08 | 2019-08-08 | Method for determining fixed station and dynamic station of variable-line type bus |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110533227A true CN110533227A (en) | 2019-12-03 |
| CN110533227B CN110533227B (en) | 2022-12-20 |
Family
ID=68661573
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910728875.6A Active CN110533227B (en) | 2019-08-08 | 2019-08-08 | Method for determining fixed station and dynamic station of variable-line type bus |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110533227B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111489018A (en) * | 2020-03-30 | 2020-08-04 | 德鑫智慧科技(上海)有限公司 | Dynamic self-adaptive intelligent station group arrangement method and system |
| CN112085249A (en) * | 2020-07-27 | 2020-12-15 | 北京工业大学 | Customized bus route planning method based on reinforcement learning |
| CN112233452A (en) * | 2020-10-28 | 2021-01-15 | 厦门金龙联合汽车工业有限公司 | Self-adaptive flexible scheduling method for bus |
| CN113592215A (en) * | 2021-05-28 | 2021-11-02 | 东南大学 | Method for scheduling conventional buses and variable-route buses in combined mode |
| CN114373315A (en) * | 2022-01-14 | 2022-04-19 | 江苏大学 | Intersection conventional bus lane type dynamic platform control method and system |
| CN114664111A (en) * | 2022-03-14 | 2022-06-24 | 河北工业大学 | Method for calculating parking delay of expressway service area |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102831767A (en) * | 2012-08-13 | 2012-12-19 | 东南大学 | Multi-mode station stopping method at optimized comprehensive cost for urban public transport |
| CN106504516A (en) * | 2016-10-24 | 2017-03-15 | 东南大学 | One kind is based on the informationalized multi-form bus dynamic dispatching method in bus station |
-
2019
- 2019-08-08 CN CN201910728875.6A patent/CN110533227B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102831767A (en) * | 2012-08-13 | 2012-12-19 | 东南大学 | Multi-mode station stopping method at optimized comprehensive cost for urban public transport |
| CN106504516A (en) * | 2016-10-24 | 2017-03-15 | 东南大学 | One kind is based on the informationalized multi-form bus dynamic dispatching method in bus station |
Non-Patent Citations (1)
| Title |
|---|
| 于乐乐: "可变线路公交动态站点选取与时刻表编制研究", 《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111489018A (en) * | 2020-03-30 | 2020-08-04 | 德鑫智慧科技(上海)有限公司 | Dynamic self-adaptive intelligent station group arrangement method and system |
| CN112085249A (en) * | 2020-07-27 | 2020-12-15 | 北京工业大学 | Customized bus route planning method based on reinforcement learning |
| CN112085249B (en) * | 2020-07-27 | 2022-11-04 | 北京工业大学 | Customized bus route planning method based on reinforcement learning |
| CN112233452A (en) * | 2020-10-28 | 2021-01-15 | 厦门金龙联合汽车工业有限公司 | Self-adaptive flexible scheduling method for bus |
| CN113592215A (en) * | 2021-05-28 | 2021-11-02 | 东南大学 | Method for scheduling conventional buses and variable-route buses in combined mode |
| CN114373315A (en) * | 2022-01-14 | 2022-04-19 | 江苏大学 | Intersection conventional bus lane type dynamic platform control method and system |
| CN114373315B (en) * | 2022-01-14 | 2023-02-17 | 江苏大学 | Intersection conventional bus lane type dynamic platform control method and system |
| CN114664111A (en) * | 2022-03-14 | 2022-06-24 | 河北工业大学 | Method for calculating parking delay of expressway service area |
| CN114664111B (en) * | 2022-03-14 | 2023-03-10 | 河北工业大学 | Method for calculating parking delay of expressway service area |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110533227B (en) | 2022-12-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110533227A (en) | A kind of method of determining variable line formula public transport fixed station and Dynamic Website | |
| Kang et al. | A case study on the coordination of last trains for the Beijing subway network | |
| CN105513400B (en) | The method of Dynamic Programming trip route | |
| CN104239484A (en) | Multi-mode bus combinatorial dispatch-based schedule making method | |
| CN108510127B (en) | Urban rail train operation process optimization method based on renewable energy utilization | |
| CN105678425B (en) | Inter-city railway train operation optimization method based on multi-beat combination | |
| CN111915464B (en) | Subway interruption interval passenger connection model system and method based on consideration of conventional public transport network | |
| CN109660465B (en) | Road side unit assisted Internet of vehicles load balancing routing method | |
| CN112580866B (en) | Bus route bunching optimization method based on whole-course vehicle and inter-vehicle combined scheduling | |
| CN112231796B (en) | Periodic train stop scheme optimization modeling method considering passenger space-time travel distribution | |
| CN111882156B (en) | Train schedule robust optimization method for random dynamic passenger flow and energy-saving operation | |
| CN114925909A (en) | Urban rail transit passenger flow and traffic flow coupling optimization method and system | |
| CN111324853A (en) | Method and system for calculating passing capacity of channel type high-speed railway | |
| CN112101751A (en) | Public transport optimization method, system, device and storage medium | |
| CN115239021A (en) | Method for optimizing running scheme of large and small cross-road train of urban rail transit | |
| Wong et al. | Coast control of train movement with genetic algorithm | |
| CN113344267A (en) | Logistics network resource allocation optimization method based on cooperation | |
| JP5836078B2 (en) | Operation management device, operation management method and program, and transportation system | |
| CN110674967A (en) | Express vehicle path robust optimization method under uncertain driving time | |
| CN114020808A (en) | Urban rail transit driving scheme calculation method based on multi-day passenger flow fusion | |
| CN116523166B (en) | High-speed rail train running path optimization method and device based on path distribution passenger flow | |
| CN111667087A (en) | Bus station-jumping operation method considering pollution emission | |
| CN116384596B (en) | Train schedule optimization method and device, electronic equipment and medium | |
| Xu et al. | Research on Passenger Flow Control Method in Urban Rail Transit during Peak Hours | |
| CN115938135A (en) | Transfer linking optimization method for last bus |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |