CN105448082B - A kind of quick public transport combined schedule method that variable interval is dispatched a car - Google Patents
A kind of quick public transport combined schedule method that variable interval is dispatched a car Download PDFInfo
- Publication number
- CN105448082B CN105448082B CN201511021248.7A CN201511021248A CN105448082B CN 105448082 B CN105448082 B CN 105448082B CN 201511021248 A CN201511021248 A CN 201511021248A CN 105448082 B CN105448082 B CN 105448082B
- Authority
- CN
- China
- Prior art keywords
- time
- passenger
- vehicle
- car
- website
- 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.)
- Active
Links
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
Abstract
The invention belongs to public transport optimizing scheduling technical field, more particularly to a kind of quick public transport combined schedule method that variable interval is dispatched a car：Including：Determine website sum, dispatching a car total degree and obtains running time, passenger flow information, the cost time of getting on the bus of passenger, cost time of getting off, the vehicle parking elapsed time of vehicle between website；Obtain the ridership and using this determination type of site as quick public transport website or common bus stop of getting on or off the bus of each website, and be in a joint manner decision variable with the departure interval, set up bus dispatching model, each vehicle is calculated in the berthing time of each website and the ridership got on or off the bus, object function expression formula is obtained, that is, calculates the average Waiting time of passenger, passenger averagely in car time and the average seating capacity of vehicle；Using particle swarm optimization algorithm model obtain the average Waiting time of passenger, passenger it is average the car time is as small as possible and the average seating capacity of the vehicle big scheduling scheme comprising departure interval and type of dispatching a car as far as possible.
Description
Technical field
The invention belongs to public transport optimizing scheduling technical field, more particularly to the bus rapid transit that a kind of variable interval is dispatched a car
Car combined schedule method.
Background technology
With the fast development of China's economy and urbanization process, Urban vehicles poputation rapidly increases, traffic resource
Supply wretched insufficiency.However, distinctive " compound formula " Land-Use of China causes many regions to be difficult to by traditional public
Traffic system is effectively covered altogether, the zones of action such as settlement, office occurs away from public traffic stations such as public transport, subway etc.
Phenomenon.Exactly under the guide of this demand, the theory of " micro- public transit system " is arisen at the historic moment.It is by improving " compound " inside
Microcirculation, with periphery regular public traffic Seamless linkage, effectively solves the problems, such as the trip of " compound " interior resident, significantly reduce walking away from
From the reduction travel time.And bus dispatching is then one of most important link in microcirculation.
Bus dispatching in existing micro- public transit system is often excessively simple, it is difficult to tackles the volume of the flow of passengers in micro- public transit system and concentrates
The problem of.After quick public transport is introduced, existing model also tends to only focus on the combination side in bus rapid transit and common public transport
Formula, using simply dispatching a car at equal intervals, and such scheduling mode efficiency is low, far can not meet micro-system to passenger flow
, usually there is the phenomenon such as " bunching ", " large-spacing " between bus in the requirement of affordability and vehicle punctuality rate.Therefore, at present
Public transport utilization rate under micro-system does not reach desired value much, and many residents still select private car to go on a journey.
The content of the invention
In order to further optimize the departure interval between quick public transport and the combination and vehicle of common bus, drop
The average Waiting time of low passenger and in the car time, improve bus cabin factor, overcome existing quick public transport scheduling model only to close
The problem of noting vehicle combination mode, the present invention proposes a kind of quick public transport combined schedule method that variable interval is dispatched a car, and wraps
Include：
Step 1：It is determined that section and the period studied are needed, including website sum, total degree of dispatching a car；And obtain between website
The running time of vehicle, the passenger flow information in the section；Determine the cost time of getting on the bus of every passenger, get off cost time, vehicle
Stop elapsed time；
Step 2：According to the passenger flow information in the section, sorting-out in statistics obtains the ridership of getting on or off the bus of each website, according to upper
Ridership of getting off determines that type of site is quick public transport website or common bus stop；
Step 3：Using the departure interval between quick public transport and the combination and vehicle of common in-vehicle as decision variable, build
Vertical bus dispatching model, calculates each vehicle in the berthing time of each website and the ridership got on or off the bus in each website；
Step 4：According to obtained each vehicle in the berthing time of each website and the ridership got on or off the bus in each website, obtain
Object function expression formula, that is, calculate whole section within the period of research：The average Waiting time of passenger, passenger are average in car
Time and the average seating capacity of vehicle；
Step 5：Use particle swarm optimization algorithm model so that the average Waiting time of passenger, passenger are average in car
Between it is as small as possible, the average seating capacity of vehicle is as big as possible, so as to obtain a scheduling comprising departure interval and type of dispatching a car
Scheme.
The passenger flow information is automatically obtained by counting and estimating acquisition on the spot, or by bus card-reading ticket sale system.
The step 3 includes：
Step 301：At the time of calculating when vehicle arrives at a station；And the passenger flow letter on the Customer information and platform on the moment car
Breath；
Step 302：Calculate in the case of non-overloading, passenger getting on/off number and the time spent；
Step 303：At the time of when calculating vehicle is leaving from station；And the passenger flow letter on the Customer information and platform on the moment car
Breath.
The step 4 includes：
Step 401：Calculate the whole section average Waiting time W of the passenger within the period of research1；
Step 402：Calculate whole section passenger within the period of research average in car time W2；
Step 403：Calculate the whole section average seating capacity W of the vehicle within the period of research3；
Step 404：By W1、W2、W3It is added by certain weight and obtains object function.
The present invention compared with prior art, with advantages below：
Quick public transport is introduced in micro- public transit system, it is combined with common bus and dispatched a car, than traditional using single
One vehicle operation, can preferably solve the problem of indivedual website volumes of the flow of passengers are concentrated.
The constraint of traditional departure interval fixation is broken through, is dispatched a car using changing distance, is alleviated the load in peak section, more have
What is imitated avoids " bunching ", the appearance of " large-spacing " phenomenon between bus.
Propose that vehicle combination mode optimizes simultaneously with the departure interval, has more preferably than existing bus dispatching optimized algorithm first
Effect of optimization, more conducively passenger's time cost saving and public transport company's profit of operation expansion.
Embodiment
The present invention proposes a kind of quick public transport combined schedule method that variable interval is dispatched a car, including：
In step 1, according to actual conditions and needs, website sum n and the total degree m that dispatches a car first are determined；Then according to phase
Distance and road conditions between adjacent two websites, it is determined that the running time L from the i-th -1 station to the i-th stationi.Afterwards, determined according to vehicle maximum
Handling capacity of passengers M, estimates time a, each passenger loading that vehicle slows down consumed because of stop according to actual conditions and is spent
Time b and the time c that is spent of each passenger getting off car.Finally, by counting and estimating on the spot, the OD matrixes of passenger flow are drawn
{Oij, OijRepresent to reach the i-th station in the unit interval and the ridership at jth station will be removed.
In step 2, by the sorting-out in statistics to passenger flow OD data, the ridership of getting on or off the bus of each website is obtained.According to
The data determine commuter rush hour website, and these websites are set into quick public transport website.These websites Boolean variable SiTable
Show：Si=1 represents that website i is express station, Si=0 website i is not express station.
Step 3：With quick public transport and the combination E of common in-vehiclek(Ek=0 represents that kth vehicle is common in-vehicle, Ek=1
Expression kth vehicle is quick public transport) departure interval G between vehiclek(frequency of kth vehicle and -1 car of kth
The difference of frequency) it is decision variable, set up bus dispatching model：When vehicle k reaches website i, using preceding k-1 car with before
The information at i-1 stations, with reference to current passenger flow situation, calculates vehicle k in website i berthing time and the passenger got on or off the bus at the station
Number.Using recurrence relation, the information of vehicles and Customer information of system-wide section under full time-domain just can obtain.
In step 301, when vehicle k reaches the i-th station, on the one hand now moment HkiEqual to vehicle reach a upper station when
Carve Hk(i-1)Plus its a upper station berthing time Tk(i-1)Running time L afterwardsi.Particularly, vehicle k reaches the 1st station
At the time of Hk1It is vehicle k frequencyWith to the running time L before first stop1Sum.Recycle HkiCan
Obtain the time difference F that vehicle k and vehicle k-1 reaches the i-th stationki。
On the other hand, the ridership D at jth station is now removed on platformkijWhen being left equal to a upper car just AT STATION
Ridership Q(k-1)ijPlus the passenger O newly arrived during thisij×(Fki-T(k-1)i), i.e.,
Wherein, QkijWhen representing vehicle k and leaving the i-th station, the ridership at jth station is removed on platform.
In step 302, the ridership V that gets off is calculated firstki。
Wherein, UkjiRepresent on jth station kth vehicle and want the ridership at the i-th station.
Limited by vehicle carrying capacity M, vacant position R in passenger getting off car rear carkiFor
And the ridership for now wanting to get on the bus is possible to more than remaining seat.When vehicle k is common in-vehicle (1-Ek=1)
When, want that the ridership that the destination got on the bus is jth station is Dkij；When vehicle k is express (Ek=1) when, want that the destination got on the bus is
The ridership at jth station is Dkij×Si×Sj.Therefore plan is got on the bus during vehicle k the i-th stations of arrival and destination is the ridership at jth station
U′kijFor sum of the two.The ridership U ' got on the bus is intended when vehicle k reaches the i-th stationkiFor U 'kijSum.
U′kij=Dkij(SiSjEk+(1-Ek)) (6)
We use tkiRepresent the ratio of getting on the bus of passenger.Utilize tkiAnd then this car can have been obtained and destination is jth station
Ridership Ukij, and total ridership U of this car on this stationki。
Ukij=kiU′kij (9)
After vehicle arrives at a station, the time spent during vehicle parking, passenger getting on/off is Tki.If vehicle is general
Be open to traffic (1-Ek=1) or vehicle be express and this station be express website (Ek×Si=1), then there is down time, its time
Equal to deceleration time a time U is spent plus passenger loadingki× b spends time V along with passenger getting off carki× c, i.e.,
Tki=(1-Ek+SiEk)(a+bUki+cVki) (11)
In step 303, the ridership Q at jth station is removed when vehicle leaves on platformkijPassenger when being reached equal to vehicle k
The ridership that number has subtracted car adds the ridership reached during this.
Qkij=Dkij-Ukij+OijTki (12)
And the now ridership X on carkiEqual to vehicle from the i-th -1 station when ridership Xk(i-1)Plus on this station
The ridership U of carkiAnd subtract the ridership V got off at this stationki, i.e.,
In step 401, the average Waiting time of passenger is calculated, the total Waiting time t of passenger is calculated first.It is equal to each
Each car gets to the station and got to the station the total stand-by period sum of passenger in this period away from a upper car on individual platform.
On i platform, before vehicle k-1 is reached after reaching to vehicle k in this period：HavePosition passenger exists
A upper car, which is reached, just has arrived at station, removes the passenger U got on the bus in a upper station(k-1)i, remaining people is first-class AT STATION always
Treat that their total waiting time is until this car is reachedHavePosition passenger arrives in the meantime
Reach, their stand-by period isThere is U(k-1)iPosition passenger when a upper car is reached on car, during their average waiting
Between time for being got on the bus plus queuing up time for coming to a complete stop for car, i.e. total waiting time is
Total ridership O is calculated again.It is arrival rate of the passenger at the i-th stationThe m car is multiplied by get to the station i
At the time of HmiSum.
Therefore the cost W equivalent on the average Waiting time of passenger1：
In step 402, total seating capacity U is calculated first.
We are it is contemplated that influence of the time delayed because stopping AT STATION of vehicle to passenger on car, and vehicle is on road
On the running time that must spend be not that we are concerned about.Therefore we define passenger averagely in car time factor W2, use it
To weigh passenger in the car time.It is defined such as formula (21).Represent that kth vehicle reaches the actual cost in jth station from the i-th station
The ratio between time and preferable shortest time；And then,Represent that all passengers exist
The ratio between the time and ideal time of " wait " on car more.The ratio again divided by total carrying number U be passenger it is average the car time because
Son.It reflects the time length that passenger onboard delays by car stop, other passenger getting on/offs.
In step 403, the average seating capacity W of public transport company's vehicle in use3For total carrying number divided by section sum and car
Sum.
In step 404, object function W is made up of three parts：
MaxW=A3×W3-A1×W1-E2×W2 (23)
Wherein, A1It is the cost coefficient of the average Waiting time of passenger；A2It is the average cost coefficient in the car time；A3It is car
The income coefficient of average seating capacity.
In steps of 5, particle cluster algorithm is the algorithm of an iteration optimizing, and it utilizes random trip of the population in space
Come up and find the optimal solution of optimization problem.Due to controlling variable to have two, respectively Boolean variable E in this modelkWith positive integer
Number variable Gk, so we take the particle swarm optimization algorithm that " integer, binary system " is mixed, concretely comprise the following steps：
(1) particle number, the position of random initializtion particle are determined.Due to EkAnd GkRespectively there are m, therefore particle length is 2m.
(2) speed of each particle and new position are calculated using iterative formula.Use Xi=(xi,1,xi,2,...,xi,2m) table
Show particle position, Vi=(vi,1,vi,2,...,vi,2m) representing particle rapidity, then iterative formula is：
（26）
（27）
（28）
（29）
It is the particle i speed that d is tieed up in kth time iteration；c1、c2It is accelerator coefficient；rand1、rand2It is [0,1]
Between random number；It is the particle i current locations that d is tieed up in kth time iteration；pbestidIt is the individual that particle i is tieed up in d
The position of extreme point；gbestdIt is whole group in the position of the d global extremum points tieed up；Round () is bracket function；
It is the random number between [0,1]；χ is compressibility factor, and it helps to ensure PSO algorithmic statements；ω is inertia weight, uses inertia weight
To control influence of the speed above to present speed.
(3) new position of relatively more all particlesThe desired positions pbest being had been to the particleidFitness,
IfFitness it is bigger, thenCompare the desired positions of all particles, update colony's desired positions
gbestd。
(4) step (2) is returned to, until algorithmic statement, or iterations is reached.
This embodiment is only the present invention preferably embodiment, but protection scope of the present invention is not limited thereto,
Any one skilled in the art the invention discloses technical scope in, the change or replacement that can be readily occurred in,
It should all be included within the scope of the present invention.
Claims (4)
1. a kind of quick public transport combined schedule method that variable interval is dispatched a car, it is characterised in that including：
Step 1：It is determined that section and the period studied are needed, including website sum, total degree of dispatching a car；And obtain vehicle between website
Running time, the passenger flow information in the section；Determine the cost time of getting on the bus of every passenger, get off cost time, vehicle parking
Elapsed time；
Step 2：According to the passenger flow information in the section, sorting-out in statistics obtains the ridership of getting on or off the bus of each website, according to getting on or off the bus
Ridership determines that type of site is quick public transport website or common bus stop；
Step 3：Using the departure interval between quick public transport and the combination and vehicle of common in-vehicle as decision variable, set up public
Scheduling model is handed over, each vehicle is calculated in the berthing time of each website and the ridership got on or off the bus in each website；
Step 4：According to obtained each vehicle in the berthing time of each website and the ridership got on or off the bus in each website, target is obtained
Function expression, that is, calculate whole section within the period of research：The average Waiting time of passenger, passenger are average in the car time
With the average seating capacity of vehicle；
Step 5：Use particle swarm optimization algorithm model so that the average Waiting time of passenger, passenger are average most in the car time
May be small, the average seating capacity of vehicle is as big as possible, so as to obtain a scheduling scheme comprising departure interval and type of dispatching a car.
2. according to the method described in claim 1, it is characterised in that the passenger flow information by counting and estimating acquisition on the spot,
Or automatically obtained by bus card-reading ticket sale system.
3. according to the method described in claim 1, it is characterised in that the step 3 includes：
Step 301：At the time of calculating when vehicle arrives at a station；And the passenger flow information on the Customer information and platform on the moment car；
Step 302：Calculate in the case of non-overloading, passenger getting on/off number and the time spent；
Step 303：At the time of when calculating vehicle is leaving from station；And the passenger flow information on the Customer information and platform on the moment car.
4. according to the method described in claim 1, it is characterised in that the step 4 includes：
Step 401：Calculate the whole section average Waiting time W of the passenger within the period of research1；
Step 402：Calculate whole section passenger within the period of research average in car time W2；
Step 403：Calculate the whole section average seating capacity W of the vehicle within the period of research3；
Step 404：By W1、W2、W3It is added by weight and obtains object function W：
MaxW=A3×W3-A1×W1-A2×W2
Wherein, A1It is the cost coefficient of the average Waiting time of passenger；A2It is the average cost coefficient in the car time；A3It is that vehicle is put down
The income coefficient of equal seating capacity.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201511021248.7A CN105448082B (en) | 2015-12-30 | 2015-12-30 | A kind of quick public transport combined schedule method that variable interval is dispatched a car |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201511021248.7A CN105448082B (en) | 2015-12-30 | 2015-12-30 | A kind of quick public transport combined schedule method that variable interval is dispatched a car |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105448082A CN105448082A (en) | 2016-03-30 |
| CN105448082B true CN105448082B (en) | 2017-09-08 |
Family
ID=55558207
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201511021248.7A Active CN105448082B (en) | 2015-12-30 | 2015-12-30 | A kind of quick public transport combined schedule method that variable interval is dispatched a car |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105448082B (en) |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106650984A (en) * | 2016-09-12 | 2017-05-10 | 上海斐讯数据通信技术有限公司 | Vehicle dispatch method and system |
| CN106504518B (en) * | 2016-11-24 | 2019-04-02 | 浙江交通职业技术学院 | A kind of dispatching method that city bus is cooperateed with long-distance passenger transportation |
| CN108263451B (en) * | 2016-12-30 | 2020-08-04 | 河南辉煌城轨科技有限公司 | Rail train management system capable of intelligently distributing frequency |
| CN106971246A (en) * | 2017-04-12 | 2017-07-21 | 青岛海信网络科技股份有限公司 | A kind of taxi Shang Ke areas passenger waiting time Forecasting Methodology and device |
| CN108515988B (en) * | 2018-01-03 | 2021-04-06 | 中车工业研究院有限公司 | Train operation diagram optimization method for improving passenger timeliness |
| CN109147314B (en) * | 2018-11-05 | 2020-06-09 | 北京航空航天大学 | Bus station stagnation setting method and device |
| CN111063209B (en) * | 2019-12-23 | 2021-05-11 | 北京航空航天大学 | Automatic driving bus combined dispatching optimization method matched with inter-section bus |
| CN111898909B (en) * | 2020-07-31 | 2023-09-01 | 同济大学 | Unmanned bus dispatching method based on real-time requirements |
| CN112508235A (en) * | 2020-11-19 | 2021-03-16 | 北京清研宏达信息科技有限公司 | Bus departure time interval optimization method based on ant colony algorithm |
| CN112668777A (en) * | 2020-12-25 | 2021-04-16 | 北京师范大学 | Batch quantitative type vehicle passenger carrying scheduling optimization method based on multi-body simulation |
| CN113628473B (en) * | 2021-07-02 | 2022-07-22 | 东南大学 | Intelligent bus response type stop plan and dynamic scheduling system |
| CN113506461A (en) * | 2021-07-07 | 2021-10-15 | 安徽富煌科技股份有限公司 | Traffic scheduling system based on dynamic self-adaptive particle swarm algorithm |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE10003192A1 (en) * | 2000-01-25 | 2001-08-09 | Bbr Baudis Bergmann Roesch Ver | Public transport messaging service for alerting passenger to vehicle delays involves creating and transmitting information to users by transmitting warning message e.g. Short Message Service |
| CN101520945B (en) * | 2008-02-29 | 2010-08-18 | 厦门雅迅网络股份有限公司 | Automatic scheduling method for urban public bus lines |
| CN101799981B (en) * | 2010-02-09 | 2012-02-01 | 华南理工大学 | multi-mode public transport region scheduling control method |
| CN102136190B (en) * | 2011-05-03 | 2014-06-18 | 上海理工大学 | Dispatching management system and method for event emergency response of urban bus passenger transport |
| CN102831767B (en) * | 2012-08-13 | 2014-07-09 | 东南大学 | Multi-mode station stopping method at optimized comprehensive cost for urban public transport |
| GB201314824D0 (en) * | 2013-08-19 | 2013-10-02 | Tomtom Dev Germany Gmbh | Multi-modal routing |
| CN104157132B (en) * | 2014-08-18 | 2016-08-17 | 东南大学 | A kind of dynamic optimization method of self-adapting type bus departure timetable |
| CN104239484B (en) * | 2014-09-05 | 2017-09-05 | 浙江工业大学 | One kind is based on table preparation method at the time of multi-mode public transport combined schedule |
| CN104835315B (en) * | 2015-05-26 | 2017-02-01 | 上海交通大学 | Mixed bus type-based bus operation time control system and method |
-
2015
- 2015-12-30 CN CN201511021248.7A patent/CN105448082B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN105448082A (en) | 2016-03-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105448082B (en) | A kind of quick public transport combined schedule method that variable interval is dispatched a car | |
| CN107092976B (en) | Method for cooperatively optimizing departure intervals of multiple bus routes by multi-objective model | |
| Muñoz et al. | Comparison of dynamic control strategies for transit operations | |
| CN105761482A (en) | Taxi real-time appointing method and system based on fairness | |
| CN111915464B (en) | Subway interruption interval passenger connection model system and method based on consideration of conventional public transport network | |
| CN105427605B (en) | A kind of public transportation lane considering travel mode transfer arranges Benefit Calculation | |
| CN106530680B (en) | A kind of public bus network composite services method based on main station express bus | |
| CN104239484A (en) | Multi-mode bus combinatorial dispatch-based schedule making method | |
| CN107958316A (en) | The train dwelling optimization method and system of a kind of rail line | |
| CN107832958A (en) | A kind of electric taxi charging station planing method based on demand analysis | |
| CN109887267A (en) | A kind of conllinear section regular public traffic method of adjustment of rail traffic | |
| CN109670709B (en) | Goods transportation method and system based on crowdsourcing public transportation system | |
| CN112580866B (en) | Bus route bunching optimization method based on whole-course vehicle and inter-vehicle combined scheduling | |
| CN109657820A (en) | A kind of taxi matching process reserved | |
| CN113077162A (en) | Multi-vehicle type customized bus area scheduling method facing real-time requirements | |
| CN114818349A (en) | Energy-saving operation diagram optimization analysis method based on spatio-temporal network passenger flow state estimation | |
| Bagamanova et al. | Extended atm for seamless travel (x-team d2d) | |
| CN116777171A (en) | Point-to-point carpooling dynamic scheduling method and device for network taxi taking | |
| CN116127839A (en) | Bus station service interruption prevention and control method based on reinforcement learning | |
| CN115879658A (en) | Customized bus route optimization method, system, storage medium and equipment | |
| CN115936330A (en) | Demand response type BRT vehicle scheduling algorithm based on Lagrangian principle | |
| Lee et al. | Planning and design of a taxipooling dispatching system | |
| Han et al. | Two-stage optimization of airport ferry service delay considering flight uncertainty | |
| CN111951542B (en) | Boarding point counting planning method for optimizing service efficiency of boarding area of taxi in airport | |
| CN112906926B (en) | Method, device, equipment and storage medium for predicting railway transportation flow direction |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |