CN116071910B - Flexible bus scheduling method and system - Google Patents
Flexible bus scheduling method and system Download PDFInfo
- Publication number
- CN116071910B CN116071910B CN202310024631.6A CN202310024631A CN116071910B CN 116071910 B CN116071910 B CN 116071910B CN 202310024631 A CN202310024631 A CN 202310024631A CN 116071910 B CN116071910 B CN 116071910B
- Authority
- CN
- China
- Prior art keywords
- vehicle
- passenger
- indicating
- matching
- vehicles
- 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
- 238000000034 method Methods 0.000 title claims abstract description 21
- 238000012216 screening Methods 0.000 claims description 41
- 238000013480 data collection Methods 0.000 claims description 6
- 238000004891 communication Methods 0.000 claims description 5
- 230000003993 interaction Effects 0.000 description 2
- 238000012795 verification Methods 0.000 description 2
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/20—Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles
- G08G1/202—Dispatching vehicles on the basis of a location, e.g. taxi dispatching
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
- G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
- G08G1/0125—Traffic data processing
- G08G1/0133—Traffic data processing for classifying traffic situation
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
- Y02T10/00—Road transport of goods or passengers
- Y02T10/10—Internal combustion engine [ICE] based vehicles
- Y02T10/40—Engine management systems
Abstract
Different from the traditional stop mode, the passenger automatically uploads the riding demand, the control terminal carries out the scheduling of the vehicle according to the riding demand, in the scheduling process, the distance within 5km of the passenger is ensured to reach the terminal station within 15 minutes, the distance within more than 5km is ensured to reach within 30 minutes, the stop which does not submit the riding demand can be stopped without entering the stop, the single-trip running time of the bus is greatly shortened, and the operation efficiency and the riding experience of the passenger can be improved.
Description
Technical Field
The application belongs to the technical field of traffic scheduling, and particularly relates to a flexible bus scheduling method and system.
Background
Urban buses are an important component of public transportation, existing buses usually run according to fixed routes, a plurality of stops are arranged on the running routes, the buses stop at each stop, and when no passengers need to get on at a certain stop, the buses still need to stop at the stop. On one hand, the operation mode can prolong the single operation time of the bus and reduce the operation efficiency; on the other hand, delay of the arrival time of passengers is caused, and riding experience is affected.
Therefore, it is necessary to provide a flexible bus dispatching method and system to solve the above problems.
Disclosure of Invention
The purpose of the embodiment of the application is to provide a flexible bus dispatching method and system, which are different from the traditional stop mode, the passenger uploads the riding demand automatically, the control terminal dispatches the vehicle according to the riding demand, in the dispatching process, the 5km distance of the passenger is ensured to reach the destination within 15 minutes, the distance of the passenger is more than 5km distance to reach the destination within 30 minutes, the stop which does not submit the riding demand can stop without going into the stop, the single-trip running time of the bus is greatly shortened, and the operation efficiency and the riding experience of the passenger can be improved.
In order to solve the technical problems, the application is realized as follows:
a flexible bus dispatching method comprises the following steps:
s1, acquiring the state Q of any running bus of the current line i ＝{v i ,n i ,P i ,l i ,d lmax }, where v i Indicating the running speed of the vehicle i, n i Number indicating vehicle i, P i License plate number indicating vehicle i, l i Indicating the traveling direction of the vehicle i, d lmax A terminal station indicating the traveling direction of the vehicle i;
s2, acquiring an order submitted by a passenger, and generating a passenger state r according to reservation information of the order j ＝{n j ,d sj ,d Qj ,l j N is }, where n j Number d representing the number automatically generated by passenger j when submitting the request Sj Indicating the location of the station where passenger j is located, d Qj Indicating the destination of passenger j, l j Indicating the riding direction of the passenger j;
s3, screening the traveling direction and the riding direction of the passenger j, and meeting d (d) Sj ,d lmax )≥d(d sj ,d Qj ) Form a preliminary screening vehicle set k= { K 1 ,K 2 ,K 3 ,…,K i ,…,K n And d (d) sj ,d lmax ) Indicating the location d of the station where passenger j is located Sj Distance to destination in traveling direction of vehicle i, d (d Sj ,d Qj ) Indicating the location d of the station where passenger j is located Sj To destination d Qj Is a distance of (2);
s4: calculating any vehicle K in the primary screening vehicle set K i From the station position d where passenger j is located Sj To destination d Qj If d (d) Sj ,d Qj ) Less than or equal to 5km and t less than or equal to 15min, the vehicle K is represented i Successfully match with passenger j; if d (d) Sj ,d Qj ) More than 5km and t less than or equal to 30min, then represents vehicle k i Successfully match with passenger j; if it is other casesThen the matching is failed; for any order, sequentially matching vehicles in the primary screening vehicle set K until the matching is successful, and stopping the matching operation after the matching is successful;
s5: for successfully matched vehicles and passengers, the number n automatically generated when the passenger submits the request is determined j Transmitting to a vehicle end; number n of the vehicle i And license plate number P i To the passenger side.
Preferably, in the step S4, "calculate any vehicle k in the preliminary screening vehicle set k i From the station position d where passenger j is located Sj To destination d Qj The calculation process of the time t' of (a) is as follows:
in the formula, v i Representing vehicle K i Speed, delta t Representing the cause vehicle k i The time generated by the stop floats.
Preferably, in the step S4, "for any order, the vehicles in the primary screening vehicle set K are sequentially matched until the matching is successful" the following constraint conditions are satisfied:
X ij ＝{0,1}
wherein X is ij Represents a decision variable, n represents the total number of vehicles in the set of primary screening vehicles K, C i Representing vehicle K i R represents the maximum number of passengers with the vehicle K i The total number of passengers who match successfully.
The application also provides a flexible bus dispatching system, comprising:
a first data collection module for obtaining current lineArbitrary running bus state Q i ＝{v i ,n i ,P i ,l i ,d lmax }, where v i Indicating the running speed of the vehicle i, n i Number indicating vehicle i, P i License plate number indicating vehicle i, l i Indicating the traveling direction of the vehicle i, d lmax A terminal station indicating the traveling direction of the vehicle i;
the second data collection module is used for acquiring an order submitted by a passenger and generating a passenger state r according to reservation information of the order j ＝{n j ,d sj ,d Qj ,l j N is }, where n j Number d representing the number automatically generated by passenger j when submitting the request Sj Indicating the location of the station where passenger j is located, d Qj Indicating the destination of passenger j, l j Indicating the riding direction of the passenger j;
screening module for screening traveling direction and riding direction of passenger j and meeting d (d) Sj ,d lmax )≥d(d Sj ,d Qj ) Form a preliminary screening vehicle set k= { K 1 ,K 2 ,K 3 ,…,K i ,…,K n And d (d) Sj ,d lmax ) Indicating the location d of the station where passenger j is located Sj Distance to destination in traveling direction of vehicle i, d (d Sj ,d Qj ) Indicating the location d of the station where passenger j is located Sj To destination d Qj Is a distance of (2);
and a matching module: calculating any vehicle K in the primary screening vehicle set K i From the station position d where passenger j is located Sj To destination d Qj If d (d) Sj ,d Qj ) Less than or equal to 5km and t less than or equal to 15min, the vehicle K is represented i Successfully match with passenger j; if d (d) Sj ,d Qj ) More than 5km and t less than or equal to 30min, the vehicle K is represented i Successfully match with passenger j; if the matching is the other situation, the matching is failed; for any order, sequentially matching vehicles in the primary screening vehicle set K until the matching is successful, and stopping the matching operation after the matching is successful;
and a data issuing module: submitting a request to the passenger for the successfully matched vehicle and passengerNumber n automatically generated at the time j Transmitting to a vehicle end; number n of the vehicle i And license plate number P i To the passenger side.
Preferably, the flexible bus dispatching system is designed by adopting a micro-service architecture, each module externally provides API service in a Rest API mode, and communication among the modules is realized in a Http mode.
Different from the traditional stop mode, the flexible bus scheduling method and system provided by the application have the advantages that passengers upload the riding demands automatically, the control terminal schedules the vehicles according to the riding demands, in the scheduling process, the 5 km-distance of the passengers reaches the terminal station within 15 minutes, the 5 km-distance is more than 5 km-distance and reaches within 30 minutes, the stops not submitting the riding demands can be stopped without entering the stops, the single-trip running time of the buses is greatly shortened, and the operation efficiency and the riding experience of the passengers can be improved.
Detailed Description
The following description of the embodiments of the present application will be made clearly and fully below, and it is apparent that the embodiments described are some, but not all, of the embodiments of the present application. All other embodiments, which can be made by one of ordinary skill in the art based on the embodiments herein without making any inventive effort, are intended to be within the scope of the present application.
The application provides a flexible bus scheduling method, which comprises the following steps:
s1, acquiring state data Q of any vehicle i ＝{v i ,n i ,P i ,l i ,d lmax }, where v i Indicating the running speed of the vehicle i, n i Number indicating vehicle i, P i License plate number indicating vehicle i, l i Indicating the traveling direction of the vehicle i, d lmax The terminal indicating the traveling direction of the vehicle i.
The vehicle end needs to be equipped with a corresponding vehicle-mounted intelligent device, which is used for collecting the vehicle state, such as the running speed v of the vehicle i Direction of travel l i Can be obtained from an onboard ECUThe method comprises the steps of carrying out a first treatment on the surface of the On the other hand as a man-machine interaction tool, e.g. number n of vehicle i License plate number P i Can be filled by the driver. The vehicle-mounted intelligent equipment is in communication connection with the control platform, and the vehicle state data are uploaded to the control platform in real time.
S2, acquiring an order submitted by a passenger, and generating a passenger state r according to reservation information of the order j ＝{n j ,d Sj ,d Qj ,l j N is }, where n j Number d representing the number automatically generated by passenger j when submitting the request Sj Indicating the location of the station where passenger j is located, d 1j Indicating the destination of passenger j, l j Indicating the riding direction of passenger j.
The passenger terminal needs to install a corresponding mobile terminal, the mobile terminal is used as a man-machine interaction tool, the mobile terminal is in communication connection with a control platform, the passenger accesses the control platform through an app, an applet or a webpage on the mobile terminal, and an order is submitted to the control platform.
S3, screening the traveling direction and the riding direction of the passenger j, and meeting d (d) Sj ,d lmax )≥d(d Sj ,d Qj ) Form a preliminary screening vehicle set k= { K 1 ,K 2 ,K 3 ,…,K i ,…,K n And d (d) Sj ,d lmax ) Indicating the location d of the station where passenger j is located Sj Distance to destination in traveling direction of vehicle i, d (d Sj ,d Qj ) Indicating the location d of the station where passenger j is located sj To destination d Qj Is a distance of (3).
Step S3 is used for performing preliminary screening of vehicles, in the whole bus system, a plurality of lines are arranged, and a plurality of vehicles are arranged on each line, so that the order requirement of passengers is met, and the running direction l of the vehicles is required i Direction l of passenger j The distance from the station where the passenger is located to the terminal is larger than or equal to the riding distance of the passenger, namely, the passenger can reach the destination by riding on the vehicle, and the situation that the passenger does not reach the destination but does not reach the destination is avoided.
S4: calculating any vehicle K in the primary screening vehicle set K i From the station position d where passenger j is located Sj To destination d Qj If d (d) Sj ,d Qj ) Less than or equal to 5km and t less than or equal to 15min, the vehicle K is represented i Successfully match with passenger j; if d (d) Sj ,d Qj ) More than 5km and t less than or equal to 30min, the vehicle K is represented i Successfully match with passenger j; if the matching is the other situation, the matching is failed; and for any order, sequentially matching the vehicles in the primary screening vehicle set K until the matching is successful, and stopping the matching operation after the matching is successful.
In the matching rule of the technical scheme, the travel within 5km is limited to 15min, the travel exceeding 5km is limited to 30min. Before order taking, the data that different vehicles have ordered are different, so that the stops at are not the same despite the vehicles running on the same line, thereby causing the arrival times at which the current order is executed to be different. For example, the station position d where passenger j is located Sj To destination d Qj 10 stations exist in the middle, vehicles Ka and Kb exist in the primary screening vehicle set K, wherein Ka needs to stop at 8 stations, kb needs to stop at 5 stations, so that arrival time of Kb is 18min, and order requirements are not met; the arrival time of Ka is 13min, and the order requirement is met.
Preferably, in the step S4, "calculate any vehicle K in the preliminary screening vehicle set K i From the station position d where passenger j is located Sj To destination d Qj The calculation process of the time t' of (a) is as follows:
in the formula, v i Representing vehicle K i Speed, delta t Representing the cause vehicle K i The time generated by the stop floats.
Dock generated time float delta t Can be obtained according to an empirical value, and the unit time required by each passenger to get on the bus when the passenger stops can be obtained through the empirical value, multiplied by each passengerThe number of passengers on each platform needing to get on is multiplied by d Sj To d Qj The total time floating delta can be obtained by the number of stations to be stopped in the journey t 。
In the matching process, all vehicles in the vehicle set K are matched with the passengers j in sequence, and after the vehicles with successful matching appear, the matching process is stopped, so that only one vehicle can be matched with the passengers j successfully.
For the above matching principle, the following constraint conditions exist in the matching process:
X ij ＝{0,1}
wherein X is ij Representing decision variables, X ij =0 indicates a match failure, X ij =1 indicates successful matching, n indicates the total number of vehicles in the set K of primary screening vehicles, C i Representing vehicle K i R represents the maximum number of passengers with the vehicle K i The total number of passengers successfully matched, the number of requests received by the vehicle i cannot exceed the maximum number of passengers C of the vehicle in a decision period i 。
S5: for successfully matched vehicles and passengers, the number n automatically generated when the passenger submits the request is determined j Transmitting to a vehicle end; number n of the vehicle i And license plate number P i To the passenger side.
During the subsequent riding, the vehicle end passes through the number n j The verification of the identity of the passenger can be performed manually or automatically by means of the prior art identity verification technique, for example by generating a message containing said number n at the passenger side j The two-dimensional code of the device is arranged at the vehicle end, and the identity can be checked by the code scanning when a passenger gets on the vehicle. Number n of passenger passing vehicle i And license plate number P i And (5) distinguishing and confirming the vehicles, so as to avoid the wrong vehicles.
The application also provides a flexible bus dispatching system, comprising:
the first data collection module is used for obtaining the state Q of any running bus of the current line i ＝{v i ,n i ,P i ,l i ,d lmax }, where v i Indicating the running speed of the vehicle i, n i Number indicating vehicle i, P i License plate number indicating vehicle i, l i Indicating the traveling direction of the vehicle i, d lmax A terminal station indicating the traveling direction of the vehicle i;
the second data collection module is used for acquiring an order submitted by a passenger and generating a passenger state r according to reservation information of the order j ＝{n j ,d Sj ,d Qj ,l j N is }, where n j Number d representing the number automatically generated by passenger j when submitting the request Sj Indicating the location of the station where passenger j is located, d Qj Indicating the destination of passenger j, l j Indicating the riding direction of the passenger j;
screening module for screening traveling direction and riding direction of passenger j and meeting d (d) Sj ,d lmax )≥d(d Sj ,d Qj ) Form a preliminary screening vehicle set k= { K 1 ,K 2 ,K 3 ,…,K i ,…,K n And d (d) Sj ,d lmax ) Indicating the location d of the station where passenger j is located Sj Distance to destination in traveling direction of vehicle i, d (d Sj ,d Qj ) Indicating the location d of the station where passenger j is located Sj To destination d Qj Is a distance of (2);
and a matching module: calculating any vehicle K in the primary screening vehicle set K i From the station position d where passenger j is located Sj To destination d Qj If d (d) Sj ,d Qj ) Less than or equal to 5km and t less than or equal to 15min, the vehicle K is represented i Successfully match with passenger j; if d (d) sj ,d Qj ) More than 5km and t less than or equal to 30min, the vehicle K is represented i Successfully match with passenger j;if the matching is the other situation, the matching is failed; for any order, sequentially matching vehicles in the primary screening vehicle set K until the matching is successful, and stopping the matching operation after the matching is successful;
and a data issuing module: for successfully matched vehicles and passengers, the number n automatically generated when the passenger submits the request is determined j Transmitting to a vehicle end; number n of the vehicle i And license plate number P i To the passenger side.
Preferably, the flexible bus dispatching system is designed by adopting a micro-service architecture, each module externally provides API service in a Rest API mode, and communication among the modules is realized in a Http mode.
The examples of the present application have been described above, but the present application is not limited to the above-described embodiments, which are merely illustrative and not restrictive, and many forms can be made by those of ordinary skill in the art without departing from the spirit of the present application and the scope of the protection of the claims, which fall within the protection of the present application.
Claims (4)
1. The flexible bus dispatching method is characterized by comprising the following steps of:
a1: acquiring state Q of bus running randomly on current line i ＝{v i ，n i ，P i ，l i ，d lmax }, where v i Indicating the running speed of the vehicle i, n i Number indicating vehicle i, P i License plate number indicating vehicle i, l i Indicating the traveling direction of the vehicle i, d lmax A terminal station indicating the traveling direction of the vehicle i;
a2: acquiring an order submitted by a passenger, and generating a passenger state r according to reservation information of the order j ＝{n j ，d Sj ，d Qj ，l j N is }, where n j Number d representing the number automatically generated by passenger j when submitting the request Sj Indicating the location of the station where passenger j is located, d Qj Indicating the destination of passenger j, l j Representing passengersj riding direction;
s3: screening the traveling direction and the riding direction of the passenger j, and satisfying d (d) Sj ，d lmax )≥d(d Sj ，d Qj ) Form a preliminary screening vehicle set k= { K 1 ，K 2 ，K 3 ，…，K i ，…，K n And d (d) Sj ，d lmax ) Indicating the location d of the station where passenger j is located Sj Distance to destination in traveling direction of vehicle i, d (d Sj ，d Qj ) Indicating the location d of the station where passenger j is located Sj To destination d Qj Is a distance of (2); n represents the total number of vehicles in the primary screening vehicle set K; k (K) i Representing any vehicle in the set of primary screening vehicles K;
s4: calculating any vehicle K in the primary screening vehicle set K i From the station position d where passenger j is located Sj To destination d Qj If d (d) Sj ，d Qj ) Less than or equal to 5km and t less than or equal to 15min, the vehicle K is represented i Successfully match with passenger j; if d (d) Sj ，d Qj ) More than 5km and t less than or equal to 30min, the vehicle K is represented i Successfully match with passenger j; if the matching is the other situation, the matching is failed; for any order, sequentially matching vehicles in the primary screening vehicle set K until the matching is successful, and stopping the matching operation after the matching is successful; in the step S4, "for any order, vehicles in the primary screening vehicle set K are sequentially matched until the matching is successful" satisfies the following constraint conditions:
X ij ＝{0，1}
wherein X is ij Representing decision variables, C i Representing vehicle K i R is the maximum number of passengersRepresentation and vehicle K i The total number of passengers who are successfully matched;
s5: for successfully matched vehicles and passengers, the number n automatically generated when the passenger submits the request is determined j Transmitting to a vehicle end; number n of the vehicle i And license plate number P i To the passenger side.
2. The flexible bus dispatching method according to claim 1, wherein in the step S4, "calculate any vehicle K in the preliminary screening vehicle set K i From the station position d where passenger j is located Sj To destination d Qj The calculation process of the time t' of (a) is as follows:
in the formula, v i Representing vehicle K i Speed, delta t Representing the cause vehicle K i The time generated by the stop floats.
3. A flexible bus dispatch system, comprising:
a first data collection module: acquiring state Q of bus running randomly on current line i ＝{v i ，n i ，P i ，l i ，d lmax }, where v i Indicating the running speed of the vehicle i, n i Number indicating vehicle i, P i License plate number indicating vehicle i, l i Indicating the traveling direction of the vehicle i, d lmax A terminal station indicating the traveling direction of the vehicle i;
and a second data collection module: acquiring an order submitted by a passenger, and generating a passenger state r according to reservation information of the order j ＝{n j ，d Sj ，d Qj ，l j N is }, where n j Number d representing the number automatically generated by passenger j when submitting the request Sj Indicating the location of the station where passenger j is located, d Qj Indicating the destination of passenger j, l j Indicating the riding direction of the passenger j;
and a screening module: screening the traveling direction and the riding direction of the passenger j, and satisfying d (d) Sj ，d lmax )≥d(d Sj ，d Qj ) Form a preliminary screening vehicle set k= { K 1 ，K 2 ，K 3 ，…，K i ，…，K n And d (d) Sj ，d lmax ) Indicating the location d of the station where passenger j is located Sj Distance to destination in traveling direction of vehicle i, d (d Sj ，d Qj ) Indicating the location d of the station where passenger j is located Sj To destination d Qj Is a distance of (2); n represents the total number of vehicles in the primary screening vehicle set K; k (K) i Representing any vehicle in the set of primary screening vehicles K;
and a matching module: calculating any vehicle K in the primary screening vehicle set K i From the station position d where passenger j is located Sj To destination d Qj If d (d) Sj ，d Qj ) Less than or equal to 5km and t less than or equal to 15min, the vehicle K is represented i Successfully match with passenger j; if d (d) Sj ，d Qj ) More than 5km and t less than or equal to 30min, the vehicle K is represented i Successfully match with passenger j; if the matching is the other situation, the matching is failed; for any order, sequentially matching vehicles in the primary screening vehicle set K until the matching is successful, and stopping the matching operation after the matching is successful; the vehicles in the primary screening vehicle set K are matched in sequence for any order until the matching is successful, and the following constraint conditions are met:
X ij ＝{0,1}
wherein X is ij Representing decision variables, C i Representing vehicle K i R represents the maximum number of passengers with the vehicle K i The total number of passengers who are successfully matched;
and a data issuing module: for successfully matched vehicles and passengers, the number n automatically generated when the passenger submits the request is determined j Transmitting to a vehicle end; number n of the vehicle i And license plate number P i To the passenger side.
4. A flexible bus scheduling system according to claim 3, wherein the flexible bus scheduling system is designed by adopting a micro-service architecture, and each module provides API service to the outside in a Rest API mode, and the communication between each module communicates in an Http mode.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310024631.6A CN116071910B (en) | 2023-01-09 | 2023-01-09 | Flexible bus scheduling method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310024631.6A CN116071910B (en) | 2023-01-09 | 2023-01-09 | Flexible bus scheduling method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116071910A CN116071910A (en) | 2023-05-05 |
| CN116071910B true CN116071910B (en) | 2023-12-22 |
Family
ID=86176297
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310024631.6A Active CN116071910B (en) | 2023-01-09 | 2023-01-09 | Flexible bus scheduling method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116071910B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012025012A1 (en) * | 2010-08-26 | 2012-03-01 | Zhang Yukang | Intelligent urban public transportation system oriented to passenger travel and implementation method thereof |
| CN109308574A (en) * | 2018-09-07 | 2019-02-05 | 华南理工大学 | A kind of flexible bus dispatching method in internet of real-time response half |
| CN113160542A (en) * | 2021-04-21 | 2021-07-23 | 广州通巴达电气科技有限公司 | Riding method and device based on information feedback |
| CN113919684A (en) * | 2021-10-08 | 2022-01-11 | 湖南大学 | Multi-mode customized bus dynamic scheduling method, system and readable storage medium |
-
2023
- 2023-01-09 CN CN202310024631.6A patent/CN116071910B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012025012A1 (en) * | 2010-08-26 | 2012-03-01 | Zhang Yukang | Intelligent urban public transportation system oriented to passenger travel and implementation method thereof |
| CN109308574A (en) * | 2018-09-07 | 2019-02-05 | 华南理工大学 | A kind of flexible bus dispatching method in internet of real-time response half |
| CN113160542A (en) * | 2021-04-21 | 2021-07-23 | 广州通巴达电气科技有限公司 | Riding method and device based on information feedback |
| CN113919684A (en) * | 2021-10-08 | 2022-01-11 | 湖南大学 | Multi-mode customized bus dynamic scheduling method, system and readable storage medium |
Non-Patent Citations (2)
| Title |
|---|
| 乘客运输的车辆路径规划策略;戴意愿;文桂林;周华安;;计算机工程与应用(第12期);全文 * |
| 基于位置服务的现代公共客运服务设计分析;马超民;何人可;;装饰(第01期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116071910A (en) | 2023-05-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2021004115A1 (en) | Combined dispatching optimization method for manned buses and autonomous buses | |
| CN110189006B (en) | Scheduling method and device for vehicle, computer equipment and storage medium thereof | |
| CN110119835B (en) | Bus dynamic departure scheduling optimization method based on interval calculation | |
| CN103956041B (en) | A kind of bus dispatching system and control method thereof | |
| WO2019184724A1 (en) | Real-time passenger flow-based intelligent operation adjustment system and method for trains | |
| CN105761479A (en) | System and method of reserving, dispatching and managing university school bus | |
| CN103164751B (en) | A kind of indefinite website is without fixing circuit public transport operation system and method for running | |
| CN111340289A (en) | Genetic algorithm-based bus departure and speed adjustment optimization method and system | |
| CN110782694B (en) | Internet bus arrival and stop management optimization method | |
| CN107316092B (en) | Inter-city network taxi booking and sharing client searching and receiving and sending method | |
| CN106910336A (en) | Method for obtaining the time headway coefficient of stability | |
| CN111311950B (en) | Intelligent dispatching method and system for bus in peak period | |
| CN116071910B (en) | Flexible bus scheduling method and system | |
| CN113393137B (en) | Scheduling sharing system based on Internet of vehicles | |
| CN115641722B (en) | Class travel service system and method based on dynamic waiting time | |
| CN111243261A (en) | Bus lane borrowing use scheduling method and system | |
| DE102011050954A1 (en) | Information device used for delivering current situation of e.g. bus stop to e.g. passenger of e.g. bus, has transmitter that requests data on current situation of public vehicle | |
| CN116151538A (en) | Simulation system and method applied to intelligent bus demand balanced scheduling | |
| CN110246356B (en) | Method for determining number and type of variable-route public transport configuration vehicles | |
| CN113344336A (en) | Vehicle scheduling method and device and storage medium | |
| CN113011466A (en) | Virtual and real bus stop setting system and method | |
| CN111231993A (en) | Flexible marshalling-based regional rail transit line transportation capacity calculation method | |
| CN203260193U (en) | Bus arrival time prompting system | |
| CN111231991B (en) | Method for calculating number of trains in non-marshalling period of unit time under flexible marshalling | |
| CN111231994B (en) | Method for determining marshalling period under flexible marshalling of train |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |