Road area division method and device, electronic equipment and storage medium

By dynamically dividing road areas based on task and vehicle information using optimization algorithms, the method addresses inefficiencies in item distribution, ensuring balanced task allocation and improved delivery efficiency.

CN119090158APending Publication Date: 2024-12-06BEIJING JINGDONG QIANSHITECHNOLOGY CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202310665075.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2023-06-06
Publication Date
2024-12-06

AI Technical Summary

Technical Problem

Existing logistics systems face inefficiencies in item distribution due to tasks being assigned based on preset, artificially divided road areas, which can lead to uneven task distribution and reduced efficiency, particularly in scenarios where delivery tasks are imbalanced.

Method used

A method and device that dynamically divide road areas by optimizing the target time required to complete delivery tasks, taking into account task and vehicle information to ensure efficient task allocation, using algorithms like simulated annealing or genetic algorithms to determine allocation information and divide road areas accordingly.

Benefits of technology

This approach ensures balanced task distribution by dynamically adjusting road areas based on task and vehicle information, enhancing the overall efficiency of item delivery processes.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119090158A_ABST
    Figure CN119090158A_ABST
Patent Text Reader

Abstract

The embodiment of the invention discloses a road area division method and device, electronic equipment and a storage medium. The method comprises the steps of obtaining task information of at least one article distribution task needing to be completed in a target area, and vehicle information of at least one article distribution vehicle capable of being used for completing the at least one article distribution task; determining distribution information of the at least one article distribution task for the at least one article distribution vehicle according to the task information and the vehicle information by taking a target duration required to be paid for completing the at least one article distribution task as an optimization target; according to the distribution information, road area division is carried out on the target area, at least one target road area is obtained, and the task distribution process on the target area is achieved according to the at least one target road area. According to the technical scheme in the embodiment of the invention, the article distribution efficiency can be effectively controlled.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] Embodiments of the present invention relate to the field of logistics, and in particular to a road area division method, device, electronic equipment and storage medium. Background Art

[0002] In the field of logistics, for at least one item delivery task assigned to a distribution site, the at least one item delivery task can be assigned to corresponding item delivery vehicles, so that the delivery process of the items to be delivered represented by the at least one item delivery task can be completed based on these item delivery vehicles.

[0003] Currently, tasks are usually assigned according to preset road areas, which are artificially pre-divided.

[0004] In the process of realizing the present invention, the inventors found that the prior art has the following technical problems: the efficiency of item distribution cannot be guaranteed. Summary of the invention

[0005] The embodiments of the present invention provide a road area division method, device, electronic device and storage medium to effectively ensure the efficiency of item distribution.

[0006] According to one aspect of the present invention, a road area division method is provided, which may include:

[0007] Acquire task information of at least one item delivery task to be completed in a target area, and vehicle information of at least one item delivery vehicle that can be used to complete the at least one item delivery task;

[0008] Taking the target time required to complete at least one item delivery task as the optimization target, and determining allocation information of at least one item delivery task to at least one item delivery vehicle according to the task information and the vehicle information;

[0009] According to the allocation information, the target area is divided into road areas to obtain at least one target road area, so as to implement the task allocation process in the target area according to the at least one target road area.

[0010] According to another aspect of the present invention, a road area division device is provided, which may include:

[0011] A vehicle information acquisition module, used to acquire task information of at least one item delivery task to be completed in a target area, and vehicle information of at least one item delivery vehicle that can be used to complete the at least one item delivery task;

[0012] An allocation information determination module, configured to determine allocation information of at least one item delivery task for at least one item delivery vehicle based on the task information and the vehicle information, taking the target time required to complete at least one item delivery task as the optimization target;

[0013] The road area division module is used to divide the road area on the target area according to the allocation information to obtain at least one target road area, so as to implement the task allocation process on the target area according to the at least one target road area.

[0014] According to another aspect of the present invention, there is provided an electronic device, which may include:

[0015] at least one processor; and

[0016] a memory communicatively connected to at least one processor; wherein,

[0017] The memory stores a computer program that can be executed by at least one processor. The computer program is executed by at least one processor so that the road area division method provided by any embodiment of the present invention is implemented when the at least one processor executes the computer program.

[0018] According to another aspect of the present invention, a computer-readable storage medium is provided, on which computer instructions are stored. The computer instructions are used to enable a processor to implement the road area division method provided by any embodiment of the present invention when executed.

[0019] The technical solution of the embodiment of the present invention is to obtain the task information of at least one item delivery task to be completed in the target area, and the vehicle information of at least one item delivery vehicle that can be used to complete the at least one item delivery task; take the target time required to complete the at least one item delivery task as the optimization target, and determine the allocation information of at least one item delivery vehicle for at least one item delivery task based on the task information and the vehicle information; divide the road area in the target area according to the allocation information to obtain at least one target road area, so that the task allocation process in the target area can be implemented according to the at least one target road area. The above technical solution, by taking the target time as the optimization target, combining the task information and the vehicle information to determine the allocation information, and then matching the at least one target road area obtained based on the allocation information with the distribution of the current item delivery task, so that the task allocation process implemented according to the at least one target road area can effectively ensure the efficiency of item delivery.

[0020] It should be understood that the contents described in this section are not intended to identify the key or important features of the embodiments of the present invention, nor are they intended to limit the scope of the present invention. Other features of the present invention will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0022] Figure 1 is a flow chart of a road area division method provided according to an embodiment of the present invention;

[0023] Figure 2a is a first schematic diagram of an optional example of a road area division method provided in an embodiment of the present invention;

[0024] Figure 2b is a second schematic diagram of an optional example of a road area division method provided in an embodiment of the present invention;

[0025] Figure 3 is a flow chart of another road area division method provided according to an embodiment of the present invention;

[0026] Figure 4 is a schematic diagram of an optional example of another road area division method provided according to an embodiment of the present invention;

[0027] Figure 5 is a flow chart of another road area division method provided according to an embodiment of the present invention;

[0028] Figure 6a is a first schematic diagram of an optional example of another road area division method provided in an embodiment of the present invention;

[0029] Figure 6b is a second schematic diagram of an optional example of another road area division method provided in an embodiment of the present invention;

[0030] Figure 6c is a third schematic diagram of an optional example of another road area division method provided in an embodiment of the present invention;

[0031] Figure 7 is a structural block diagram of a road area division device provided according to an embodiment of the present invention;

[0032] Figure 8 It is a structural schematic diagram of an electronic device for implementing the road area division method according to an embodiment of the present invention. DETAILED DESCRIPTION

[0033] In order to enable those skilled in the art to better understand the scheme of the present invention, the technical scheme in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present invention.

[0034] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. The situations of "target", "original", etc. are similar and will not be repeated here. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0035] Before introducing the embodiments of the present invention, the problem that the efficiency of item distribution cannot be guaranteed when tasks are assigned according to preset road areas (i.e., fixed road areas) as described in the background technology is first exemplified. Fixed road areas can be understood as fixed road areas that are artificially divided on the target area based on experience in advance, which may match or differ from the distribution of current item distribution tasks. Specifically, in practical applications, there may be a situation where the distribution of item distribution tasks on each fixed road area is relatively balanced, which means that the number of item distribution tasks that each item distribution vehicle needs to complete is relatively balanced, and at this time, the labor efficiency is balanced, which can effectively guarantee the efficiency of item distribution; of course, there may also be a situation where the distribution of item distribution tasks on each fixed road area is uneven, that is, there are more item distribution tasks on some fixed road areas, and fewer item distribution tasks on some fixed road areas, which means that some item distribution vehicles are overloaded and some item distribution vehicles are underloaded, and the uneven labor efficiency will directly lead to low item distribution efficiency. As can be seen from the above, when tasks are assigned according to fixed road areas, the efficiency of item distribution cannot be guaranteed, which is particularly obvious in the express delivery scene where the distribution of item distribution tasks is uneven.

[0036] Figure 1: is a flow chart of a road zone division method provided in an embodiment of the present invention. This embodiment is applicable to the case of dynamically dividing road zones, and is particularly applicable to the case of dynamically dividing road zones by optimizing target duration. The method can be executed by a road zone division device provided in an embodiment of the present invention, and the device can be implemented by software and / or hardware, and the device can be integrated in an electronic device, and the electronic device can be various user terminals or servers.

[0037] See also Figure 1 The method of the embodiment of the present invention specifically includes the following steps:

[0038] S110: Acquire task information of at least one item delivery task to be completed in a target area, and vehicle information of at least one item delivery vehicle that can be used to complete the at least one item delivery task.

[0039] Among them, the target area can be understood as the area to be divided into road areas, such as the area where XX District of XX City is located or the area where XX County of XX City of XX Province is located. The item delivery task can be understood as a task for delivering the items to be delivered represented by it. It should be noted that since the delivery address of the items to be delivered is located in the target area, the item delivery task belongs to the task that needs to be completed in the target area. Exemplarily, in combination with the field of e-commerce, it can be an order, then the goods in the order are delivered at this time. The number of item delivery tasks can be one, two or more, which is related to the actual situation and is not specifically limited here. Task information can be understood as information of at least one item delivery task, which can be the information of at least one item delivery task as a whole, or the information of each item delivery task therein, which can be set according to the actual situation and is not specifically limited here. In combination with the application scenarios that may be involved in the embodiments of the present invention, the task information can be at least one of the delivery address, delivery time, task weight (i.e., the weight of the items to be delivered represented by the item delivery task) and the number of items to be delivered; of course, it can also be task information in other aspects, which is not specifically limited here.

[0040] An item delivery vehicle can be understood as a vehicle used to complete an item delivery task, that is, a vehicle used to deliver the items to be delivered represented by the item delivery task. The number of item delivery vehicles can be one, two, or more, which is related to the actual situation and is not specifically limited here. Vehicle information can be understood as information about at least one item delivery vehicle, which can be information about at least one item delivery vehicle as a whole, or information about each item delivery vehicle therein, which can be set according to actual conditions and is not specifically limited here. In combination with the application scenarios that may be involved in the embodiments of the present invention, the vehicle information can be a vehicle model and / or a vehicle load, wherein the vehicle model is mainly used for delivery restrictions on special sections, such as restricting the passage of special models on a certain elevated road; of course, it can also be other aspects of vehicle information, which is not specifically limited here.

[0041] It should be noted that, when there is at least one item delivery task and at least one item delivery vehicle, the at least one item delivery vehicle can be used to complete the at least one item delivery task. However, for each of the at least one item delivery vehicles, which item delivery tasks of the at least one item delivery task it is used to complete remains to be determined.

[0042] S120: Taking the target time required to complete at least one item delivery task as the optimization target, and determining allocation information of at least one item delivery task to at least one item delivery vehicle according to the task information and the vehicle information.

[0043] The target duration can be understood as the duration required to complete at least one item delivery task (i.e., all item delivery tasks) as a whole. The allocation information can be used to indicate that each item delivery task in at least one item delivery task is allocated to an item delivery vehicle in at least one item delivery vehicle. For example, assuming that there are 5 item delivery tasks (represented by 1-5 here) and 2 item delivery vehicles (represented by A and B here), the allocation information can be used to indicate that 1-3 is allocated to A and 4-5 is allocated to B.

[0044] It should be noted that the shorter the target duration, the higher the efficiency of item distribution. Therefore, in order to ensure the efficiency of item distribution, the target duration can be used as the optimization target, and the allocation information of at least one item distribution task for at least one item distribution vehicle can be determined based on the task information and vehicle information. In other words, the task information and vehicle information are used as fixed parameters in the optimization process, and the optimal target duration is obtained by continuously adjusting the allocation information, and the allocation information corresponding to the optimal target duration is used as the final allocation information. It should be emphasized that the allocation information obtained here is used for road area division, and whether a vehicle is subsequently allocated to at least one item distribution task based on the allocation information is not specifically limited here.

[0045] In practical applications, optionally, the process of determining the above allocation information can be implemented based on a heuristic algorithm, such as a simulated annealing algorithm, a genetic algorithm, a list search algorithm, an evolutionary programming, an evolutionary strategy, an ant colony algorithm, or an artificial neural network, etc., which is not specifically limited here. Optionally, in the process of optimizing with the target duration as the optimization target, in addition to determining the allocation information, the distribution path of each item distribution vehicle can also be determined, so that the distribution path can be used as a reference for subsequent item distribution, so as to ensure the efficiency of item distribution from different aspects.

[0046] S130. Divide the target area into road zones according to the allocation information to obtain at least one target road zone, so as to implement a task allocation process in the target area according to the at least one target road zone.

[0047] Among them, on the one hand, for each of the at least one item delivery vehicles, the item delivery task that can be assigned to the item delivery vehicle in at least one item delivery task can be determined according to the allocation information; on the other hand, in practical applications, the part of the target area that one or more item delivery vehicles pass through to perform the item delivery task can be divided into a target road area. Therefore, the road area division can be performed on the target area according to the allocation information to obtain at least one target road area. Specifically, since the part that needs to be passed through the target area to complete the item delivery task can be determined according to the delivery address of the item delivery task, the road area division can be performed on the target area according to the allocation information and the delivery address of each item delivery task to obtain at least one target road area. It should be noted that the at least one target road area obtained by the above division is closely related to the task information and the vehicle information. Therefore, when the task information and / or the vehicle information changes, the at least one target road area obtained by the division will also change accordingly, that is, they are dynamic road areas, which can effectively ensure the balanced distribution of item delivery tasks.

[0048] After obtaining at least one target road area, the task allocation process in the target area can be implemented according to the at least one target road area, for example, the allocation process of at least one item delivery task in the target area can be implemented. In actual applications, optionally, this allocation process can be implemented according to at least one target road area, or can be implemented according to at least one target road area and the allocation information obtained above, which is not specifically limited here; for example, the allocation process of item delivery tasks other than at least one item delivery task in the target area can be implemented, and these item delivery tasks can be item delivery tasks that are not involved in the road area division process, such as item delivery tasks that come after the road area division is completed; of course, the allocation process of item delivery tasks in other cases in the target area can also be implemented, which is not specifically limited here.

[0049] The technical solution of the embodiment of the present invention is to obtain the task information of at least one item delivery task to be completed in the target area, and the vehicle information of at least one item delivery vehicle that can be used to complete the at least one item delivery task; take the target time required to complete the at least one item delivery task as the optimization target, and determine the allocation information of at least one item delivery vehicle for at least one item delivery task based on the task information and the vehicle information; divide the road area in the target area according to the allocation information to obtain at least one target road area, so that the task allocation process in the target area can be implemented according to the at least one target road area. The above technical solution, by taking the target time as the optimization target, combining the task information and the vehicle information to determine the allocation information, and then matching the at least one target road area obtained based on the allocation information with the distribution of the current item delivery task, so that the task allocation process implemented according to the at least one target road area can effectively ensure the efficiency of item delivery.

[0050] An optional technical solution, the above road area division method further includes:

[0051] Obtaining a preset constraint condition, wherein the preset constraint condition includes at least one of the following:

[0052] Each of the at least one item delivery vehicle starts from a preset location to deliver items and returns to the preset location after completing the item delivery;

[0053] The items to be delivered represented by each item delivery task in at least one item delivery task are delivered once; and

[0054] When the task information includes the task weight of each item delivery task in at least one item delivery task, and the vehicle information includes the vehicle load of each item delivery vehicle in at least one item delivery vehicle, the sum of the task weights of the item delivery tasks assigned to each item delivery vehicle is less than or equal to the vehicle load of each item delivery vehicle;

[0055] Determining allocation information of at least one item delivery task for at least one item delivery vehicle according to the task information and the vehicle information includes:

[0056] According to the task information, the vehicle information and the preset constraint conditions, allocation information of at least one item delivery task for at least one item delivery vehicle is determined.

[0057] The preset constraint condition may be a preset constraint condition related to completing the item delivery task by the item delivery vehicle. In practical applications, it may be at least one of the three conditions described above. Of course, it may also be other preset constraints, which are not specifically limited here. The allocation information is determined in combination with the preset constraint condition, so that the allocation information determined thereby can be guaranteed to be consistent with the actual delivery scenario.

[0058] In order to better understand the above technical solution, the following is an exemplary description of the application scenarios that may be involved in the embodiments of the present invention. For example, suppose there are K vehicles with a load of q at the distribution station. k The item delivery vehicles (referred to as vehicles in this example) are used to provide item delivery services for the N orders that have arrived (i.e., the item delivery tasks mentioned above). The order weight of each order is g. i (i=1,2,...,N), the sum of the order weights of all orders delivered by the vehicle (i.e., the total order weight) needs to be less than q k , each order (or the delivery address of the order) can only be served by a vehicle once, and each vehicle starts from and ends at a distribution station.

[0059] Here, the following objective function (i.e. the optimization objective mentioned above) and constraint function (i.e. the preset constraint conditions mentioned above) are proposed.

[0060] Objective function:

[0061]

[0062] Constraint function:

[0063]

[0064]

[0065]

[0066]

[0067]

[0068] Decision variables:

[0069] Whether vehicle k passes through delivery address i to delivery address j, the decision variable is 0 or 1;

[0070] y ki : Whether delivery address i is served by vehicle k, the decision variable is 0 or 1.

[0071] Other parameters:

[0072] F: target duration;

[0073] c ij : The transportation time of the vehicle from delivery address i to delivery address j;

[0074] T j : The operation time at delivery address j, which will be elaborated in detail later;

[0075] g i : The order weight corresponding to the delivery address i;

[0076] When i and j are 0, it indicates a distribution site.

[0077] In the above, formula (2) indicates that the number of vehicles departing from the distribution station is K; formula (3) indicates that the vehicle departs from the distribution station and returns to the distribution station after completing the delivery; formulas (4) and (5) indicate that each delivery address is delivered once and can only be delivered once; formula (6) indicates that the total order weight is less than the vehicle load.

[0078] The order is optimized through a heuristic algorithm to obtain the delivery path and allocation information. For example, Figure 2a The delivery addresses of 10 orders and the delivery addresses of the distribution stations are displayed. Figure 2b The delivery path (i.e., each d in the figure) and allocation information (each order connected by a curve is allocated to the same vehicle) obtained through the above steps are shown.

[0079] Figure 3It is a flow chart of another road zone division method provided in an embodiment of the present invention. This embodiment is optimized based on the above-mentioned technical solutions. In this embodiment, optionally, obtaining task information of at least one item delivery task to be completed in the target area includes: obtaining task information of each item delivery task in at least one item delivery task to be completed in the target area, wherein the task information at least includes the delivery address; the above-mentioned road zone division method also includes: for the target fence corresponding to the delivery address, analyzing the delivery address, and predicting the operation time required to operate within the target fence to complete the item delivery task; determining the allocation information of at least one item delivery task for at least one item delivery vehicle based on the task information and vehicle information, including: determining the allocation information of at least one item delivery task for at least one item delivery vehicle based on the task information and operation time of each item delivery task, as well as the vehicle information. Among them, the explanations of the terms that are the same or corresponding to the above-mentioned embodiments are not repeated here.

[0080] See also Figure 3 The method of this embodiment may specifically include the following steps:

[0081] S210: Obtain task information of each item delivery task in at least one item delivery task to be completed in the target area, wherein the task information at least includes a delivery address.

[0082] Among them, the task information of each item delivery task is obtained, and the task information at least includes the delivery address, that is, the task information includes the delivery address and other types of information, such as the delivery time, task weight and the number of items to be delivered as exemplified above, which are not specifically limited here.

[0083] S220: Analyze the target fence corresponding to the delivery address and predict the operation time required to complete the item delivery task within the target fence.

[0084] Among them, in practical applications, the target duration can include two parts: transportation duration and operation duration. The transportation duration can be used to represent the time required for the item delivery personnel to drive the item delivery vehicle from the delivery address of one item delivery task to the delivery address of another item delivery task. The operation duration can be used to represent the time required for the item delivery personnel to drive the item delivery vehicle to the vicinity of the delivery address of a certain item delivery task, unload the items to be delivered represented by the item delivery task from the item delivery vehicle, carry them upstairs to deliver them to the customer, and go downstairs and return to the item delivery vehicle. It can be seen that in the process of optimizing the target duration, accurate prediction of the transportation duration and the operation duration is crucial. Here is an optional prediction scheme for the operation duration, the specific content is as follows.

[0085] The target fence may be a pre-drawn electronic fence that surrounds the delivery address, for example, the electronic fence surrounding the building where the delivery address is located may be used as the target fence, or the electronic fence surrounding the community where the delivery address is located may be used as the target fence, etc., and no specific limitation is made here.

[0086] Analyze the delivery address, such as the floor where the delivery address is located and whether the building where the delivery address is located has an elevator, which are key factors that will affect the operation time. Further, based on the obtained analysis results, predict the operation time required to complete the item delivery task within the target fence. In practical applications, the operation time can be optionally defined as the exit time of the item delivery personnel leaving the target fence minus the entry time of the item delivery personnel entering the target fence.

[0087] S230: Obtain vehicle information of at least one item delivery vehicle that can be used to complete at least one item delivery task.

[0088] S240: Taking the target time required to complete at least one item delivery task as the optimization target, determine allocation information of at least one item delivery task for at least one item delivery vehicle according to task information and operation time of each item delivery task, as well as vehicle information.

[0089] Among them, the allocation information is determined by combining the task information and operation time of each item delivery task, as well as the vehicle information, so that the allocation information determined in this way can better ensure the efficiency of item delivery. On this basis, optionally, the transportation time required to reach the delivery address can be predicted by analyzing the delivery address, so that the allocation information can be determined by combining the task information, transportation time and operation time of each item delivery task, as well as the vehicle information. The allocation information determined by comprehensive consideration of multiple factors can better ensure the efficiency of item delivery.

[0090] S250: Divide the target area into road zones according to the allocation information to obtain at least one target road zone, so as to implement a task allocation process in the target area according to the at least one target road zone.

[0091] The technical solution of the embodiment of the present invention analyzes the delivery address of the item delivery task and predicts the operation time required to complete the item delivery task at the target fence operation corresponding to the delivery address, so that the allocation information can be determined by comprehensively considering the task information and operation time of each item delivery task, as well as the vehicle information. The allocation information determined in this way can better ensure the efficiency of item delivery.

[0092] An optional technical solution, the above road area division method further includes:

[0093] Obtaining historical information of historical delivery tasks, wherein the historical information at least includes historical addresses;

[0094] For the historical fence corresponding to the historical address, obtain the historical duration required to work within the historical fence to complete the historical delivery task;

[0095] Analyze the historical addresses, and use the obtained analysis results and historical duration as a set of training samples, so as to obtain a job duration prediction model based on multiple sets of training samples;

[0096] Analyze the target fence corresponding to the delivery address and predict the working time required to complete the delivery task within the target fence, including:

[0097] The delivery address is analyzed for the target fence corresponding to the delivery address, and the analysis result is input into the operation duration prediction model to predict the operation duration required to complete the item delivery task within the target fence.

[0098] Among them, the historical delivery task can be understood as the completed item delivery task. The historical information can be understood as the task information of the historical delivery task, which at least includes the historical address. The historical fence can be a pre-drawn electronic fence that can surround the historical address, for example, the electronic fence surrounding the building where the historical address is located is used as the historical fence, or the electronic fence surrounding the community where the historical address is located is used as the historical fence, etc., which is not specifically limited here. It should be noted that the definitions of the target fence and the historical fence need to be consistent, for example, both are electronic fences drawn in units of buildings or communities, so that they are of reference significance in the future. Since the historical delivery task has been completed, the historical duration required to operate in the historical fence to complete the historical delivery task can be directly obtained. In this way, the analysis results and historical duration obtained by analyzing the historical address can be used as a set of training samples, and then the original prediction model can be trained based on multiple sets of training samples to obtain the operation duration prediction model. The original prediction model can be a fitting function or a neural network equation that can realize the prediction function, etc., which is not specifically limited here. On this basis, the analysis results of the delivery address can be input into the operation duration prediction model, and then the operation duration can be predicted based on the output results of the operation duration prediction model, thereby achieving the effect of accurate and rapid prediction of the operation duration.

[0099] In another optional technical solution, the above-mentioned task information further includes item information of the items to be delivered represented by the item delivery task;

[0100] Analyze the target fence corresponding to the delivery address and predict the working time required to complete the delivery task within the target fence, including:

[0101] For the target fence corresponding to the delivery address, the delivery address and item information are analyzed to predict the working time required to complete the item delivery task within the target fence.

[0102] Among them, in addition to the delivery address, the task information may also include the item information of the items to be delivered represented by the item delivery task, such as the weight (i.e., item weight) and / or quantity (i.e., item quantity) of the items to be delivered, etc. This can be determined according to the actual situation and is not specifically limited here. Since the item information will also have a significant impact on the operation time, for example, heavier and / or more items to be delivered will extend the operation time, and lighter and / or fewer items to be delivered will shorten the operation time, so in order to improve the prediction accuracy of the operation time, the delivery address and item information can be comprehensively analyzed, so as to predict the operation time based on the analysis results of the two, thereby improving the prediction accuracy of the operation time.

[0103] In order to understand the above-mentioned technical solutions more vividly, the following is an exemplary description of the above-mentioned technical solutions in combination with specific examples. Figure 4 , analyze the order information, extract the following features: whether the building where the delivery address is located has an elevator, the floor where the delivery address is located, and the weight and quantity of the goods to be delivered represented by the order, standardize these four features, and input the standardized results into the operation duration prediction model, and predict the operation duration based on the output results of the operation duration prediction model. In practical applications, optionally, the above operation duration prediction model may include at least three layers: input nodes, hidden nodes, and output nodes. The above features may be input into the input nodes, and the above output results may be output through the output nodes. Optionally, the above operation duration prediction process may be represented by the following formula:

[0104] T i =t i (ω i ,ξ i ,ψ i ,ζ i )

[0105] Among them, T i is the operation time of order i, t i is the duration of order i calculated by the operation duration prediction model, ω i is whether the building to which order i belongs has an elevator, ξ i is the floor to which order i belongs, ψ i is the weight of the goods in order i, ζ i is the number of items in order i.

