CN111461485A - Task allocation method, device, equipment and computer readable storage medium - Google Patents

Task allocation method, device, equipment and computer readable storage medium Download PDF

Info

Publication number
CN111461485A
CN111461485A CN202010136457.0A CN202010136457A CN111461485A CN 111461485 A CN111461485 A CN 111461485A CN 202010136457 A CN202010136457 A CN 202010136457A CN 111461485 A CN111461485 A CN 111461485A
Authority
CN
China
Prior art keywords
vehicle
station
vehicles
information
time
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
Application number
CN202010136457.0A
Other languages
Chinese (zh)
Inventor
裴迪
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Ping An International Smart City Technology Co Ltd
Original Assignee
Ping An International Smart City Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Ping An International Smart City Technology Co Ltd filed Critical Ping An International Smart City Technology Co Ltd
Priority to CN202010136457.0A priority Critical patent/CN111461485A/en
Publication of CN111461485A publication Critical patent/CN111461485A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06315Needs-based resource requirements planning or analysis
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047Optimisation of routes or paths, e.g. travelling salesman problem

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Operations Research (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Marketing (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Educational Administration (AREA)
  • Traffic Control Systems (AREA)
  • Navigation (AREA)

Abstract

The invention relates to the technical field of artificial intelligence, and discloses a task allocation method.A vehicle-using route planning map is constructed through order information of a user, vehicles meeting the requirements of the order information are searched and calculated based on boarding sites carried in the order information, and the vehicles are informed to take in and send out and the user is informed to wait for taking in and sending out; the invention also provides a task allocation device, equipment and a computer readable storage medium, thereby realizing the conversion of the traditional element driving mode into the demand driving mode, allocating the tasks of the vehicles for use according to vehicle construction, greatly utilizing vehicle resources, meeting the vehicle use requirements of most passengers, avoiding the execution of single tasks of one vehicle at the same time to cause the resource waste of the vehicles on line, and planning the travel route of the vehicle according to the demand, thus not only ensuring the on-time arrival of the vehicle, but also greatly improving the riding experience of the users on the vehicles for transportation.

Description

Task allocation method, device, equipment and computer readable storage medium
Technical Field
The present invention relates to the field of artificial intelligence technologies, and in particular, to a method, an apparatus, a device, and a computer-readable storage medium for task allocation.
Background
With the continuous development of scientific technology and internet technology, especially for the development and use of intelligent platforms, great convenience is brought to users on the trip of transportation, and the users can also perform vehicle reservation and planning use without going out. When a user needs to sit on the vehicle, the vehicle using software can be used for selecting information such as vehicle using time, a vehicle type expected to be used, a vehicle getting-on place, a vehicle getting-off place and the like, submitting the information to the system platform, generating a vehicle using task by the system platform and distributing the vehicle using task to a corresponding vehicle.
However, in a scene with a large vehicle using demand, for example, traffic congestion during peak hours of getting on and off duty, if vehicle task allocation is performed according to the existing vehicle using task allocation strategy, for example, a vehicle can only execute one vehicle using task at the same time, so that the vehicle for executing the vehicle using task cannot arrive at a vehicle using place on time, and thus the online vehicle using service has a phenomenon that the allocation of vehicle resources cannot meet the vehicle using demand, and the online waiting time of a user is long, it can be seen that the problem that the application range of the vehicle using task allocation strategy is small in the prior art.
Disclosure of Invention
The invention mainly aims to provide a task allocation method, a task allocation device and a computer readable storage medium, and aims to solve the technical problem that the existing vehicle using task allocation cannot meet the vehicle using requirement, so that the waiting time of a user is too long.
In order to achieve the above object, the present invention provides a task allocation method, including the following steps:
receiving order information of a user, and generating a vehicle using route planning map according to the order information, wherein the order information comprises a vehicle getting-on site, a vehicle getting-off site and expected departure time selected by the user, and the vehicle using route planning map is a detailed driving path constructed based on the vehicle getting-on site and the vehicle getting-off site;
taking the vehicle-loading site as a search center, searching at least two vehicles which will pass through the vehicle-loading site, and acquiring vehicle build of the at least two vehicles, wherein the vehicle build comprises route planning of the vehicles and current positions of the vehicles;
matching the route plans of at least two vehicles with the user route plan graph respectively, and selecting vehicles with consistent route plans;
calculating the distance between the vehicle and the upper vehicle station and the receiving and sending time when each vehicle reaches the upper vehicle station respectively according to the current position of the selected vehicle;
and selecting a vehicle meeting the requirement of the order information to go to a pick-up user based on the distance and the pick-up time.
Optionally, the step of receiving order information of a user and generating a car route planning map according to the order information includes:
the order dynamics on the vehicle platform is monitored, and at least one piece of unprocessed order information is obtained from the order dynamics;
analyzing the at least one order information, and extracting station information in the order;
merging the same stations in the extracted station information to form a task order;
and generating a corresponding vehicle using route planning map by combining the current road condition based on the task order.
Optionally, the step of searching for at least two vehicles that will pass through the vehicle-loading site by using the vehicle-loading site as a search center and obtaining vehicle building of the at least two vehicles includes:
searching whether vehicles with vehicle working states in idle states exist in a search area established based on the preset radius size by taking the boarding station as a search center;
if so, acquiring the vehicle build of the vehicle.
Optionally, the step of calculating the distance between the vehicle and the boarding station and the pick-up time for each vehicle to reach the boarding station respectively according to the current position of the selected vehicle includes:
acquiring road information from the current position of a vehicle to the getting-on station, wherein the road information comprises road conditions and traffic regulations;
calling a satellite positioning system on the vehicle, and measuring the distance between the current position and the getting-on station in a positioning measurement mode;
according to the distance and the road condition, calculating the time length required by the vehicle to reach the boarding station from the current position according to the traffic regulation;
and calculating the arrival time of the vehicle to the boarding station and the departure time of the vehicle according to the expected departure time and the time length.
Optionally, after the step of calculating the distance between the vehicle and the pick-up station according to the selected current position of the vehicle, and the pick-up time when each vehicle reaches the pick-up station respectively, the method further includes:
calling a navigation interface on the car using platform, and marking and displaying the car using route planning diagram on the navigation interface;
and sending the marked navigation interface, the time length and the arrival time to a user.
Optionally, the step of selecting a vehicle meeting the requirement of the order information to go to the pick-up user based on the distance and the pick-up time includes:
detecting whether the vehicle is assigned a driver;
if not, searching drivers on standby around the current position of the vehicle, and calling corresponding shift information and position information of the drivers;
selecting a driver meeting the expected trigger time according to the scheduling information;
calculating a time point when the driver arrives at the position of the vehicle according to the position information;
and selecting the driver with the shortest time point, and informing the driver.
Optionally, the vehicle building further includes an on-duty driver information table, and the step of selecting the vehicle meeting the requirement of the order information to go to the pickup user based on the distance and the pickup time further includes:
if a driver is distributed on the vehicle, acquiring the duty information corresponding to the driver;
judging whether the driver can finish a pick-up task or not according to the duty information and the arrival time;
and if not, selecting second value shift information from the on-duty driver information table, and sending the order information to the corresponding on-duty driver according to the second value shift information.
In addition, to achieve the above object, the present invention provides a task assigning apparatus, including:
the order processing module is used for receiving order information of a user and generating a vehicle using route planning map according to the order information, wherein the order information comprises a vehicle getting-on station, a vehicle getting-off station and expected departure time selected by the user, and the vehicle using route planning map is a driving detailed path constructed based on the vehicle getting-on station and the vehicle getting-off station;
the searching module is used for searching at least two vehicles which pass through the upper vehicle station by taking the upper vehicle station as a searching center and acquiring vehicle built systems of the at least two vehicles, wherein the vehicle built systems comprise route plans of the vehicles and current positions of the vehicles;
the matching module is used for matching the route plans of at least two vehicles with the user route plan graph respectively and selecting the vehicles with consistent route plans;
the calculation module is used for calculating the distance between the vehicle and the getting-on station and the receiving and sending time when each vehicle reaches the getting-on station respectively according to the current position of the selected vehicle;
and the notification module is used for selecting a vehicle meeting the requirement of the order information to go to the receiving and delivering user based on the distance and the receiving and delivering time.
Optionally, the order processing module comprises an order monitoring unit, an order parsing unit, an order combining unit and a route planning unit, wherein,
the order monitoring unit is used for monitoring the order dynamics on the vehicle using platform and acquiring at least one unprocessed order message from the order dynamics;
the order analyzing unit is used for analyzing the at least one order information and extracting station information in the order;
the order combining unit is used for combining the same stations in the extracted station information to form a task order;
and the route planning unit is used for generating a corresponding vehicle using route planning map by combining the current road condition based on the task order.
Optionally, the search module comprises a radar scanning unit and a data reading unit, wherein,
the radar scanning unit is used for searching whether a vehicle with a vehicle working state in an idle state exists in a search area established based on a preset radius size by taking the boarding station as a search center;
the data reading unit is used for acquiring the vehicle building of the vehicle when the vehicle in the idle state is searched.
Optionally, the calculation module comprises a road monitoring unit, a measurement unit and a time calculation unit, wherein,
the road monitoring unit is used for acquiring road information from the current position of a vehicle to the boarding station, wherein the road information comprises road conditions and traffic regulations;
the measuring unit is used for calling a satellite positioning system on the vehicle and measuring the distance between the current position and the boarding station in a positioning measurement mode;
the time calculation unit is used for calculating the time length required by the vehicle to reach the boarding station from the current position according to the distance and the road condition and the traffic regulation; and calculating the arrival time of the vehicle to the boarding station and the departure time of the vehicle according to the expected departure time and the time length.
Optionally, the task allocation device further comprises a display processing module, configured to call a navigation interface on the car using platform, and mark and display the car using route planning map on the navigation interface; and sending the marked navigation interface, the time length and the arrival time to a user.
Optionally, the notification module includes: a detection unit, a screening unit and a sending unit, wherein,
the detection unit is used for detecting whether a driver is distributed to the vehicle;
the screening unit is used for searching drivers waiting at the periphery of the current position of the vehicle and calling the corresponding scheduling information and the position information of the drivers when the fact that the drivers are not distributed to the vehicle is detected; selecting a driver meeting the expected trigger time according to the scheduling information; calculating a time point when the driver arrives at the position of the vehicle according to the position information;
and the sending unit is used for selecting the driver with the shortest time point and informing the driver.
Optionally, the vehicle build further comprises an on-duty driver information table;
the screening unit is further used for acquiring the duty information corresponding to the driver when the driver is detected to be distributed on the vehicle;
the detection unit is also used for judging whether the driver can finish a pick-up task or not according to the duty information and the arrival time;
the sending unit is further used for selecting second-value shift information from the on-duty driver information table when the driver is judged to be unable to complete the pick-up task, and sending the order information to the corresponding on-duty driver according to the second-value shift information.
In addition, to achieve the above object, the present invention also provides a task allocation apparatus, including: a memory, a processor and a task allocation program stored on the memory and executable on the processor, the task allocation program when executed by the processor implementing the steps of the task allocation method as claimed in any one of the above.
Furthermore, to achieve the above object, the present invention also provides a computer-readable storage medium having a task allocation program stored thereon, the task allocation program, when executed by one or more processors, implementing the steps of the task allocation method as described in any one of the above.
The invention provides a task allocation method, which is characterized in that a route is planned according to a vehicle order of a user, a vehicle with the optimal corresponding route is selected for allocation based on the planned route, and after the vehicle is selected, the information of the boarding time and the station is calculated for the user, so that the traditional element driving mode is converted into a demand driving mode. The vehicle is built according to the vehicle and matched with the planned route, the matching-consistent vehicle is selected to calculate the pick-up time, and passengers and drivers are informed, so that the matching of the travel habits and travel plans of the vehicles and the passengers is realized, the tasks of the vehicles can be distributed according to the vehicle building, the vehicle resources can be greatly utilized, the vehicle demands of most of the passengers are met, the execution of single tasks of one vehicle at the same time is avoided, the resource waste of the online vehicle is caused, the travel route of the vehicle is planned according to the requirement, the vehicle can be guaranteed to arrive at the destination on time, and the riding experience of the user on the transportation vehicle is greatly improved.
Drawings
FIG. 1 is a schematic illustration of an operating environment of a vehicle distribution system in accordance with an embodiment of the present invention;
FIG. 2 is a flowchart illustrating a task allocation method according to a first embodiment of the present invention;
FIG. 3 is a flowchart illustrating a task allocation method according to a second embodiment of the present invention;
FIG. 4 is a functional block diagram of an embodiment of a task allocation apparatus provided in the present invention;
fig. 5 is a schematic structural diagram of an embodiment of a task allocation apparatus provided in the present invention.
The implementation, functional features and advantages of the objects of the present invention will be further explained with reference to the accompanying drawings.
Detailed Description
It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
The invention provides a vehicle distribution system, and referring to fig. 1, fig. 1 is a schematic structural diagram of an operating environment of the vehicle distribution system according to an embodiment of the invention.
As shown in fig. 1, the vehicle distribution system includes: a processor 101, e.g. a CPU, a communication bus 102, a user interface 103, a network interface 104, a memory 105. Wherein the communication bus 102 is used for enabling connection communication between these components. The user interface 103 may comprise a Display screen (Display), an input unit such as a Keyboard (Keyboard), and the network interface 104 may optionally comprise a standard wired interface, a wireless interface (e.g. WI-FI interface). The memory 105 may be a high-speed RAM memory or a non-volatile memory (e.g., a disk memory). The memory 105 may optionally also be a storage device separate from the aforementioned processor 101.
Those skilled in the art will appreciate that the hardware configuration of the vehicle distribution system shown in fig. 1 does not constitute a limitation of the task distribution apparatus and task distribution device of the present invention, and may include more or fewer components than those shown, or some components may be combined, or a different arrangement of components.
As shown in fig. 1, the memory 105, which is a kind of computer-readable storage medium, may include therein an operating system, a network communication program module, a user interface program module, and a program for implementing task assignment. The operating system schedules communication among modules in the vehicle distribution system and executes a task distribution program stored in a memory so as to realize vehicle distribution and notification receiving and sending of vehicle orders of passengers.
In the hardware configuration of the vehicle distribution system shown in fig. 1, the network interface 104 is mainly used for accessing a network; the user interface 103 is primarily used to monitor and retrieve the in-vehicle order information to be processed, and the processor 101 may be used to invoke the task allocation program stored in the memory 105 and perform the operations of the various embodiments of the task allocation method described below.
Based on the hardware structure of the vehicle distribution system, various embodiments of the task distribution method of the present invention are presented.
Referring to fig. 2, fig. 2 is a flowchart of a task allocation method according to an embodiment of the present invention. In this embodiment, the method is applied to a vehicle allocation system, and includes the steps of acquiring a vehicle order on an order platform of the system in real time, merging the order based on station information in the vehicle order, calculating a vehicle meeting a pick-up and delivery requirement, and finally sending order information to a corresponding vehicle to notify the corresponding vehicle of completing an order task, where the task allocation method specifically includes the following steps:
step S210, receiving order information of a user, and generating a vehicle using route planning map according to the order information;
the order information can be generated by triggering a general vehicle APP of a user, and can also be generated by a request vehicle utilization platform, the order information comprises a vehicle getting-on station, a vehicle getting-off station and expected departure time selected by the user, the vehicle utilization route planning diagram is a driving detailed path constructed based on the vehicle getting-on station and the vehicle getting-off station, the driving detailed path comprises at least one path station besides the vehicle getting-on station and the vehicle getting-off station, and the path station can also be set as a vehicle getting-on station for receiving orders in the driving process. Further, it is not necessary for the pick-up station to be the user-selected pick-up station, which may be the closest station assigned by the platform based on the user-selected pick-up station.
In practical application, the number of the boarding stations may be multiple, or one, for multiple situations, a user may select multiple boarding stations at the same time when placing an order, the multiple boarding stations may be only for the user, or may be for different passengers, when the user is for different passengers, the user is required to provide contact ways of the multiple passengers when placing an order, and after the vehicle-using planning route is determined, notification messages are respectively sent to the passengers and the user.
Step S220, searching at least two vehicles passing through the upper vehicle station by taking the upper vehicle station as a searching center, and acquiring vehicle building of the at least two vehicles;
in this embodiment, the vehicle configuration includes a route plan of the vehicle and a current position of the vehicle, and even further includes an on-duty driver information table, preferably, the on-duty driver information table is mainly used for processing an order when the vehicle is on duty and off duty, so as to avoid a long-time empty window phenomenon of the vehicle, and of course, the order may be allocated to notify the driver to go on duty in a non-off duty period.
In practical applications, the vehicle construction is that the schedule of each vehicle is arranged, and the staff can plan the vehicle running route of each vehicle and the arrival time of each station in advance, and the arrival time in the embodiment is updated according to the real-time road condition.
In practical application, the vehicle building system can be created in real time according to the order information of the user, that is, the vehicle is configured to be in an idle state or a working state, while the vehicle in the idle state does not perform the pre-configuration of the driving route, but the starting point and the terminal point can be configured first, and the setting of how to set the standing up and down needs to be performed according to the actual order information of the user.
In this embodiment, when the pick-up station is used as the center to perform the search, the search is performed within the range of which the radius is R, in practical application, the search may also be performed in a fixed area or a signal line manner, further, the search is performed to search all vehicles within the range, including the vehicles in operation and the vehicles not in operation, and after the search is completed, the search further includes distinguishing the types of the vehicles, distinguishing the operation type and the non-operation type, and screening the vehicles in the operation type to provide the pick-up and delivery task for the user.
Step S230, respectively matching route plans of at least two vehicles with the user route planning diagram, and selecting vehicles with consistent route plans;
in this embodiment, in the matching process, there may be two situations, one of which is that the getting-on station and the getting-off station in the order are just the starting point and the ending point in the vehicle building, only whether the driving directions are the same needs to be judged, and if so, the vehicle is selected as the vehicle for the order. And if the getting-on station and the getting-off station in the order are the vehicle building and are not the starting point and the terminal point, comparing whether the stations in the route are the same or not, and if so, selecting the vehicle as the vehicle for the order.
Step S240, calculating the distance between the vehicle and the boarding station and the receiving and sending time when each vehicle reaches the boarding station respectively according to the current position of the selected vehicle;
in this embodiment, when calculating the distance, the distance may be a straight-line distance from the getting-on station to the vehicle in the order, and the vehicle with the straight-line distance being less than or equal to a preset distance is selected as the matching vehicle, or a driving distance from the vehicle to the getting-on station may be calculated according to the current road condition, and the consumed time is calculated based on the driving distance and the speed limit regulation of the road, so as to obtain the delivery time.
In practical application, when matching the vehicle, the passenger information in the branch order may be specifically used to obtain the historical order of the passenger, and the existing vehicle in the historical order is used as the matching vehicle, which is not specifically limited in the embodiment of the present invention.
And step S250, selecting a vehicle meeting the requirement of the order information to go to a receiving user based on the distance and the receiving time.
In this embodiment, for any matching vehicle, at least one of the riding place and route distance, the required arrival time and the estimated price of the matching vehicle is fed back to the user of the order information, so that the user can make arrangement.
In practical application, the method also comprises the step of sending response information to a driver of the matched vehicle, and the driver terminal judges whether to return order taking willingness or not according to at least one of a vehicle order and a riding place route distance, required arrival time and estimated price of the matched vehicle so as to distribute the vehicle to send users.
In this embodiment, the order information may be a vehicle-use planning order of one user, or vehicle-use planning orders of multiple users, and when there are multiple orders in one order information, the vehicle-use planning processing method needs to perform the following processing before generating the vehicle-use planning route map:
the order dynamics on the vehicle platform is monitored, and at least one piece of unprocessed order information is obtained from the order dynamics;
analyzing the at least one order information, and extracting station information in the order;
merging the same stations in the extracted station information to form a task order;
and generating a corresponding vehicle using route planning map by combining the current road condition based on the task order.
In practical application, for a public vehicle, since the vehicle is public, it is generally considered that the vehicle is issued only when a certain number of passengers are needed, or the vehicle is continuously received before the vehicle is driven, so that the order information obtained here is specifically obtained by monitoring the vehicle orders reported by different users on an internet offer APP, and obtaining at least one unassigned vehicle order at the time point or in the time period, of course, the vehicle order may be on the same APP platform or on different APP platforms, and then combining the orders, where the combined orders have a requirement that the vehicle lines required by the users are the same, or one of the vehicle lines includes the lines of other vehicles, or the vehicle-on station and the vehicle-off station are not far apart.
And then, generating a user route planning diagram based on the combined task orders, wherein the vehicle route planning diagram comprises information of the getting-on station and the getting-off station of all the orders.
Further, after determining the task order, a vehicle meeting the condition needs to be selected for order dispatching, and in the process of selecting the vehicle, the following specific method may be implemented:
analyzing the task order and extracting the boarding station;
searching whether vehicles with vehicle working states in idle states exist in a search area established based on the preset radius size by taking the boarding station as a search center;
if so, acquiring the vehicle build of the vehicle.
In the present embodiment, it is the vehicles in the idle state that are searched for, and these vehicles build, in particular for their vehicles, vehicles that contain a route distribution that includes an origination point and an end point, as well as the shift schedule of the vehicle.
Further, a route plan corresponding to each vehicle is obtained from vehicle construction, the route plan is compared with a user planned route in the task order, vehicles with relatively close or identical routes are selected, and the vehicles are notified to carry out pick-up tasks.
In this embodiment, the vehicle receives the passenger/user and simultaneously notifies the passenger/user so that the passenger/user can plan the exit, specifically, the vehicle arrival time and the approximate forming distance are notified to the user, and these information can be obtained by performing the calculation in advance, and the specific calculation process is as follows:
acquiring road information from the current position of a vehicle to the getting-on station, wherein the road information comprises road conditions and traffic regulations;
calling a satellite positioning system on the vehicle, and measuring the distance between the current position and the getting-on station in a positioning measurement mode;
according to the distance and the road condition, calculating the time length required by the vehicle to reach the boarding station from the current position according to the traffic regulation;
and calculating the arrival time of the vehicle to the boarding station and the departure time of the vehicle according to the expected departure time and the time length.
In practical application, road traffic conditions in different time periods can change, which are factors that greatly affect the route planning for vehicle use, but in the embodiment, the road condition is predicted by combining the current time based on the user time specified by the user in the order, and the actual time of the vehicle reaching the boarding station is calculated according to the predicted road condition.
In this embodiment, if there are a plurality of boarding stations, when the actual time is calculated, calculation is performed for each boarding station, and when a route is selected, a matching vehicle may be searched for based on a user who gets on the earliest as a criterion.
Further, after the step of calculating the distance between the vehicle and the boarding station and the pick-up time when each vehicle reaches the boarding station respectively according to the current position of the selected vehicle, the method also comprises the step of calculating the pick-up time when each vehicle reaches the boarding station respectively
Calling a navigation interface on the car using platform, and marking and displaying the car using route planning diagram on the navigation interface;
and sending the marked navigation interface, the time length and the arrival time to a user.
In this embodiment, the vehicle may be properly scheduled only in the vehicle configuration for the selected vehicle, but it is not known whether the vehicle can be scheduled, for example, the vehicle has no driver, or is not in the duty schedule, when the driver needs to be matched in addition to the vehicle selected from the vehicle configuration for the selected vehicle, i.e. whether the scheduling for the vehicle is valid is further determined, specifically, when the step of selecting the vehicle meeting the requirement of the order information to go to the pickup user based on the distance and the pickup time is performed, the step of firstly querying the driver registered in the platform, selecting the driver on standby from the drivers, and then screening again according to the pickup station specifically includes:
detecting whether the vehicle is assigned a driver;
if not, searching drivers on standby around the current position of the vehicle, and calling corresponding shift information and position information of the drivers;
selecting a driver meeting the expected trigger time according to the scheduling information;
calculating a time point when the driver arrives at the position of the vehicle according to the position information;
and selecting the driver with the shortest time point, and informing the driver.
In this embodiment, when it is detected that the vehicle has no on-duty driver, the order for the user can be completed by selecting a suitable driver from the periphery of the vehicle in the above-mentioned manner, but this is only achieved when the driver is not allocated to the vehicle temporarily, or the order needs emergency treatment, and when the vehicle has an on-duty driver, that is, when an on-duty driver information table is arranged for the vehicle, the notification and arrangement according to the shift on the on-duty driver information table should be selected.
In this embodiment, the step of selecting a vehicle to go to the delivery user, which meets the requirement of the order information based on the distance and the delivery time, further includes:
detecting whether the vehicle is assigned a driver;
if the driver is distributed on the vehicle, acquiring the duty information corresponding to the driver, optionally, directly calling from a duty driver information table, or reading from the content displayed on the display device on the vehicle, wherein the duty driver information table can be obtained by analyzing from vehicle construction;
judging whether the driver can finish a pick-up task or not according to the duty information and the arrival time;
and if not, selecting second value shift information from the on-duty driver information table, and sending the order information to the corresponding on-duty driver according to the second value shift information.
In practical applications, the determination of whether the receiving task can be completed refers to whether the user can return to the shift position after arriving at the get-off station while the receiving task is executed, but the completion may also be completed with a certain error, for example, the completion may be considered as the completion of the receiving task within 15 minutes to 30 minutes, but if the shift is delayed, the driver on duty needs to be notified while the order for the vehicle is allocated, so as to remind the driver on duty of the time delay of the shift.
Specifically, when notifying the driver on duty, the driver may be notified by sending a short message through the driver's telephone number, or may be notified through the platform of the car.
In summary, the method provided by the embodiment of the application realizes the dispatching control of the public transport means (vehicles), realizes the conversion of the traditional element driving mode into the demand driving mode, meets the vehicle using requirements of most passengers, avoids the problem that the vehicles cannot arrive at the delivery site and the destination on time due to too long time consumption caused by blind parking and receiving when the drivers drive the vehicles, and greatly improves the riding experience of the users on the vehicles.
As shown in fig. 3, a flowchart of another task allocation method provided by the present application specifically includes
Step S310, receiving the conditions that the user selects a trigger site, an getting-off site, expected departure time and payment completion of an order on the APP.
In this step, the triggering station is not necessarily the final boarding station of the user, and is allocated according to the finally determined route.
And step S320, combining an optimal route according to the order, and distributing preset getting-on and getting-off positions and corresponding time for the user.
In the step, when calculating the getting-off point and the getting-on time, the road information from the current position of the vehicle to the getting-on station is obtained, wherein the road information comprises road conditions and traffic regulations;
measuring the distance between the current position and the boarding station through a GPS;
according to the distance and the road condition, calculating the time length consumed by the vehicle to go to the boarding station from the current position according to the traffic regulation;
and determining the arrival time of the vehicle at the boarding station and the departure time of the vehicle according to the expected trigger time.
In step S330, a vehicle in the nearest and idle state is selected based on the boarding location to execute the order.
In this embodiment, the user ordering the combined items corresponds to one task. The task contains a line, for example, a- > B- > C- > D, and ab C D represents the corresponding getting-on or getting-off station on this line. The system also schedules the expected time to get on or off for each station.
After the user places an order, the system will only combine one task for that order and other orders. 1 hour before the expected departure (time configurable), a human vehicle system is matched for the task. The man-vehicle construction is described below.
The simple construction of people and vehicles means that operators configure a driver for each vehicle (such as 9, 13, 15 and the like), and generally, each vehicle corresponds to each driver every day in a time period of day. The human-vehicle building system is divided into idle state and in-task state.
Every 5 seconds every other when each driver is in the driving process, the latest gps position information is reported to the server
In the present embodiment, the specific algorithm for finding the optimal vehicle according to the real-time position of the driver is as follows:
1. after the user places an order, the system forms a task R according to basic information of the user placing the order, and the form line of the task R is L _1- > L _2- > L _3- > L _ 4;
2. the system plans a travel time for task R as T (e.g., 2019-10-110: 00: 00);
3. and matching the optimal driver vehicle, namely the matched man vehicle building system for the task R by the system at the moment that the user expects to go for 1 hour, namely T-1 hour. The matched man-vehicle building rules are as follows:
screening out a man-vehicle building list corresponding to a driver in an idle state;
calculating the Gaode planned distance D from a corresponding driver to the task R starting station L _1 by each idle person vehicle, wherein the working vehicles are calculated according to the average speed of 60 kilometers per hour;
the time AT D/60 for each of the people-vehicle construction drivers to go to the departure station L _1 is calculated while satisfying the above conditions.
When the human-vehicle system corresponding to the minimum AT is locked, the vehicle immediately goes to send the passenger, and the human-vehicle system is marked as a task-in state.
In summary, the embodiment of the invention recombines the existing organization mode and flow by combining the existing passenger transportation organization mode and flow with the informatization technology, and converts the traditional element driving mode into the demand driving mode. The enterprise plans the vehicle using task in advance according to the passenger traveling habits and traveling plans, so that the vehicle using requirements of most passengers are met. If the travel demand of the passenger is not in the enterprise car utilization solution, the enterprise provides a new solution for the passenger and generates an unplanned car utilization task of the enterprise.
And the enterprise carries out man-vehicle construction according to the existing service and the instant response service so as to meet the requirement of a vehicle using task. In the whole closed loop of the vehicle using task, an organization mode evaluation system is added to evaluate the dynamic requirements of passengers and the benefits of the existing vehicle using tasks of enterprises, and the construction of the vehicles and the people is dynamically adjusted to achieve the optimal mode between the organization benefits of the enterprises and the travel benefits of the passengers.
In order to solve the above problem, an embodiment of the present invention further provides a task allocation apparatus, as shown in fig. 4, where the task allocation apparatus includes: an order processing module 41, a search module 42, a matching module 43, a calculation module 44 and a notification module 45, wherein
The order processing module 41 is configured to receive order information of a user, and generate a vehicle using path planning map according to the order information, where the order information includes a vehicle getting-on site, a vehicle getting-off site and expected departure time selected by the user, and the vehicle using path planning map is a detailed driving path constructed based on the vehicle getting-on site and the vehicle getting-off site;
a searching module 42, configured to search for at least two vehicles that will pass through the upper vehicle station by using the upper vehicle station as a search center, and obtain a vehicle establishment of the at least two vehicles, where the vehicle establishment includes a route plan of the vehicle and a current location of the vehicle;
a matching module 43, configured to match route plans of at least two vehicles with the user route plan map, respectively, and select vehicles with consistent route plans;
a calculation module 44, configured to calculate, according to the current position of the selected vehicle, a distance between the vehicle and the boarding station, and a time for each vehicle to reach the boarding station;
and the notification module 45 is configured to select a vehicle meeting the requirement of the order information to go to the pick-up user based on the distance and the pick-up time.
The execution function and the execution flow corresponding to the function based on the device are the same as the description of the task allocation method embodiment in the above embodiment of the present invention, and therefore the embodiment of the task allocation device is not described in detail in this embodiment.
In the embodiment of the present invention, the task allocation apparatus may be implemented in the form of a server, that is, the apparatus for implementing the task allocation method is set as a function of a server of a car ordering platform, as shown in fig. 5, the car ordering platform includes a server 51, a driver end 52 and a user end 53, and different orders of different users of the user end 53 may be uniformly distributed by the server 51 and finally pushed to the driver end 52. It should be understood that the schematic structural diagram shown in fig. 5 is only a preferred structural diagram provided by the embodiment of the present invention, and is not a unique structural diagram, and in other embodiments, the server 51 may also implement the operation process of the task allocation program for the vehicle order through other structural diagrams.
In a specific implementation, the position closest principle used in the foregoing method embodiment may be implemented in the server 51 through a distance policy, where the distance policy may include: if the user's time of using the bus is the current time, the server 51 will sequentially search for the buses satisfying the task order from near to far within the set distance threshold range by taking the user's place of getting on the bus as the center, and push the order, while for the drivers with a longer distance, i.e. exceeding the distance threshold set by the server 51, for example, 3-5 km, no order push will be performed.
In addition, an embodiment of the present invention further provides a task allocation device, where the task allocation device includes: the method for implementing the task allocation program when executed by the processor can refer to each embodiment of the task allocation method of the present invention, and therefore, redundant description is not repeated.
The invention also provides a computer readable storage medium.
In this embodiment, the computer-readable storage medium stores a task allocation program, and the method implemented when the vehicle order processing is executed by one or more processors may refer to each embodiment of the task allocation method of the present invention, so that redundant description is omitted.
The method and the device provided by the embodiment of the invention mainly construct a vehicle taking route planning map through the order information of the user, search and calculate the vehicle required by the load order at the boarding station of the determined user based on the information, and inform the vehicle of receiving and sending and inform the user of waiting, thereby realizing the conversion of the traditional element driving mode into the demand driving mode, meeting the vehicle taking requirements of most passengers, avoiding the problems that the driver stops and receives the passengers with blind destination when driving the vehicle, wasting too many fruits, leading the vehicle not to reach the destination on time and greatly improving the riding experience of the user on public transport.
Through the above description of the embodiments, those skilled in the art will clearly understand that the method of the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but in many cases, the former is a better implementation manner. Based on such understanding, the technical solutions of the present invention may be embodied in the form of a software product, which is stored in a storage medium (e.g., ROM/RAM), and includes instructions for causing a terminal (e.g., a mobile phone, a computer, a server, or a network device) to execute the method according to the embodiments of the present invention.
The present invention is described in connection with the accompanying drawings, but the present invention is not limited to the above embodiments, which are only illustrative and not restrictive, and those skilled in the art can make various changes without departing from the spirit and scope of the invention as defined by the appended claims, and all changes that come within the meaning and range of equivalency of the specification and drawings that are obvious from the description and the attached claims are intended to be embraced therein.

Claims (10)

1. A task allocation method is characterized by comprising the following steps:
receiving order information of a user, and generating a vehicle using route planning map according to the order information, wherein the order information comprises a vehicle getting-on site, a vehicle getting-off site and expected departure time selected by the user, and the vehicle using route planning map is a detailed driving path constructed based on the vehicle getting-on site and the vehicle getting-off site;
taking the vehicle-loading site as a search center, searching at least two vehicles which will pass through the vehicle-loading site, and acquiring vehicle build of the at least two vehicles, wherein the vehicle build comprises route planning of the vehicles and current positions of the vehicles;
matching the route plans of at least two vehicles with the user route plan graph respectively, and selecting vehicles with consistent route plans;
calculating the distance between the vehicle and the upper vehicle station and the receiving and sending time when each vehicle reaches the upper vehicle station respectively according to the current position of the selected vehicle;
and selecting a vehicle meeting the requirement of the order information to go to a pick-up user based on the distance and the pick-up time.
2. The task allocation method according to claim 1, wherein the step of receiving order information of a user and generating a lane plan map according to the order information comprises:
the order dynamics on the vehicle platform is monitored, and at least one piece of unprocessed order information is obtained from the order dynamics;
analyzing the at least one order information, and extracting station information in the order;
merging the same stations in the extracted station information to form a task order;
and generating a corresponding vehicle using route planning map by combining the current road condition based on the task order.
3. The task distribution method according to claim 2, wherein the step of searching for at least two vehicles that will pass through the upper vehicle site with the upper vehicle site as a search center and obtaining vehicle building of the at least two vehicles comprises:
searching whether vehicles with vehicle working states in idle states exist in a search area established based on the preset radius size by taking the boarding station as a search center;
if so, acquiring the vehicle build of the vehicle.
4. A task allocation method according to claim 3, wherein the step of calculating the distance of the vehicle from the pick-up station based on the current position of the selected vehicle, and the pick-up time for each vehicle to reach the pick-up station respectively comprises:
acquiring road information from the current position of a vehicle to the getting-on station, wherein the road information comprises road conditions and traffic regulations;
calling a satellite positioning system on the vehicle, and measuring the distance between the current position and the getting-on station in a positioning measurement mode;
according to the distance and the road condition, calculating the time length required by the vehicle to reach the boarding station from the current position according to the traffic regulation;
and calculating the arrival time of the vehicle to the boarding station and the departure time of the vehicle according to the expected departure time and the time length.
5. The task assigning method according to claim 4, wherein after the step of calculating the distance of the vehicle from the pick-up station according to the current position of the selected vehicle and the pick-up time for each vehicle to reach the pick-up station respectively, further comprising:
calling a navigation interface on the car using platform, and marking and displaying the car using route planning diagram on the navigation interface;
and sending the marked navigation interface, the time length and the arrival time to a user.
6. The task assigning method according to any one of claims 1 to 5, wherein the step of selecting a vehicle that satisfies the requirement of the order information to go to a pickup user based on the distance and the pickup time comprises:
detecting whether the vehicle is assigned a driver;
if not, searching drivers on standby around the current position of the vehicle, and calling corresponding shift information and position information of the drivers;
selecting a driver meeting the expected trigger time according to the scheduling information;
calculating a time point when the driver arrives at the position of the vehicle according to the position information;
and selecting the driver with the shortest time point, and informing the driver.
7. The task assignment method of claim 6, wherein the vehicle build further comprises an on-duty driver information table, and the step of selecting a vehicle to go to a pickup user that meets the requirements of the order information based on the distance and the pickup time further comprises:
if a driver is distributed on the vehicle, acquiring the duty information corresponding to the driver;
judging whether the driver can finish a pick-up task or not according to the duty information and the arrival time;
and if not, selecting second value shift information from the on-duty driver information table, and sending the order information to the corresponding on-duty driver according to the second value shift information.
8. A task assigning apparatus, characterized in that the task assigning apparatus comprises:
the order processing module is used for receiving order information of a user and generating a vehicle using route planning map according to the order information, wherein the order information comprises a vehicle getting-on station, a vehicle getting-off station and expected departure time selected by the user, and the vehicle using route planning map is a driving detailed path constructed based on the vehicle getting-on station and the vehicle getting-off station;
the searching module is used for searching at least two vehicles which pass through the upper vehicle station by taking the upper vehicle station as a searching center and acquiring vehicle built systems of the at least two vehicles, wherein the vehicle built systems comprise route plans of the vehicles and current positions of the vehicles;
the matching module is used for matching the route plans of at least two vehicles with the user route plan graph respectively and selecting the vehicles with consistent route plans;
the calculation module is used for calculating the distance between the vehicle and the getting-on station and the receiving and sending time when each vehicle reaches the getting-on station respectively according to the current position of the selected vehicle;
and the notification module is used for selecting a vehicle meeting the requirement of the order information to go to the receiving and delivering user based on the distance and the receiving and delivering time.
9. A task allocation device, characterized in that the task allocation device comprises: memory, a processor and a task allocation program stored on the memory and executable on the processor, the task allocation program when executed by the processor implementing the steps of the task allocation method according to any one of claims 1-7.
10. A computer-readable storage medium, having stored thereon a task allocation program which, when executed by one or more processors, implements the steps of the task allocation method of any one of claims 1-7.
CN202010136457.0A 2020-03-02 2020-03-02 Task allocation method, device, equipment and computer readable storage medium Pending CN111461485A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010136457.0A CN111461485A (en) 2020-03-02 2020-03-02 Task allocation method, device, equipment and computer readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010136457.0A CN111461485A (en) 2020-03-02 2020-03-02 Task allocation method, device, equipment and computer readable storage medium

Publications (1)

Publication Number Publication Date
CN111461485A true CN111461485A (en) 2020-07-28

Family

ID=71685135

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010136457.0A Pending CN111461485A (en) 2020-03-02 2020-03-02 Task allocation method, device, equipment and computer readable storage medium

Country Status (1)

Country Link
CN (1) CN111461485A (en)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112183791A (en) * 2020-08-25 2021-01-05 汉海信息技术(上海)有限公司 Network appointment scheduling method and device, electronic equipment and storage medium
CN112907144A (en) * 2021-03-31 2021-06-04 中仁车汇科技发展(深圳)有限公司 Evacuation method for dense crowd
CN113065921A (en) * 2021-04-13 2021-07-02 上海钧正网络科技有限公司 Travel order distribution and initiation method, device, terminal and storage medium
CN113642795A (en) * 2021-08-16 2021-11-12 北京瑞华高科技术有限责任公司 Vehicle resource allocation method and device
CN113902177A (en) * 2021-09-26 2022-01-07 上海擎朗智能科技有限公司 Task allocation method and system
CN114254785A (en) * 2021-12-22 2022-03-29 首约科技(北京)有限公司 Method for improving order receiving efficiency of taxi booking driver
CN115438975A (en) * 2022-09-14 2022-12-06 北京化工大学 Order assignment and vehicle path optimization method, device and equipment
CN115907405A (en) * 2022-12-08 2023-04-04 力景(北京)系统技术有限公司 Intelligent airport alarm receiving processing method and device, electronic equipment and medium
CN117236646A (en) * 2023-11-10 2023-12-15 杭州一喂智能科技有限公司 Vehicle scheduling method, device, electronic equipment and computer readable medium

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107844844A (en) * 2017-11-18 2018-03-27 共乘网络科技(北京)有限公司 Private car shared platform method of work based on green traffic
CN108416480A (en) * 2018-03-23 2018-08-17 中山市博林树投资管理有限公司 A kind of intelligence share-car matching process
CN109635980A (en) * 2018-12-21 2019-04-16 重庆呼我出行网络科技有限公司 About vehicle order allocation method and system
CN110348589A (en) * 2019-07-12 2019-10-18 北京平安快轿科技有限公司 A kind of share-car method, apparatus, computer equipment and storage medium
WO2019219088A1 (en) * 2018-05-18 2019-11-21 Beijing Didi Infinity Technology And Development Co., Ltd. Systems and methods for order allocation
CN110543960A (en) * 2019-08-20 2019-12-06 南京领行科技股份有限公司 Order dispatching method and device
CN110599300A (en) * 2019-08-30 2019-12-20 上海钧正网络科技有限公司 Order processing method and device, computer equipment and storage medium

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107844844A (en) * 2017-11-18 2018-03-27 共乘网络科技(北京)有限公司 Private car shared platform method of work based on green traffic
CN108416480A (en) * 2018-03-23 2018-08-17 中山市博林树投资管理有限公司 A kind of intelligence share-car matching process
WO2019219088A1 (en) * 2018-05-18 2019-11-21 Beijing Didi Infinity Technology And Development Co., Ltd. Systems and methods for order allocation
CN109635980A (en) * 2018-12-21 2019-04-16 重庆呼我出行网络科技有限公司 About vehicle order allocation method and system
CN110348589A (en) * 2019-07-12 2019-10-18 北京平安快轿科技有限公司 A kind of share-car method, apparatus, computer equipment and storage medium
CN110543960A (en) * 2019-08-20 2019-12-06 南京领行科技股份有限公司 Order dispatching method and device
CN110599300A (en) * 2019-08-30 2019-12-20 上海钧正网络科技有限公司 Order processing method and device, computer equipment and storage medium

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112183791A (en) * 2020-08-25 2021-01-05 汉海信息技术(上海)有限公司 Network appointment scheduling method and device, electronic equipment and storage medium
CN112907144A (en) * 2021-03-31 2021-06-04 中仁车汇科技发展(深圳)有限公司 Evacuation method for dense crowd
CN113065921A (en) * 2021-04-13 2021-07-02 上海钧正网络科技有限公司 Travel order distribution and initiation method, device, terminal and storage medium
CN113642795A (en) * 2021-08-16 2021-11-12 北京瑞华高科技术有限责任公司 Vehicle resource allocation method and device
CN113902177A (en) * 2021-09-26 2022-01-07 上海擎朗智能科技有限公司 Task allocation method and system
CN114254785A (en) * 2021-12-22 2022-03-29 首约科技(北京)有限公司 Method for improving order receiving efficiency of taxi booking driver
CN115438975A (en) * 2022-09-14 2022-12-06 北京化工大学 Order assignment and vehicle path optimization method, device and equipment
CN115438975B (en) * 2022-09-14 2023-04-25 北京化工大学 Order assignment and vehicle path optimization method, device and equipment
CN115907405A (en) * 2022-12-08 2023-04-04 力景(北京)系统技术有限公司 Intelligent airport alarm receiving processing method and device, electronic equipment and medium
CN117236646A (en) * 2023-11-10 2023-12-15 杭州一喂智能科技有限公司 Vehicle scheduling method, device, electronic equipment and computer readable medium
CN117236646B (en) * 2023-11-10 2024-03-12 杭州一喂智能科技有限公司 Vehicle scheduling method, device, electronic equipment and computer readable medium

Similar Documents

Publication Publication Date Title
CN111461485A (en) Task allocation method, device, equipment and computer readable storage medium
CN108765933B (en) Method, device, equipment and storage medium for recommending boarding points
US20190057479A1 (en) Systems and methods for dispatching vehicles
CN112419706B (en) Real-time single processing method and server
CN109673162A (en) For providing the method and apparatus of transportation service information
CN105551236B (en) Vehicle dispatching method and vehicle dispatch system
JP6656004B2 (en) Vehicle dispatch processing system
CN110136427A (en) A kind of automatic Pilot taxi dispatching system based on car networking big data
CN107845253B (en) Reservation order early warning method and server
GB2501075A (en) Dynamically demand-responsive transport
JP2019028862A (en) Management method, management apparatus, and management system
JP2019168827A (en) Information processor and program
JP2019219845A (en) Vehicle management system and vehicle management method
CN106981189B (en) intelligent bus running route setting method and system
JP2004185362A (en) Automatic taxi dispatch system using mobile terminal
JP2004227262A (en) Quick-response vehicle getting-on/off system, method and program
CN112447054B (en) Method and apparatus for controlling vehicle travel
CN113808381B (en) Public transport scheduling method, server and storage medium
CN114037260A (en) Method and device for dispatching and guiding bus junction station
CN113191512A (en) Vehicle reservation method and device
JP2021015379A (en) Vehicle allocation processing device
CN113240897A (en) Vehicle scheduling method, system and computer readable storage medium
JP3755518B2 (en) Mobile vehicle allocation program and mobile vehicle allocation method
CN112669534B (en) Service vehicle distribution method and device
JP7427548B2 (en) Vehicle dispatch control device, vehicle dispatch control system, and vehicle dispatch control method

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