Intelligent logistics vehicle management scheduling method, device and equipment and storage medium

Abstract

The invention provides an intelligent logistics vehicle management scheduling method, device and equipment and a storage medium, and relates to the technical field of logistics, and the method comprises the steps: obtaining a first driving path of a plurality of distribution vehicles in a park and a second driving path of a plurality of to-be-scheduled distribution vehicles to enter the park; comparing the first driving path with the second driving path, determining an initial sequence of each to-be-dispatched distribution vehicle entering the park, and calculating waiting time required by each to-be-dispatched distribution vehicle entering the park; obtaining a distribution task of each to-be-dispatched distribution vehicle, and determining the remaining distribution duration of each to-be-dispatched distribution vehicle according to the distribution task; and in combination with the remaining delivery duration and the waiting duration, adjusting the initial sequence, and determining the final sequence of the delivery vehicles to be dispatched entering the park. The system has the technical effects that orderly flow of logistics vehicles in the park is ensured, the situation of vehicle congestion in the park is reduced, and the overall logistics efficiency is improved.

Description

Technical Field

[0001] The present application relates to the field of logistics technology, and specifically to a smart logistics vehicle management and scheduling method, device, equipment and storage medium. Background Art

[0002] With the rapid development of industries such as e-commerce, logistics companies have more shipping and unloading businesses, resulting in a large number of logistics vehicles entering and leaving the park. However, these vehicles have no effective information guidance in the factory area and can stop at will, which often leads to a series of problems such as vehicle congestion in the factory area, inefficient unloading, and untimely shipment.

[0003] Existing technologies usually preset the vehicle's route and schedule before the vehicle departs, which works effectively when the traffic volume in the park is small. However, when the traffic volume in the park is large, the actual traffic conditions may deviate greatly from the expected ones, resulting in the above method being unable to flexibly respond to changes, which may cause vehicle congestion in the park, thereby reducing the overall logistics efficiency. Summary of the invention

[0004] The present application provides a smart logistics vehicle management and scheduling method, device, equipment and storage medium, which are used to ensure the orderly flow of logistics vehicles within the park, reduce the occurrence of vehicle congestion in the park, and improve overall logistics efficiency.

[0005] In the first aspect, the present application provides a smart logistics vehicle management and scheduling method, the method comprising: obtaining a first driving path of multiple delivery vehicles in a park and a second driving path of multiple delivery vehicles to be scheduled to enter the park; comparing the first driving path and the second driving path, determining the initial order of each of the delivery vehicles to be scheduled to enter the park and calculating the waiting time required for each of the delivery vehicles to be scheduled to enter the park; obtaining the delivery task of each of the delivery vehicles to be scheduled, and determining the remaining delivery time of each of the delivery vehicles to be scheduled based on the delivery task; adjusting the initial order in combination with the remaining delivery time and the waiting time, and determining the final order of each of the delivery vehicles to be scheduled to enter the park.

[0006] By adopting the above technical solution, by comparing the first driving path and the second driving path, the initial order of each delivery vehicle to be dispatched to enter the park is determined, and the waiting time required for each delivery vehicle to be dispatched to enter the park is calculated, which is helpful for pre-planning and guiding vehicles to avoid sudden vehicle congestion. Subsequently, the delivery tasks of each delivery vehicle to be dispatched are obtained, and the remaining delivery time of each vehicle is determined according to the delivery tasks. Combined with the remaining delivery time and the waiting time, the initial order is further adjusted to finally determine the final order of each delivery vehicle to be dispatched to enter the park. On the basis of considering the current location and driving path of the vehicle, combined with the specific delivery tasks and remaining delivery time of the vehicle, by dynamically adjusting the order of vehicles entering the park, not only traffic congestion caused by random parking of vehicles in the park is avoided, but also the unloading and shipping efficiency of the vehicle is greatly improved, ensuring the orderly flow of logistics vehicles in the park, reducing the occurrence of vehicle congestion in the park, and improving the overall logistics efficiency.

[0007] Optionally, the obtaining of the first driving paths of multiple delivery vehicles in the park and the second driving paths of multiple delivery vehicles to be dispatched to enter the park includes: obtaining target warehouses corresponding to the multiple delivery vehicles in the park, the target warehouses including at least one warehouse; generating the first driving path of each delivery vehicle according to the target warehouses and the current positions of each delivery vehicle; obtaining the target warehouses corresponding to the multiple delivery vehicles to be dispatched to enter the park; and generating the second driving path of each delivery vehicle to be dispatched according to the target warehouses corresponding to each delivery vehicle to be dispatched.

[0008] By adopting the above technical solution, by obtaining the target warehouse and current position of the delivery vehicles in the park and generating the first driving path, the movement trajectory and destination of the vehicles in the park can be accurately grasped. This helps to plan the traffic flow in the park in advance and avoid vehicles stopping randomly in the park, causing traffic congestion and waste of resources. Secondly, by obtaining the target warehouse of the delivery vehicles to be dispatched to enter the park and generating the second driving path, the vehicles about to enter the park can be effectively pre-dispatched and route planned. This method ensures the correspondence between the driving paths and target warehouses of vehicles inside and outside the park, avoiding stagnation and confusion caused by unclear paths after vehicles enter the park.

[0009] Optionally, generating a first driving path for each delivery vehicle based on the target warehouse and the current position of each delivery vehicle includes: acquiring a road network topology structure within the park; generating multiple driving routes for each delivery vehicle based on the road network topology structure; calculating the driving time of each delivery vehicle on each driving route in combination with the current position of each delivery vehicle and the multiple driving routes of each delivery vehicle; and selecting the driving route with the shortest driving time for each delivery vehicle as the first driving path for each delivery vehicle.

[0010] By adopting the above technical solution and obtaining the topological structure of the road network in the park, we can understand the road distribution and traffic conditions in the park in detail, and provide basic data for generating multiple driving routes. Based on the multiple driving routes generated by these data, we can provide multiple options for each delivery vehicle and avoid delays caused by congestion on a single route. By combining the current position of each delivery vehicle and multiple driving routes, the driving time is calculated, and the time consumption of each route can be accurately predicted. Not only the real-time nature of the current position of the vehicle is taken into account, but also the traffic capacity and possible congestion of different sections of the park are comprehensively considered, so that the calculation of driving time is more accurate.

