CN112233452A - Self-adaptive flexible scheduling method for bus - Google Patents
Self-adaptive flexible scheduling method for bus Download PDFInfo
- Publication number
- CN112233452A CN112233452A CN202011175027.6A CN202011175027A CN112233452A CN 112233452 A CN112233452 A CN 112233452A CN 202011175027 A CN202011175027 A CN 202011175027A CN 112233452 A CN112233452 A CN 112233452A
- Authority
- CN
- China
- Prior art keywords
- time
- bus
- passenger
- delta
- reservation
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/123—Traffic control systems for road vehicles indicating the position of vehicles, e.g. scheduled vehicles; Managing passenger vehicles circulating according to a fixed timetable, e.g. buses, trains, trams
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention discloses a self-adaptive flexible scheduling method of a bus, which relates to the field of bus scheduling, and the scheduling process of the flexible station requirement comprises the following steps: and acquiring the time and the area of the demand of the passenger, judging the weight of the objective function according to the time and the area, solving the optimal solution of the model by using an intelligent algorithm to plan the optimal driving route of the bus for the objective function F1 which is the benefit of the bus company measured by money and F2 which is the benefit of the passenger measured by time, and feeding the updated driving route back to a driver. It can be seen that the scheduling method is not the traditional fixed-time departure fixed-station stop, but the two objective functions of the benefit of the public transport company measured by money and the benefit of the passenger measured by time are divided, so that the benefit of the passenger is maximized under the condition that the public transport company does not lose the cost, and the passenger demand is responded to by taking the objective function as a variable route. The method can automatically adjust the weight of the objective function for the requirements of passengers in different operation areas and at different time so as to maximize the benefits of the passengers and the public transport company.
Description
Technical Field
The invention relates to the field of bus dispatching, in particular to a self-adaptive flexible dispatching method for a bus.
Background
In recent years, with the acceleration of urbanization construction, resident's travel demands are increasingly diversified, and the phenomenon that passenger demands such as high bus idle rate, operation cost waste, long passenger waiting time and the like are unmatched with bus capacity can appear in the mode that traditional buses are regularly dispatched and are parked at fixed stations in passenger flow sparse areas or travel low peak time. The flexible bus dispatching system comprehensively considers the factors of the operation cost of the bus company and the time cost of the passengers based on the travel demands of the passengers, so that the satisfaction degree of the passengers can be improved, and the operation income of the bus company can be increased.
At present, flexible buses popularized in partial areas are applied to a certain fixed area or a certain specific time period in a day, the optimal bus dispatching route is obtained through a fixed objective function, universality is not achieved, a solution method cannot be changed along with different traveling characteristics of passengers, and flexibility of the flexible buses is not fully reflected.
Disclosure of Invention
The invention provides a self-adaptive flexible dispatching method of a bus, which aims to solve the problems in the prior art.
The invention adopts the following technical scheme:
a self-adaptive flexible dispatching method of a bus comprises the following steps.
The method comprises the following steps: obtaining basic data.
Step two: passenger reservation information is received.
Step three: the background acquires a target function according to the region where the bus is located when the passenger makes an appointment and the current time; the target functions are two, respectively
And
wherein F1 represents the benefit of the public transportation company measured in money, and F2 represents the benefit of the passenger measured in time; c1 represents passenger fare income increased by the bus company due to the response to the reservation, C2 represents operation cost increased by the response to the reservation, C3 represents time for getting on the bus with more passengers due to the response to the reservation, C4 represents time for getting off the bus with more passengers due to the response to the reservation, C5 represents time for reducing the travel time of the reserved passenger due to the response to the reservation, C6 represents time for waiting for the next bus with the reservation not responded, and defines the reservation that is not responded to for the first schedule and directly joins the stop necessary to be stopped in the next bus schedule; delta1To delta6Representing the weight of each influencing factor.
Step four: inputting the information obtained in the first step and the second step into an algorithm, solving the objective function obtained in the third step by using an intelligent algorithm, and selecting a scheme with F1 being more than or equal to 0 and F2 being the largest when F1 is more than or equal to 0; and when all F1 are less than 0, selecting the scheme with the maximum F1 to obtain a bus running route which maximizes the comprehensive income of the bus company and the passengers.
Further, the method also comprises the following steps.
Step five: the updated route is sent to a driver end, and the driver drives according to the route instruction; and meanwhile, a result of whether the reservation of the passenger is responded is sent to a mobile phone terminal of the passenger, and the passenger gets on the bus at a preset station according to the reservation time.
Step six: and repeating the second step to the fifth step, continuously receiving the passenger reservation information and updating the bus running route.
Further, when the operating area is a suburb, a rural area, or the like, and the distance is long, the objective function δ is set to minimize the walking of passengers5And delta6Enlarging; when the operation area is a city, the time factor is considered in an important way.
Furthermore, when the operation area is a city, when the operation area is between 7:00 and 9:00 and between 17:00 and 19:00, the operation area is judged as a peak time for getting on and off duty, the time cost of passengers is mainly considered, and the objective function delta is set3、δ4And delta6Enlarging;when the time is 22: 00-6: 00 of the next day, the night trip is judged to be a low peak time, the operation cost of the public transport company and the waiting time of passengers under the bus are mainly considered, and the objective function delta is calculated1And delta4Enlarging; when the vehicle is in other time, the vehicle is judged to be in the trip peak time, and various influence factors, delta, are comprehensively considered1To delta6All values are 1.
Further, the basic data includes bus fare, running cost per kilometer, average vehicle speed, average walking speed of passengers and station coordinates.
Further, the passenger reservation information includes a flexible station for reserving getting on, a fixed station for getting off, expected departure time and the number of people going out.
Further, the intelligent algorithm in the fourth step is a genetic algorithm or a particle swarm algorithm
From the above description of the structure of the present invention, compared with the prior art, the present invention has the following advantages:
the invention discloses a self-adaptive flexible dispatching method of a bus, which is not the traditional fixed-time departure fixed-station stop, but divides two objective functions of the benefit of a bus company measured by money and the benefit of a passenger measured by time, maximizes the benefit of the passenger under the condition that the bus company does not claim the cost, and responds to the requirement of the passenger in a variable-route way by taking the objective function as a target. The method can automatically adjust the weight of the objective function for the requirements of passengers in different operation areas and at different time so as to maximize the benefits of the passengers and the public transport company.
Drawings
FIG. 1 is a simplified flow chart of the present invention.
FIG. 2 is a flow chart of the method for adjusting weights in two formulas according to the present invention.
Detailed Description
The following describes embodiments of the present invention with reference to the drawings.
As shown in fig. 1 and fig. 2, in the method for dispatching the bus adaptively and flexibly, a station with large passenger flow is defined as a fixed station, and the bus must stop; the station with small passenger flow is defined as a flexible station, the bus cannot stop for the flexible station without passenger demand, and the bus can decide whether to stop according to a scheduling result for the flexible station with passenger demand. The flexible site demand scheduling process comprises the following steps:
the method comprises the following steps: acquiring basic data; specifically, the basic data includes information such as bus fare, running cost per kilometer, average vehicle speed, average walking speed of passengers, and station coordinates.
Step two: receiving passenger reservation information; specifically, the passenger reservation information includes information such as a flexible station for reserving getting on, a fixed station for getting off, expected departure time, and the number of people going out.
Step three: the background acquires a target function according to the region where the bus is located when the passenger makes an appointment and the current time; the target functions are two, respectively
And
；
in the above two formulas, F1 represents the benefit of the public transport company measured in money, and F2 represents the benefit of the passenger measured in time; c1 represents passenger fare income increased by the bus company due to the response to the reservation, C2 represents operation cost increased by the response to the reservation, C3 represents time for getting on the bus with more passengers due to the response to the reservation, C4 represents time for getting off the bus with more passengers due to the response to the reservation, C5 represents time for reducing the travel time of the reserved passenger due to the response to the reservation, C6 represents time for waiting for the next bus with the reservation not responded, and defines the reservation that is not responded to for the first schedule and directly joins the stop necessary to be stopped in the next bus schedule; delta1To delta6Representing the weight of each influencing factor.
Specifically, when the operating area is a suburb, a rural area, or the like, and the station is far away, the objective function δ is set to minimize the walking of passengers5And delta6And enlarging.
Specifically, when the operation area is a city, the time factor is considered in an important way, and the following is specifically considered: when the peak time is between 7:00 and 9:00 and 17:00 and 19:00, the peak time is judged as the peak time of going to and from work, the time cost of passengers is considered, and the objective function delta is set3、δ4And delta6Enlarging; when the time is 22: 00-6: 00 of the next day, the night trip is judged to be a low peak time, the operation cost of the public transport company and the waiting time of passengers under the bus are mainly considered, and the objective function delta is calculated1And delta4Enlarging; when the vehicle is in other time, the vehicle is judged to be in the trip peak time, and various influence factors, delta, are comprehensively considered1To delta6All values are 1.
As a specific weight adjustment method: when the operating area is suburb, rural area and other sites are far away, delta5And delta6Are all adjusted to 2, delta1To delta4The values of (A) are all adjusted to 1. When the operation area is a city: when the peak time is 7:00-9:00 and 17:00-19:00, the peak time is judged to be off duty, and delta is determined to be off duty1、δ2And delta5Are all adjusted to 1 while delta is adjusted3、δ4And delta6The values of (A) are all adjusted to 2; when the night is judged to be in the night trip peak period when the night is in the range of 22: 00-6: 00 of the next day, the delta is determined1Is adjusted to a value of 1.5, delta4Is adjusted to 2 while delta is adjusted2、δ3、δ5And delta6All the values of (1) are adjusted to be 1, and when the values are in other time, the trip peak period is judged to be the trip peak period, and delta is adjusted to be1To delta6The values of (A) are all adjusted to 1.
In the third step, two factors affecting the distribution of the number of passengers are mainly determined by the region and the time, but the actual use is not limited to this, and other factors affecting the distribution of the number of passengers may be considered in the scheduling method in addition to the two factors. In addition, the weight δ of each influencing factor in the above-mentioned third step1To delta6In addition to being able to be designed as a constant value, it is also possible to design it as a variable value that can be optimized to a certain target in a machine-self-learning manner for different situations.
Step four: inputting the information obtained in the first step and the second step into an algorithm, solving the objective function obtained in the third step by using an intelligent algorithm such as a genetic algorithm, a particle swarm algorithm and the like, and selecting a scheme with F1 being more than or equal to 0 and F2 being the largest when F1 is more than or equal to 0; and when all F1 are less than 0, selecting the scheme with the maximum F1 to obtain a bus running route which maximizes the comprehensive income of the bus company and the passengers.
Step five: the updated route is sent to a driver end, and the driver drives according to the route instruction; and meanwhile, a result of whether the reservation of the passenger is responded is sent to a mobile phone terminal of the passenger, and the passenger gets on the bus at a preset station according to the reservation time.
Step six: and repeating the second step to the fifth step, continuously receiving the passenger reservation information and updating the bus running route.
In summary, the invention discloses an adaptive flexible dispatching method for buses, which is not the traditional fixed-time departure fixed-station stop, but divides two objective functions of the benefit of the bus company measured by money and the benefit of the passenger measured by time, maximizes the benefit of the passenger under the condition that the bus company does not claim the cost, and responds to the requirement of the passenger in a variable way. The method can automatically adjust the weight of the objective function for the requirements of passengers in different operation areas and at different time so as to maximize the benefits of the passengers and the public transport company.
The above description is only an embodiment of the present invention, but the design concept of the present invention is not limited thereto, and any insubstantial modifications made by using the design concept should fall within the scope of infringing the present invention.
Claims (7)
1. A self-adaptive flexible scheduling method of a bus is characterized by comprising the following steps:
the method comprises the following steps: acquiring basic data;
step two: receiving passenger reservation information;
step three: the background acquires a target function according to the region where the bus is located when the passenger makes an appointment and the current time; the target functions are two, respectively
And
wherein F1 represents the benefit of the public transportation company measured in money, and F2 represents the benefit of the passenger measured in time; c1 represents passenger fare income increased by the bus company due to the response to the reservation, C2 represents operation cost increased by the response to the reservation, C3 represents time for getting on the bus with more passengers due to the response to the reservation, C4 represents time for getting off the bus with more passengers due to the response to the reservation, C5 represents time for reducing the travel time of the reserved passenger due to the response to the reservation, C6 represents time for waiting for the next bus with the reservation not responded, and defines the reservation that is not responded to for the first schedule and directly joins the stop necessary to be stopped in the next bus schedule; delta1To delta6Representing the weight of each influencing factor;
step four: inputting the information obtained in the first step and the second step into an algorithm, solving the objective function obtained in the third step by using an intelligent algorithm, and selecting a scheme with F1 being more than or equal to 0 and F2 being the largest when F1 is more than or equal to 0; and when all F1 are less than 0, selecting the scheme with the maximum F1 to obtain a bus running route which maximizes the comprehensive income of the bus company and the passengers.
2. The adaptive flexible scheduling method of buses according to claim 2, characterized by further comprising the steps of:
step five: the updated route is sent to a driver end, and the driver drives according to the route instruction; meanwhile, a result of whether the reservation of the passenger is responded is sent to a mobile phone terminal of the passenger, and the passenger gets on the bus at a preset station according to the reservation time;
step six: and repeating the second step to the fifth step, continuously receiving the passenger reservation information and updating the bus running route.
3. The adaptive flexible scheduling method of buses according to claim 1, characterized in that: the operation area is suburb,When the stations of the country are far away, the objective function delta is set to reduce the walking of passengers as much as possible5And delta6Enlarging; when the operation area is a city, the time factor is considered in an important way.
4. The adaptive flexible scheduling method of buses according to claim 3, characterized in that: when the operation area is a city, when the operation area is between 7:00 and 9:00 and 17:00 and 19:00, the operation area is judged as the peak time of going to and from work, the time cost of passengers is mainly considered, and the objective function delta is set3、δ4And delta6Enlarging; when the time is 22: 00-6: 00 of the next day, the night trip is judged to be a low peak time, the operation cost of the public transport company and the waiting time of passengers under the bus are mainly considered, and the objective function delta is calculated1And delta4Enlarging; when the vehicle is in other time, the vehicle is judged to be in the trip peak time, and various influence factors, delta, are comprehensively considered1To delta6All values are 1.
5. The adaptive flexible scheduling method of buses according to claim 1, characterized in that: the basic data comprises bus fare, running cost per kilometer, average speed, average walking speed of passengers and station coordinates.
6. The adaptive flexible scheduling method of buses according to claim 1, characterized in that: the passenger reservation information comprises a flexible station for reserving getting on, a fixed station for getting off, expected departure time and the number of people going out.
7. The adaptive flexible scheduling method of buses according to claim 1, characterized in that: the intelligent algorithm in the fourth step is a genetic algorithm or a particle swarm algorithm.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011175027.6A CN112233452A (en) | 2020-10-28 | 2020-10-28 | Self-adaptive flexible scheduling method for bus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011175027.6A CN112233452A (en) | 2020-10-28 | 2020-10-28 | Self-adaptive flexible scheduling method for bus |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112233452A true CN112233452A (en) | 2021-01-15 |
Family
ID=74109798
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011175027.6A Pending CN112233452A (en) | 2020-10-28 | 2020-10-28 | Self-adaptive flexible scheduling method for bus |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112233452A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112907071A (en) * | 2021-02-20 | 2021-06-04 | 华南理工大学 | Bus scheduling method, system and device based on willingness-to-pay and storage medium |
| CN115424437A (en) * | 2022-08-22 | 2022-12-02 | 厦门筑成信创城市规划设计有限公司 | Station response type bus dispatching method and device |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106097226A (en) * | 2016-06-20 | 2016-11-09 | 华南理工大学 | City Routine Transit Network Design method based on Hierarchical Programming |
| CN106127357A (en) * | 2016-07-29 | 2016-11-16 | 华南理工大学 | A kind of customization public transport automatic routing system based on reservation data and method |
| CN107092976A (en) * | 2017-03-28 | 2017-08-25 | 东南大学 | A kind of method of multi-objective Model collaboration optimization a plurality of public bus network departure interval |
| CN109308574A (en) * | 2018-09-07 | 2019-02-05 | 华南理工大学 | A kind of flexible bus dispatching method in internet of real-time response half |
| CN109376928A (en) * | 2018-10-24 | 2019-02-22 | 天津市市政工程设计研究院 | Consider the customization public transport rideshare optimization method of bipartite matching |
| CN109409599A (en) * | 2018-10-24 | 2019-03-01 | 天津市市政工程设计研究院 | Customization public bus network based on real-time requirement opens optimization method |
| CN110533227A (en) * | 2019-08-08 | 2019-12-03 | 东南大学 | A kind of method of determining variable line formula public transport fixed station and Dynamic Website |
-
2020
- 2020-10-28 CN CN202011175027.6A patent/CN112233452A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106097226A (en) * | 2016-06-20 | 2016-11-09 | 华南理工大学 | City Routine Transit Network Design method based on Hierarchical Programming |
| CN106127357A (en) * | 2016-07-29 | 2016-11-16 | 华南理工大学 | A kind of customization public transport automatic routing system based on reservation data and method |
| CN107092976A (en) * | 2017-03-28 | 2017-08-25 | 东南大学 | A kind of method of multi-objective Model collaboration optimization a plurality of public bus network departure interval |
| CN109308574A (en) * | 2018-09-07 | 2019-02-05 | 华南理工大学 | A kind of flexible bus dispatching method in internet of real-time response half |
| CN109376928A (en) * | 2018-10-24 | 2019-02-22 | 天津市市政工程设计研究院 | Consider the customization public transport rideshare optimization method of bipartite matching |
| CN109409599A (en) * | 2018-10-24 | 2019-03-01 | 天津市市政工程设计研究院 | Customization public bus network based on real-time requirement opens optimization method |
| CN110533227A (en) * | 2019-08-08 | 2019-12-03 | 东南大学 | A kind of method of determining variable line formula public transport fixed station and Dynamic Website |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112907071A (en) * | 2021-02-20 | 2021-06-04 | 华南理工大学 | Bus scheduling method, system and device based on willingness-to-pay and storage medium |
| CN115424437A (en) * | 2022-08-22 | 2022-12-02 | 厦门筑成信创城市规划设计有限公司 | Station response type bus dispatching method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109800902B (en) | Unmanned bus optimization method for uninterrupted reciprocating flexible line length | |
| CN111340406B (en) | Method and system for realizing bus dynamic arrangement model based on OD passenger flow | |
| CN109308574B (en) | Real-time response Internet semi-flexible bus scheduling method | |
| CN107564269B (en) | A kind of half flexible bus dispatching method based on willingness to pay | |
| CN107945503B (en) | Car sharing method and system of downwind car | |
| CN112233452A (en) | Self-adaptive flexible scheduling method for bus | |
| CN105844432A (en) | VANET based electric automobile charge scheduling system and method | |
| CN105761482A (en) | Taxi real-time appointing method and system based on fairness | |
| CN111539565B (en) | Bus fare preferential method based on vehicle and station congestion degree | |
| CN112561379A (en) | Regional network taxi appointment-oriented scheduling method | |
| CN112907083B (en) | Multi-line bus charging control system and method | |
| CN111898909B (en) | Unmanned bus dispatching method based on real-time requirements | |
| CN111598646A (en) | Electric taxi charging navigation method with reservation function | |
| CN113159499B (en) | Traffic hub arrival passenger flow evacuation-oriented multi-exit mode combined scheduling method | |
| CN107220733B (en) | Customized bus driving optimization method based on Internet and vehicle-road cooperation origin-destination set | |
| CN113597720A (en) | Power reception control method and power reception control device for power reception element | |
| CN113077162A (en) | Multi-vehicle type customized bus area scheduling method facing real-time requirements | |
| CN112070258A (en) | Method and system for dispatching order of taxi taking in online taxi appointment | |
| CN114219210A (en) | Electric automobile real-time scheduling optimization method considering demand response willingness grading | |
| CN109615112A (en) | A kind of response type community public transport vehicle scheduling optimization method | |
| CN113386770A (en) | Electric vehicle charging path dynamic planning method based on charging station data sharing | |
| CN112288112A (en) | Method and device for reserving vehicle and computer storage medium | |
| CN112465177B (en) | Bus route optimization system and method based on big data analysis | |
| CN115663867B (en) | Electric automobile charging scheduling method based on intelligent charging network system | |
| CN111898863A (en) | Dynamic scheduling method and device for rail transit vehicle |
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: 20210115 |
|
| RJ01 | Rejection of invention patent application after publication |