[0106] Figure 5 It is a flowchart of another road zone division method provided in an embodiment of the present invention. This embodiment is optimized based on the above-mentioned technical solutions. In this embodiment, optionally, obtaining task information of at least one item delivery task to be completed in the target area includes: obtaining task information of each item delivery task in at least one item delivery task to be completed in the target area, wherein the task information at least includes the delivery address; the above-mentioned road zone division method also includes: obtaining at least one interest area obtained by pre-dividing the target area; according to the delivery address of each item delivery task, aggregating at least one item delivery task on at least one interest area, and taking all item delivery tasks aggregated to the same interest area in at least one item delivery task as aggregated tasks to obtain at least one aggregated task; taking at least one aggregated task as at least one item delivery task, and updating the acquired task information according to the task information of at least one item delivery task. Among them, the explanations of the terms that are the same or corresponding to the above-mentioned embodiments are not repeated here.

[0107] See also Figure 5 The method of this embodiment may specifically include the following steps:

[0108] S310: Obtain task information of each item delivery task in at least one item delivery task to be completed in the target area, wherein the task information at least includes a delivery address.

[0109] S320: Acquire at least one region of interest obtained by pre-dividing the target region.

[0110] Among them, the Area of ​​Interest (AOI) can be understood as an interest surface in an Internet electronic map, which is mainly used to express regional geographical entities in a map, such as a residential area, a university, an office building, an industrial park, a comprehensive shopping mall, a hospital, a scenic spot or a gymnasium, etc. In combination with the application scenarios that may be involved in the embodiments of the present invention, the AOI can be a surface obtained by the map data team in accordance with a set of standards, such as the actual boundaries of a community, an industrial area, and a park, on the target area. The number of AOIs can be one, two or more, which is not specifically limited here.

[0111] S330. Aggregate at least one item delivery task on at least one area of ​​interest according to the delivery address of each item delivery task, and use all item delivery tasks aggregated to the same area of ​​interest among the at least one item delivery task as aggregated tasks to obtain at least one aggregated task.

[0112] Among them, since at least one AOI is obtained by dividing the target area, the item delivery tasks can be aggregated to at least one AOI according to the delivery addresses of the item delivery tasks. Specifically, for each item delivery task, the AOI where the delivery address of the item delivery task is located is determined, and then the item delivery task is aggregated to the AOI. For example, Figure 2a As shown in the figure, each triangle represents a delivery address (or delivery location), and each area framed by horizontal, vertical and diagonal lines is an AOI, so the orders can be aggregated on these AOIs according to the delivery addresses. Figure 2a The example shown is a special one where only one order is aggregated on each AOI.

[0113] Furthermore, all item delivery tasks aggregated to the same AOI in at least one item delivery task are taken as aggregated tasks, that is, there is a corresponding relationship between the aggregated tasks and the AOI. For the aggregated tasks corresponding to a certain AOI, they can be used to represent all item delivery tasks aggregated to the AOI. At this time, the aggregated task is a whole, and the number of item delivery tasks represented by it may be one, two or more, which is related to the aggregation situation on the AOI and is not specifically limited here.

[0114] After the above steps, at least one aggregation task can be obtained. It should be noted that the number of aggregation tasks may be equal to the number of AOIs or less than the number of AOIs. The former occurs when there is a delivery address on each AOI, and the latter occurs when there is no delivery address on some AOIs.

[0115] S340: taking at least one aggregated task as at least one item delivery task, and updating the acquired task information according to the task information of the at least one item delivery task.

[0116] In order to simplify the description, at least one aggregated task is referred to as at least one item delivery task. In other words, the item delivery task mentioned later refers to the aggregated task obtained through aggregation. On this basis, the previously obtained task information is updated according to the task information of at least one item delivery task. In other words, the task information mentioned later is the task information of the aggregated task.

[0117] It should be noted that by reducing the number of tasks through task aggregation, the speed of determining the allocation information can be increased; and, since an AOI is usually a smaller surface on the Internet electronic map, the subsequent determination of the allocation information based on the aggregated tasks will basically not affect the efficiency of item distribution.

[0118] S350: Obtain vehicle information of at least one item delivery vehicle that can be used to complete at least one item delivery task.

[0119] S360: Taking the target time required to complete at least one item delivery task as the optimization target, determine allocation information of at least one item delivery task for at least one item delivery vehicle according to the task information and the vehicle information.

[0120] S370: Divide the target area into road zones according to the allocation information to obtain at least one target road zone, so as to implement a task allocation process in the target area according to the at least one target road zone.

[0121] The technical solution of the embodiment of the present invention aggregates at least one item distribution task onto at least one AOI to obtain at least one aggregated task, and then determines the distribution information based on the at least one aggregated task. This can improve the speed of determining the distribution information without affecting the item distribution efficiency.

[0122] An optional technical solution is to divide the target area into road zones according to the allocation information to obtain at least one target road zone, including:

[0123] For each item delivery vehicle in the at least one item delivery vehicle, determining a vehicle task assigned to the item delivery vehicle in the at least one item delivery task according to the assignment information;

[0124] Using the interest area corresponding to the vehicle mission in the at least one interest area as the target road area corresponding to the item delivery vehicle divided on the target area;

[0125] A target road area corresponding to at least one item delivery vehicle is obtained.

[0126] For each item delivery vehicle, the item delivery task assigned to the item delivery vehicle among at least one item delivery task determined according to the allocation information is used as the vehicle task. In practical applications, the number of vehicle tasks may be one, two, or more, which depends on the actual situation and is not specifically limited here. For example, see Figure 2b As mentioned above, each order connected by a curve is assigned to the same item delivery vehicle. For example, if order 1 and order 2 are both assigned to a certain item delivery vehicle, then order 1 and order 2 can be understood as the vehicle tasks assigned to the item delivery vehicle among the 10 orders.

[0127] According to the above analysis, the essence of vehicle tasks is aggregate tasks. Since there is a corresponding relationship between aggregate tasks and AOIs, the AOI corresponding to the vehicle task can be determined from at least one AOI, and then the AOI is used as the target road area corresponding to the item delivery vehicle divided on the target area. It should be noted that the number of vehicle tasks is the same as the number of determined AOIs, so the AOIs corresponding to these vehicle tasks in the target area are divided into a target road area, which is the target road area corresponding to the item delivery vehicle. For example, see Figure 2b , Continuing with the above example, the AOI corresponding to order 1 and the AOI corresponding to order 2 are divided into a target road area on the target area. After the above steps, the target road areas corresponding to at least one item delivery vehicle can be obtained.

[0128] The above technical solution, with the help of the correspondence between AOI and vehicle tasks, divides the target road area corresponding to the item delivery vehicle based on AOI, thereby achieving the effect of rapid division of the target road area.

[0129] On this basis, an optional technical solution, the above road area division method further includes:

[0130] Determine at least one allocated area corresponding to at least one target road area from at least one area of ​​interest, and obtain an area position of each allocated area in the at least one allocated area;