[0011] Optionally, the comparing the first driving path and the second driving path, determining the initial order of each of the to-be-scheduled delivery vehicles entering the park and calculating the waiting time required for each of the to-be-scheduled delivery vehicles to enter the park, includes: determining the first delivery vehicle and the first to-be-scheduled delivery vehicle with path conflict, wherein a critical path node in the second driving path corresponding to the first delivery vehicle exists in the first driving path corresponding to the first to-be-scheduled delivery vehicle; calculating the first time when the first delivery vehicle arrives at the corresponding critical path node, and determining the waiting time for the first to-be-scheduled delivery vehicle to give way to the first delivery vehicle based on the first time; determining the waiting time of the to-be-scheduled delivery vehicles with no path conflict to be zero, and determining the initial order of each of the to-be-scheduled delivery vehicles entering the park based on the waiting time of each of the to-be-scheduled delivery vehicles.

[0012] By adopting the above technical solution, by determining the first delivery vehicle and the first delivery vehicle to be dispatched with path conflicts and identifying the critical path nodes, the parts that may cause traffic conflicts can be accurately identified. This process ensures a comprehensive grasp of the driving paths of vehicles inside and outside the park, and can foresee and solve possible congestion problems in advance. Calculating the first time the first delivery vehicle arrives at the critical path node and determining the waiting time of the first delivery vehicle to be dispatched based on this can effectively arrange the entry time of the delivery vehicle to be dispatched and avoid conflicts at the critical path nodes. For delivery vehicles to be dispatched that do not have path conflicts, their waiting time is determined to be zero, which ensures that they can quickly enter the park, avoid unnecessary waiting, and ensure the flexibility and efficiency of vehicle dispatching within the park.

[0013] Optionally, the initial order is adjusted in combination with the remaining delivery time and the waiting time, including: predicting the predicted time for each of the delivery vehicles to be dispatched to complete the remaining delivery tasks; calculating the sum of the predicted time and the waiting time for each of the delivery vehicles to be dispatched to obtain a target time; obtaining the remaining delivery time of each of the delivery vehicles to be dispatched, and calculating the difference between the remaining delivery time of each of the delivery vehicles to be dispatched and the target time; and adjusting the initial order according to the size of the difference.

[0014] By adopting the above technical solution, the order of vehicle entry is dynamically adjusted by combining the remaining delivery time and waiting time, thus realizing efficient dispatching of smart logistics vehicles. Through accurate prediction and reasonable adjustment, the ineffective waiting time of vehicles inside and outside the park is reduced, the overall delivery efficiency is improved, and the logistics tasks are completed on time. At the same time, this dispatching method improves the road utilization rate within the park, reduces the risk of traffic congestion, and improves the operational efficiency and customer satisfaction of the logistics company.

[0015] Optionally, after determining the final order in which each of the to-be-scheduled delivery vehicles enters the park, it also includes: obtaining real-time traffic flow information within the park; adjusting the second driving path of each of the to-be-scheduled delivery vehicles according to the real-time traffic flow information; calculating the time for each of the to-be-scheduled delivery vehicles to arrive at the target warehouse based on the adjusted second driving path; if the time for each to-be-scheduled delivery vehicle to arrive at the target warehouse does not meet preset requirements, obtaining the number and position of the to-be-scheduled delivery vehicles that do not meet the preset requirements; determining the final driving path of each of the to-be-scheduled delivery vehicles according to the number and position of the to-be-scheduled delivery vehicles that do not meet the preset requirements.

[0016] By adopting the above technical solution, by obtaining real-time traffic flow information in the park, the current traffic conditions in the park can be dynamically grasped. This real-time information provides reliable basic data for route adjustment, ensuring the timeliness and accuracy of scheduling decisions. According to the real-time traffic flow information, the second driving path of each dispatched delivery vehicle is adjusted to help avoid the current congested road sections and choose a smoother path. The waiting time and driving time of vehicles in the park are significantly reduced, and the flow efficiency of vehicles is improved.

[0017] Optionally, the method also includes: obtaining real-time location information and status information of each of the delivery vehicles to be dispatched after the vehicles to be dispatched enter the park; determining whether the driving path of each of the delivery vehicles to be dispatched is consistent with the corresponding second driving path based on the real-time location information and the status information; if the driving path of a delivery vehicle to be dispatched is inconsistent with the corresponding second driving path, generating early warning information and sending the early warning information to the terminal device of the management personnel, so that the management personnel can manage and dispatch the delivery vehicles to be dispatched.

[0018] By adopting the above technical solutions, through real-time monitoring and early warning mechanisms, efficient management and dispatch of dispatched delivery vehicles are achieved. Through dynamic adjustment and timely intervention, the smooth operation of vehicles in the park is ensured, delays caused by path deviation are reduced, the overall delivery efficiency is improved, the operating costs are reduced, and the operation level and customer satisfaction of the logistics company are improved.

[0019] In a second aspect, the present application provides a smart logistics vehicle management and scheduling device, which includes: an acquisition module, a comparison module, a determination module and an adjustment module; wherein the acquisition module is used to acquire a first driving path of multiple delivery vehicles in a park and a second driving path of multiple delivery vehicles to be scheduled to enter the park; the comparison module is used to compare the first driving path and the second driving path, determine the initial order of each delivery vehicle to be scheduled to enter the park and calculate the waiting time required for each delivery vehicle to be scheduled to enter the park; the determination module is used to acquire the delivery task of each delivery vehicle to be scheduled, and determine the remaining delivery time of each delivery vehicle to be scheduled based on the delivery task; the adjustment module is used to adjust the initial order in combination with the remaining delivery time and the waiting time, and determine the final order of each delivery vehicle to be scheduled to enter the park.

[0020] In the third aspect, the present application provides an electronic device, which adopts the following technical solution: it includes a processor, a memory, a user interface and a network interface, the memory is used to store instructions, the user interface and the network interface are used to communicate with other devices, and the processor is used to execute the instructions stored in the memory so that the electronic device executes a computer program such as any of the above-mentioned smart logistics vehicle management and scheduling methods.

[0021] In a fourth aspect, the present application provides a computer-readable storage medium, which adopts the following technical solution: it stores a computer program that can be loaded by a processor and execute any of the above-mentioned smart logistics vehicle management and scheduling methods.

[0022] In summary, the present application includes at least one of the following beneficial technical effects: 1. It not only avoids traffic congestion caused by random parking of vehicles in the park, but also greatly improves the unloading and delivery efficiency of vehicles, ensures the orderly flow of logistics vehicles in the park, reduces the occurrence of vehicle congestion in the park, and improves the overall logistics efficiency; 2. Through dynamic adjustment and timely intervention, the smooth operation of vehicles in the park is ensured, delays caused by route deviation are reduced, overall delivery efficiency is improved, operating costs are reduced, and the logistics company's operating level and customer satisfaction are improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0023] Figure 1 It is a flowchart of a smart logistics vehicle management and scheduling method provided in an embodiment of the present application; Figure 2 It is a structural diagram of a smart logistics vehicle management and dispatching device provided in an embodiment of the present application; Figure 3 It is a structural schematic diagram of an electronic device provided in an embodiment of the present application.

