CN114971136A - Bus and tour bus scheduling method - Google Patents
Bus and tour bus scheduling method Download PDFInfo
- Publication number
- CN114971136A CN114971136A CN202210156650.XA CN202210156650A CN114971136A CN 114971136 A CN114971136 A CN 114971136A CN 202210156650 A CN202210156650 A CN 202210156650A CN 114971136 A CN114971136 A CN 114971136A
- Authority
- CN
- China
- Prior art keywords
- time
- vehicles
- bus
- passengers
- travel
- 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 17
- 238000011217 control strategy Methods 0.000 claims description 4
- 238000012163 sequencing technique Methods 0.000 claims description 4
- 238000004088 simulation Methods 0.000 claims description 4
- 238000010586 diagram Methods 0.000 description 4
- 239000000969 carrier Substances 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000007781 pre-processing Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
Images
Classifications
-
- 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- 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)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Tourism & Hospitality (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- Educational Administration (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Traffic Control Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a dispatching method of buses and touring minibuses, which is characterized in that the buses and the touring minibuses are distributed by judging a starting point, a plurality of bus routes are planned, and travel demand data are divided into different bus routes; when the bus route is a bus route, the number of passengers in each bus route is counted, and vehicles bearing seat numbers correspondingly are distributed; integrating vehicles within the corresponding carrying seat number to generate a scheduling instruction; when the starting point is not the bus stop, according to the travel demand data, a vehicle travel path, a stop and driving receiving time are generated, and travel efficiency is improved.
Description
Technical Field
The invention relates to the technical field of traffic scheduling, in particular to a scheduling method of buses and touring minibuses.
Background
The intelligent public traffic scheduling means that real-time traffic information is dynamically acquired to realize real-time monitoring and scheduling of vehicles, at present, most of the existing public transport enterprises in cities adopt a traditional scheduling mode, although some advanced technologies exist, the intelligent level is low, the connection between a dispatcher and a driver is not timely, information about vehicles and passengers cannot be transmitted to the dispatcher in real time, real-time scheduling is influenced, meanwhile, the passengers cannot obtain related public service information timely, the overall level of public transport service is low, and in the running process of public transport vehicles, the running requirements of corresponding lines are expected to be realized by large departure intervals and few operation shifts in the aspect of vehicle operation units; the passengers hope that the waiting time is short and the comfort degree of the space in the vehicle is high. For the dispatching of vehicles, certain contradiction exists between the demands of operators and passengers, and the traditional mode of dispatching by depending on experience is difficult to meet the requirements of public transportation dispatching at present. Most bus command centers in society can only dispatch vehicles according to time intervals, and can not count the number of passengers waiting for buses in a station in real time, so that a lot of passengers can not take the buses in time, and the service quality is seriously influenced.
Therefore, how to intelligently schedule buses and tour trolleys and improve travel efficiency is a problem to be solved urgently by technical personnel in the field.
Disclosure of Invention
In view of the above, the invention provides a method for dispatching buses and cruise buses, which includes the steps of determining a starting point to distribute buses and cruise buses, planning a plurality of bus routes and dividing travel demand data into different bus routes; when the bus route is a bus route, the number of passengers in each bus route is counted, and vehicles bearing seat numbers correspondingly are distributed; integrating vehicles within the corresponding carrying seat number to generate a scheduling instruction; when the starting point is not the bus stop, according to the travel demand data, a vehicle travel path, a stop and driving receiving time are generated, and travel efficiency is improved.
In order to achieve the purpose, the invention adopts the following technical scheme:
a method for dispatching buses and touring minibuses comprises the following steps:
s1, collecting travel demand data;
s2, judging whether a bus stop is arranged at the starting point of the trip, if so, performing S3, and if not, performing S6;
s3, planning a plurality of bus routes, and dividing travel demand data into different bus routes;
s4, counting the number of passengers in each bus line, and distributing the vehicles bearing the seats correspondingly;
s5, integrating vehicles within the corresponding carrying seat number to generate a dispatching instruction;
and S6, generating a vehicle driving path, a stop station and a driving receiving time according to the travel demand data.
Preferably, passenger trip demand data is acquired through an online platform, and passenger position information is analyzed, wherein the trip demand data comprises a trip starting point, trip time and trip number; and resolving the starting point into longitude and latitude coordinates, and converting the longitude and latitude coordinates into plane coordinates so as to calculate the distance between the travel points.
Preferably, the step S4 specifically includes:
s41, setting the minimum number of passengers on each bus line;
s42, calculating the number of combined passengers aggregated in each bus line, and recording the current number of combined passengers as the number of shifts when the number of combined passengers is larger than the lowest number of combined passengers;
and S43, matching the vehicles carrying the seat numbers for the shift according to the current carpooling number.
Preferably, the step S5 specifically includes:
s51, sequencing according to the departure time from morning to evening, and executing a first scheduling task;
s52, determining the actual departure time of the current task through a simulation control strategy;
s53, determining the current task time through AVL data;
s54, determining the arrival time of the current one-way task according to the actual departure time and the predicted operation time of the current task;
and S55, repeating the steps S52 to S54 until the last task is completed.
Preferably, the step S6 specifically includes:
s61, acquiring an initial location, and setting a transfer radius by taking the initial location as a center, wherein the set area is a transfer area requested by the order;
s62, obtaining a list of all dispatchable vehicles in the pickup range, obtaining pickup time of the dispatchable vehicles, and calculating pickup time;
s63, calculating the distance between the current position of the vehicle and the position of the starting point, and calculating the driving receiving distance according to the distance;
s64, acquiring a comprehensive quality coefficient of a driver of the dispatchable vehicle;
s65, calculating the sum of the pickup time, the pickup distance and the comprehensive quality coefficient, and setting the sum as a priority;
and S66, sorting the dispatchable vehicles according to the priority, and sequentially dispatching the vehicles in sequence.
According to the technical scheme, compared with the prior art, the invention discloses a dispatching method of buses and tour buses, which is characterized in that the buses and tour buses are distributed by judging the starting point, a plurality of bus routes are planned, and trip demand data are divided into different bus routes; when the bus route is a bus route, the number of passengers in each bus route is counted, and vehicles bearing seat numbers correspondingly are distributed; integrating vehicles within the corresponding carrying seat number to generate a scheduling instruction; when the starting point is not the bus stop, according to the travel demand data, a vehicle travel path, a stop and driving receiving time are generated, and travel efficiency is improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
Fig. 1 is a schematic diagram of the overall flow structure provided by the present invention.
Fig. 2 is a schematic flow structure diagram of step S4 provided in the present invention.
Fig. 3 is a schematic flow structure diagram of step S5 provided in the present invention.
Fig. 4 is a schematic flow structure diagram of step S6 provided in the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The embodiment of the invention discloses a method for dispatching buses and touring minibuses, which comprises the following steps:
s1, collecting travel demand data;
s2, judging whether a bus stop is arranged at the starting point of the trip, if so, performing S3, and if not, performing S6;
s3, planning a plurality of bus routes, and dividing travel demand data into different bus routes;
s4, counting the number of passengers in each bus line, and distributing the vehicles with corresponding seat numbers;
s5, integrating the vehicles in the corresponding carrying seat digits to generate a dispatching instruction;
and S6, generating a vehicle driving path, a stop station and a driving receiving time according to the travel demand data.
In order to further optimize the technical scheme, passenger travel demand data are obtained through an online platform, and passenger position information is analyzed, wherein the travel demand data comprise a travel starting point, travel time and the number of people in travel; and resolving the starting point into longitude and latitude coordinates, and converting the longitude and latitude coordinates into plane coordinates so as to calculate the distance between the travel points.
To further optimize the above technical solution, step S4 specifically includes:
s41, setting the minimum number of passengers on each bus line;
s42, calculating the number of combined passengers aggregated in each bus line, and recording the current number of combined passengers as the number of shifts when the number of combined passengers is larger than the lowest number of combined passengers;
and S43, matching the vehicles carrying the seat numbers for the shift according to the current carpooling number.
To further optimize the above technical solution, step S5 specifically includes:
s51, sequencing according to departure time from morning to evening, and executing a first scheduling task;
s52, determining the actual departure time of the current task through a simulation control strategy;
s53, determining the current task time through AVL data;
s54, determining the arrival time of the current one-way task according to the actual departure time and the predicted operation time of the current task;
and S55, repeating the steps S52 to S54 until the last task is completed.
To further optimize the above technical solution, step S6 specifically includes:
s61, acquiring an initial location, and setting a transfer radius by taking the initial location as a center, wherein the set area is a transfer area requested by the order;
s62, obtaining a list of all dispatchable vehicles in the pickup range, obtaining pickup time of the dispatchable vehicles, and calculating pickup time;
s63, calculating the distance between the current position of the vehicle and the position of the starting point, and calculating the driving receiving distance according to the distance;
s64, acquiring a comprehensive quality coefficient of a driver of the dispatchable vehicle;
s65, calculating the sum of the pickup time, the pickup distance and the comprehensive prime coefficient, and setting the sum as the priority;
and S66, sorting the dispatchable vehicles according to the priority, and sequentially dispatching the vehicles in sequence.
Particularly, the service is provided to the back and forth service in a five-ring range around Beijing West station and Beijing south station, and in Huilongguan, Tiantong yuan, Daxing Huangcun, Shijing mountain octagonal and Tongzhou urban area. The riding-in-cooperation customized bus is based on the travel demands of passengers, people and vehicles are matched by the system according to a certain scheduling rule, and the use efficiency of transport capacity is improved.
The platform collects passenger trip demand data, including trip starting points, trip time and trip number, analyzes passenger position information, analyzes the starting points into longitude and latitude coordinates, converts the longitude and latitude coordinates into plane coordinates, and calculates the distance between trip points. After the completion, judging whether the starting point is provided with a bus stop or not, if so, planning a plurality of bus lines according to the travel distance, the travel time and the like, dividing the travel demand data into the corresponding bus lines, specifically, according to the division basis including whether the starting point is contained in the bus line or not, whether the riding time and the waiting time meet the demand or not, setting the lowest carpooling number of each bus line after the completion, calculating the aggregated carpooling number in each bus line, recording the current carpooling number as the number of shifts when the carpooling number is more than the lowest carpooling number, matching the number of corresponding carriers for the number of shifts according to the current carpooling number, specifically, setting the number of carriers not less than the current carpooling number and the number of empty seats of the vehicle not more than 50%, after the completion, setting the departure time, sequencing the vehicles from early to late according to the departure time, and executing a first scheduling task, the method comprises the steps of determining the actual departure time of a current task through a simulation control strategy, preprocessing AVL data to obtain a current scheduling task sample set, obtaining one-way time distribution of vehicle time samples, calculating to obtain the one-way time according to the one-way time distribution, determining the arrival time of the current one-way task through the actual departure time and the predicted operation time of the current task, and repeating the scheduling tasks until the last task is completed.
If the starting point is not provided with a bus stop, the passenger obtains the starting point, the starting point is used as the center, the taking radius is set, the set area is the taking area requested by the order, the platform obtains all the dispatchable vehicles in the taking range, the time required by the vehicle taking of the dispatchable vehicles is obtained, the taking time is calculated, the distance between the current position of the vehicle and the position of the starting point is calculated, the taking distance is calculated according to the distance, the comprehensive quality coefficient of the vehicle drivers can be obtained, the sum of the taking time coefficient, the taking distance coefficient and the comprehensive quality coefficient is calculated and set as the priority, the dispatchable vehicles are sorted according to the priority, and the vehicles are sequentially taken according to the sequence.
The embodiments in the present description are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other. The device disclosed by the embodiment corresponds to the method disclosed by the embodiment, so that the description is simple, and the relevant points can be referred to the method part for description.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (5)
1. A method for dispatching buses and touring minibuses is characterized by comprising the following steps:
s1, collecting travel demand data;
s2, judging whether a bus stop is arranged at the starting point of the trip, if so, performing S3, and if not, performing S6;
s3, planning a plurality of bus routes, and dividing travel demand data into different bus routes;
s4, counting the number of passengers in each bus line, and distributing the vehicles bearing the seats correspondingly;
s5, integrating vehicles within the corresponding carrying seat number to generate a dispatching instruction;
and S6, generating a vehicle driving path, a stop station and a driving receiving time according to the travel demand data.
2. The method according to claim 1, wherein passenger travel demand data including a travel starting point, travel time and number of people traveling are acquired through an online platform and the passenger position information is analyzed; and resolving the starting point into longitude and latitude coordinates, and converting the longitude and latitude coordinates into plane coordinates so as to calculate the distance between the travel points.
3. The method according to claim 1, wherein the step S4 specifically includes:
s41, setting the minimum number of passengers on each bus line;
s42, calculating the number of combined passengers aggregated in each bus line, and recording the current number of combined passengers as the number of shifts when the number of combined passengers is larger than the lowest number of combined passengers;
and S43, matching the vehicles carrying the seat numbers for the shift according to the current carpooling number.
4. The method according to claim 1, wherein the step S5 specifically includes:
s51, sequencing according to the departure time from morning to evening, and executing a first scheduling task;
s52, determining the actual departure time of the current task through a simulation control strategy;
s53, determining the current task time through AVL data;
s54, determining the arrival time of the current one-way task according to the actual departure time and the predicted operation time of the current task;
and S55, repeating the steps S52 to S54 until the last task is completed.
5. The method according to claim 1, wherein the step S6 specifically includes:
s61, acquiring an initial location, and setting a transfer radius by taking the initial location as a center, wherein the set area is a transfer area requested by the order;
s62, obtaining a list of all dispatchable vehicles in the pickup range, obtaining pickup time of the dispatchable vehicles, and calculating pickup time;
s63, calculating the distance between the current position of the vehicle and the position of the starting point, and calculating the driving receiving distance according to the distance;
s64, acquiring a comprehensive quality coefficient of a driver of the dispatchable vehicle;
s65, calculating the sum of the pickup time, the pickup distance and the comprehensive prime coefficient, and setting the sum as the priority;
and S66, sorting the dispatchable vehicles according to the priority, and sequentially dispatching the vehicles in sequence.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2021108307408 | 2021-07-22 | ||
| CN202110830740.8A CN113592272A (en) | 2021-07-22 | 2021-07-22 | Dispatching method for public transport and tour bus |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114971136A true CN114971136A (en) | 2022-08-30 |
Family
ID=78248959
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110830740.8A Withdrawn CN113592272A (en) | 2021-07-22 | 2021-07-22 | Dispatching method for public transport and tour bus |
| CN202210156650.XA Pending CN114971136A (en) | 2021-07-22 | 2022-02-21 | Bus and tour bus scheduling method |
Family Applications Before (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110830740.8A Withdrawn CN113592272A (en) | 2021-07-22 | 2021-07-22 | Dispatching method for public transport and tour bus |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN113592272A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116757339A (en) * | 2023-08-21 | 2023-09-15 | 倍施特科技(集团)股份有限公司 | Operation optimization method based on customized passenger transport and customized transport device |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114898551A (en) * | 2022-03-16 | 2022-08-12 | 深圳市综合交通与市政工程设计研究总院有限公司 | Method for investigating traffic volume of conventional urban public transport network |
-
2021
- 2021-07-22 CN CN202110830740.8A patent/CN113592272A/en not_active Withdrawn
-
2022
- 2022-02-21 CN CN202210156650.XA patent/CN114971136A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116757339A (en) * | 2023-08-21 | 2023-09-15 | 倍施特科技(集团)股份有限公司 | Operation optimization method based on customized passenger transport and customized transport device |
| CN116757339B (en) * | 2023-08-21 | 2023-11-14 | 倍施特科技(集团)股份有限公司 | Operation optimization method based on customized passenger transport and customized transport device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113592272A (en) | 2021-11-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Amirgholy et al. | Optimal design of sustainable transit systems in congested urban networks: A macroscopic approach | |
| CN109035770B (en) | Real-time analysis and prediction method for bus passenger capacity in big data environment | |
| Bischoff et al. | City-wide shared taxis: A simulation study in Berlin | |
| CN104021667B (en) | Integrate subscription services and the taxi dispatching system called a taxi in real time and scheduling method | |
| CN111915176B (en) | Scheduling method and system for pure electric bus in hybrid operation mode | |
| CN102044149B (en) | City bus operation coordinating method and device based on time variant passenger flows | |
| CN105279955B (en) | A kind of share-car method and apparatus | |
| Bischoff et al. | Proactive empty vehicle rebalancing for Demand Responsive Transport services | |
| CN107358319A (en) | Flow Prediction in Urban Mass Transit method, apparatus, storage medium and computer equipment | |
| CN114971136A (en) | Bus and tour bus scheduling method | |
| Hamadneh et al. | Impacts of shared autonomous vehicles on the travelers’ mobility | |
| CN111815189A (en) | Modular bus dispatching system | |
| CN104239484A (en) | Multi-mode bus combinatorial dispatch-based schedule making method | |
| Marczuk et al. | Simulation framework for rebalancing of autonomous mobility on demand systems | |
| CN109612488B (en) | Big data micro-service-based mixed travel mode path planning system and method | |
| CN112309122A (en) | Intelligent bus grading decision-making system based on multi-system cooperation | |
| CN111739287A (en) | Intelligent scheduling system for intelligent station with cooperative vehicle and road | |
| CN111553530B (en) | Inter-city network car booking and packing travel capacity prediction and travel recommendation method and system | |
| CN115409295B (en) | Bus scheduling method based on bottleneck analysis, electronic equipment and storage medium | |
| CN111311950B (en) | Intelligent dispatching method and system for bus in peak period | |
| CN111898909A (en) | Unmanned bus dispatching method based on real-time requirements | |
| CN115860594A (en) | Simulation system and method applied to intelligent bus scheduling | |
| CN115472011A (en) | Bus intelligent line planning algorithm based on reservation data | |
| CN113450242B (en) | Path deviation type bus dispatching system, storage medium and equipment | |
| CN112289065B (en) | Customized bus route design method and system based on accurate OD big data |
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 |