[0131] For an unallocated area other than at least one allocated area in at least one area of ​​interest, a distance area is determined from at least one allocated area according to an area position of the unallocated area and an area position of each allocated area, and the unallocated area is allocated to a target road area in at least one target road area corresponding to the distance area.

[0132] Among them, in actual applications, some AOIs in at least one AOI may have been divided into (i.e., allocated to) a certain target road area, while some AOIs may not have been divided into (i.e., not yet allocated to) any target road area, because there are no item delivery tasks on these AOIs. Here, the AOI that has been allocated to a certain target road area is called an allocated area, and the AOI that has not been allocated to any target road area is referred to as an unallocated area. The number of allocated areas can be one, two or more, which is related to the actual situation and is not specifically limited here. The area position of each allocated area in at least one allocated area is obtained. In actual applications, optionally, the position of the center point in the allocated area can be used as the area position, or the average of the positions of each point in the allocated area can be used as the area position, and so on, which are not specifically limited here.

[0133] For each unallocated area, according to the area position of the unallocated area and the area position of each allocated area, a distance area can be determined from at least one allocated area, for example, the navigation distance between the area position of the unallocated area and the area position of each allocated area is calculated respectively, and then the allocated area corresponding to the navigation distance that meets the preset distance condition is used as the distance area. Further, the unallocated area is allocated to a target road area corresponding to the distance area in at least one target road area, that is, the unallocated area and the distance area are divided into the same target road area, thereby achieving the effect of rapid allocation of the unallocated area. At this point, each AOI on the target area is divided into a corresponding target road area, thereby completing the road area division on the entire target area. The allocation of the unallocated area helps to achieve the effective allocation of subsequent item delivery tasks and item collection tasks, thereby ensuring the item delivery efficiency under various circumstances.

[0134] In order to better understand the above-mentioned technical solutions as a whole, the following is an exemplary description of the above-mentioned technical solutions in combination with specific examples. For example, the specific steps are as follows:

[0135] 1. Basic data preparation

[0136] Step S1: Basic data preparation

[0137] The station manager of the collection and distribution station completes the configuration of basic information such as vehicle model and vehicle load of heavy cargo couriers within the jurisdiction (i.e. the target area mentioned above). The vehicle model is mainly used for delivery restrictions on special roads, and the vehicle load is mainly used for delivery load distribution.

[0138] Step S2: Staff scheduling configuration

[0139] The stationmaster schedules personnel and vehicle types every day, and the system dynamically divides road areas based on the vehicles that the daily travelers are responsible for.

[0140] Step S3: Order division and aggregation

[0141] All orders that have been placed on the day and arrived at the collection and distribution site are printed on the map and aggregated on the corresponding AOI, and all orders aggregated on the same AOI are used as a distribution point (i.e., the aggregation task mentioned above).

[0142] Step S4: Job duration prediction

[0143] In addition to the transportation time, the target duration also includes the operation time for contacting customers, going upstairs and carrying. Therefore, the operation time prediction model is used here to predict the operation time of each order.

[0144] So far, the following data is obtained:

[0145] Assume that there are 4 vehicles traveling on the second day, and their vehicle load distribution is 60KG, 70KG, 40KG and 90KG. There are 30 orders aggregated on AOI and then become 10 delivery points (see Figure 6a , where one square is an AOI), the delivery point information is as follows (latitude and longitude; delivery weight; operation time):

[0146] Delivery point 1 [123.2321, 123.4321; 13KG; 30 minutes],

[0147] Delivery point 2 [123.2332, 123.4321; 11KG; 25 minutes],

[0148] ...,

[0149] Delivery point 10 [123.1232, 123.1221; 18KG; 25 minutes].

[0150] 2. Order allocation at distribution stations

[0151] The planning equations are solved by using the above equations (1) to (6), and the results are as follows: Figure 6b As shown, delivery points 1-2 are assigned to vehicle 1, delivery points 3-5 are assigned to vehicle 2, delivery points 9-10 are assigned to vehicle 3, and delivery points 6-8 are assigned to vehicle 4. That is, AOIs belonging to the same vehicle are divided into the same target road area.

[0152] 3. Dynamic road zone division

[0153] The navigation distance of the unallocated area is calculated, and then the target road area corresponding to the nearest allocated area is allocated. The result is as follows: Figure 6c So far, each AOI in the target area is divided into a certain target road area, thereby realizing the dynamic road area division of the target area.

[0154] The above technical solution can be applied to terminal delivery scenarios, solving the problem of uneven distribution of express delivery orders and realizing dynamic road area division in terminal express delivery scenarios. When tasks are allocated based on this, the utilization efficiency of express delivery vehicles is improved, thereby improving the efficiency of express delivery and increasing more revenue for the company.

[0155] Figure 7 This is a structural block diagram of a road area division device provided in an embodiment of the present invention, and the device is used to execute the road area division method provided in any of the above embodiments. The device and the road area division method of the above embodiments belong to the same inventive concept. For details not described in detail in the embodiments of the road area division device, please refer to the embodiments of the above road area division method. Figure 7The device may specifically include: a vehicle information acquisition module 410, an allocation information determination module 420 and a road area division module 430.

[0156] The vehicle information acquisition module 410 is used to acquire task information of at least one item delivery task to be completed in the target area, and vehicle information of at least one item delivery vehicle that can be used to complete the at least one item delivery task;

[0157] The allocation information determination module 420 is used to determine the allocation information of at least one item delivery task for at least one item delivery vehicle based on the task information and the vehicle information, taking the target time required to complete at least one item delivery task as the optimization target;

[0158] The road area division module 430 is used to divide the road areas in the target area according to the allocation information to obtain at least one target road area, so as to implement the task allocation process in the target area according to the at least one target road area.

[0159] Optionally, the vehicle information acquisition module 410 may include:

[0160] A first task information acquisition unit is used to acquire task information of each item delivery task in at least one item delivery task to be completed in a target area, wherein the task information at least includes a delivery address;

[0161] The above-mentioned road area division device further includes:

[0162] The operation duration prediction module is used to analyze the delivery address according to the target fence corresponding to the delivery address, and predict the operation duration required to complete the item delivery task within the target fence;

[0163] The allocation information determination module 420 may include:

[0164] The first allocation information determination unit is used to determine allocation information of at least one item delivery task for at least one item delivery vehicle according to the task information and operation duration of each item delivery task and the vehicle information.

[0165] On this basis, optionally, the road area division device further includes:

[0166] A historical information acquisition module, used to acquire historical information of historical delivery tasks, wherein the historical information at least includes historical addresses;

[0167] A historical duration acquisition module is used to acquire the historical duration required to operate within the historical fence to complete the historical delivery task for the historical fence corresponding to the historical address;

[0168] A model training module is used to analyze historical addresses and use the obtained analysis results and historical duration as a set of training samples, so as to obtain a job duration prediction model based on multiple sets of training samples;