[0024] Description of reference numerals: 1000, electronic device; 1001, processor; 1002, communication bus; 1003, user interface; 1004, network interface; 1005, memory. DETAILED DESCRIPTION

[0025] In order to enable those skilled in the art to better understand the technical solutions in this specification, the technical solutions in the embodiments of this specification will be clearly and completely described below in conjunction with the drawings in the embodiments of this specification. Obviously, the described embodiments are only part of the embodiments of this application, not all of the embodiments.

[0026] In the description of the embodiments of the present application, words such as "illustrative", "for example" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "illustrative", "for example" or "for example" in the embodiments of the present application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "illustrative", "for example" or "for example" is intended to present related concepts in a concrete way.

[0027] With the rapid development of e-commerce and other industries, the business volume of logistics companies in shipping and unloading has increased significantly, resulting in a large number of logistics vehicles entering and leaving the factory. However, these vehicles lack effective information guidance in the factory and stop at random, which often leads to a series of problems such as vehicle congestion in the factory, low unloading efficiency, and untimely shipment. These problems not only make the business efficiency of enterprises low, but also seriously restrict the development of logistics companies.

[0028] In order to solve the above problems, this application proposes a smart logistics vehicle scheduling method. This method obtains the first driving paths of multiple delivery vehicles in the park and the second driving paths of multiple delivery vehicles to be scheduled to enter the park, combines path comparison and waiting time calculation, optimizes the entry order and driving path of the vehicles, and improves the scientificity and efficiency of vehicle scheduling.

[0029] Figure 1 It is a flow chart of a smart logistics vehicle management and dispatching method provided by an embodiment of the present application. It should be understood that although Figure 1 The steps in the flowchart are shown in sequence as indicated by the arrows, but the steps are not necessarily executed in the order indicated by the arrows; unless otherwise specified in this document, there is no strict order restriction for the execution of the steps, and the steps may be executed in other orders; and Figure 1 At least part of the steps may include multiple sub-steps or multiple stages. These sub-steps or stages are not necessarily executed at the same time, but can be executed at different times. The execution order of these sub-steps or stages is not necessarily sequential, but can be executed in turn or alternately with other steps or at least part of the sub-steps or stages of other steps.

[0030] This application discloses a smart logistics vehicle management and scheduling method. Figure 1 As shown, the method includes S101-S104.

[0031] S101, obtaining first driving paths of a plurality of delivery vehicles in the park and second driving paths of a plurality of delivery vehicles to be dispatched and to enter the park.

[0032] Multiple delivery vehicles are vehicles that are currently performing delivery tasks in the park. These vehicles have entered the park and are traveling on different paths to their respective target warehouses or distribution points for loading, unloading or other logistics-related operations. By tracking the driving paths of these vehicles in real time, we can ensure that their movement in the park is efficient and conflict-free.

[0033] Multiple delivery vehicles to be dispatched are vehicles that have not yet entered the park and are waiting to be dispatched to enter the park for delivery tasks. These vehicles may be in the waiting area outside the park or on the way to the park. It is necessary to plan the best entry time and driving path for these vehicles to avoid conflicts with delivery vehicles in the park and ensure efficient dispatch after entering the park.

[0034] In one example, the first driving paths of multiple delivery vehicles currently running in the park are obtained. This is achieved by collecting the real-time location data of each delivery vehicle and its target warehouse information. The target warehouse of each delivery vehicle may include one or more warehouses. By obtaining the above information, the first driving path of each delivery vehicle can be generated.

[0035] At the same time, it is also necessary to obtain the second driving paths of multiple delivery vehicles to be dispatched to enter the park. This is achieved by collecting the real-time location data of these delivery vehicles to be dispatched and their corresponding target warehouse information. Based on this information, the second driving path of each delivery vehicle to be dispatched is generated. The specific process is similar to generating the first driving path. Combined with the current location and target warehouse of each delivery vehicle to be dispatched, the road network topology in the park is used to calculate multiple possible driving routes, and the route with the shortest driving time is selected as the second driving path of the delivery vehicle to be dispatched.

[0036] The main purpose of implementing the above steps is to ensure that the system can fully grasp the driving paths of all relevant vehicles inside and outside the park, so as to provide basic data support for subsequent scheduling decisions. By obtaining and analyzing these driving paths, the dynamic positions and driving routes of vehicles inside and outside the park can be effectively compared, possible path conflicts can be identified, and the entry order and driving paths of vehicles can be optimized accordingly, traffic congestion in the park can be reduced, and the scheduling efficiency of logistics vehicles can be improved.

[0037] Based on the above embodiment, as an optional implementation, in S101, obtaining the first driving paths of multiple delivery vehicles in the park and the second driving paths of multiple delivery vehicles to be dispatched to enter the park specifically includes the following steps: S10, obtaining target warehouses corresponding to a plurality of delivery vehicles in the park, wherein the target warehouses include at least one warehouse.

[0038] S11, generating a first driving path for each delivery vehicle according to the target warehouse and the current position of each delivery vehicle.

[0039] In one example, the target warehouse and current location of each delivery vehicle to be dispatched are obtained through the management system of the dispatch center. This information is usually obtained in real time through the GPS positioning system and the logistics management platform, and is dynamically updated. This data is then used to generate the first driving path for each vehicle.

[0040] Based on the above embodiment, as an optional implementation, in S11, generating the first driving path of each delivery vehicle according to the target warehouse and the current position of each delivery vehicle specifically includes the following steps: S1000, obtaining the road network topology structure within the park.

[0041] S1001, generating multiple driving routes for each delivery vehicle according to the road network topology.

[0042] Specifically, the road network topology, which includes the nodes and connections of the road, is used to calculate multiple feasible routes from the vehicle's current location to the target warehouse. Factors considered for each route include road length, traffic conditions, and access restrictions.

[0043] After generating multiple driving routes, the route information is sent to the on-board terminal devices of each delivery vehicle. The on-board terminal devices will display multiple optional routes and guide the vehicle to drive along the optimal route through the navigation system. At the same time, the road and vehicle conditions are continuously monitored. If the main route is congested or has other problems, the vehicle will be advised to switch to an alternative route.

[0044] S1002, calculating the driving time of each delivery vehicle on each driving route in combination with the current position of each delivery vehicle and the multiple driving routes of each delivery vehicle.

[0045] In one example, the current location of each delivery vehicle and detailed path information for each route are combined with real-time traffic data to calculate travel time. The latest traffic conditions, including road congestion and other factors that affect travel speed, are obtained through the traffic management platform. This data is combined with the road length and speed limit information for each route to calculate the estimated travel time for each route.

