Order data processing method and device, electronic equipment and computer readable medium
By predicting order attributes and spatially clustering geographic areas for optimized vehicle allocation, the method addresses the challenge of balancing delivery timeliness and cost in urban distribution logistics, ensuring efficient and cost-effective order processing.
Patent Information
- Application Number
- CN202310632409.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2023-05-31
- Publication Date
- 2024-12-03
AI Technical Summary
Existing order data processing methods in urban distribution logistics either lead to delays in production time or significant increases in delivery costs, failing to balance delivery timeliness and cost-effectiveness.
Predicting order goods attributes using historical data, determining the required number of vehicles, spatially clustering geographic areas, and processing orders based on these groups to optimize vehicle allocation and reduce costs while ensuring timely delivery.
Achieves a balance between delivery cost and timeliness by predicting vehicle needs and clustering geographic areas, reducing production and distribution costs while maintaining delivery efficiency.
Smart Images

Figure CN119067559A_ABST
Abstract
Description
Technical Field
[0001] Embodiments of the present disclosure relate to the field of warehousing and logistics technology, and in particular to order data processing methods, devices, electronic devices, and computer-readable media. Background Art
[0002] In the urban distribution logistics scenario, transporting items from warehouses to supermarkets is a daily task. For a company, the money spent on transportation vehicles is the main cost expenditure. But at the same time, before loading, the items indicated by the order generally need to be picked out and packaged in the warehouse. Therefore, there are usually two technical solutions: one is from the perspective of optimal cost, which often waits until all orders are observed, and then optimizes the selection of vehicle models and trains; the other is from the perspective of timeliness, which often produces immediately when an order comes in, and loads and sends out at any time.
[0003] However, the inventors found that the above two technical solutions either lead to a delay in the production time of the order or lead to a significant increase in the delivery cost.
[0004] The above information disclosed in this Background section is only for enhancement of understanding of the background of the inventive concept and therefore it may contain information that does not form the prior art that is already known in this country to a person of ordinary skill in the art. Summary of the invention
[0005] The content of this disclosure is used to introduce concepts in a brief form, which will be described in detail in the detailed implementation section below. The content of this disclosure is not intended to identify the key features or essential features of the technical solution claimed for protection, nor is it intended to limit the scope of the technical solution claimed for protection.
[0006] Some embodiments of the present disclosure propose order data processing methods, devices, electronic devices, computer-readable media, and computer program products to solve one or more of the technical problems mentioned in the above background technology section.
[0007] In a first aspect, some embodiments of the present disclosure provide an order data processing method, including: determining predicted attribute information of order goods in a target area within a target time period based on attribute information of order goods in historical order data of a target area; analyzing the predicted attribute information and attribute information of preset vehicles to determine the number of preset vehicles required to complete the transportation of the order goods; based on the number of vehicles, spatially clustering multiple geographic areas within the target area to obtain multiple area groups; and processing order data within the target area received within the target time period based on the multiple area groups.
[0008] In some embodiments, based on the number of vehicles, multiple geographic areas within the target area are spatially clustered to obtain multiple area groups, including: taking the number of vehicles as a constraint condition, clustering the multiple geographic areas within the target area through a spatial clustering method with constraints to obtain multiple area groups matching the number of vehicles; and allocating preset vehicles to the multiple area groups to establish an association relationship between the vehicle identification and the multiple area groups.
[0009] In some embodiments, the number of vehicles is used as a constraint condition, and multiple geographic areas within the target area are clustered through a spatial clustering method with constraints, including: determining the number of vehicles as the number of clusters, and setting the quantity range of orders in each cluster group; using the number of clusters and the quantity range as constraints, and clustering multiple geographic areas within the target area according to the historical order quantity of each geographic area.
[0010] In some embodiments, order data within a target area received within a target time period is processed according to multiple area groups, including: for order data within a target area received within the target time period, determining the area group to which the order data belongs based on the delivery address information of the order data, as the target area group; and establishing a corresponding relationship between the order data and a vehicle identification associated with the target area group.
[0011] In some embodiments, the method further includes: for each assigned preset vehicle, counting the attribute information of the goods indicated by each order data corresponding to the preset vehicle to obtain transportation attribute information; and determining the vehicle adjustment strategy based on the comparison result between the attribute information of the preset vehicle and the transportation attribute information.
[0012] In some embodiments, a vehicle adjustment strategy is determined based on a comparison result between the attribute information of the preset vehicle and the transport attribute information, including: in response to determining that the attribute information of the preset vehicle is less than the transport attribute information, adjusting the preset vehicle to other vehicles, wherein the attribute information of the other vehicles is greater than the attribute information of the preset vehicle; in response to determining that the attribute information of the other vehicles is less than the transport attribute information, adding a transport vehicle to the regional group associated with the other vehicles.
[0013] In some embodiments, based on the attribute information of the order goods in the historical order data of the target area, the predicted attribute information of the order goods in the target area within the target time period is determined, including: based on the historical order data of the target area, counting the attribute information of the order goods at each historical time point in the historical time series; using the statistical data as input, and outputting the predicted attribute information of the order goods in the target area within the target time period through a gradient boosting tree model.
[0014] In some embodiments, the multiple geographic regions are obtained by the following method: based on the delivery address information in the historical order data, the geographic locations in the target area are clustered and divided by a mean shift algorithm to obtain the multiple geographic regions.
[0015] In a second aspect, some embodiments of the present disclosure provide an order data processing device, comprising: a prediction unit, configured to determine predicted attribute information of order goods in a target area within a target time period based on attribute information of order goods in historical order data of the target area; a vehicle determination unit, configured to analyze the predicted attribute information and attribute information of preset vehicles, and determine the number of preset vehicles to complete the transportation of the order goods; a regional clustering unit, configured to spatially cluster multiple geographic areas within the target area based on the number of vehicles to obtain multiple regional groups; and an order processing unit, configured to process the order data within the target area received within the target time period according to the multiple regional groups.
[0016] In some embodiments, the regional clustering unit includes: a clustering subunit, configured to use the number of vehicles as a constraint condition, and cluster multiple geographical areas within the target area through a spatial clustering method with constraints to obtain multiple regional groups matching the number of vehicles; an allocation subunit, configured to allocate preset vehicles to the multiple regional groups, and establish an association relationship between the vehicle identification and the multiple regional groups.
[0017] In some embodiments, the clustering subunit is further configured to determine the number of vehicles as the number of clusters, and to set the quantity range of orders in each cluster group; using the number of clusters and the quantity range as constraints, clustering multiple geographic areas within the target area according to the historical order quantity of each geographic area.
[0018] In some embodiments, the order processing unit is further configured to determine, for order data within a target area received within a target time period, the regional group to which the order data belongs based on the delivery address information of the order data, as the target regional group; and establish a corresponding relationship between the order data and the vehicle identification associated with the target regional group.
[0019] In some embodiments, the device also includes a vehicle adjustment unit, which is configured to, for each assigned preset vehicle, count the attribute information of the goods indicated by each order data corresponding to the preset vehicle to obtain transportation attribute information; and determine the vehicle adjustment strategy based on the comparison result between the attribute information of the preset vehicle and the transportation attribute information.
[0020] In some embodiments, the vehicle adjustment unit is further configured to, in response to determining that the attribute information of the preset vehicle is less than the transportation attribute information, adjust the preset vehicle to other vehicles, wherein the attribute information of the other vehicles is greater than the attribute information of the preset vehicle; in response to determining that the attribute information of the other vehicles is less than the transportation attribute information, add a transportation vehicle to the regional group associated with the other vehicles.
[0021] In some embodiments, the prediction unit is further configured to count the attribute information of the order goods at each historical time point in the historical time series based on the historical order data of the target area; use the statistical data as input, and output the predicted attribute information of the order goods in the target area within the target time period through the gradient boosting tree model.
[0022] In some embodiments, the device also includes a region division unit configured to cluster and divide the geographical locations in the target area according to the delivery address information in the historical order data through a mean shift algorithm to obtain multiple geographical areas.
[0023] In a third aspect, some embodiments of the present disclosure provide an electronic device comprising: one or more processors; a storage device on which one or more programs are stored, and when the one or more programs are executed by the one or more processors, the one or more processors implement the method described in any implementation method in the above-mentioned first aspect.
[0024] In a fourth aspect, some embodiments of the present disclosure provide a computer-readable medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the method described in any one of the implementations in the first aspect above is implemented.
[0025] In a fifth aspect, some embodiments of the present disclosure provide a computer program product, including a computer program, which implements the method described in any implementation manner in the above-mentioned first aspect when executed by a processor.
[0026] The above-mentioned various embodiments of the present disclosure have the following beneficial effects: the order data processing method of some embodiments of the present disclosure can achieve a balance between delivery time and delivery cost. Specifically, one of the relevant delivery solutions is the most cost-effective, but the production time of the order will be delayed a lot, and the delivery timeliness cannot be guaranteed. The other is the most time-optimal, but the cost of the delivery vehicle will be greatly increased. The current warehousing and distribution industry lacks a technical solution that balances delivery timeliness and delivery cost.
[0027] Based on this, the order data processing method of some embodiments of the present disclosure can predict the attribute information of the order goods within the target time period based on the historical order data. Therefore, the required number of vehicles can be predicted based on the predicted attribute information. In other words, the number of vehicles required to transport the order goods within the target time period can be predicted in advance. Then, based on the predicted number of vehicles, multiple geographical areas within the target area can be spatially clustered to obtain multiple regional groups. Afterwards, orders received within the target area within the target time period can be processed in real time based on the multiple regional groups. In other words, based on the historical order data, multiple geographical areas can be spatially clustered in advance. There is no need to wait until all orders are observed before performing order clustering and vehicle selection. In this way, when a real-time order is received, the regional group to which it belongs can be determined based on its delivery address, thereby realizing order clustering. While reducing the production and distribution costs, the delivery timeliness of the order can be guaranteed as much as possible. Thereby achieving a balance between the delivery cost and the delivery timeliness. BRIEF DESCRIPTION OF THE DRAWINGS
[0028] The above and other features, advantages and aspects of the embodiments of the present disclosure will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. Throughout the accompanying drawings, the same or similar reference numerals represent the same or similar elements. It should be understood that the drawings are schematic and that components and elements are not necessarily drawn to scale.
[0029] Figure 1 is a flow chart of some embodiments of the order data processing method disclosed in the present invention;
[0030] Figure 2 are flow charts of other embodiments of the order data processing method disclosed herein;
[0031] Figure 3 It is a schematic diagram of application scenarios of some embodiments of the order data processing method disclosed in the present invention;
[0032] Figure 4 It is a schematic diagram of the structure of some embodiments of the order data processing device disclosed in the present invention;
[0033] Figure 5 It is a schematic diagram of the structure of an electronic device suitable for implementing some embodiments of the present disclosure. DETAILED DESCRIPTION
[0034] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as being limited to the embodiments set forth herein. On the contrary, these embodiments are provided to provide a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not intended to limit the scope of protection of the present disclosure.
[0035] It should also be noted that, for ease of description, only the parts related to the invention are shown in the drawings. In the absence of conflict, the embodiments and features in the embodiments of the present disclosure can be combined with each other.
[0036] It should be noted that the concepts such as "first" and "second" mentioned in the present disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units.
[0037] It should be noted that the modifications of "one" and "plurality" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, it should be understood as "one or more".
[0038] Figure 1 The process 100 of some embodiments of the order data processing method according to the present disclosure is shown. The method comprises the following steps:
[0039] Step 101: Determine predicted attribute information of the order goods in the target area within a target time period based on the attribute information of the order goods in the historical order data of the target area.
[0040] In some embodiments, the execution entity of the order data processing method (for example Figure 3 The server shown in ) can communicate and connect with other devices through a wired connection or a wireless connection. Here, the execution subject can determine the predicted attribute information of the order goods in the target area within the target time period based on the attribute information of the order goods in the historical order data of the target area. Among them, the target area and the target time period can be set according to the actual situation. For example, the target area can be a certain city, or it can be a certain administrative district in the city, and so on. The target time period here is usually a certain time period in the future (not yet happened), such as a certain day in the future, or a certain week, etc. The order data in the target area is generally the order data within the target area whose delivery address information belongs to the order. The attribute information of the order goods can generally be information used to reflect the transportation situation of the goods, such as generally including at least one of the following: quantity, volume, weight, etc.
[0041] In some embodiments, the execution entity may use a kernel density estimation algorithm to analyze the attribute information of the order goods in the historical order data. The horizontal axis may be a historical time point, and the vertical axis may be the total attribute information of the order goods. The historical time point here may also be set according to actual conditions, such as every hour or every day. In this way, the attribute information may be fitted by the kernel density estimation algorithm, thereby determining the predicted attribute information of the order goods in the target area within the target time period.
[0042] Optionally, the execution subject can also determine the predicted attribute information within the target time period through a gradient boosting tree model (such as the XGBoost (eXtreme GradientBoosting) model). As an example, first, the execution subject can count the attribute information of the order goods at each historical time point in the historical time series based on the historical order data of the target area. After that, the statistical data can be used as input, and the predicted attribute information of the order goods in the target area within the target time period can be output through the gradient boosting tree model. This helps to improve the accuracy and efficiency of the prediction results. At the same time, the scope of application of the method can be expanded.
[0043] Here, the gradient boosting tree model can be trained by sample data. The sample data may include sample attribute information of order goods at multiple sample time points. At this time, the sample attribute information at the t-1 sample time point can be input into the model to be trained to predict the predicted attribute information at the t-th sample time point. Afterwards, the predicted attribute information at the t-th sample time point and the sample number information can be analyzed to determine whether the model training is complete. If the training is complete, the trained model can be used as the gradient boosting tree model.
[0044] Step 102, analyzing the predicted attribute information and the attribute information of the preset vehicles, and determining the number of preset vehicles required to complete the transportation of the ordered goods.
[0045] In some embodiments, based on the predicted attribute information obtained in step 101, the execution entity can analyze the attribute information of the preset vehicles and the predicted attribute information to determine the number of preset vehicles required to complete the transportation of the ordered goods. The preset vehicles here can also be set according to actual conditions, such as commonly used vehicles. The attribute information of the preset vehicles can be information used to reflect the transportation capacity of the vehicle, such as the length, width, height, and maximum weight carried by the vehicle. In other words, by comparing the predicted attribute information with the attribute information of the vehicle, it can be preliminarily determined that the minimum number of preset vehicles is required to complete the transportation task of the ordered goods indicated by the predicted attribute information.
[0046] Step 103 , based on the number of vehicles, spatially clustering multiple geographical areas within the target area to obtain multiple area groups.
[0047] In some embodiments, based on the number of vehicles determined in step 102, the execution entity may spatially cluster multiple geographic areas within the target area to obtain multiple area groups. As an example, the execution entity may cluster multiple geographic areas according to their locations to obtain multiple area groups that match (e.g., are the same or similar to) the number of vehicles. In other words, geographical areas that are adjacent in location may be clustered into one area group.
[0048] In some embodiments, the execution entity can use the number of vehicles as a constraint condition, and cluster multiple geographic areas within the target area through a spatial clustering method with constraints (such as KMeansConstrained) to obtain multiple regional groups that match the number of vehicles. That is, the number of regional groups is the same as the number of vehicles. And preset vehicles can be assigned to multiple regional groups, thereby establishing an association relationship between the vehicle identification of the preset vehicle and the multiple regional groups. This is equivalent to allocating vehicles in advance and determining the preset vehicles responsible for transporting the ordered goods of each regional group.
[0049] It should be noted that, compared with the ordinary KMeans clustering method, this method can not only set the number of categories, but also specify the upper and lower limits of the sample size of each category. Furthermore, the execution subject can determine the number of vehicles as the number of clusters, and can set the number range of orders in each cluster group (i.e., the upper and lower limits of the number of orders). In this case, the execution subject can use the number of clusters and the number range as constraints, and cluster multiple geographical areas in the target area according to the historical number of orders in each geographical area. In this way, the number of orders in each regional group can be stabilized, and the gap in the number of orders between the regional groups can be narrowed as much as possible. This avoids the situation where the delivery cannot be completed due to the excessive number of orders in a certain regional group. This can further ensure the delivery timeliness. It can be understood that the above upper limit is usually also the upper limit of each driver's daily delivery capacity, and the lower limit is usually the number of orders that each driver needs to complete at least every day. This clustering method also helps to narrow the income gap between delivery personnel.
[0050] Here, when performing spatial clustering, we can abandon the global solution of VRP. Among them, VRP is the abbreviation of Vehicle Routing Problem, which is generally a vehicle path planning problem and one of the classic optimization problems in the field of operations research and optimization. The decision variables that need to be optimized are which vehicle the goods should be assigned to and the order in which each vehicle completes the delivery of the goods. The optimization goal is mostly to minimize the number of vehicles used or the total driving distance of the vehicles. This is also because the full amount of order data (that is, the predicted attribute information of the orders obtained in the target time period) is based on the prediction, and the solution of the traditional VRP problem is extremely sensitive to the data, which can easily cause the current optimal solution to become of poor quality during actual operation. At the same time, the clustering method can have good spatial aggregation, which also has a good driver experience in actual operation. The driver can make corresponding adjustments based on whether the order can be delivered on time, which enhances flexibility.
[0051] It is understandable that the above-mentioned multiple geographical areas can be obtained by dividing the target area. As an example, it can be divided according to the administrative districts of a certain city. Alternatively, it can also be divided into one geographical area according to the geographical location.
[0052] In some embodiments, in order to improve the accuracy of the division results, the execution entity can cluster the geographical locations in the target area according to the delivery address information in the historical order data through the mean shift algorithm (such as Meanshift), thereby obtaining multiple geographical areas. This method can take into account the two important factors of non-delivery of geographical divisions and controllable quantity of goods within the category. The Meanshift clustering method is an algorithm with iterative steps. Generally, the deviation mean of the current coordinate point from the order delivery address is calculated first, and then the coordinate point is moved to the deviation mean, and the above steps are repeated until the termination condition is reached. This method can seamlessly cut the geography by using the characteristics of clustering, and any order generated in the future can be classified into a certain category. At the same time, Meanshift can focus on order clusters with higher density, which improves the stability of clustering results. That is, each category can generate enough orders every day, which can help improve the accuracy of the prediction.
[0053] In other words, the clustering results of multiple geographic regions obtained by the Meanshift clustering method are more accurate and stable. There is no need to redivide the geographic regions for a period of time. This also helps to improve the accuracy of subsequent data processing.
[0054] Step 104: Processing order data within the target area received within the target time period according to the multiple area groups.
[0055] In some embodiments, based on the multiple regional groups obtained in step 103, the execution entity may process the order data received in the target area within the target time period. As an example, the execution entity may determine the regional group to which the order data belongs based on the delivery address information of the received order data, thereby achieving clustering of the order data. That is, the order data belonging to the same regional group are classified into one category. The order data of the same category may be transported and delivered using the same vehicle.
[0056] Specifically, for order data received within the target area during the target time period, the execution entity determines the regional group to which the order data belongs based on the delivery address information of the order data, as the target regional group. Afterwards, a correspondence can be established between the order data and the vehicle identification associated with the target regional group. That is, a vehicle is assigned to each regional group. When a real-time order comes in, the corresponding regional group can be determined based on the delivery address information of the order, and the order can be matched to the vehicle that has been locked in advance in the regional group. Figure 3 As shown, vehicle A corresponds to orders 1 and 2, and vehicle B corresponds to orders 3 and 4.
[0057] Through the above description, the order data processing method of some embodiments of the present disclosure can predict the attribute information of the order goods within the target time period based on the historical order data. Therefore, the required number of vehicles can be predicted based on the predicted attribute information. In other words, the number of vehicles required to transport the order goods within the target time period can be predicted in advance. Then, according to the predicted number of vehicles, multiple geographical areas within the target area can be spatially clustered to obtain multiple regional groups. After that, the orders received within the target area within the target time period can be processed in real time based on the multiple regional groups. In other words, based on the historical order data, multiple geographical areas can be spatially clustered in advance. There is no need to wait until all orders are observed before order clustering and vehicle selection. In this way, when a real-time order is received, the regional group to which it belongs can be determined based on its delivery address, thereby realizing order clustering. While reducing the production and distribution costs, the delivery timeliness of the order can be guaranteed as much as possible. Then a balance between the distribution cost and the distribution timeliness is achieved.
[0058] Continue to see Figure 2 , which shows a process 200 according to other embodiments of the order data processing method of the present disclosure.
[0059] Step 201 : determining predicted attribute information of the order goods in the target area within a target time period according to the attribute information of the order goods in the historical order data of the target area.
[0060] Step 202: Analyze the predicted attribute information and the attribute information of the preset vehicles to determine the number of preset vehicles required to complete the transportation of the ordered goods.
[0061] Step 203 : spatially clustering the multiple geographical areas within the target area based on the number of vehicles to obtain multiple area groups, and allocating preset vehicles to the multiple area groups.
[0062] Step 204 , for the order data within the target area received within the target time period, a corresponding relationship is established between the order data and the vehicle identification associated with the target area group according to the delivery address information of the order data.
[0063] The above steps can be found in Figure 1 The relevant descriptions in step 101 to step 104 of the embodiment are not repeated here.
[0064] Step 205 , for each allocated preset vehicle, the attribute information of the goods indicated by each order data corresponding to the preset vehicle is counted to determine the vehicle adjustment strategy.
[0065] In some embodiments, for each assigned preset vehicle, that is, the preset vehicle assigned to multiple regional groups in step 203, the execution entity can collect the attribute information of the goods indicated by each order data corresponding to the preset vehicle to obtain the transportation attribute information. Then, according to the comparison result of the attribute information of the preset vehicle and the transportation attribute information, the vehicle adjustment strategy can be determined.
[0066] Specifically, in response to determining that the attribute information of the preset vehicle is less than the transportation attribute information, the preset vehicle may be adjusted to another vehicle. The attribute information of the other vehicle is generally greater than the attribute information of the preset vehicle. Further, in response to determining that the attribute information of the other vehicle is less than the transportation attribute information, a transportation vehicle is added to the regional group associated with the other vehicle.
[0067] That is to say, if the previously assigned preset vehicle can accommodate the corresponding order goods, no vehicle adjustment is required. If the preset vehicle cannot accommodate the order goods, a larger vehicle can be used instead. If the largest vehicle still cannot accommodate the order goods, a new vehicle is added to this area group, that is, an additional vehicle is added.
[0068] As an example, steps 201 to 203 in the above order data processing method can be executed before the warehouse production at 6 am every day. In this way, real-time orders received after 6 am can execute steps 204 to 205. Finally, after the warehouse closes the order, the delivery route planning can be performed for the vehicles in each regional group through TSP (traveling salesman problem).
[0069] It is understandable that the order data processing method disclosed in the present invention can construct the prediction problem into a top-down (from large to small) prediction structure, which can significantly improve the accuracy of the overall prediction. A single, fine-grained prediction cannot draw on the order volume information of the adjacent area, and cannot guarantee the data stability in its own small area, which can easily lead to inaccurate prediction results. This top-down prediction framework can effectively aggregate the information together first, and then split it. That is, first predict the attribute information of the overall order goods, and then determine the minimum number of vehicles. Then perform spatial clustering of geographical areas according to the number of vehicles. While improving data stability, when predicting the order volume of a small area, the order volume information of the surrounding areas can be fully obtained to improve the prediction accuracy.
[0070] Further references Figure 4 , as a response to the above Figure 1 to Figure 2 In order to realize the method shown in the figure, the present disclosure provides some embodiments of an order data processing device. These device embodiments are similar to Figure 1 to Figure 2 The order data processing device can be specifically applied to various electronic devices.
[0071] like Figure 4 As shown, the order data processing device 400 of some embodiments may include: a prediction unit 401, configured to determine the predicted attribute information of the order goods in the target area within the target time period based on the attribute information of the order goods in the historical order data of the target area; a vehicle determination unit 402, configured to analyze the predicted attribute information and the attribute information of the preset vehicles, and determine the number of preset vehicles to complete the transportation of the order goods; a regional clustering unit 403, configured to spatially cluster multiple geographical areas in the target area based on the number of vehicles to obtain multiple regional groups; an order processing unit 404, configured to process the order data in the target area received within the target time period according to the multiple regional groups.
[0072] In some embodiments, the regional clustering unit 403 may include: a clustering subunit ( Figure 4 ), is configured to use the number of vehicles as a constraint condition, cluster multiple geographic areas within the target area through a spatial clustering method with constraint conditions, and obtain multiple area groups that match the number of vehicles; the allocation subunit ( Figure 4 ), configured to allocate preset vehicles to multiple regional groups and establish an association relationship between the vehicle identification and the multiple regional groups.
[0073] In some embodiments, the clustering subunit can be further configured to determine the number of vehicles as the number of clusters, and to set the quantity range of orders in each cluster group; using the number of clusters and the quantity range as constraints, clustering multiple geographic areas within the target area according to the historical order quantity of each geographic area.
[0074] In some embodiments, the order processing unit 404 is further configured to determine, for order data within the target area received within the target time period, the regional group to which the order data belongs based on the delivery address information of the order data, as the target regional group; and establish a corresponding relationship between the order data and the vehicle identification associated with the target regional group.
[0075] In some embodiments, the order data processing device 400 may also include a vehicle adjustment unit ( Figure 4 ), is configured to, for each assigned preset vehicle, collect the attribute information of the goods indicated by each order data corresponding to the preset vehicle to obtain the transport attribute information; and determine the vehicle adjustment strategy based on the comparison result between the attribute information of the preset vehicle and the transport attribute information.
[0076] In some embodiments, the vehicle adjustment unit can be further configured to, in response to determining that the attribute information of the preset vehicle is less than the transportation attribute information, adjust the preset vehicle to other vehicles, wherein the attribute information of the other vehicles is greater than the attribute information of the preset vehicle; in response to determining that the attribute information of the other vehicles is less than the transportation attribute information, add a transportation vehicle to the regional group associated with the other vehicles.
[0077] In some embodiments, the prediction unit 401 can be further configured to count the attribute information of the order goods at each historical time point in the historical time series based on the historical order data of the target area; use the statistical data as input, and output the predicted attribute information of the order goods in the target area within the target time period through the gradient boosting tree model.
[0078] In some embodiments, the order data processing device 400 may further include a region division unit ( Figure 4 ), is configured to cluster the geographical locations in the target area according to the delivery address information in the historical order data through a mean shift algorithm to obtain multiple geographical areas.
[0079] It is understood that the units recorded in the order data processing device 400 are similar to those in the reference Figure 1 to Figure 2 Therefore, the operations, features and beneficial effects described above for the method are also applicable to the order data processing device 400 and the units included therein, and will not be described in detail here.
[0080] Reference below Figure 5 , which shows a structural schematic diagram of an electronic device 500 suitable for implementing some embodiments of the present disclosure. Figure 5 The electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.
[0081] like Figure 5 As shown, the electronic device 500 may include a processing device 501 (e.g., a central processing unit, a graphics processing unit, etc.), which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 502 or a program loaded from a storage device 508 into a random access memory (RAM) 503. In the RAM 503, various programs and data required for the operation of the electronic device 500 are also stored. The processing device 501, the ROM 502, and the RAM 503 are connected to each other via a bus 504. An input / output (I / O) interface 505 is also connected to the bus 504.
[0082] Typically, the following devices may be connected to the I / O interface 505: input devices 506 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; output devices 507 including, for example, a speaker, a vibrator, etc.; storage devices 508 including, for example, a hard disk, a magnetic disk, etc.; and communication devices 509. The communication devices 509 may allow the electronic device 500 to communicate with other devices wirelessly or by wire to exchange data. Figure 5 The electronic device 500 is shown with various devices, but it should be understood that it is not required to implement or possess all the devices shown. More or fewer devices may be implemented or possessed instead. Figure 5 Each block shown in the figure may represent one device, or may represent multiple devices as required.
[0083] In particular, according to some embodiments of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, some embodiments of the present disclosure include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In some such embodiments, the computer program can be downloaded and installed from the network through the communication device 509, or installed from the storage device 508, or installed from the ROM 502. When the computer program is executed by the processing device 501, the above-mentioned functions defined in the method of some embodiments of the present disclosure are executed.
[0084] It should be noted that the computer-readable medium recorded in some embodiments of the present disclosure may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, 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 above. In some embodiments of the present disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In some embodiments of the present disclosure, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, in which a computer-readable program code is carried. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. The computer readable signal medium may also be any computer readable medium other than a computer readable storage medium, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer readable medium may be transmitted using any suitable medium, including but not limited to: wires, optical cables, RF (radio frequency), etc., or any suitable combination of the above.
[0085] In some embodiments, the client and the server may communicate using any currently known or future developed network protocol such as HTTP (Hyper Text Transfer Protocol), and may be interconnected with 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"), an internet (e.g., the Internet), and a peer-to-peer network (e.g., an ad hoc peer-to-peer network), as well as any currently known or future developed network.
[0086] The computer-readable medium may be included in the electronic device; or it may exist independently without being installed in the electronic device. The computer-readable medium carries one or more programs. When the one or more programs are executed by the electronic device, the electronic device: determines the predicted attribute information of the order goods in the target area within the target time period based on the attribute information of the order goods in the historical order data of the target area; analyzes the predicted attribute information and the attribute information of the preset vehicles to determine the number of preset vehicles that complete the transportation of the order goods; spatially clusters multiple geographic areas in the target area based on the number of vehicles to obtain multiple area groups; and processes the order data in the target area received within the target time period based on the multiple area groups.
[0087] In addition, computer program code for performing the operations of some embodiments of the present disclosure may be written in one or more programming languages or a combination thereof, including object-oriented programming languages, such as Java, Smalltalk, C++, and conventional procedural programming languages, such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer may be connected to the user's computer via any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).
[0088] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present disclosure. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some implementations as replacements, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.
[0089] The units described in some embodiments of the present disclosure may be implemented by software or hardware. The units described may also be set in a processor, for example, it may be described as: a processor includes a prediction unit, a vehicle determination unit, a regional clustering unit, and an order processing unit. The names of these units do not constitute limitations on the units themselves in some cases, for example, the vehicle determination unit may also be described as a "unit for determining the number of preset vehicles to complete the transportation of ordered goods".
[0090] The functions described above herein may be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), and the like.
[0091] Some embodiments of the present disclosure further provide a computer program product, including a computer program, which, when executed by a processor, implements any of the above-mentioned order data processing methods.
[0092] The above descriptions are only some preferred embodiments of the present disclosure and an explanation of the technical principles used. Those skilled in the art should understand that the scope of the invention involved in the embodiments of the present disclosure is not limited to the technical solutions formed by a specific combination of the above-mentioned technical features, but should also cover other technical solutions formed by any combination of the above-mentioned technical features or their equivalent features without departing from the above-mentioned inventive concept. For example, the above-mentioned features are replaced with the technical features with similar functions disclosed in the embodiments of the present disclosure (but not limited to) and the technical solutions formed.
Claims
1. A method for processing order data, comprising: Determining predicted attribute information of the order goods in the target area within the target time period according to the attribute information of the order goods in the historical order data of the target area; Analyze the predicted attribute information and the attribute information of the preset vehicles to determine the number of the preset vehicles required to complete the transportation of the ordered goods; Based on the number of vehicles, spatially clustering multiple geographic areas within the target area to obtain multiple area groups; The order data within the target area received within the target time period is processed according to the multiple area groups.
2. The method according to claim 1, wherein: The method of spatially clustering the multiple geographical areas within the target area based on the number of vehicles to obtain multiple area groups includes: Taking the number of vehicles as a constraint condition, clustering multiple geographical areas within the target area through a spatial clustering method with constraint conditions to obtain multiple area groups matching the number of vehicles; and The preset vehicles are allocated to the plurality of regional groups, and association relationships between vehicle identifiers and the plurality of regional groups are established.
3. The method according to claim 2, wherein: The method of clustering the plurality of geographical areas within the target area by using a spatial clustering method with constraints by taking the number of vehicles as a constraint condition includes: Determining the number of vehicles as the number of clusters, and setting a quantity range of orders in each cluster group; The number of clusters and the quantity range are used as constraint conditions, and multiple geographical areas within the target area are clustered according to the historical order quantity of each geographical area.
4. The method according to claim 2, wherein: The step of processing the order data in the target area received within the target time period according to the multiple area groups includes: For the order data within the target area received within the target time period, determining the area group to which the order data belongs according to the delivery address information of the order data as the target area group; A correspondence is established between the order data and the vehicle identification associated with the target area group.
5. The method according to claim 4, wherein: The method further comprises: For each assigned preset vehicle, the attribute information of the goods indicated by each order data corresponding to the preset vehicle is counted to obtain the transport attribute information; A vehicle adjustment strategy is determined based on a comparison result between the attribute information of the preset vehicle and the transportation attribute information.
6. The method according to claim 5, wherein: The determining of the vehicle adjustment strategy according to the comparison result between the attribute information of the preset vehicle and the transportation attribute information includes: In response to determining that the attribute information of the preset vehicle is less than the transportation attribute information, adjusting the preset vehicle to another vehicle, wherein the attribute information of the other vehicle is greater than the attribute information of the preset vehicle; In response to determining that the attribute information of the other vehicle is less than the transportation attribute information, a transportation vehicle is added to the area group associated with the other vehicle.
7. The method according to claim 1, wherein: The step of determining predicted attribute information of the order goods in the target area within the target time period according to the attribute information of the order goods in the historical order data of the target area includes: According to the historical order data of the target area, the attribute information of the order goods at each historical time point in the historical time series is counted; The statistical data is used as input, and the predicted attribute information of the order goods in the target area within the target time period is output through the gradient boosting tree model.
8. The method according to any one of claims 1 to 7, wherein: The plurality of geographical areas are obtained by: According to the delivery address information in the historical order data, the geographical locations in the target area are clustered and divided by a mean shift algorithm to obtain a plurality of geographical areas.
9. An order data processing device, comprising: A prediction unit, configured to determine predicted attribute information of the order goods in the target area within a target time period according to the attribute information of the order goods in the historical order data of the target area; A vehicle determination unit is configured to analyze the predicted attribute information and the attribute information of the preset vehicles, and determine the number of the preset vehicles to complete the transportation of the ordered goods; A regional clustering unit is configured to spatially cluster a plurality of geographical regions within the target area based on the number of vehicles to obtain a plurality of regional groups; The order processing unit is configured to process the order data in the target area received within the target time period according to the multiple area groups.
10. An electronic device comprising: one or more processors; a storage device having one or more programs stored thereon, When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1 to 8.
11. A computer readable medium having a computer program stored thereon, wherein: When the computer program is executed by a processor, the method according to any one of claims 1 to 8 is implemented.
12. A computer program product, comprising a computer program, which, when executed by a processor, implements the method according to any one of claims 1 to 8.
Citation Information
Cited By
Intelligent monitoring management system based on 5G network
CN119854750A