[0169] The job duration prediction module may include:

[0170] The first operation duration prediction unit is used to analyze the delivery address according to the target fence corresponding to the delivery address, and input the analysis result into the operation duration prediction model to predict the operation duration required to complete the item delivery task within the target fence.

[0171] Alternatively, the task information further includes item information of items to be delivered represented by the item delivery task, and the operation duration prediction module may include:

[0172] The second operation duration prediction unit is used to analyze the delivery address and the item information for the target fence corresponding to the delivery address, and predict the operation duration required to operate within the target fence to complete the item delivery task.

[0173] Optionally, the above-mentioned road area division device further includes:

[0174] The preset constraint condition acquisition module is used to acquire the preset constraint condition, wherein the preset constraint condition includes at least one of the following:

[0175] Each of the at least one item delivery vehicle starts from a preset location to deliver items and returns to the preset location after completing the item delivery;

[0176] The items to be delivered represented by each item delivery task in at least one item delivery task are delivered once; and

[0177] When the task information includes the task weight of each item delivery task in at least one item delivery task, and the vehicle information includes the vehicle load of each item delivery vehicle in at least one item delivery vehicle, the sum of the task weights of the item delivery tasks assigned to each item delivery vehicle is less than or equal to the vehicle load of each item delivery vehicle;

[0178] The allocation information determination module 420 may include:

[0179] The second allocation information determination unit is used to determine allocation information of at least one item delivery task for at least one item delivery vehicle according to the task information, the vehicle information and the preset constraint conditions.

[0180] Optionally, the vehicle information acquisition module 410 may include:

[0181] A second task information acquisition unit is used to acquire task information of each item delivery task in at least one item delivery task to be completed in the target area, wherein the task information at least includes a delivery address;

[0182] The above-mentioned road area division device further includes:

[0183] An interest region acquisition module, used to acquire at least one interest region obtained by pre-dividing the target region;

[0184] an aggregated task obtaining module, for aggregating at least one item delivery task on at least one area of ​​interest according to the delivery address of each item delivery task, and taking all item delivery tasks aggregated to the same area of ​​interest in the at least one item delivery task as aggregated tasks, so as to obtain at least one aggregated task;

[0185] The task information updating module is used to take at least one aggregated task as at least one item delivery task, and update the acquired task information according to the task information of at least one item delivery task.

[0186] On this basis, optionally, the road area division module 430 may include:

[0187] A vehicle task determination unit, configured to determine, for each of the at least one item delivery vehicle, a vehicle task assigned to the item delivery vehicle in at least one item delivery task according to the assignment information;

[0188] A target road area division unit, used to use the interest area corresponding to the vehicle mission in at least one interest area as a target road area corresponding to the article delivery vehicle divided on the target area;

[0189] The target road area obtaining unit is used to obtain the target road area corresponding to at least one item delivery vehicle.

[0190] On this basis, optionally, the road area division device further includes:

[0191] An area position acquisition module, used to determine at least one allocated area corresponding to at least one target road area from at least one area of ​​interest, and acquire an area position of each allocated area in the at least one allocated area;

[0192] The area allocation module is used to determine a distance area from at least one allocated area according to an area position of the unallocated area and an area position of each allocated area for an unallocated area other than at least one allocated area in at least one area of ​​interest, and allocate the unallocated area to a target road area in at least one target road area corresponding to the distance area.

[0193] The road area division device provided by the embodiment of the present invention obtains the task information of at least one item delivery task to be completed in the target area and the vehicle information of at least one item delivery vehicle that can be used to complete the at least one item delivery task through the vehicle information acquisition module; determines the allocation information of at least one item delivery task for at least one item delivery vehicle based on the task information and the vehicle information, taking the target time required to complete the at least one item delivery task as the optimization target, through the allocation information determination module; divides the road area in the target area according to the allocation information through the road area division module, and obtains at least one target road area, so that the task allocation process in the target area can be implemented according to the at least one target road area. The above device determines the allocation information based on the target time as the optimization target, combined with the task information and the vehicle information, and then matches the at least one target road area divided based on the allocation information with the current distribution of the item delivery task, so that the task allocation process implemented according to the at least one target road area can effectively ensure the item delivery efficiency.

[0194] The road area division device provided in the embodiment of the present invention can execute the road area division method provided in any embodiment of the present invention, and has the corresponding functional modules and beneficial effects of the execution method.

[0195] It is worth noting that in the embodiment of the above-mentioned road area division device, the various units and modules included are only divided according to functional logic, but are not limited to the above-mentioned division, as long as the corresponding functions can be achieved; in addition, the specific names of the functional units are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of the present invention.

[0196] Figure 8 A schematic diagram of the structure of an electronic device 10 that can be used to implement an embodiment of the present invention is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices (such as helmets, glasses, watches, etc.) and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present invention described and / or required herein.

[0197] like Figure 8As shown, the electronic device 10 includes at least one processor 11, and a memory connected to the at least one processor 11, such as a read-only memory (ROM) 12, a random access memory (RAM) 13, etc., wherein the memory stores a computer program that can be executed by at least one processor, and the processor 11 can perform various appropriate actions and processes according to the computer program stored in the read-only memory (ROM) 12 or the computer program loaded from the storage unit 18 to the random access memory (RAM) 13. In the RAM 13, various programs and data required for the operation of the electronic device 10 can also be stored. The processor 11, the ROM 12, and the RAM 13 are connected to each other through a bus 14. An input / output (I / O) interface 15 is also connected to the bus 14.

[0198] A number of components in the electronic device 10 are connected to the I / O interface 15, including: an input unit 16, such as a keyboard, a mouse, etc.; an output unit 17, such as various types of displays, speakers, etc.; a storage unit 18, such as a disk, an optical disk, etc.; and a communication unit 19, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.

[0199] The processor 11 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the processor 11 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, a digital signal processor (DSP), and any appropriate processor, controller, microcontroller, etc. The processor 11 executes the various methods and processes described above, such as a road zone division method.

[0200] In some embodiments, the road zone division method may be implemented as a computer program, which is tangibly contained in a computer-readable storage medium, such as a storage unit 18. In some embodiments, part or all of the computer program may be loaded and / or installed on the electronic device 10 via the ROM 12 and / or the communication unit 19. When the computer program is loaded into the RAM 13 and executed by the processor 11, one or more steps of the road zone division method described above may be performed. Alternatively, in other embodiments, the processor 11 may be configured to perform the road zone division method in any other appropriate manner (e.g., by means of firmware).

[0201] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0202] Computer programs for implementing the methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that when the computer program is executed by the processor, the functions / operations specified in the flow chart and / or block diagram are implemented. The computer program may be executed entirely on the machine, partially on the machine, partially on the machine as a stand-alone software package and partially on a remote machine, or entirely on a remote machine or server.