[0046] For example, the road conditions and current traffic flow on each route are analyzed. If a section of a route is congested, the estimated travel time for that section is increased accordingly to reflect the longer travel time. The length of the road, speed limit, and real-time traffic conditions are taken into account to accurately estimate the total travel time for each route.

[0047] After generating the estimated driving time, the time of each route is compared and the optimal route is selected. These calculation results are sent to the vehicle terminal equipment of each delivery vehicle, providing detailed information on the driving time and recommended routes. The vehicle terminal equipment will display the most recommended route and guide the vehicle to drive along the optimal path through the navigation system.

[0048] S1003: Selecting a driving route with the shortest driving time for each delivery vehicle as a first driving route for each delivery vehicle.

[0049] S12, obtaining target warehouses corresponding to a plurality of delivery vehicles to be dispatched to enter the park.

[0050] S13, generating a second driving path for each delivery vehicle to be dispatched according to the target warehouses corresponding to each delivery vehicle to be dispatched.

[0051] In one example, the current location of each delivery vehicle to be dispatched and the location of the target warehouse are obtained. This information is obtained in real time through the GPS positioning system and the logistics management platform. Then, the second driving path is generated using the road network topology and real-time traffic data. The specific generation method can refer to the above embodiment, and will not be described in detail here.

[0052] S102, comparing the first driving route and the second driving route, determining the initial order of each delivery vehicle to be dispatched to enter the park and calculating the waiting time required for each delivery vehicle to be dispatched to enter the park.

[0053] In one example, it is necessary to obtain and compare the first driving paths of multiple delivery vehicles in the park and the second driving paths of multiple delivery vehicles to be dispatched to enter the park. The main purpose of comparing these driving paths is to identify potential path conflicts and traffic congestion points, so as to optimize the entry order of the delivery vehicles to be dispatched and ensure that the logistics vehicles inside and outside the park can operate efficiently. Through this path comparison, the system can predict and solve possible traffic problems in advance, avoiding vehicle congestion and delays caused by path conflicts.

[0054] Specifically, the real-time location data and driving path information of vehicles are used to comprehensively monitor the road network within the park. Based on this data, the system will perform overlapping analysis on the first driving path (the path of vehicles running in the park) and the second driving path (the path of vehicles waiting to enter the park) to identify possible path intersections and time nodes. Through this analysis, it is possible to determine which path segments may have multiple vehicles passing by at the same time at a specific point in time, thereby identifying potential congestion risks.

[0055] After identifying the route conflicts and potential congestion points, the order in which the delivery vehicles to be dispatched enter the park is determined according to their actual conditions. The principles for determining the order of entry include factors such as the urgency of the task of the delivery vehicles to be dispatched, the remaining delivery time, and the waiting time of the vehicles. Taking these factors into consideration, vehicles with urgent tasks and shorter remaining delivery time are given priority to enter the park to maximize overall logistics efficiency.

[0056] Next, the waiting time required for each delivery vehicle to be dispatched to enter the park is calculated. The calculation of the waiting time is based on the current driving conditions of vehicles in the park and the real-time traffic conditions of the road network. By simulating different entry sequences and path selections, the waiting time of each vehicle under each scheme is evaluated, and finally the scheduling scheme with the shortest total waiting time is selected. Specifically, based on the results of the path overlap analysis, the waiting time required for each delivery vehicle to be dispatched to enter the park at different time points is predicted, and the entry sequence is dynamically adjusted based on the mission urgency and real-time location of the vehicle to ensure that each vehicle enters the park at the most appropriate time.

[0057] The main purpose of implementing the above steps is to achieve efficient dispatching of logistics vehicles inside and outside the park, reduce the waiting time of vehicles at the park entrance and on the road, and improve the overall logistics operation efficiency. By accurately matching the driving path and optimizing the entry sequence, path conflicts and traffic congestion can be effectively avoided, ensuring smooth flow of vehicles within the park and maximizing loading and unloading efficiency.

[0058] Based on the above embodiment, as an optional implementation, in S102, comparing the first driving path and the second driving path, determining the initial order of each to-be-dispatched delivery vehicle entering the park and calculating the waiting time required for each to-be-dispatched delivery vehicle to enter the park specifically include the following steps: S20, determining a first delivery vehicle and a first delivery vehicle to be dispatched that have path conflicts, wherein a critical path node in a second driving path corresponding to the first delivery vehicle exists in a first driving path corresponding to the first delivery vehicle to be dispatched.

[0059] In one example, the second driving path of the first delivery vehicle and the first driving path of the first delivery vehicle to be dispatched are first obtained. Then, the critical path nodes in the two paths are analyzed. The critical path nodes are those critical intersections, turning points or sections with heavy traffic in the path.

[0060] Each critical path node in the second driving path of the first delivery vehicle is checked one by one to determine whether these nodes exist in the first driving path of the first delivery vehicle to be dispatched. If the same critical path nodes are found, it is determined that there is a path conflict between the two vehicles at these nodes.

[0061] For example, suppose the second driving path of the first delivery vehicle passes through an important intersection, and the first driving path of the first delivery vehicle to be dispatched also passes through the same intersection. The system will mark this intersection as a conflict node and identify the related vehicles, namely the first delivery vehicle and the first delivery vehicle to be dispatched.

[0062] After the path conflict is determined, appropriate measures are taken to resolve the conflict. For example, the driving path of one of the vehicles can be replanned, or the departure time of the vehicle can be adjusted to ensure that the two vehicles do not pass the same key path node at the same time. The adjusted path information will be sent to the vehicle terminal equipment of the relevant vehicles, and the vehicles will drive according to the new path or time instructions.

[0063] S21, calculating a first time when the first delivery vehicle arrives at the corresponding key path node, and determining, based on the first time, a waiting time for the first delivery vehicle to be dispatched to give way to the first delivery vehicle.

[0064] In one example, the second driving path of the first delivery vehicle and its key path nodes are obtained. Then, the time when the first delivery vehicle arrives at these key path nodes is calculated, and this time is called the first time. The time when the first delivery vehicle arrives at the key path nodes is accurately predicted by using real-time traffic data, the current speed of the vehicle, and the driving distance.

[0065] Once the first time that the first delivery vehicle arrives at the critical path node is determined, this time is compared with the travel path of the first delivery vehicle to be dispatched. If it is found that the first delivery vehicle to be dispatched will also arrive at the critical path node at the same time or a similar time, the first delivery vehicle to be dispatched needs to be arranged to avoid the first delivery vehicle.

