CN111160720A - Automatic bus scheduling event handling method and device - Google Patents
Automatic bus scheduling event handling method and device Download PDFInfo
- Publication number
- CN111160720A CN111160720A CN201911266033.XA CN201911266033A CN111160720A CN 111160720 A CN111160720 A CN 111160720A CN 201911266033 A CN201911266033 A CN 201911266033A CN 111160720 A CN111160720 A CN 111160720A
- Authority
- CN
- China
- Prior art keywords
- time
- departure
- shift
- driver
- time interval
- 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 37
- 238000012545 processing Methods 0.000 claims description 15
- 238000009826 distribution Methods 0.000 claims description 7
- 238000003860 storage Methods 0.000 claims description 7
- 230000007306 turnover Effects 0.000 claims description 5
- 238000003672 processing method Methods 0.000 claims 1
- 230000008569 process Effects 0.000 abstract description 13
- 238000010586 diagram Methods 0.000 description 10
- 230000006870 function Effects 0.000 description 6
- 238000004590 computer program Methods 0.000 description 5
- 238000012986 modification Methods 0.000 description 5
- 230000004048 modification Effects 0.000 description 5
- 238000004422 calculation algorithm Methods 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 3
- 238000003032 molecular docking Methods 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000007704 transition 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
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/109—Time management, e.g. calendars, reminders, meetings or time accounting
- G06Q10/1093—Calendar-based scheduling for persons or groups
- G06Q10/1097—Task assignment
-
- G06Q50/40—
Abstract
The invention discloses a method and a device for automatically handling a bus dispatching event. The dispatching method has the advantages that the dispatching plan is automatically generated and the dispatching is automatically completed according to the current resource and service requirements, the problem that the dispatching cannot be carried out according to the originally compiled plan due to the fact that vehicles, drivers and the external environment exist in the dispatching process can be solved, the workload of the dispatchers is reduced, and the generation quality of the driving plan can be improved.
Description
Technical Field
The embodiment of the invention relates to the technical field of traffic, in particular to a method and a device for automatically handling a bus dispatching event.
Background
The compilation of the driving plan is one of the important basic works of the operation of the public transportation enterprise, and the compilation of the driving plan in the industry at present gradually changes from relying on manual experience to relying on a computer technology. When the original driving plan is affected by the temporary vehicle fault, the temporary driver leave or the external environment, such as road blockage, temporary traffic control and the like, in the scheduling process according to the prepared driving plan, the manual adjustment of the departure plan is basically performed by the dispatcher according to the current resource situation mastered by the dispatcher, but a larger workload can be added to the dispatcher in the adjustment process, and in addition, the dispatcher can only consider a local small part to perform the adjustment, so that the optimal effect cannot be achieved.
Disclosure of Invention
The embodiment of the invention provides a method and a device for automatically handling a bus dispatching event, which are used for improving the automatic adjustment of a departure plan, reducing the workload of a dispatcher and improving the generation quality of the departure plan.
In a first aspect, an embodiment of the present invention provides an automatic handling method for a bus scheduling event, including:
acquiring current resource and service requirements;
generating a pre-launching time table of the number of the hung shift of the whole day according to the service requirement;
and setting the information of the number of shifts for the departure time in the pre-departure timetable according to the current resources.
According to the technical scheme, the dispatching plan is automatically generated and the dispatching is automatically completed according to the current resource and service requirements, the problem that the dispatching cannot be performed according to the originally compiled plan due to the fact that vehicles, drivers and the external environment are in the dispatching process can be solved, the workload of the dispatcher is reduced, and the generation quality of the driving plan can be improved.
Optionally, the service requirement includes the number of departure in each time period and the first and last shift time of each bus route;
the generating of the pre-departure time table of the number of the hung shifts all day according to the service requirement comprises the following steps:
determining the departure time interval of each time interval according to the first and last shift time of each bus line and the departure number of each time interval in an interval average mode; if the departure number of each time interval is not divided by the corresponding time interval, determining the distribution position of the remainder which is not divided by the whole division according to the average departure time interval of the next time interval of the time interval and the average departure time interval of the time interval;
and determining the pre-departure time table of the number of the hung shift of the whole day according to the departure time interval of each time interval.
Optionally, the current resource includes a current driver on duty, a vehicle operated by the driver, a task of the driver, a working time and a working duration of the driver, a number of times of scheduling currently scheduled shifts, a last-shift operation time, a current-shift departure time, a current-time turnaround time, and a stop-and-go time of each shift;
the setting of the shift information for the departure time in the pre-departure timetable according to the current resources comprises the following steps:
determining the driver and the vehicle to be scheduled according to the current on-duty driver, the vehicle operated by the driver, the task of the driver, the on-duty time and the working time of the driver;
determining the number of the remaining shifts according to the number of times of shift planning and the number of times of shift scheduling currently;
determining the current available time according to the departure time of the current shift, the turnover time of the current moment and the stop time of each shift;
determining the next stop station according to the running time of the last shift;
and setting the shift information for the rest shifts in the departure time according to the drivers and vehicles to be scheduled, the number of the rest shifts, the current available time and the next stop station.
In a second aspect, an embodiment of the present invention provides an automatic handling device for a bus scheduling event, including:
the acquisition unit is used for acquiring current resources and service requirements;
the processing unit is used for generating a pre-issuing time table of the number of the hung shift in the whole day according to the service requirement; and setting the information of the number of shifts for the departure time in the pre-departure timetable according to the current resources.
Optionally, the service requirement includes the number of departure in each time period and the first and last shift time of each bus route;
the processing unit is specifically configured to:
determining the departure time interval of each time interval according to the first and last shift time of each bus line and the departure number of each time interval in an interval average mode; if the departure number of each time interval is not divided by the corresponding time interval, determining the distribution position of the remainder which is not divided by the whole division according to the average departure time interval of the next time interval of the time interval and the average departure time interval of the time interval;
and determining the pre-departure time table of the number of the hung shift of the whole day according to the departure time interval of each time interval.
Optionally, the current resource includes a current driver on duty, a vehicle operated by the driver, a task of the driver, a working time and a working duration of the driver, a number of times of scheduling currently scheduled shifts, a last-shift operation time, a current-shift departure time, a current-time turnaround time, and a stop-and-go time of each shift;
the processing unit is specifically configured to:
determining the driver and the vehicle to be scheduled according to the current on-duty driver, the vehicle operated by the driver, the task of the driver, the on-duty time and the working time of the driver;
determining the number of the remaining shifts according to the number of times of shift planning and the number of times of shift scheduling currently;
determining the current available time according to the departure time of the current shift, the turnover time of the current moment and the stop time of each shift;
determining the next stop station according to the running time of the last shift;
and setting the shift information for the rest shifts in the departure time according to the drivers and vehicles to be scheduled, the number of the rest shifts, the current available time and the next stop station.
In a third aspect, an embodiment of the present invention further provides a computing device, including:
a memory for storing program instructions;
and the processor is used for calling the program instruction stored in the memory and executing the automatic bus dispatching event handling method according to the obtained program.
In a fourth aspect, an embodiment of the present invention further provides a computer-readable non-volatile storage medium, which includes computer-readable instructions, and when the computer reads and executes the computer-readable instructions, the computer is caused to execute the above-mentioned automatic bus scheduling event handling method.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a schematic diagram of a system architecture according to an embodiment of the present invention;
fig. 2 is a schematic flow chart of a method for automatically handling a bus scheduling event according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of an automatic bus scheduling event handling device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention clearer, the present invention will be described in further detail with reference to the accompanying drawings, and it is apparent that the described embodiments are only a part of the embodiments of the present invention, 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.
Fig. 1 illustrates an exemplary system architecture to which embodiments of the present invention may be applied, which may be a server 100, and the server 100 may include a processor 110, a communication interface 120, and a memory 130.
The communication interface 120 is used for communicating with a terminal device, receiving and transmitting data transmitted by the terminal device, and implementing communication.
The processor 110 is a control center of the server 100, connects various parts of the entire server 100 using various interfaces and routes, performs various functions of the server 100 and processes data by operating or executing software programs and/or modules stored in the memory 130 and calling data stored in the memory 130. Alternatively, processor 110 may include one or more processing units.
The memory 130 may be used to store software programs and modules, and the processor 110 executes various functional applications and data processing by operating the software programs and modules stored in the memory 130. The memory 130 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function, and the like; the storage data area may store data created according to a business process, and the like. Further, the memory 130 may include high speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other volatile solid state storage device.
It should be noted that the structure shown in fig. 1 is only an example, and the embodiment of the present invention is not limited thereto.
Based on the above description, fig. 2 shows in detail a flow of an automatic handling method for a bus scheduling event according to an embodiment of the present invention, where the flow may be executed by an automatic handling apparatus for a bus scheduling event, and the apparatus may be located in the server 100 or the server 100.
As shown in fig. 2, the process specifically includes:
In an embodiment of the present invention, the current resources may include a current driver on duty, a vehicle operated by the driver, a task of the driver, a time on duty and a working hour of the driver, a number of scheduled shifts currently scheduled, a last shift operating time, a current shift departure time, a current turn-around time, and a stop-and-go time of each shift.
The service requirements may include the number of departures per time period and the first and last hours of each bus route.
It should be noted that the following constraint requirements are also involved in the embodiments of the present invention:
(1) standing and stopping time: the stop time is understood to be the rest time of the driver during operation.
(2) Operating time: the running time is divided according to time intervals, and automatic extraction is carried out from historical running data, so that the accuracy of the running data is ensured.
(3) And (3) restriction of departure sequence in the team: departure order within a driver team (we call this team a team). The first round within the team is sent out in strict order of execution. The last round in the group is dispatched (also called pickup) in strict order. And dispatching the cars according to the remaining dispatching number and sequence in other circles, namely: giving priority to the shift with more remaining departure numbers, and giving departure in sequence when the remaining departure numbers are the same.
(4) And (3) constraint of the team investment time period: the number of shifts (drivers, vehicles) is divided into different groups according to the time of putting into operation and the time of receiving the vehicles, and the groups are called as groups. The description information of the team comprises: the name of the team, the investment and operation time and the vehicle receiving time.
(5) And (3) logically constraining: the time conflict can be understood, namely the time conflict constraint of the vehicle and the driver in the operation process.
And step 202, generating a pre-issuing time table of the number of the hung shifts all day according to the service requirement.
Specifically, according to the first and last shift time of each bus route and the departure number of each time period, the departure time interval of each time period is determined in an interval average mode; if the departure number of each time interval is not divided by the corresponding time interval, determining the distribution position of the remainder which is not divided by the whole division according to the average departure time interval of the next time interval of the time interval and the average departure time interval of the time interval. And then determining a pre-departure schedule of the number of the hung shifts all day according to the departure time interval of each time interval.
For example, a pre-departure schedule [ t ] of the number of the outstanding shifts in the whole day is generated according to the first and last shift time and the departure time in the time interval in the input parameters of the bus plan1，t2，t3...tn-1，tn]Wherein the total number of the vehicle is N, wherein t1Time of first bus, tnThe last bus time. The specific method comprises the following steps: for example, the number of departure in a certain period is 6: 00-7: the number of departure of 00 is 8, and then according to the interval average method, all departure intervals in the period are respectively [8, 8, 8, 9, 9, 9%]The corresponding departure times are [ 6: 00,6: 08,6: 16,6: 24,6: 33,6: 42,6: 51,7: 00]The reason for the inconsistency of departure intervals is that the departure count cannot be divided exactly by the time interval span, and there is a remainder, which is assigned to the head or the end. The principle of remainder distribution is as follows: if the average departure interval of the next time interval of the time interval is larger than the time interval, the remainder is distributed to the tail part, and otherwise, the remainder is distributed to the head part of the time interval.
In addition, a departure interval smooth transition method is adopted at the time interval junction to avoid large interval change. The pre-departure timetable covers the first and last shift of the line, and meets the number of the planned train times in the time period, if the line is an uplink and downlink line, the pre-departure timetable of the uplink and the downlink needs to be generated respectively.
And 203, setting the information of the number of shifts for the departure time in the pre-departure timetable according to the current resources.
Specifically, the driver and the vehicle to be scheduled are determined according to the current on-duty driver, the current on-duty vehicle, the vehicle operated by the driver, the task of the driver, the on-duty time and the working time of the driver. The number of remaining shifts may be determined based on the scheduled number of shifts and the current number of shifts scheduled. The current available time may be determined based on the departure time of the current shift, the turnaround time at the current time, and the station stop time of each shift. The next docking station may be determined based on the last shift run time. And setting the shift information for the rest shifts in the departure time based on the driver and the vehicle to be scheduled, the number of the rest shifts, the current available time and the next stop station.
For example, the shift information is set for each departure time in the departure time order. The process of starting to hang up at a certain moment comprises the following steps:
(1) if the system is an uplink and downlink line, the departure development and calculation of the slave main station and the departure synchronization of the main station and the slave station are carried out to hang up the shift.
(2) Resource information: including the class, the class group to which the class belongs, the driver and the vehicle to be scheduled, the next stop station, the available time and the number of the remaining classes.
(3) Available time and next docking station calculation.
Initialization: in the shift in operation, the next station can be judged according to the operation direction, and the available time is the arrival time plus the current time; (its arrival time is calculated by the predictive algorithm of the vehicle in operation).
In the calculation process: available time is departure time + current turn-around time + station stop time, next station stop: the decision may be made on the last run time.
(4) And (4) calculating the number of the drivers and vehicles to be scheduled and the number of the remaining shifts.
The driver and the vehicle to be scheduled can be determined by the current driver on duty, the vehicle operated by the driver, the task of the driver and the working time and working duration of the driver.
The number of remaining shifts is the number of scheduled shifts.
(5) Dispatching plan dispatcher intervention: the intervention adjustment is carried out in two ways:
the first method is as follows: and adjusting the model input and the constraint, and automatically calculating the adjusted algorithm service according to the adjusted parameters.
The second method comprises the following steps: the departure plan within 1 one-way time can be adjusted in the departure scheduling window, and the adjusted algorithm service is automatically calculated according to the adjusted parameters.
The embodiment shows that the current resources and the service requirements are obtained, the pre-departure time table without the shift numbers hung all day is generated according to the service requirements, and the shift information is set for the departure time in the pre-departure time table according to the current resources. The dispatching method has the advantages that the dispatching plan is automatically generated and the dispatching is automatically completed according to the current resource and service requirements, the problem that the dispatching cannot be carried out according to the originally compiled plan due to the fact that vehicles, drivers and the external environment exist in the dispatching process can be solved, the workload of the dispatchers is reduced, and the generation quality of the driving plan can be improved.
In the embodiment of the invention, the model of the driving plan can be automatically generated according to the information of the bus parameter information, the time interval division, the running time and the like of the bus route, so that the quality and the efficiency of the driving plan compilation are improved. According to the vehicles, drivers, planning times and external environment road conditions of the bus route, the departure planning model is automatically completed, the quality and the efficiency of dynamically generating the driving plan are improved, and the workload of a dispatcher is reduced.
Based on the same technical concept, fig. 3 exemplarily shows a structure of an automatic bus scheduling event handling device according to an embodiment of the present invention, which may execute an automatic bus scheduling event handling process, where the device may be the server 100 shown in fig. 1, or may be in the server 100.
As shown in fig. 3, the apparatus specifically includes:
an obtaining unit 301, configured to obtain current resources and service requirements;
the processing unit 302 is configured to generate a pre-issuance schedule of the number of the unused shift of the whole day according to the service requirement; and setting the information of the number of shifts for the departure time in the pre-departure timetable according to the current resources.
Optionally, the service requirement includes the number of departure in each time period and the first and last shift time of each bus route;
the processing unit 302 is specifically configured to:
determining the departure time interval of each time interval according to the first and last shift time of each bus line and the departure number of each time interval in an interval average mode; if the departure number of each time interval is not divided by the corresponding time interval, determining the distribution position of the remainder which is not divided by the whole division according to the average departure time interval of the next time interval of the time interval and the average departure time interval of the time interval;
and determining the pre-departure time table of the number of the hung shift of the whole day according to the departure time interval of each time interval.
Optionally, the current resource includes a current driver on duty, a vehicle operated by the driver, a task of the driver, a working time and a working duration of the driver, a number of times of scheduling currently scheduled shifts, a last-shift operation time, a current-shift departure time, a current-time turnaround time, and a stop-and-go time of each shift;
the processing unit 302 is specifically configured to:
determining the driver and the vehicle to be scheduled according to the current on-duty driver, the vehicle operated by the driver, the task of the driver, the on-duty time and the working time of the driver;
determining the number of the remaining shifts according to the number of times of shift planning and the number of times of shift scheduling currently;
determining the current available time according to the departure time of the current shift, the turnover time of the current moment and the stop time of each shift;
determining the next stop station according to the running time of the last shift;
and setting the shift information for the rest shifts in the departure time according to the drivers and vehicles to be scheduled, the number of the rest shifts, the current available time and the next stop station.
Based on the same technical concept, an embodiment of the present invention further provides a computing device, including:
a memory for storing program instructions;
and the processor is used for calling the program instruction stored in the memory and executing the automatic bus dispatching event handling method according to the obtained program.
Based on the same technical concept, the embodiment of the invention also provides a computer-readable non-volatile storage medium, which comprises computer-readable instructions, and when the computer reads and executes the computer-readable instructions, the computer is enabled to execute the automatic handling method for the bus dispatching event.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the invention.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.
Claims (8)
1. A bus scheduling event automatic processing method is characterized by comprising the following steps:
acquiring current resource and service requirements;
generating a pre-launching time table of the number of the hung shift of the whole day according to the service requirement;
and setting the information of the number of shifts for the departure time in the pre-departure timetable according to the current resources.
2. The method of claim 1, wherein the service requirements include a number of departures per time period and a first and last shift time for each bus route;
the generating of the pre-departure time table of the number of the hung shifts all day according to the service requirement comprises the following steps:
determining the departure time interval of each time interval according to the first and last shift time of each bus line and the departure number of each time interval in an interval average mode; if the departure number of each time interval is not divided by the corresponding time interval, determining the distribution position of the remainder which is not divided by the whole division according to the average departure time interval of the next time interval of the time interval and the average departure time interval of the time interval;
and determining the pre-departure time table of the number of the hung shift of the whole day according to the departure time interval of each time interval.
3. The method of claim 1, wherein the current resources include a driver currently on duty, a vehicle operated by a driver, a mission of a driver, a time on duty and a length of work for a driver, a number of scheduled shifts, a number of currently scheduled shifts, a last shift time, a current shift departure time, a current time-of-day turnaround time, and a stop-time for each shift;
the setting of the shift information for the departure time in the pre-departure timetable according to the current resources comprises the following steps:
determining the driver and the vehicle to be scheduled according to the current on-duty driver, the vehicle operated by the driver, the task of the driver, the on-duty time and the working time of the driver;
determining the number of the remaining shifts according to the number of times of shift planning and the number of times of shift scheduling currently;
determining the current available time according to the departure time of the current shift, the turnover time of the current moment and the stop time of each shift;
determining the next stop station according to the running time of the last shift;
and setting the shift information for the rest shifts in the departure time according to the drivers and vehicles to be scheduled, the number of the rest shifts, the current available time and the next stop station.
4. An automatic handling device for bus dispatching events is characterized by comprising:
the acquisition unit is used for acquiring current resources and service requirements;
the processing unit is used for generating a pre-issuing time table of the number of the hung shift in the whole day according to the service requirement; and setting the information of the number of shifts for the departure time in the pre-departure timetable according to the current resources.
5. The apparatus of claim 4, wherein the service requirements include a number of departures per time period and a first and last shift time for each bus route;
the processing unit is specifically configured to:
determining the departure time interval of each time interval according to the first and last shift time of each bus line and the departure number of each time interval in an interval average mode; if the departure number of each time interval is not divided by the corresponding time interval, determining the distribution position of the remainder which is not divided by the whole division according to the average departure time interval of the next time interval of the time interval and the average departure time interval of the time interval;
and determining the pre-departure time table of the number of the hung shift of the whole day according to the departure time interval of each time interval.
6. The apparatus of claim 4, wherein the current resources include a driver currently on duty, a vehicle operated by a driver, a task of a driver, a time on duty and a length of work for a driver, a number of scheduled shifts, a number of currently scheduled shifts, a last shift time, a current shift departure time, a current turn-around time, and a stop-and-go time for each shift;
the processing unit is specifically configured to:
determining the driver and the vehicle to be scheduled according to the current on-duty driver, the vehicle operated by the driver, the task of the driver, the on-duty time and the working time of the driver;
determining the number of the remaining shifts according to the number of times of shift planning and the number of times of shift scheduling currently;
determining the current available time according to the departure time of the current shift, the turnover time of the current moment and the stop time of each shift;
determining the next stop station according to the running time of the last shift;
and setting the shift information for the rest shifts in the departure time according to the drivers and vehicles to be scheduled, the number of the rest shifts, the current available time and the next stop station.
7. A computing device, comprising:
a memory for storing program instructions;
a processor for calling program instructions stored in said memory to execute the method of any one of claims 1 to 3 in accordance with the obtained program.
8. A computer-readable non-transitory storage medium including computer-readable instructions which, when read and executed by a computer, cause the computer to perform the method of any one of claims 1 to 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911266033.XA CN111160720A (en) | 2019-12-11 | 2019-12-11 | Automatic bus scheduling event handling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911266033.XA CN111160720A (en) | 2019-12-11 | 2019-12-11 | Automatic bus scheduling event handling method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111160720A true CN111160720A (en) | 2020-05-15 |
Family
ID=70556785
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911266033.XA Pending CN111160720A (en) | 2019-12-11 | 2019-12-11 | Automatic bus scheduling event handling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111160720A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112116259A (en) * | 2020-09-22 | 2020-12-22 | 青岛海信网络科技股份有限公司 | Intelligent scheduling method and device based on time interval rule automatic queuing |
| CN112967519A (en) * | 2021-02-01 | 2021-06-15 | 青岛海信网络科技股份有限公司 | Public transport means scheduling method, device and equipment |
| CN113723754A (en) * | 2021-07-27 | 2021-11-30 | 厦门蓝斯通信股份有限公司 | Method and device for generating bus scheduling plan |
| CN114091981A (en) * | 2022-01-18 | 2022-02-25 | 青岛海信网络科技股份有限公司 | Vehicle dispatching method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105575108A (en) * | 2016-01-11 | 2016-05-11 | 深圳市蓝泰源信息技术股份有限公司 | Intelligent bus dispatching operation method |
| CN105894219A (en) * | 2016-06-28 | 2016-08-24 | 郑州天迈科技股份有限公司 | Bus automatic shift arrangement method |
| CN107122892A (en) * | 2017-04-13 | 2017-09-01 | 上海雷腾软件股份有限公司 | The method and apparatus that a kind of vehicle is arranged an order according to class and grade |
| CN108734353A (en) * | 2018-05-22 | 2018-11-02 | 青岛海信网络科技股份有限公司 | A kind of public bus network route plan generation method and device |
| CN108898872A (en) * | 2018-09-12 | 2018-11-27 | 南京行者易智能交通科技有限公司 | Shift method of adjustment based on vehicle intelligent terminal equipment and history passenger flow big data |
-
2019
- 2019-12-11 CN CN201911266033.XA patent/CN111160720A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105575108A (en) * | 2016-01-11 | 2016-05-11 | 深圳市蓝泰源信息技术股份有限公司 | Intelligent bus dispatching operation method |
| CN105894219A (en) * | 2016-06-28 | 2016-08-24 | 郑州天迈科技股份有限公司 | Bus automatic shift arrangement method |
| CN107122892A (en) * | 2017-04-13 | 2017-09-01 | 上海雷腾软件股份有限公司 | The method and apparatus that a kind of vehicle is arranged an order according to class and grade |
| CN108734353A (en) * | 2018-05-22 | 2018-11-02 | 青岛海信网络科技股份有限公司 | A kind of public bus network route plan generation method and device |
| CN108898872A (en) * | 2018-09-12 | 2018-11-27 | 南京行者易智能交通科技有限公司 | Shift method of adjustment based on vehicle intelligent terminal equipment and history passenger flow big data |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112116259A (en) * | 2020-09-22 | 2020-12-22 | 青岛海信网络科技股份有限公司 | Intelligent scheduling method and device based on time interval rule automatic queuing |
| CN112967519A (en) * | 2021-02-01 | 2021-06-15 | 青岛海信网络科技股份有限公司 | Public transport means scheduling method, device and equipment |
| CN112967519B (en) * | 2021-02-01 | 2022-05-13 | 青岛海信网络科技股份有限公司 | Public transport means scheduling method, device and equipment |
| CN113723754A (en) * | 2021-07-27 | 2021-11-30 | 厦门蓝斯通信股份有限公司 | Method and device for generating bus scheduling plan |
| CN114091981A (en) * | 2022-01-18 | 2022-02-25 | 青岛海信网络科技股份有限公司 | Vehicle dispatching method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111160720A (en) | Automatic bus scheduling event handling method and device | |
| CN108734353A (en) | A kind of public bus network route plan generation method and device | |
| CN109166303B (en) | Bus scheduling method and system | |
| CN111309470B (en) | Job scheduling method and device | |
| CN108320494B (en) | Bus dynamic scheduling method, storage medium and device | |
| CN106485434A (en) | The dispatching method of automatic conveying device and system | |
| CN111161560B (en) | Bus corridor operation order management method and device | |
| CN111695726A (en) | Bus scheduling schedule updating method and device | |
| CN110766249B (en) | Vehicle scheduling method and device, computer equipment and storage medium | |
| CN109493638B (en) | Park parking space management optimization method and device | |
| CN116030655A (en) | Vehicle control method, device and system | |
| CN113011792A (en) | Mine vehicle scheduling method and system | |
| CN108805414B (en) | Method and device for adjusting planned departure timetable of bus | |
| CN109242269A (en) | Job instruction generation method, device, system, electronic equipment and storage medium | |
| CN114822007B (en) | Automatic driving vehicle scheduling method and system | |
| CN111325424A (en) | Intelligent scheduling method and system based on improved ant colony algorithm | |
| CN112116259A (en) | Intelligent scheduling method and device based on time interval rule automatic queuing | |
| CN109523189B (en) | Vehicle scheduling method and system | |
| CN114037414A (en) | Scheduling plan generation method and device | |
| CN114548719A (en) | Bus shift acquisition method, device, equipment and storage medium | |
| CN101354763A (en) | Method and system for scheduling resource | |
| CN113807796B (en) | Collaborative method for establishing collaborative waiting area to optimize different transportation routes between 2 points | |
| CN107945577B (en) | Ship scheduling method based on navigation channel with limited traffic capacity | |
| CN111400028A (en) | Load balancing processing method for train management | |
| CN116050768B (en) | Scheduling method and device for engineering machinery service resources |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200515 |