CN112562380A - Flexible fare flexible public transportation scheduling method - Google Patents
Flexible fare flexible public transportation scheduling method Download PDFInfo
- Publication number
- CN112562380A CN112562380A CN202011549862.1A CN202011549862A CN112562380A CN 112562380 A CN112562380 A CN 112562380A CN 202011549862 A CN202011549862 A CN 202011549862A CN 112562380 A CN112562380 A CN 112562380A
- Authority
- CN
- China
- Prior art keywords
- flexible
- fare
- bus
- passengers
- 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
- 238000000034 method Methods 0.000 title claims abstract description 25
- 230000002068 genetic effect Effects 0.000 claims abstract description 7
- 238000004364 calculation method Methods 0.000 claims description 11
- 230000008901 benefit Effects 0.000 abstract description 4
- 230000004044 response Effects 0.000 abstract description 3
- 210000000349 chromosome Anatomy 0.000 description 5
- 230000008569 process Effects 0.000 description 2
- 230000001133 acceleration Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000002035 prolonged effect Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
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
-
- 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/02—Reservations, e.g. for tickets, services or events
-
- 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
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0201—Market modelling; Market analysis; Collecting market data
- G06Q30/0206—Price or cost determination based on market factors
-
- 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
-
- 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/40—Business processes related to the transportation industry
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Human Resources & Organizations (AREA)
- Entrepreneurship & Innovation (AREA)
- Finance (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Health & Medical Sciences (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Data Mining & Analysis (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Traffic Control Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a flexible fare flexible public traffic scheduling method, which comprises the following steps: receiving passenger travel appointment information; the background calculates an objective function by using a flexible bus model according to the demand, and ticket price parameters in the model can be partially reduced when the actual bus detouring time and distance are larger than a certain threshold value on the basis of fixed ticket prices; and further solving the optimal solution of the model by adopting a genetic algorithm so as to plan the optimal driving route of the bus. The invention comprehensively considers the benefits of passengers and the public transport company in all aspects, aims to maximize profits, travel time of the passengers, convenience and satisfaction of the public transport company, and provides a method with variable fare under the background that the riding time of the passengers on the bus is increased and further the complaints and the satisfaction of the passengers are reduced due to the response of other passengers.
Description
Technical Field
The invention relates to the technical field of flexible public transportation scheduling, in particular to a flexible fare flexible public transportation scheduling method.
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 part of regions carry out bus operation route scheduling on the basis of a bus company operation cost target obtained by fixed fare calculation, and the calculation model is easy to cause that the time and the distance of taking more passengers on the bus are too long due to temporary response of the buses to the requirements of other passengers, so that the complaints of the customers are caused, the number of the passengers willing to take the flexible buses is reduced in the long term, and the advantages of the flexible buses cannot be fully exerted.
Disclosure of Invention
The invention provides a flexible fare flexible bus dispatching method, which aims to solve the problems that passengers on a bus complain about multiple riding times and routes and the like caused by dispatching of bus running routes based on a bus company running cost target calculated by fixed fares of the conventional flexible buses.
The invention adopts the following technical scheme:
a flexible fare flexible public transportation scheduling method is characterized by comprising the following steps:
the method comprises the following steps: receiving passenger travel appointment information;
step two: a background uses a flexible public transport model to calculate objective functions F1(s) and F2(s), wherein F1(s) comprises fare parameters, the fare is on the basis of fixed fare, when the detour distance caused by responding to reservation of other passengers accounts for more than k of the original route distance, and the detour time exceeds a, the fare is partially reduced in proportion, otherwise, the fare is unchanged;
step three: and (4) obtaining the maximum objective function values F1(s) and F2(s) in the second step, and solving by using a genetic algorithm to obtain a bus running route which maximizes the comprehensive income of the bus company and the passengers.
Preferably, the objective function F1(s) = C1-C2-C3-C4+ C5, F2(s) = -C6, C1 indicates that the income of the bus company increased by responding to the reservation is equal to the product of the current flexible stop reservation number and the fare, C2 indicates the cost increased by responding to the reservation, C3 indicates the time cost of the on-board passenger for multi-seat car increased by responding to the reservation, C4 indicates the time cost of the under-board passenger for more passengers increased by responding to the reservation, C5 indicates the cost of the travel time of the reserved passenger decreased by responding to the reservation, and C6 indicates the number of passengers not responding to the reservation.
Further, the concrete calculation method of the fare in C1 is as follows: when a passenger needs to swipe a card and temporarily not deduct money when getting on the bus, when the detour distance caused by responding to the reservation of other passengers accounts for more than k of the distance of the original route and the detour time exceeds a, the fare is reduced in a parabolic form according to the detour distance ratio; when the detour distance does not reach k and the time does not reach a, the fare is unchanged, namely the fixed fare, the passenger swipes the card again before arriving at the destination station, and the system deducts the cost according to the fare obtained through actual calculation.
Preferably, k in the second step is a fixed value of 40%, or other suitable proportional values; a is a fixed value of 10 minutes or a certain proportion of the total running time of the bus route.
Further, the flexible fare flexible public transportation scheduling method of the invention further comprises the following steps:
step four: 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 five: and repeating the second step to the fourth step, and continuously receiving the passenger reservation information and updating the bus running route.
Further, the flexible bus dispatching method for the fare further comprises the step of obtaining basic information before the step one, wherein the basic information comprises the fixed fare, the running cost per kilometer, the average speed, the average walking speed of passengers and the station coordinates.
Further, the passenger appointment travel information comprises a flexible station for booking getting-on, a fixed station for getting-off, expected departure time and the number of people going out.
As can be seen from the above description of the present invention, compared with the prior art, the present invention has the following advantages:
the flexible fare flexible bus dispatching method comprehensively considers benefits of passengers and a bus company to achieve the aim of maximizing profits, travel time of the passengers, convenience and satisfaction of the bus company, solves the optimal solution of the model by using the genetic algorithm to plan the optimal driving route of the bus, and reduces the fare of the passengers to a certain extent by the system to improve the satisfaction of the passengers when the distance and time of the passengers are prolonged beyond a certain extent due to the response of other passengers.
Drawings
FIG. 1 is a flow chart of the genetic algorithm of the present invention.
Fig. 2 is a flow chart of fare calculation according to the present invention.
FIG. 3 is a graph of fares versus detours in accordance with the present invention.
Detailed Description
The following describes embodiments of the present invention with reference to the drawings.
A flexible fare flexible public traffic scheduling method, this scheduling method defines the station with large passenger flow as the fixed station, the bus must stop; the station that passenger flow volume is little is defined as flexible station, and to the flexible station that does not have the passenger demand, the bus can not stop, and to the flexible station that has the passenger demand, the bus can decide whether to stop according to the scheduling result, and specific scheduling process includes following step:
the method comprises the steps of firstly, receiving passenger reservation travel information, wherein the passenger reservation travel information comprises 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 two, calculating objective functions F1(s) and F2(s) by using a flexible bus model in the background, wherein F1(s) = C1-C2-C3-C4+ C5, F2(s) = -C6, C1 represents the income of the bus company increased by responding to the reservation, C2 represents the cost increased by responding to the reservation, C3 represents the time cost of the passengers sitting on the bus more frequently because of responding to the reservation, C4 represents the time cost of the passengers on other stations under the bus more frequently because of responding to the reservation, C5 represents the travel time cost of the reserved passengers reduced by responding to the reservation, and C6 represents the number of passengers who do not respond to the reservation.
And step three, obtaining the maximum objective function values F1(s) and F2(s) in the step two, and solving by using a genetic algorithm to obtain a bus running route which maximizes the comprehensive income of the bus company and the passengers.
Step four: 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 five: and repeating the second step to the fourth step, and continuously receiving the passenger reservation information and updating the bus running route.
Referring to fig. 1, the specific process of the genetic algorithm is as follows:
1. and designing the bus stop sequence by adopting an ant colony algorithm.
2. And receiving the ith reservation information, and randomly generating size chromosome codes.
3. And F1(s) = C1-C2-C3-C4+ C5 and F2(s) = -C6 are calculated on the s-th chromosome by using a flexible bus model.
4. If s < size, let s = s +1, continue to compute F1(s) and F2(s) until s = size.
5. The non-dominated ranking and congestion degree calculation yields the parent.
6. The parent chromosomes are selected, crossed and mutated to obtain offspring.
7. And merging the parent chromosome population and the offspring chromosome population for elite selection.
8. If G <100, let G = G +1, repeat steps 3 to 7 until G = 100.
9. Judging whether the bus reaches the penultimate station or not, if so, finishing dispatching; if not, let i = i +1 and repeat steps 1-8.
The calculation method of the C1 in the second step is the product of the reservation number of the current flexible site and the fare. Referring to fig. 2, the specific calculation method of the fare is as follows: when the passenger needs to swipe the card and temporarily not pay money when getting on the bus, the detour distance caused by responding to the reservation of other passengers accounts for the distance of the original route, namely, the detour ratio Px = detour distance/original distance is calculated, and when Px>k, k is preferably 0.4, a is preferably 10 minutes after the detour time exceeds a, and the fare is reduced in a parabolic form according to the detour distance ratio, wherein the specific parabolic formula is as follows: ticket _ each = (25-25 Ticket) × Px2The functional relationship of the fare as a function of the detour ratio is shown in FIG. 3,/4 + (20 × Ticket-20) × Px/4+ 1. If calculated Ticket _ each<2, calculating according to the lowest fare 2 yuan; when the detour ratio Px is less than or equal to k or the detour time is less than or equal to a, the fare is unchanged, namely the fixed fare, the passenger swipes the card again before arriving at the destination station, and the system deducts the cost according to the fare obtained through actual calculation.
The k can also be other suitable proportional values, and the a can also be other proportional values of the total running time of the bus route.
The flexible fare flexible bus dispatching method further comprises the step of obtaining basic information before the step one, wherein the basic information comprises fixed fare, running cost per kilometer, average speed, average walking speed of passengers and station coordinates.
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 flexible fare flexible public transportation scheduling method is characterized by comprising the following steps:
the method comprises the following steps: receiving passenger travel appointment information;
step two: a background uses a flexible public transport model to calculate objective functions F1(s) and F2(s), wherein F1(s) comprises fare parameters, the fare is on the basis of fixed fare, when the detour distance caused by responding to reservation of other passengers accounts for more than k of the original route distance, and the detour time exceeds a, the fare is partially reduced in proportion, otherwise, the fare is unchanged;
step three: and (4) obtaining the maximum objective function values F1(s) and F2(s) in the second step, and solving by using a genetic algorithm to obtain a bus running route which maximizes the comprehensive income of the bus company and the passengers.
2. The flexible fare flexible bus dispatching method as claimed in claim 1, wherein: the objective function in the second step is F1(s) = C1-C2-C3-C4+ C5, F2(s) = -C6, C1 indicates the income of the bus company increased by responding to the reservation and is equal to the product of the current flexible stop reservation number and the fare, C2 indicates the cost increased by responding to the reservation, C3 indicates the time cost of the passengers on the bus who are more seated by responding to the reservation, C4 indicates the time cost of the passengers on the other stops under the bus who are more seated by responding to the reservation, C5 indicates the travel time cost of the reserved passengers which is reduced by responding to the reservation, and C6 indicates the number of passengers who do not respond to the reservation.
3. The flexible fare flexible bus dispatching method as claimed in claim 2, wherein: the concrete calculation method of the fare in C1 is as follows: when a passenger needs to swipe a card and temporarily not deduct money when getting on the bus, when the detour distance caused by responding to the reservation of other passengers accounts for more than k of the distance of the original route and the detour time exceeds a, the fare is reduced in a parabolic form according to the detour distance ratio; when the detour distance does not reach k and the time does not reach a, the fare is unchanged, namely the fixed fare, the passenger swipes the card again before arriving at the destination station, and the system deducts the cost according to the fare obtained through actual calculation.
4. The flexible fare flexible bus dispatching method as claimed in claim 2 or 3, characterized in that: and k in the second step is 40%, and a is 10 minutes.
5. The flexible fare flexible bus scheduling method according to claim 1, further comprising the steps of:
step four: 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 five: and repeating the second step to the fourth step, and continuously receiving the passenger reservation information and updating the bus running route.
6. The flexible fare flexible bus dispatching method as claimed in claim 1, wherein: before the first step, obtaining basic data, wherein the basic data comprises fixed ticket prices, running cost per kilometer, average vehicle speed, average passenger walking speed and station coordinates.
7. The flexible fare flexible bus dispatching method as claimed in claim 1, wherein: the passenger reservation travel 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.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011549862.1A CN112562380A (en) | 2020-12-24 | 2020-12-24 | Flexible fare flexible public transportation scheduling method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011549862.1A CN112562380A (en) | 2020-12-24 | 2020-12-24 | Flexible fare flexible public transportation scheduling method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112562380A true CN112562380A (en) | 2021-03-26 |
Family
ID=75033285
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011549862.1A Pending CN112562380A (en) | 2020-12-24 | 2020-12-24 | Flexible fare flexible public transportation scheduling method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112562380A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114282740A (en) * | 2021-09-07 | 2022-04-05 | 内蒙古大学 | High-speed rail ticket amount distribution optimization method considering flexible tickets |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107330559A (en) * | 2017-07-03 | 2017-11-07 | 华南理工大学 | A kind of hybrid customization public bus network planing method of many terminus multi-vehicle-types |
| CN107564269A (en) * | 2017-08-28 | 2018-01-09 | 华南理工大学 | A kind of half flexible bus dispatching method based on willingness to pay |
-
2020
- 2020-12-24 CN CN202011549862.1A patent/CN112562380A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107330559A (en) * | 2017-07-03 | 2017-11-07 | 华南理工大学 | A kind of hybrid customization public bus network planing method of many terminus multi-vehicle-types |
| CN107564269A (en) * | 2017-08-28 | 2018-01-09 | 华南理工大学 | A kind of half flexible bus dispatching method based on willingness to pay |
Non-Patent Citations (2)
| Title |
|---|
| 潘璐: "双车服务模型下的夜间柔性公交调度研究", 《中国优秀硕士学位论文全文数据库工程科技Ⅱ辑》 * |
| 邱丰: "可变线路式公交运营调度与模式优化研究", 《中国博士学位论文全文数据库工程科技Ⅱ辑》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114282740A (en) * | 2021-09-07 | 2022-04-05 | 内蒙古大学 | High-speed rail ticket amount distribution optimization method considering flexible tickets |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109308574B (en) | Real-time response Internet semi-flexible bus scheduling method | |
| RU2717114C2 (en) | System for control of group trips on vehicle (embodiments) and method of control of group trips on vehicle | |
| Davidson et al. | Driving alone versus riding together-How shared autonomous vehicles can change the way we drive | |
| CN107220733B (en) | Customized bus driving optimization method based on Internet and vehicle-road cooperation origin-destination set | |
| KR101586974B1 (en) | Method for providing one-way service of shared autonomous vehicle | |
| CN107633676A (en) | A kind of intelligent sharing vehicle-mounted service system | |
| CN114912736A (en) | Electric bus coordination optimization scheduling method | |
| CN109410562B (en) | Optimized dispatching method for community buses | |
| CN113077162A (en) | Multi-vehicle type customized bus area scheduling method facing real-time requirements | |
| CN111178716B (en) | Automatic driving taxi empty scheduling method for auction type | |
| CN109615112A (en) | A kind of response type community public transport vehicle scheduling optimization method | |
| CN112562380A (en) | Flexible fare flexible public transportation scheduling method | |
| CN113379159A (en) | Taxi driver passenger-searching route recommendation method based on gray model and Markov decision process | |
| CN112233452A (en) | Self-adaptive flexible scheduling method for bus | |
| CN116468219A (en) | Method for matching taxi sharing schedule by junction station | |
| CN111105078A (en) | Customized public transport network optimization method | |
| CN113393000B (en) | Method for improving passenger flow of conventional bus line through mobile reservation | |
| CN115641722A (en) | Regular bus trip service system and method based on dynamic waiting time | |
| Lee et al. | Planning and design of a taxipooling dispatching system | |
| CN114548461A (en) | Method for dynamically predicting waiting time of passenger by using network appointment order data | |
| CN114331060A (en) | DRT vehicle path generation method for high-speed rail station connection under MaaS background | |
| CN113222373A (en) | Driver scheduling method and system based on value selection | |
| CN112906221B (en) | Multi-vehicle type region customized bus scheduling method based on reservation data | |
| CN111144599A (en) | Car booking service system of network car booking | |
| Li et al. | Research on Routing Optimization Model of Demand Responsive Connector under Simultaneous Pickup and Delivery Mode |
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: 20210326 |
|
| RJ01 | Rejection of invention patent application after publication |