[0066] In order to determine the waiting time of the first delivery vehicle to be dispatched, the time difference between the two vehicles arriving at the critical path node is calculated. For example, if the first delivery vehicle is expected to arrive at the critical path node in 12 minutes, and the first delivery vehicle to be dispatched is expected to arrive at the node in 11 minutes, it is determined that the first delivery vehicle to be dispatched waits for 1 minute to avoid the first delivery vehicle. This waiting instruction is sent to the vehicle-mounted terminal device of the first delivery vehicle to be dispatched, instructing it to stop briefly at an appropriate location until the first delivery vehicle passes the critical path node.

[0067] S22, determining the waiting time of the delivery vehicles to be dispatched without path conflict to be zero, and determining the order of the delivery vehicles to be dispatched entering the park according to the waiting time of each delivery vehicle to be dispatched.

[0068] In one example, the waiting time of each delivery vehicle to be dispatched is determined according to the result of S21. For delivery vehicles to be dispatched without path conflicts, their waiting time is set to zero, which means that these vehicles can directly enter the park without waiting.

[0069] Next, the dispatched delivery vehicles with route conflicts are sorted and their order of entering the park is determined according to their calculated waiting time. Vehicles with shorter waiting time are given priority to enter the park to reduce the total waiting time and avoid long traffic delays.

[0070] For example, suppose there are three delivery vehicles to be dispatched: Car A, Car B, and Car C. According to the previous calculation, Car A has no path conflict and its waiting time is zero; Car B and Car C have path conflicts, Car B needs to wait for 3 minutes and Car C needs to wait for 5 minutes. Car A is first arranged to enter the park because Car A does not need to wait. Then, Car B is arranged to enter the park after waiting for 3 minutes, and finally Car C is arranged to enter the park after waiting for 5 minutes.

[0071] The entry order and waiting time information of each dispatched delivery vehicle are sent to the vehicle's on-board terminal device. The vehicles enter the park in the order and time indicated by the system to ensure that the whole process is orderly.

[0072] S103, obtaining the delivery task of each delivery vehicle to be dispatched, and determining the remaining delivery time of each delivery vehicle to be dispatched according to the delivery task.

[0073] In one example, the delivery task of each delivery vehicle to be dispatched is obtained. The delivery task information usually includes the target warehouse or delivery point that the vehicle needs to go to, the type and quantity of goods to be delivered, the estimated loading and unloading time, etc. The main purpose of obtaining this information is to fully understand the specific delivery requirements of each delivery vehicle to be dispatched, so as to provide necessary data support for the subsequent calculation of the remaining delivery time.

[0074] Specifically, a data request is sent to each delivery vehicle to be dispatched through the logistics management platform or dispatch system to obtain its current delivery task information. This task information can be updated and transmitted in real time through vehicle-mounted terminal equipment, logistics management system interface, etc. After this information is collected, it is uniformly processed and analyzed.

[0075] After obtaining the delivery task information, it is necessary to calculate the remaining delivery time of each delivery vehicle to be dispatched based on this task information. The remaining delivery time refers to the time obtained by subtracting the current time spent from the fixed total delivery time of each delivery task. The purpose of determining the remaining delivery time is to optimize the dispatching decision and give priority to vehicles with shorter remaining delivery time and urgent tasks to enter the park, so as to improve the overall logistics efficiency.

[0076] The specific calculation steps are as follows: First, based on the location of the target warehouse or distribution point of the distribution task, combined with the road network topology inside and outside the park, calculate the travel time of each distribution vehicle to be dispatched from the current location to the target warehouse. Then, based on the loading and unloading time specified in the distribution task, plus the possible waiting time, calculate the total time required to complete the current distribution task. Finally, add up the total time of each distribution task to get the remaining distribution time of each distribution vehicle to be dispatched.

[0077] In order to ensure the accuracy and real-time nature of the calculation, current traffic conditions, road congestion and other dynamic factors are also taken into account. Through real-time updates and dynamic adjustments, more accurate remaining delivery times can be obtained, providing reliable data support for scheduling decisions.

[0078] S104, adjusting the initial sequence in combination with the remaining delivery time and the waiting time, and determining the final sequence of each delivery vehicle to be dispatched to enter the park.

[0079] In one example, the delivery vehicles to be dispatched are comprehensively sorted according to the remaining delivery time and the waiting time. First, all the delivery vehicles to be dispatched are sorted according to the remaining delivery time. After the preliminary sorting, the waiting time of each vehicle is further considered. If the remaining delivery time of two vehicles is similar, the vehicle with a shorter waiting time will be given priority to enter the park. This is because vehicles with shorter waiting times can be dispatched faster, thereby improving the overall dispatch efficiency and logistics mobility inside and outside the park.

[0080] In order to implement this scheduling strategy, the remaining delivery time and waiting time of each vehicle are recorded and monitored in real time. The management system of the scheduling center regularly updates this information to ensure that the status of each vehicle is up to date. A scheduling order list will be generated, and each vehicle will be sorted according to the aforementioned sorting rules. The specific time for each delivery vehicle to be scheduled to enter the park will be notified according to the sorting results.

[0081] During the dispatching process, the traffic conditions and dynamic positions of vehicles in the park are monitored in real time. If congestion or other abnormal conditions occur in the park, the system will adjust the dispatching order and schedule in time to ensure the smooth and efficient operation of the overall logistics.

[0082] Based on the above embodiment, as an optional implementation, in S104, adjusting the initial order in combination with the remaining delivery time and the waiting time specifically includes the following steps: S40, predicting the time required for each delivery vehicle to be dispatched to complete the remaining delivery tasks.

[0083] In one example, the current status information of each delivery vehicle to be dispatched is obtained, including the current location, completed delivery tasks, and a list of remaining delivery tasks. The remaining delivery tasks usually include multiple delivery points and detailed information of each delivery point, such as the address, estimated cargo unloading time, etc.

[0084] Using the above information and combining it with factors such as road network data, real-time traffic conditions, vehicle speed, etc., the time required for each delivery vehicle to complete the remaining delivery tasks is predicted.

[0085] S41, calculating the sum of the predicted duration and the waiting time of each delivery vehicle to be dispatched to obtain the target duration.

[0086] S42, obtaining the remaining delivery time of each delivery vehicle to be dispatched, and calculating the difference between the remaining delivery time of each delivery vehicle to be dispatched and the target time.

[0087] S43, adjusting the initial order according to the difference.

[0088] The target time in the smart logistics vehicle management and scheduling method refers to the ideal time set by the logistics company or scheduling system for each delivery vehicle to complete its delivery task. This target time is usually set based on several factors, including historical delivery data, customer demand, service level agreement (SLA) and the company's internal operating standards.

[0089] In one example, the difference values ​​of each delivery vehicle to be dispatched calculated in the previous step are obtained. The difference value refers to the difference between the remaining delivery time of each vehicle and the target time. Through these differences, vehicles with the risk of delay are identified.