[0203] In the context of the present invention, a computer-readable storage medium may be a tangible medium that may contain or store a computer program for use by or in combination with an instruction execution system, device or equipment. A computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices or equipment, or any suitable combination of the foregoing. Alternatively, a computer-readable storage medium may be a machine-readable signal medium. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0204] To provide interaction with a user, the systems and techniques described herein may be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and a pointing device (e.g., a mouse or trackball) through which the user can provide input to the electronic device. Other types of devices may also be used to provide interaction with the user; for example, the feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form (including acoustic input, voice input, or tactile input).

[0205] The systems and techniques described herein may be implemented in a computing system that includes backend components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes frontend components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such backend components, middleware components, or frontend components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), a blockchain network, and the Internet.

[0206] A computing system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The client and server relationship is generated by computer programs running on the corresponding computers and having a client-server relationship with each other. The server may be a cloud server, also known as a cloud computing server or cloud host, which is a host product in the cloud computing service system to solve the defects of difficult management and weak business scalability in traditional physical hosts and VPS services.

[0207] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps described in the present invention can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solution of the present invention can be achieved, and this document does not limit this.

[0208] The above specific implementations do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A road area division method, characterized in that: include: Acquire task information of at least one item delivery task to be completed in a target area, and vehicle information of at least one item delivery vehicle that can be used to complete the at least one item delivery task; Taking the target time required to complete the at least one item delivery task as the optimization target, and determining allocation information of the at least one item delivery task to the at least one item delivery vehicle according to the task information and the vehicle information; According to the allocation information, road area division is performed on the target area to obtain at least one target road area, so as to implement the task allocation process on the target area according to the at least one target road area.

2. The method according to claim 1, characterized in that: The obtaining of task information of at least one item delivery task to be completed in the target area includes: Acquire task information of each item delivery task in at least one item delivery task to be completed in the target area, wherein the task information at least includes a delivery address; The method further comprises: Analyze the target fence corresponding to the delivery address and predict the operation time required to complete the item delivery task within the target fence; The step of determining, based on the task information and the vehicle information, allocation information of the at least one item delivery task for the at least one item delivery vehicle comprises: The allocation information of the at least one item delivery task for the at least one item delivery vehicle is determined according to the task information and operation duration of each item delivery task and the vehicle information.

3. The method according to claim 2, characterized in that Also includes: Acquire historical information of historical delivery tasks, wherein the historical information at least includes historical addresses; For the historical fence corresponding to the historical address, obtaining the historical duration required to work within the historical fence to complete the historical delivery task; Analyze the historical addresses, and use the obtained analysis results and the historical duration as a group of training samples, so as to obtain a job duration prediction model based on multiple groups of the training samples; The target fence corresponding to the delivery address is analyzed to predict the operation time required to complete the item delivery task within the target fence, including: The delivery address is analyzed for the target fence corresponding to the delivery address, and the analysis result is input into the operation duration prediction model to predict the operation duration required to complete the item delivery task within the target fence.

4. The method according to claim 2, characterized in that: The task information also includes item information of the items to be delivered represented by the item delivery task; The target fence corresponding to the delivery address is analyzed to predict the operation time required to complete the item delivery task within the target fence, including: With respect to the target fence corresponding to the delivery address, the delivery address and the item information are analyzed to predict the operation time required to operate within the target fence in order to complete the item delivery task.

5. The method according to claim 1, characterized in that Also includes: Obtaining a preset constraint condition, wherein the preset constraint condition includes at least one of the following: Each of the at least one item delivery vehicle starts from a preset location to deliver items, and returns to the preset location after completing the item delivery; The items to be delivered represented by each item delivery task in the at least one item delivery task are delivered once; and In a case where the task information includes the task weight of each item delivery task in the at least one item delivery task, and the vehicle information includes the vehicle load of each item delivery vehicle in the at least one item delivery vehicle, the sum of the task weights of the item delivery tasks assigned to each item delivery vehicle is less than or equal to the vehicle load of each item delivery vehicle; The step of determining, based on the task information and the vehicle information, allocation information of the at least one item delivery task for the at least one item delivery vehicle comprises: According to the task information, the vehicle information and the preset constraint conditions, allocation information of the at least one item delivery task for the at least one item delivery vehicle is determined.

6. The method according to claim 1, characterized in that The obtaining of task information of at least one item delivery task to be completed in the target area includes: Acquire task information of each item delivery task in at least one item delivery task to be completed in the target area, wherein the task information at least includes a delivery address; The method further comprises: Acquire at least one region of interest obtained by pre-dividing the target area; aggregating the at least one item delivery task on the at least one area of ​​interest according to the delivery address of each item delivery task, and taking all item delivery tasks aggregated to the same area of ​​interest among the at least one item delivery task as aggregated tasks, so as to obtain at least one aggregated task; The at least one aggregated task is used as the at least one item delivery task, and the acquired task information is updated according to the task information of the at least one item delivery task.

7. The method according to claim 6, characterized in that The step of dividing the target area into road zones according to the allocation information to obtain at least one target road zone comprises: For each of the at least one item delivery vehicle, determining, according to the allocation information, a vehicle task assigned to the item delivery vehicle in the at least one item delivery task; Using the interest area corresponding to the vehicle mission in the at least one interest area as a target road area corresponding to the item delivery vehicle divided on the target area; A target road area corresponding to each of the at least one article delivery vehicles is obtained.

8. The method according to claim 7, characterized in that Also includes: Determine at least one allocated area corresponding to at least one target road area from the at least one area of ​​interest, and obtain an area position of each allocated area in the at least one allocated area; For an unallocated area other than the at least one allocated area in the at least one area of ​​interest, a distance area is determined from the at least one allocated area according to an area position of the unallocated area and an area position of each of the allocated areas, and the unallocated area is allocated to a target road area in the at least one target road area corresponding to the distance area.

9. A road area division device, characterized in that: include: A vehicle information acquisition module, used to acquire task information of at least one item delivery task to be completed in a target area, and vehicle information of at least one item delivery vehicle that can be used to complete the at least one item delivery task; an allocation information determination module, configured to determine allocation information of the at least one item delivery task for the at least one item delivery vehicle based on the task information and the vehicle information, taking the target time required to complete the at least one item delivery task as an optimization target; The road area division module is used to divide the road areas on the target area according to the allocation information to obtain at least one target road area, so as to implement the task allocation process on the target area according to the at least one target road area.

10. An electronic device, characterized in that: include: at least one processor; as well as a memory communicatively connected to the at least one processor; wherein, The memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor executes the road area division method according to any one of claims 1 to 8.

11. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a processor to implement the road area division method as described in any one of claims 1-8 when executed.