[0090] Then, the order of each delivery vehicle to be dispatched to enter the park is adjusted according to the size of the difference. Generally, vehicles with larger difference values ​​indicate a higher risk of delay and need to be handled first. Therefore, these vehicles with larger difference values ​​are prioritized to enter the park so that they can start or continue their delivery tasks as soon as possible, thereby reducing delays.

[0091] For example, suppose there are three delivery vehicles to be dispatched: Car A, Car B, and Car C. According to the previous calculation, the difference of Car A is 20 minutes, the difference of Car B is 10 minutes, and the difference of Car C is -5 minutes (indicating that the task is expected to be completed ahead of schedule). Car A is prioritized to enter the park because it has the greatest risk of delay, followed by Car B, and finally Car C. In this way, by adjusting the order of vehicles entering the park, those vehicles that may be delayed can be given priority.

[0092] After determining the final order of each delivery vehicle to be dispatched entering the park, it also includes: obtaining real-time traffic flow information in the park; adjusting the second driving path of each delivery vehicle to be dispatched according to the real-time traffic flow information; calculating the time for each delivery vehicle to be dispatched to arrive at the target warehouse based on the adjusted second driving path; if the time for the delivery vehicle to be dispatched to arrive at the target warehouse does not meet the preset requirements, then obtaining the number and position of the delivery vehicles to be dispatched that do not meet the preset requirements; according to the number and position of the delivery vehicles to be dispatched that do not meet the preset requirements, determining the final driving path of each delivery vehicle to be dispatched.

[0093] In one example, first, the real-time traffic flow information in the park is obtained. The real-time traffic flow information can be collected in real time through sensors, cameras, and GPS devices installed in the park. The real-time traffic flow information includes current road congestion, vehicle flow, accident reports, etc.

[0094] Then, based on the real-time traffic flow information, the second driving path of each delivery vehicle to be dispatched is adjusted. The purpose of adjusting the path is to avoid congested sections and potential traffic problems, so as to find the optimal driving route. For example, if a main road is severely congested, the system will re-plan a secondary road or an alternative path for the vehicle to bypass the congested area.

[0095] After adjusting the route, calculate the time it takes for each delivery vehicle to arrive at the target warehouse based on the adjusted second driving route. This step is to evaluate whether the new driving route can meet the preset time requirements, and use real-time traffic data and the current location of the vehicle to accurately calculate the arrival time.

[0096] If the time for the dispatched delivery vehicles to arrive at the target warehouse does not meet the preset requirements, the number and location of these vehicles will be further obtained. For example, if three vehicles are found to still fail to arrive at the target warehouse on time after the route adjustment, the specific location and number of these three vehicles will be recorded.

[0097] The final driving routes of these vehicles are determined based on the number and location of the delivery vehicles to be dispatched that do not meet the preset requirements. The determination of the final driving route needs to take into account multiple factors, including the location of the vehicle, the current traffic conditions, the scheduling of other vehicles, etc. For example, some tasks can be reallocated to other vehicles that are closer to the target warehouse, or more direct and faster routes can be planned for these vehicles, even if this may increase some costs.

[0098] The method also includes: after each delivery vehicle to be dispatched enters the park, obtaining real-time location information and status information of each delivery vehicle to be dispatched; determining whether the driving path of each delivery vehicle to be dispatched is consistent with the corresponding second driving path based on the real-time location information and status information; if the driving path of the delivery vehicle to be dispatched is inconsistent with the corresponding second driving path, generating early warning information and sending the early warning information to the terminal device of the management personnel, so that the management personnel can manage and dispatch the delivery vehicles to be dispatched.

[0099] In one example, in order to ensure delivery efficiency and safety, after each delivery vehicle to be dispatched enters the park, the real-time location information and status information of each delivery vehicle to be dispatched are first obtained. The real-time location information can be obtained through the GPS device on the vehicle, and the status information includes the vehicle's speed, driving direction, whether it is in a parking state, etc.

[0100] The above information is monitored in real time, and the actual driving path of the vehicle is compared with the pre-planned second driving path. Through this comparison, the system can determine whether the driving path of each dispatched delivery vehicle is consistent with the corresponding second driving path. For example, after vehicle A enters the park, the system detects that its current position is consistent with the pre-planned second driving path, while vehicle B deviates from the pre-planned path and drives on an unplanned road.

[0101] When it is found that the driving path of the dispatched delivery vehicle is inconsistent with the corresponding second driving path, an early warning message will be generated immediately. The early warning information includes the vehicle identification, current location, degree of deviation and possible reasons (such as traffic congestion, temporary road closure, etc.) of the deviated vehicle.

[0102] The generated warning information will be sent to the terminal device of the manager so that the manager can manage and dispatch the delivery vehicles in time. For example, after the system finds that vehicle B deviates from the scheduled route, the generated warning information will be immediately sent to the mobile phone or computer of the logistics manager. After receiving the warning information, the manager can immediately take corresponding management and dispatch measures. For example, the driver of vehicle B can be contacted through the terminal device to understand the reason for the deviation from the route and guide him to return to the scheduled route or choose a more suitable alternative route. In addition, the manager can also readjust the task allocation of vehicle B according to the real-time traffic conditions and the status of other vehicles to ensure the smooth progress of the overall distribution plan.

[0103] Based on the above method, the present application also discloses a smart logistics vehicle management and dispatching device, such as Figure 2 As shown, Figure 2 It is a structural diagram of a smart logistics vehicle management and scheduling device provided in an embodiment of the present application.

[0104] A smart logistics vehicle management and dispatching device comprises: an acquisition module, a comparison module, a determination module and an adjustment module; wherein the acquisition module is used to acquire a first driving path of a plurality of delivery vehicles in a park and a second driving path of a plurality of delivery vehicles to be dispatched that are to enter the park; the comparison module is used to compare the first driving path and the second driving path, determine the initial sequence of each delivery vehicle to be dispatched entering the park and calculate the waiting time required for each delivery vehicle to be dispatched to enter the park; the determination module is used to acquire the delivery task of each delivery vehicle to be dispatched, and determine the remaining delivery time of each delivery vehicle to be dispatched according to the delivery task; the adjustment module is used to adjust the initial sequence in combination with the remaining delivery time and the waiting time, and determine the final sequence of each delivery vehicle to be dispatched entering the park.

[0105] In one example, the acquisition module is also used to obtain the target warehouses corresponding to multiple delivery vehicles in the park, the target warehouses including at least one warehouse; generate a first driving path for each delivery vehicle based on the target warehouse and the current position of each delivery vehicle; obtain the target warehouses corresponding to multiple delivery vehicles to be dispatched that are about to enter the park; and generate a second driving path for each delivery vehicle to be dispatched based on the target warehouses corresponding to each delivery vehicle to be dispatched.

[0106] In one example, the acquisition module is also used to obtain the road network topology structure within the park; generate multiple driving routes for each delivery vehicle based on the road network topology structure; calculate the driving time of each delivery vehicle on each driving route based on the current position of each delivery vehicle and the multiple driving routes of each delivery vehicle; and select the driving route with the shortest driving time for each delivery vehicle as the first driving path for each delivery vehicle.

[0107] In one example, the comparison module is also used to determine a first delivery vehicle and a first delivery vehicle to be dispatched that have a path conflict, and a critical path node in the second driving path corresponding to the first delivery vehicle exists in the first driving path corresponding to the first delivery vehicle to be dispatched; calculate the first time when the first delivery vehicle arrives at the corresponding critical path node, and determine the waiting time for the first delivery vehicle to be dispatched to give way to the first delivery vehicle based on the first time; determine the waiting time of the delivery vehicle to be dispatched that does not have a path conflict to be zero, and determine the initial order of each delivery vehicle to be dispatched entering the park based on the waiting time of each delivery vehicle to be dispatched.

[0108] In one example, the adjustment module is also used to predict the predicted time for each delivery vehicle to be scheduled to complete the remaining delivery tasks; calculate the sum of the predicted time and the waiting time of each delivery vehicle to be scheduled to obtain the target time; obtain the remaining delivery time of each delivery vehicle to be scheduled, and calculate the difference between the remaining delivery time of each delivery vehicle to be scheduled and the target time; adjust the initial order according to the size of the difference.

[0109] In one example, the above-mentioned device is also used to obtain real-time traffic flow information within the park; adjust the second driving path of each delivery vehicle to be dispatched according to the real-time traffic flow information; calculate the time for each delivery vehicle to be dispatched to arrive at the target warehouse based on the adjusted second driving path; if the time for the delivery vehicle to be dispatched to arrive at the target warehouse does not meet the preset requirements, obtain the number and position of the delivery vehicles to be dispatched that do not meet the preset requirements; determine the final driving path of each delivery vehicle to be dispatched according to the number and position of the delivery vehicles to be dispatched that do not meet the preset requirements.

[0110] In one example, the above-mentioned device is also used to obtain the real-time location information and status information of each delivery vehicle to be dispatched after each delivery vehicle to be dispatched enters the park; determine whether the driving path of each delivery vehicle to be dispatched is consistent with the corresponding second driving path based on the real-time location information and status information; if the driving path of the delivery vehicle to be dispatched is inconsistent with the corresponding second driving path, generate an early warning message and send the early warning message to the terminal device of the management personnel, so that the management personnel can manage and dispatch the delivery vehicles to be dispatched.

[0111] It should be noted that: when the device provided in the above embodiment realizes its function, only the division of the above functional modules is used as an example. In actual application, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above. In addition, the device and method embodiments provided in the above embodiment belong to the same concept, and the specific implementation process is detailed in the method embodiment, which will not be repeated here.

[0112] See also Figure 3 , is a schematic diagram of the structure of an electronic device provided in an embodiment of the present application. Figure 3 As shown, the electronic device 1000 may include: at least one processor 1001 , at least one network interface 1004 , a user interface 1003 , a memory 1005 , and at least one communication bus 1002 .

[0113] The communication bus 1002 is used to realize the connection and communication between these components.

[0114] The user interface 1003 may include a display screen (Display) and a camera (Camera). Optionally, the user interface 1003 may also include a standard wired interface and a wireless interface.

[0115] The network interface 1004 may optionally include a standard wired interface or a wireless interface (such as a WI-FI interface).

[0116] Among them, the processor 1001 may include one or more processing cores. The processor 1001 uses various interfaces and lines to connect various parts in the entire server, and executes various functions of the server and processes data by running or executing instructions, programs, code sets or instruction sets stored in the memory 1005, and calling data stored in the memory 1005. Optionally, the processor 1001 can be implemented in at least one hardware form of digital signal processing (Digital, Signal, Processing, DSP), field programmable gate array (Field-Programmable, Gate, Array, FPGA), and programmable logic array (Programmable, Logic, Array, PLA). The processor 1001 can integrate one or a combination of a central processing unit (Central, Processing, Unit, CPU), an image processor (Graphics, Processing, Unit, GPU), and a modem. Among them, the CPU mainly processes the operating system, user interface, and application programs; the GPU is responsible for rendering and drawing the content to be displayed on the display screen; and the modem is used to process wireless communications. It can be understood that the above-mentioned modem may not be integrated into the processor 1001, but may be implemented separately through a chip.

[0117] Among them, the memory 1005 may include a random access memory (Random, Access, Memory, RAM) and may also include a read-only memory (Read-Only, Memory). Optionally, the memory 1005 includes a non-transitory, computer-readable, storage, medium. The memory 1005 can be used to store instructions, programs, codes, code sets or instruction sets. The memory 1005 may include a program storage area and a data storage area, wherein the program storage area may store instructions for implementing an operating system, instructions for at least one function (such as a touch function, a sound playback function, an image playback function, etc.), instructions for implementing the above-mentioned various method embodiments, etc.; the data storage area may store data involved in the above-mentioned various method embodiments, etc. The memory 1005 may optionally be at least one storage device located away from the aforementioned processor 1001. As Figure 3 As shown, the memory 1005 as a computer storage medium may include an operating system, a network communication module, a user interface module, and an application program for a smart logistics vehicle management and scheduling method.

[0118] exist Figure 3In the electronic device 1000 shown, the user interface 1003 is mainly used to provide an input interface for the user and obtain data input by the user; and the processor 1001 can be used to call an application program storing a smart logistics vehicle management and scheduling method in the memory 1005. When executed by one or more processors, the electronic device executes one or more methods described in the above embodiments.

[0119] An electronic device readable storage medium stores instructions, which, when executed by one or more processors, enable the electronic device to execute one or more of the methods described in the above embodiments.

[0120] It should be noted that, for the aforementioned method embodiments, for the sake of simplicity, they are all described as a series of action combinations, but those skilled in the art should be aware that the present application is not limited by the order of the actions described, because according to the present application, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily required for the present application.

[0121] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0122] In the several embodiments provided in the present application, it should be understood that the disclosed devices can be implemented in other ways. For example, the device embodiments described above are only schematic, such as the division of the units, which is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some service interfaces, and the indirect coupling or communication connection of devices or units can be electrical or other forms.

[0123] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0124] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0125] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable memory. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product, which is stored in a memory and includes several instructions for a computer device (which can be a personal computer, server or network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned memory includes: various media that can store program codes, such as USB flash drives, mobile hard drives, magnetic disks or optical disks.

[0126] The above is only an exemplary embodiment of the present disclosure, and the scope of the present disclosure cannot be limited thereto. That is, any equivalent changes and modifications made according to the teachings of the present disclosure are still within the scope of the present disclosure. After considering the specification and practicing the disclosure here, those skilled in the art will easily think of other embodiments of the present disclosure. This application is intended to cover any modification, use or adaptation of the present disclosure, which follows the general principles of the present disclosure and includes common knowledge or customary technical means in the technical field not recorded in the present disclosure. The description and examples are only regarded as exemplary, and the scope and spirit of the present disclosure are defined by the claims.

Claims

1. A smart logistics vehicle management and dispatching method, characterized in that: The method comprises: Acquire a first driving path of a plurality of delivery vehicles in the park and a second driving path of a plurality of delivery vehicles to be dispatched to enter the park; Comparing the first driving route with the second driving route, determining the initial order of each of the to-be-dispatched delivery vehicles entering the park and calculating the waiting time required for each of the to-be-dispatched delivery vehicles to enter the park; Obtaining the delivery tasks of each of the delivery vehicles to be dispatched, and determining the remaining delivery time of each of the delivery vehicles to be dispatched according to the delivery tasks; The initial sequence is adjusted in combination with the remaining delivery time and the waiting time to determine the final sequence in which the delivery vehicles to be dispatched enter the park.

2. The intelligent logistics vehicle management and dispatching method according to claim 1 is characterized in that: The obtaining of first driving paths of a plurality of delivery vehicles in the park and second driving paths of a plurality of delivery vehicles to be dispatched to enter the park includes: Obtain target warehouses corresponding to a plurality of delivery vehicles in the park, wherein the target warehouses include at least one warehouse; Generate a first driving path for each delivery vehicle according to the target warehouse and the current position of each delivery vehicle; Obtain the target warehouses corresponding to the plurality of delivery vehicles to be dispatched to enter the park; A second driving path for each of the delivery vehicles to be dispatched is generated according to the target warehouses respectively corresponding to each of the delivery vehicles to be dispatched.

3. The intelligent logistics vehicle management and dispatching method according to claim 2 is characterized in that: The step of generating a first driving path for each delivery vehicle according to the target warehouse and the current position of each delivery vehicle comprises: Obtaining the road network topology structure within the park; Generating a plurality of driving routes for each of the delivery vehicles according to the road network topology; Calculate the driving time of each delivery vehicle on each driving route by combining the current position of each delivery vehicle and the multiple driving routes of each delivery vehicle; The driving route with the shortest driving time for each delivery vehicle is selected as the first driving path for each delivery vehicle.

4. The intelligent logistics vehicle management and dispatching method according to claim 1 is characterized in that: The comparing the first driving path and the second driving path, determining the initial order of each of the to-be-dispatched delivery vehicles entering the park and calculating the waiting time required for each of the to-be-dispatched delivery vehicles to enter the park, includes: Determine a first delivery vehicle and a first delivery vehicle to be dispatched that have a path conflict, wherein a critical path node in a second driving path corresponding to the first delivery vehicle exists in a first driving path corresponding to the first delivery vehicle to be dispatched; Calculating a first time when the first delivery vehicle arrives at a corresponding key path node, and determining, based on the first time, a waiting time for the first delivery vehicle to be dispatched to give way to the first delivery vehicle; The waiting time of the delivery vehicles to be dispatched without path conflict is determined to be zero, and the initial order of the delivery vehicles to be dispatched entering the park is determined according to the waiting time of each delivery vehicle to be dispatched.

5. The intelligent logistics vehicle management and dispatching method according to claim 1 is characterized in that: The adjusting the initial sequence in combination with the remaining delivery time and the waiting time comprises: Predicting the time required for each of the delivery vehicles to be dispatched to complete the remaining delivery tasks; Calculate the sum of the predicted duration and the waiting time of each delivery vehicle to be dispatched to obtain a target duration; Obtaining the remaining delivery time of each of the delivery vehicles to be dispatched, and calculating the difference between the remaining delivery time of each of the delivery vehicles to be dispatched and the target time; The initial sequence is adjusted according to the size of the difference.

6. The intelligent logistics vehicle management and dispatching method according to claim 1 is characterized in that: After determining the final order of the delivery vehicles to be dispatched to enter the park, the method further includes: Obtaining real-time traffic flow information within the park; According to the real-time traffic flow information, adjusting the second driving path of each of the delivery vehicles to be dispatched; Calculating the time for each of the to-be-dispatched delivery vehicles to arrive at the target warehouse based on the adjusted second driving path; If the time for the delivery vehicles to be dispatched to arrive at the target warehouse does not meet the preset requirements, the number and location of the delivery vehicles to be dispatched that do not meet the preset requirements are obtained; According to the number and position of the delivery vehicles to be dispatched that do not meet the preset requirements, the final driving path of each delivery vehicle to be dispatched is determined.

7. The intelligent logistics vehicle management and dispatching method according to claim 1 is characterized in that: The method further comprises: After each of the delivery vehicles to be dispatched enters the park, obtaining real-time location information and status information of each of the delivery vehicles to be dispatched; Determining whether the driving path of each of the to-be-dispatched delivery vehicles is consistent with the corresponding second driving path according to the real-time location information and the status information; If the driving path of the delivery vehicle to be dispatched is inconsistent with the corresponding second driving path, a warning message is generated and sent to the terminal device of the management personnel, so that the management personnel can manage and dispatch the delivery vehicle to be dispatched.

8. A smart logistics vehicle management and dispatching device, characterized in that: The device comprises: an acquisition module, a comparison module, a determination module and an adjustment module; wherein, The acquisition module is used to acquire a first driving path of a plurality of delivery vehicles in the park and a second driving path of a plurality of delivery vehicles to be dispatched to enter the park; The comparison module is used to compare the first driving path and the second driving path, determine the initial order of each of the to-be-dispatched delivery vehicles entering the park and calculate the waiting time required for each of the to-be-dispatched delivery vehicles to enter the park; The determination module is used to obtain the delivery tasks of each of the delivery vehicles to be scheduled, and determine the remaining delivery time of each of the delivery vehicles to be scheduled according to the delivery tasks; The adjustment module is used to adjust the initial sequence in combination with the remaining delivery time and the waiting time to determine the final sequence of each of the delivery vehicles to be dispatched entering the park.

9. An electronic device, characterized in that: It includes a processor, a memory user interface and a network interface, the memory is used to store instructions, the user interface and the network interface are used to communicate with other devices, and the processor is used to execute the instructions stored in the memory so that the electronic device executes the method as described in any one of claims 1-7.

10. A computer-readable storage medium, characterized in that: A computer program is stored which can be loaded by a processor and execute the method according to any one of claims 1 to 7.

Images