Method, device and equipment for generating collection and distribution difficulty information, medium and program product

Abstract

The embodiment of the invention discloses a collection and dispatch difficulty information generation method and device, equipment, a medium and a program product. A specific embodiment of the method comprises the steps of obtaining an article order information set; for each piece of article order information in the article order information set, generating order collection and dispatching difficulty information corresponding to the article order information according to article information and demand place information included in the article order information; according to each demander identifier included in the article order information set, performing aggregation processing on the article order information set to obtain each article order information cluster; clustering according to the order information of each item to generate cluster collection and distribution difficulty information; and according to the obtained order collection and distribution difficulty information and cluster collection and distribution difficulty information, generating collection and distribution difficulty information of the corresponding article order information set. The implementation mode is related to intelligent logistics, the applicability of the collection and dispatch difficulty information is improved, the fulfillment rate is further improved, and the customer complaint rate and the article breakage rate are reduced.

Description

Technical Field

[0001] Embodiments of the present disclosure relate to the field of computer technology, and in particular to methods, devices, equipment, media, and program products for generating information on difficulty of dispatching. Background Art

[0002] With the rapid development of computer technology, Internet technology and communication technology, more and more express parcels need to be collected and delivered by couriers. At present, when determining the difficulty of the express parcels that couriers are responsible for collecting and delivering, the usual method is: the more express parcels there are, the more difficult it is for the courier to collect and deliver them.

[0003] However, the inventors have discovered that when the above method is used to determine the difficulty of the parcels that the courier is responsible for collecting and delivering, the following technical problems often occur: only considering the number of parcels results in large differences in the actual difficulty of collecting and delivering the same number of parcels, which results in the low applicability of the determined difficulty of collecting and delivering parcels. When the courier collects a batch of parcels with a higher actual difficulty, it leads to a poor fulfillment rate and a high customer complaint rate and item damage rate.

[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 methods, devices, electronic devices, computer-readable media and program products for generating dispatch difficulty information 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 a method for generating pickup and dispatch difficulty information, the method comprising: obtaining a set of item order information, wherein the item order information in the above-mentioned item order information set includes a demander identifier, demand location information and item information; for each item order information in the above-mentioned item order information set, generating single pickup and dispatch difficulty information corresponding to the above-mentioned item order information according to the item information and demand location information included in the above-mentioned item order information; aggregating the above-mentioned item order information set according to each demander identifier included in the above-mentioned item order information set to obtain each item order information cluster; generating clustered pickup and dispatch difficulty information according to the above-mentioned each item order information cluster; generating pickup and dispatch difficulty information corresponding to the above-mentioned item order information set according to each obtained single pickup and dispatch difficulty information and the above-mentioned clustered pickup and dispatch difficulty information.

[0008] Optionally, the above-mentioned item information includes item weight, the above-mentioned demand location information includes elevator pick-up and dispatch identification and floor number; and the above-mentioned single pick-up and dispatch difficulty information corresponding to the above-mentioned item order information is generated based on the item information and demand location information included in the above-mentioned item order information, including: determining the floor weighting coefficient based on the above-mentioned elevator pick-up and dispatch identification; generating the single pick-up and dispatch difficulty information corresponding to the above-mentioned item order information based on the above-mentioned item weight, the above-mentioned floor number and the above-mentioned floor weighting coefficient.

[0009] Optionally, the above-mentioned item information also includes packaging time, and the above-mentioned demand location information also includes probability information; and the above-mentioned single-collection and dispatch difficulty information corresponding to the above-mentioned item order information is generated based on the above-mentioned item weight, the above-mentioned number of floors and the above-mentioned floor weighting coefficient, including: in response to determining that the demand task corresponding to the above-mentioned item order information is a collection task, generating the single-collection and dispatch difficulty information corresponding to the above-mentioned item order information according to the above-mentioned item weight, the above-mentioned number of floors, the above-mentioned floor weighting coefficient, the above-mentioned packaging time and the above-mentioned probability information; in response to determining that the demand task corresponding to the above-mentioned item order information is a dispatch task, generating the single-collection and dispatch difficulty information corresponding to the above-mentioned item order information according to the above-mentioned item weight, the above-mentioned number of floors, the above-mentioned floor weighting coefficient and the above-mentioned probability information.

[0010] Optionally, the above-mentioned item order information set is aggregated according to each demander identifier included in the above-mentioned item order information set to obtain each item order information cluster, including: aggregating the item order information including the same demander identifier into the same item order information group to obtain each item order information group; and spatially aggregating the above-mentioned each item order information group according to a preset geographic fence area set and each demand location information corresponding to each obtained item order information group to obtain each item order information group cluster as each item order information cluster.

[0011] Optionally, the method also includes: in response to determining that there is item order information that does not correspond to any item order information cluster in the above-mentioned item order information set, determining the item order information that does not correspond to any item order information cluster as the item order information to be aggregated; determining the text similarity between the above-mentioned demand address and the area text of each geo-fence area in the above-mentioned geo-fence area set based on the demand address included in the demand location information included in the above-mentioned item order information to be aggregated; based on the obtained text similarities, selecting a geo-fence area that meets a preset aggregation condition from the above-mentioned geo-fence area set as the target geo-fence area, wherein the above-mentioned preset aggregation condition includes a preset similarity condition; and aggregating the above-mentioned item order information to be aggregated to the above-mentioned target geo-fence area.

[0012] Optionally, the above-mentioned selecting a geo-fence area that meets preset aggregation conditions from the above-mentioned geo-fence area set as the target geo-fence area based on the obtained text similarities includes: determining the boundary distance between the above-mentioned required address and each geo-fence area in the above-mentioned geo-fence area set based on the above-mentioned required address; selecting a geo-fence area that meets preset aggregation conditions from the above-mentioned geo-fence area set as the target geo-fence area based on the obtained text similarities and boundary distances, wherein the above-mentioned preset aggregation conditions include preset similarity conditions and preset distance conditions.

[0013] Optionally, the above-mentioned clustering of the order information of each item to generate clustered collection and dispatch difficulty information includes: generating collection and dispatch difficulty information within each cluster according to the clustering of the order information of each item; generating inter-cluster collection and dispatch difficulty information according to the clustering of the order information of each item; generating clustered collection and dispatch difficulty information according to the collection and dispatch difficulty information within each cluster and the collection and dispatch difficulty information between clusters.

[0014] Optionally, the above-mentioned demand location information includes an elevator pick-up and dispatch identification and a floor number; and the above-mentioned generation of pick-up and dispatch difficulty information within each cluster based on the above-mentioned individual item order information clusters includes: for each item order information cluster in the above-mentioned individual item order information clusters, performing the following steps: determining the walking distance corresponding to the demand location information included in every two item order information in the above-mentioned item order information cluster, and obtaining a walking distance set; generating a total walking distance corresponding to the above-mentioned item order information cluster based on the above-mentioned walking distance set; generating a floor pick-up and dispatch difficulty corresponding to the above-mentioned item order information cluster based on the elevator pick-up and dispatch identification and the floor number included in each item order information in the above-mentioned item order information cluster; generating a pick-up and dispatch time corresponding to the above-mentioned item order information cluster based on the number of item order information included in the above-mentioned item order information cluster; generating the pick-up and dispatch difficulty information within the cluster based on the above-mentioned total walking distance, the above-mentioned floor pick-up and dispatch difficulty and the above-mentioned pick-up and dispatch time.

[0015] Optionally, the above-mentioned generation of inter-cluster pickup and dispatch difficulty information based on the above-mentioned individual item order information clusters includes: sorting the above-mentioned individual item order information clusters to obtain an item order information cluster sequence; for every two adjacent item order information clusters in the above-mentioned item order information cluster sequence, generating a navigation distance between the above-mentioned two adjacent item order information clusters; and determining the inter-cluster pickup and dispatch difficulty information based on the generated individual navigation distances.

[0016] Optionally, the above-mentioned acquisition of the item order information set includes: acquiring the item order information set in a target road area, wherein the above-mentioned target road area is a road area divided in a preset area, and the above-mentioned preset area includes a road area set; and the above-mentioned method also includes: performing the following division steps: for each road area in the road area set except the above-mentioned target road area, generating the pickup and dispatch difficulty information of the above-mentioned road area; generating the pickup and dispatch difficulty change information according to each historical pickup and dispatch difficulty information and each pickup and dispatch difficulty information of each road area in the road area set; in response to determining that the above-mentioned pickup and dispatch difficulty change information reaches the preset optimization target, determining the above-mentioned road area set as the preset area after the division.

[0017] Optionally, the method further includes: in response to determining that the above-mentioned information on the change in difficulty of pickup and dispatch does not reach the above-mentioned preset optimization target, dividing the above-mentioned preset area to obtain a divided road area set as a road area set, and executing the above-mentioned division step again.

[0018] Optionally, the above-mentioned obtaining of a set of item order information includes: obtaining a set of item order information of a target pickup and delivery user within a preset time period; and the above-mentioned method also includes: generating the allocation value information of the above-mentioned target pickup and delivery user within the above-mentioned preset time period based on the initial allocation value information corresponding to the above-mentioned target pickup and delivery user and the above-mentioned pickup and delivery difficulty information.

[0019] Optionally, the method also includes: sending the above-mentioned collection and delivery difficulty information to the target terminal device; in response to receiving the item order collection and delivery rejection request sent by the above-mentioned target terminal device, sending the target item order information to at least one terminal device that meets the preset collection and delivery conditions, wherein the above-mentioned target item order information is the item order information corresponding to the above-mentioned item order collection and delivery rejection request; in response to receiving the item order reception information corresponding to the above-mentioned target item order information sent by any terminal device among the above-mentioned at least one terminal device, determining the above-mentioned target item order information as the item order information of the collection and delivery user corresponding to the above-mentioned any terminal device.

[0020] In a second aspect, some embodiments of the present disclosure provide a device for generating collection and dispatch difficulty information, the device comprising: an acquisition unit, configured to acquire a set of item order information, wherein the item order information in the above-mentioned item order information set includes a demander identifier, demand location information and item information; a first generation unit, configured to generate, for each item order information in the above-mentioned item order information set, single collection and dispatch difficulty information corresponding to the above-mentioned item order information according to the item information and demand location information included in the above-mentioned item order information; an aggregation unit, configured to aggregate the above-mentioned item order information set according to each demander identifier included in the above-mentioned item order information set to obtain each item order information cluster; a second generation unit, configured to generate clustered collection and dispatch difficulty information according to the above-mentioned each item order information cluster; a third generation unit, configured to generate collection and dispatch difficulty information corresponding to the above-mentioned item order information set according to each obtained single collection and dispatch difficulty information and the above-mentioned clustered collection and dispatch difficulty information.

[0021] Optionally, the above-mentioned item information includes item weight, and the above-mentioned required location information includes elevator dispatch identification and floor number.

[0022] Optionally, the first generating unit is further configured to: determine a floor weighting coefficient based on the above-mentioned elevator pick-up and dispatch identification; and generate single pick-up and dispatch difficulty information corresponding to the above-mentioned item order information based on the above-mentioned item weight, the above-mentioned floor number and the above-mentioned floor weighting coefficient.

[0023] Optionally, the above-mentioned item information also includes packaging time, and the above-mentioned required location information also includes probability information.

[0024] Optionally, the first generating unit is further configured to: in response to determining that the demand task corresponding to the above-mentioned item order information is a collection task, generate the single collection and dispatch difficulty information corresponding to the above-mentioned item order information according to the above-mentioned item weight, the above-mentioned number of floors, the above-mentioned floor weighting coefficient, the above-mentioned packaging time and the above-mentioned probability information; in response to determining that the demand task corresponding to the above-mentioned item order information is a delivery task, generate the single collection and dispatch difficulty information corresponding to the above-mentioned item order information according to the above-mentioned item weight, the above-mentioned number of floors, the above-mentioned floor weighting coefficient and the above-mentioned probability information.

[0025] Optionally, the aggregation unit is further configured to: aggregate the item order information including the same demander identification into the same item order information group to obtain individual item order information groups; perform spatial aggregation processing on the above-mentioned individual item order information groups according to a preset set of geographic fence areas and individual demand location information corresponding to the obtained individual item order information groups to obtain clusters of individual item order information groups as individual item order information clusters.

[0026] Optionally, the device for generating information on difficulty of delivery also includes: a first determination unit, a second determination unit, a selection unit, and a geo-fence area aggregation unit. The first determination unit may be configured to, in response to determining that there is item order information that does not correspond to any item order information cluster in the above-mentioned item order information set, determine the item order information that does not correspond to any item order information cluster as the item order information to be aggregated. The second determination unit may be configured to determine the text similarity between the above-mentioned demand address and the area text of each geo-fence area in the above-mentioned geo-fence area set based on the demand address included in the demand location information included in the above-mentioned item order information to be aggregated. The selection unit may be configured to select a geo-fence area that meets a preset aggregation condition from the above-mentioned geo-fence area set as the target geo-fence area based on the obtained text similarities, wherein the above-mentioned preset aggregation condition includes a preset similarity condition. The geo-fence area aggregation unit may be configured to aggregate the above-mentioned item order information to be aggregated to the above-mentioned target geo-fence area.

[0027] Optionally, the selection unit is further configured to: determine the boundary distance between the above-mentioned required address and each geo-fence area in the above-mentioned geo-fence area set based on the above-mentioned required address; and select the geo-fence area that meets the preset aggregation conditions from the above-mentioned geo-fence area set as the target geo-fence area based on the obtained text similarities and boundary distances, wherein the above-mentioned preset aggregation conditions include preset similarity conditions and preset distance conditions.

[0028] Optionally, the second generation unit includes: an intra-cluster dispatch difficulty information generation unit, an inter-cluster dispatch difficulty information generation unit, and a cluster dispatch difficulty information generation unit. Among them, the intra-cluster dispatch difficulty information generation unit is configured to generate each intra-cluster dispatch difficulty information according to the above-mentioned individual item order information clusters. The inter-cluster dispatch difficulty information generation unit is configured to generate the inter-cluster dispatch difficulty information according to the above-mentioned individual item order information clusters. The cluster dispatch difficulty information generation unit is configured to generate the cluster dispatch difficulty information according to the above-mentioned individual intra-cluster dispatch difficulty information and the above-mentioned inter-cluster dispatch difficulty information.

[0029] Optionally, the above-mentioned required location information includes the elevator dispatch identification and the floor number.

[0030] Optionally, the intra-cluster pickup and dispatch difficulty information generating unit is further configured to: for each item order information cluster in the above-mentioned individual item order information clusters, perform the following steps: determine the walking distance corresponding to the demand location information included in every two item order information in the above-mentioned item order information cluster to obtain a walking distance set; based on the above-mentioned walking distance set, generate a total walking distance corresponding to the above-mentioned item order information cluster; based on the elevator pickup and dispatch identification and the number of floors included in each item order information in the above-mentioned item order information cluster, generate a floor pickup and dispatch difficulty corresponding to the above-mentioned item order information cluster; based on the number of item order information included in the above-mentioned item order information cluster, generate a pickup and dispatch time corresponding to the above-mentioned item order information cluster; based on the above-mentioned total walking distance, the above-mentioned floor pickup and dispatch difficulty and the above-mentioned pickup and dispatch time, generate intra-cluster pickup and dispatch difficulty information.

[0031] Optionally, the inter-cluster pick-up and dispatch difficulty information generating unit is further configured to: sort the above-mentioned individual item order information clusters to obtain an item order information cluster sequence; for every two adjacent item order information clusters in the above-mentioned item order information cluster sequence, generate a navigation distance between the above-mentioned two adjacent item order information clusters; and determine the inter-cluster pick-up and dispatch difficulty information based on the generated individual navigation distances.

[0032] Optionally, the acquisition unit is further configured to: acquire an item order information set within a target road area, wherein the target road area is a road area divided from a preset area, and the preset area includes a road area set.

[0033] Optionally, the device also includes: an execution unit, configured to perform the following division steps: for each road zone in the road zone set except the above-mentioned target road zone, generating the pickup and dispatch difficulty information of the above-mentioned road zone; generating the pickup and dispatch difficulty change information based on each historical pickup and dispatch difficulty information and each pickup and dispatch difficulty information of each road zone in the road zone set; in response to determining that the above-mentioned pickup and dispatch difficulty change information reaches a preset optimization target, determining the above-mentioned road zone set as a preset area after the division is completed.

[0034] Optionally, the device also includes: a division unit, which is configured to divide the above-mentioned preset area in response to determining that the above-mentioned information on the change in difficulty of picking up and dispatching does not reach the preset above-mentioned optimization target, obtain a divided road area set as a road area set, and execute the above-mentioned division step again.

[0035] Optionally, the acquisition unit is further configured to: acquire a set of item order information of the target delivery user within a preset time period.

[0036] Optionally, the device also includes: an allocation value information generation unit, configured to generate the allocation value information of the above-mentioned target pick-up and dispatch user within the above-mentioned preset time period based on the initial allocation value information corresponding to the above-mentioned target pick-up and dispatch user and the above-mentioned pick-up and dispatch difficulty information.

[0037] Optionally, the device further includes: a first sending unit, a second sending unit and an item order information determination unit. The first sending unit is configured to send the above-mentioned pick-up and dispatch difficulty information to the target terminal device. The second sending unit is configured to send the target item order information to at least one terminal device that meets the preset pick-up and dispatch conditions in response to receiving the item order pick-up and dispatch rejection request sent by the above-mentioned target terminal device, wherein the above-mentioned target item order information is the item order information corresponding to the above-mentioned item order pick-up and dispatch rejection request. The item order information determination unit is configured to determine the above-mentioned target item order information as the item order information of the pick-up and dispatch user corresponding to the above-mentioned any terminal device in response to receiving the item order reception information corresponding to the above-mentioned target item order information sent by any terminal device among the above-mentioned at least one terminal device.

[0038] 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 manner of the above-mentioned first aspect.

[0039] In a fourth aspect, some embodiments of the present disclosure provide a computer-readable medium having a computer program stored thereon, wherein when the program is executed by a processor, the method described in any implementation manner of the above-mentioned first aspect is implemented.

[0040] 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 of the above-mentioned first aspect when executed by a processor.

[0041] The above-mentioned embodiments of the present disclosure have the following beneficial effects: through the method for generating the difficulty information of the collection and dispatch in some embodiments of the present disclosure, the applicability of the difficulty information of the collection and dispatch is improved, thereby improving the fulfillment rate, and reducing the customer complaint rate and the item damage rate. Specifically, the reasons for the low applicability of the difficulty information of the collection and dispatch, the poor fulfillment rate, and the high customer complaint rate and item damage rate are: only considering the number of express parcels, resulting in a large difference in the actual difficulty of collecting and dispatching the same number of express parcels, thereby resulting in a low applicability of the difficulty of the determined collection and dispatch of express parcels, and when the courier collects a batch of express parcels with a higher actual difficulty, it leads to a poor fulfillment rate, a high customer complaint rate and an item damage rate. Based on this, the method for generating the difficulty information of the collection and dispatch in some embodiments of the present disclosure, first, obtains a set of item order information. Among them, the item order information in the above-mentioned item order information set includes a demander identifier, a demand location information and an item information. Then, for each item order information in the above-mentioned item order information set, according to the item information and the demand location information included in the above-mentioned item order information, a single collection and dispatch difficulty information corresponding to the above-mentioned item order information is generated. Therefore, the item-related information and the demand location-related information can be used to generate the single collection and delivery difficulty information of a single express delivery dimension. Afterwards, according to the identification of each demander included in the above-mentioned item order information set, the above-mentioned item order information set is aggregated to obtain each item order information cluster. Therefore, each item order information can be aggregated from the dimension of the demander. Secondly, based on the above-mentioned item order information clusters, cluster collection and delivery difficulty information is generated. Therefore, different item order information clusters can be used to generate cluster collection and delivery difficulty information of multiple express delivery dimensions. Finally, based on the obtained individual collection and delivery difficulty information and the above-mentioned cluster collection and delivery difficulty information, the collection and delivery difficulty information corresponding to the above-mentioned item order information set is generated. Therefore, from the dimensions of a single express delivery and multiple express deliveries, the overall collection and delivery difficulty information corresponding to the item order information set can be generated. Also, because the generated collection and delivery difficulty information utilizes the item information and the demand location information, it avoids considering only the number of express parcels. Also, because the collection and delivery difficulty information is generated from the dimensions of a single express parcel and multiple express parcels as a whole, the corresponding item order information set, the applicability of the determined collection and delivery difficulty information is improved, so that it can be used to balance the difficulty of a batch of express parcels collected and delivered by couriers, thereby improving the fulfillment rate and reducing the customer complaint rate and item damage rate. BRIEF DESCRIPTION OF THE DRAWINGS

[0042] 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.

[0043] Figure 1 is an architectural diagram of an exemplary system in which some embodiments of the present disclosure may be applied;

[0044] Figure 2 is a schematic diagram of an application scenario of a method for generating information on difficulty of dispatching according to some embodiments of the present disclosure;

[0045] Figure 3 is a flowchart of some embodiments of the method for generating dispatch difficulty information according to the present disclosure;

[0046] Figure 4 is a flowchart of other embodiments of the method for generating dispatch difficulty information according to the present disclosure;

[0047] Figure 5 It is a structural schematic diagram of some embodiments of the device for generating information on difficulty of taking assignments according to the present disclosure;

[0048] Figure 6 It is a schematic diagram of the structure of an electronic device suitable for implementing some embodiments of the present disclosure. DETAILED DESCRIPTION

[0049] 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.

[0050] 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.

[0051] 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.

[0052] 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".

[0053] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.

[0054] With regard to the collection, storage, and use of user personal information (such as item order information) involved in this disclosure, before performing the corresponding operations, the relevant organizations or individuals shall fulfill their obligations, including conducting personal information security impact assessments, fulfilling the obligation to inform the personal information subject, obtaining the authorization and consent of the personal information subject in advance, and complying with the provisions of relevant laws and regulations.

[0055] The present disclosure will be described in detail below with reference to the accompanying drawings and in conjunction with embodiments.

[0056] Figure 1 An exemplary system architecture 100 is shown to which a method or device for generating information on difficulty in picking up a task or a task can be applied according to some embodiments of the present disclosure.

[0057] like Figure 1 As shown, the system architecture 100 may include terminal devices 101, 102, 103, a network 104 and a server 105. The network 104 is used to provide a medium for communication links between the terminal devices 101, 102, 103 and the server 105. The network 104 may include various connection types, such as wired, wireless communication links or optical fiber cables, etc.

[0058] Users can use terminal devices 101, 102, 103 to interact with server 105 through network 104 to receive or send messages, etc. Various communication client applications can be installed on terminal devices 101, 102, 103, such as web browser applications, logistics collection and delivery applications, search applications, instant messaging tools, email clients, social platform software, etc.

[0059] Terminal devices 101, 102, 103 can be hardware or software. When terminal devices 101, 102, 103 are hardware, they can be various electronic devices with display screens and supporting information display, including but not limited to smart phones, tablet computers, e-book readers, laptop portable computers, desktop computers, etc. When terminal devices 101, 102, 103 are software, they can be installed in the electronic devices listed above. They can be implemented as multiple software or software modules for providing distributed services, for example, or they can be implemented as a single software or software module. No specific limitation is made here.

[0060] The server 105 may be a server that provides various services, such as a background server that provides support for information displayed on the terminal devices 101, 102, and 103. The background server may analyze and process the received request and other data, and feed back the processing results to the terminal device.

[0061] It should be noted that the method for generating the dispatch difficulty information provided in the embodiment of the present disclosure can be executed by the terminal devices 101, 102, 103, or by the server 105. Accordingly, the dispatch difficulty information generating device can be set in the terminal devices 101, 102, 103, or in the server 105. No specific limitation is made here.

[0062] It should be noted that the server can be hardware or software. When the server is hardware, it can be implemented as a distributed server cluster consisting of multiple servers, or it can be implemented as a single server. When the server is software, it can be implemented as multiple software or software modules for providing distributed services, or it can be implemented as a single software or software module. No specific limitation is made here.

[0063] It should be understood that Figure 1 The number of terminal devices, networks and servers in the embodiment is only for illustration. Any number of terminal devices, networks and servers may be provided according to the implementation requirements.

[0064] Figure 2 It is a schematic diagram of an application scenario of the method for generating information on difficulty of dispatching in some embodiments of the present disclosure.

[0065] exist Figure 2 In the application scenario, first, the computing device 201 can receive and obtain the item order information set 202. The item order information in the above-mentioned item order information set 202 includes the demander identifier, the demand location information and the item information. Then, the computing device 201 can generate the single pick-up and dispatch difficulty information corresponding to the above-mentioned item order information for each item order information in the above-mentioned item order information set 202 according to the item information and the demand location information included in the above-mentioned item order information. Thus, each single pick-up and dispatch difficulty information 203 is obtained. Afterwards, the computing device 201 can aggregate the above-mentioned item order information set 202 according to each demander identifier included in the above-mentioned item order information set 202 to obtain each item order information cluster 204. Secondly, the computing device 201 can generate the cluster pick-up and dispatch difficulty information 205 according to the above-mentioned each item order information cluster 204. Finally, the computing device 201 can generate the pick-up and dispatch difficulty information 206 corresponding to the above-mentioned item order information set 202 according to the obtained each single pick-up and dispatch difficulty information 203 and the above-mentioned cluster pick-up and dispatch difficulty information 205.

[0066] It should be noted that the computing device 201 can be hardware or software. When the computing device is hardware, it can be implemented as a distributed cluster consisting of multiple servers or terminal devices, or it can be implemented as a single server or a single terminal device. When the computing device is embodied as software, it can be installed in the hardware devices listed above. It can be implemented as multiple software or software modules for providing distributed services, or it can be implemented as a single software or software module. No specific limitation is made here.

[0067] It should be understood that Figure 2 The number of computing devices in the embodiment is only illustrative. Any number of computing devices may be provided according to implementation requirements.

[0068] Continue to refer Figure 3 , shows a process 300 of some embodiments of the method for generating the difficulty information of a task assignment according to the present disclosure. The method for generating the difficulty information of a task assignment comprises the following steps:

[0069] Step 301, obtaining an item order information set.

[0070] In some embodiments, the execution subject of the method for generating the difficulty information of the assignment (for example Figure 2The computing device 201 shown in the figure can obtain a set of item order information from the terminal through a wired connection or a wireless connection. The above-mentioned item order information set can be a set of item order information for which the difficulty information of the collection and delivery is to be determined. For example, the item order information set can be a set of item order information within a preset time period. Each item order information in the above-mentioned item order information set can correspond to a collection task or a delivery task. The above-mentioned item order information set can include item order information corresponding to a collection task or item order information corresponding to a delivery task. The item order information in the above-mentioned item order information set can include a demander identifier, a demand location information and item information. For example, when the item order information corresponds to a collection task, the item order information can include a sender identifier, a delivery location information and item information. When the item order information corresponds to a delivery task, the item order information can include a recipient identifier, a delivery location information and item information. The above-mentioned sender identifier can be an identifier that can uniquely represent the sender. For example, the sender identifier can be a mobile phone number or a sender code. The above-mentioned delivery location information can be relevant information representing the delivery location. The above-mentioned delivery location information can include a delivery address. The above-mentioned delivery location information may also include, but is not limited to: the probability that the sender is at home. The above-mentioned recipient identifier may be an identifier that can uniquely represent the recipient. For example, the recipient identifier may be a mobile phone number or a recipient code. The above-mentioned delivery location information may be relevant information indicating the delivery location. The above-mentioned delivery location information may include a delivery address. The above-mentioned delivery location information may also include, but is not limited to: the probability that the recipient is at home. The above-mentioned item information may be information related to the item. For example, the above-mentioned item information may include the quantity of items.

[0071] It should be noted that the above-mentioned wireless connection methods may include but are not limited to 3G / 4G connection, WiFi connection, Bluetooth connection, WiMAX connection, Zigbee connection, UWB (ultra wideband) connection, and other wireless connection methods currently known or to be developed in the future.

[0072] Step 302: for each item order information in the item order information set, generate the single delivery difficulty information of the corresponding item order information according to the item information and the required location information included in the item order information.

[0073] In some embodiments, for each item order information in the above-mentioned item order information set, the above-mentioned execution subject may generate the single dispatch difficulty information corresponding to the above-mentioned item order information based on the item information and the demand location information included in the above-mentioned item order information. In practice, the above-mentioned execution subject may perform dimensionless processing on the number of items included in the above-mentioned item information and the probability of being at home included in the above-mentioned demand location information to obtain the number of items and the probability of being at home after dimensionless processing. Here, the dimensionless processing may be a maximum value standardization processing. The maximum value adopted may be a preset value. The dimensionless processing may also be: using the historical maximum value corresponding to the percentile as the divisor, using the data to be dimensionlessly processed as the dividend, and then multiplying the obtained quotient by the preset maximum dimension value as the data after dimensionless processing. Then, the weighted sum of the number of items and the probability of being at home after dimensionless processing may be determined as the single dispatch difficulty information corresponding to the above-mentioned item order information. Here, the specific setting of each weighting coefficient is not limited.

[0074] Optionally, the item information may further include item weight. The item weight may be the total weight of each item corresponding to the item order information. The required location information may further include an elevator pick-up and dispatch mark and a floor number. The elevator pick-up and dispatch mark may be a mark indicating whether there is an elevator at the required location. The floor number may be the floor where the required location of the demander is located. The demander may be a recipient or a sender.

[0075] In some optional implementations of some embodiments, the execution entity may generate the single delivery difficulty information corresponding to the item order information through the following steps:

[0076] The first step is to determine the floor weighting coefficient according to the elevator dispatching mark. In practice, the execution subject may determine the first floor weighting coefficient as the floor weighting coefficient in response to determining that the elevator dispatching mark indicates that there is an elevator. The execution subject may determine the second floor weighting coefficient as the floor weighting coefficient in response to determining that the elevator dispatching mark indicates that there is no elevator. The first floor weighting coefficient and the second floor weighting coefficient may be pre-set coefficients. The first floor weighting coefficient is less than the second floor weighting coefficient.

[0077] The second step is to generate the single delivery difficulty information corresponding to the above-mentioned item order information based on the above-mentioned item weight, the above-mentioned number of floors and the above-mentioned floor weighting coefficient. In practice, the above-mentioned execution entity may first perform dimensionless processing on the above-mentioned item weight and the above-mentioned number of floors to obtain the dimensionless item weight and the number of floors. Then, the weighted sum of the dimensionless item weight and the number of floors may be determined as the single delivery difficulty information corresponding to the above-mentioned item order information. Among them, the weighting coefficient of the number of floors after dimensionless processing is the above-mentioned floor weighting coefficient. Therefore, the single delivery difficulty information of a single express delivery can be determined from the comprehensive dimensions of item weight, whether there is an elevator and the number of floors.

[0078] Optionally, the above-mentioned item information may further include packaging time. The packaging time may be the time taken to package the express corresponding to the item order information. The above-mentioned required location information may further include probability information. When the item order information corresponds to a delivery task, the probability information may be delivery probability information. The delivery probability information may be the probability of successful delivery. When the item order information corresponds to a pickup task, the probability information may be collection probability information. The collection probability information may be the probability of successful pickup.

[0079] In some optional implementations of some embodiments, the execution subject may generate the single pick-up and dispatch difficulty information corresponding to the item order information in response to determining that the demand task corresponding to the item order information is a pick-up task, according to the item weight, the number of floors, the weighting coefficient of the floors, the packaging time and the probability information. In practice, the execution subject may first perform dimensionless processing on the item weight, the number of floors, the packaging time and the probability information to obtain the dimensionless item weight, the number of floors, the packaging time and the probability information. Then, the weighted sum of the dimensionless item weight, the number of floors, the packaging time and the probability information may be determined as the single pick-up and dispatch difficulty information corresponding to the item order information. Among them, the weighting coefficient of the number of floors after dimensionless processing is the weighting coefficient of the floors. Thus, the single pick-up and dispatch difficulty information of a single express in the pick-up task can be determined from the comprehensive dimensions of item weight, whether there is an elevator, the number of floors, the packaging time and the probability of pick-up. The execution subject may also generate the single delivery difficulty information corresponding to the item order information in response to determining that the demand task corresponding to the item order information is a delivery task, according to the item weight, the number of floors, the floor weighting coefficient and the probability information. In practice, the execution subject may first perform dimensionless processing on the item weight, the number of floors and the probability information to obtain the dimensionless item weight, number of floors and probability information. Then, the weighted sum of the dimensionless item weight, number of floors and probability information may be determined as the single delivery difficulty information corresponding to the item order information. Among them, the weighting coefficient of the number of floors after dimensionless processing is the floor weighting coefficient. Thus, the single delivery difficulty information of a single express in the delivery task can be determined from the comprehensive dimensions of item weight, whether there is an elevator, number of floors and delivery probability.

[0080] Step 303: Aggregate the item order information set according to the identifiers of the demanders included in the item order information set to obtain item order information clusters.

[0081] In some embodiments, the execution entity may aggregate the item order information set according to the identifiers of the demanders included in the item order information set to obtain item order information clusters. In practice, the execution entity may aggregate item order information with the same identifier of the demander into the same item order information cluster to obtain item order information clusters.

[0082] In some optional implementations of some embodiments, first, the above-mentioned execution subject can aggregate the item order information including the same demander identification into the same item order information group to obtain each item order information group. Then, according to the preset geographic fence area set and the various demand location information corresponding to the obtained each item order information group, the above-mentioned each item order information group can be spatially aggregated to obtain each item order information group cluster as each item order information cluster. Among them, the geographic fence area set can be each pre-divided geographic fence area. Here, the geographic fence area can be represented by a directed vector composed of geographic coordinate pairs, which can be visualized as a face object. A geographic fence area can correspond to an express delivery point. In practice, the above-mentioned execution subject can first convert each receiving address included in the above-mentioned each demand location information into each geographic coordinate. Then, each item order information with corresponding geographic coordinates in the same geographic fence area can be clustered into the same item order information cluster to obtain each item order information cluster. In this way, the item order information can be aggregated from the dimensions of the demander and the geographic space.

[0083] Optionally, first, in response to determining that there is item order information that does not correspond to any item order information cluster in the item order information set, the execution subject may determine the item order information that does not correspond to any item order information cluster as the item order information to be aggregated. Then, the text similarity between the required address and the regional text of each geo-fenced area in the above-mentioned geo-fenced area set may be determined based on the required address included in the required location information included in the above-mentioned item order information to be aggregated. Here, the required address (delivery address or mailing address) may be expressed in text form. Afterwards, based on the obtained text similarities, a geo-fenced area that meets the preset aggregation condition may be selected from the above-mentioned geo-fenced area set as the target geo-fenced area, wherein the preset aggregation condition includes a preset similarity condition. The preset similarity condition may be that the text similarity corresponding to the geo-fenced area is the maximum value among the obtained text similarities. Here, the text of the geo-fenced area may be the name of a courier point. Finally, the above-mentioned item order information to be aggregated may be aggregated to the above-mentioned target geo-fenced area. Therefore, when there is item order information that is not classified into any cluster, the final aggregated cluster can be determined by the text similarity between the demand address included therein and the geo-fenced area.

[0084] In some optional implementations of some embodiments, the execution subject may select a geo-fenced area that meets a preset aggregation condition from the geo-fenced area set as a target geo-fenced area according to the obtained text similarities through the following steps:

[0085] The first step is to determine the boundary distance between the required address and each geo-fenced area in the set of geo-fenced areas according to the required address. Here, the boundary distance can be the vertical distance from a point to a surface.

[0086] In the second step, according to the obtained text similarities and boundary distances, a geo-fenced area that meets the preset aggregation condition is selected from the above-mentioned geo-fenced area set as the target geo-fenced area. The above-mentioned preset aggregation condition includes a preset similarity condition and a preset distance condition. The above-mentioned preset distance condition can be that the corresponding boundary distance is less than or equal to the preset distance. The above-mentioned preset similarity condition can be that the corresponding text similarity is greater than the preset similarity. Here, the specific settings of the preset distance and the preset similarity are not limited.

[0087] Therefore, the cluster into which the item order information that is not classified into any cluster is finally aggregated can be determined based on the comprehensive dimensions of distance and similarity to the geo-fenced area.

[0088] Step 304, clustering the order information of each item and generating clustered delivery difficulty information.

[0089] In some embodiments, the execution subject may generate cluster dispatch difficulty information based on the above-mentioned item order information clusters. In practice, first, for each item order information cluster in the above-mentioned item order information clusters, the execution subject may perform the following steps:

[0090] The first step is to determine the walking distance corresponding to the required location information included in each two item order information in the item order information cluster to obtain a walking distance set. In practice, the execution entity may determine the walking navigation distance between the required addresses in the required location information included in the two item order information as the walking distance.

[0091] The second step is to generate a total walking distance corresponding to the item order information cluster according to the walking distance set. In practice, the execution entity may determine the average of each walking distance included in the walking distance set as the walking distance average. Then, the product of the walking distance average and the number of item order information included in the item order information cluster may be determined as the total walking distance.

[0092] Then, the sum of the total walking distances obtained can be determined as the clustering difficulty information.

[0093] Step 305: Generate the collection and delivery difficulty information of the corresponding item order information set based on the obtained individual collection and delivery difficulty information and cluster collection and delivery difficulty information.

[0094] In some embodiments, the execution subject may generate the collection and dispatch difficulty information corresponding to the above-mentioned item order information set based on the obtained individual collection and dispatch difficulty information and the above-mentioned cluster collection and dispatch difficulty information. In practice, the execution subject may determine the sum of the individual collection and dispatch difficulty information as the overall collection and dispatch difficulty information. Then, the overall collection and dispatch difficulty information and the above-mentioned cluster collection and dispatch difficulty information may be dimensionless processed to obtain the dimensionless processed overall collection and dispatch difficulty information and the cluster collection and dispatch difficulty information. Finally, the weighted sum of the dimensionless processed overall collection and dispatch difficulty information and the cluster collection and dispatch difficulty information may be determined as the collection and dispatch difficulty information corresponding to the above-mentioned item order information set. Here, the dimensionless processing may be a dimensionless processing using percentiles and preset maximum dimension values. For example, the percentile may be 95%. The preset maximum dimension value may be 10000. The corresponding preset minimum dimension value may be 0. When the obtained collection and dispatch difficulty information is greater than the preset maximum dimension value, the collection and dispatch difficulty information may be set to the preset maximum dimension value. The collection and dispatch difficulty information may characterize the overall difficulty of each express corresponding to the collection and dispatch item order information set.

[0095] In some optional implementations of some embodiments, the execution subject may obtain a set of item order information in a target road area. The target road area may be a road area divided in a preset area. Here, the target road area may be any road area divided in the preset area. The preset area may be a pre-selected area. The preset area may include a road area set. Each road area in the road area set may correspond to a pick-up and delivery user, i.e., a courier.

[0096] Optionally, after step 305, the execution entity may perform the following division steps:

[0097] The first step is to generate the pick-up and dispatch difficulty information of each road area in the road area set except the target road area. In practice, the specific implementation method of generating the pick-up and dispatch difficulty information of the road area can refer to steps 301-305, which will not be repeated here.

[0098] The second step is to generate the dispatch difficulty change information based on the historical pickup and dispatch difficulty information and each pickup and dispatch difficulty information of each road zone in the road zone set. Among them, each historical pickup and dispatch difficulty information can be each pickup and dispatch difficulty information determined by the road zone set obtained by dividing the above-mentioned preset area last time. Here, the way to divide the preset area can be manual division by the user, or it can be automatic division. Automatic division can be an automatic division method with grids as units using enumeration combination or operations research method. In practice, first, the above-mentioned execution entity can determine the variance of the above-mentioned each historical pickup and dispatch difficulty information as the historical pickup and dispatch difficulty variance. Then, the variance of the above-mentioned each pickup and dispatch difficulty information can be determined as the pickup and dispatch difficulty variance. Afterwards, the difference between the above-mentioned historical pickup and dispatch difficulty variance and the above-mentioned pickup and dispatch difficulty variance can be determined as the pickup and dispatch difficulty change information.

[0099] The third step is to determine the above-mentioned road area set as the preset area after the above-mentioned difficulty change information of picking up and dispatching reaches the preset optimization target in response to determining that the above-mentioned difficulty change information of picking up and dispatching reaches the preset optimization target. Among them, the above-mentioned optimization target can be that the above-mentioned difficulty change information of picking up and dispatching is greater than a preset value. For example, the preset value can be 0.

[0100] Optionally, the execution subject may also divide the preset area in response to determining that the above-mentioned delivery difficulty change information does not reach the preset optimization target, obtain a set of divided road areas as a road area set, and perform the above-mentioned division step again. Here, the division process may be the above-mentioned way of dividing the preset area. Thus, the road area division of the area can be achieved according to the delivery difficulty information of the determined road area. Thereby, the delivery difficulty in each road area can be more balanced, reducing the performance effectiveness problems caused by the courier's excessive delivery tasks, and reducing the customer complaint rate and the item damage rate.

[0101] In some optional implementations of some embodiments, the execution subject may obtain a set of item order information of a target delivery user within a preset time period. The target delivery user may be any delivery user. The delivery user may be a courier responsible for delivery. The preset time period may be a preset historical time period. For example, the preset time period may be a time period corresponding to the past month.

[0102] Optionally, the execution subject may also generate the distribution value information of the target pick-up user within the preset time period according to the initial distribution value information corresponding to the target pick-up user and the pick-up difficulty information. The initial distribution value information may be the sum of the distribution values ​​without considering the pick-up difficulty. For example, the distribution values ​​without considering the pick-up difficulty may include but are not limited to at least one of the following: preset value, quantity value, and deduction value. The preset value may be a preset value corresponding to the target pick-up user (for example, the preset value may be a base salary). The quantity value may be the product of the number of item order information included in the item order information set and a preset coefficient. The deduction value may be the value to be deducted from the target pick-up user (for example, the deduction value may be the sum of the leave salary and the salary deducted for failure to deliver in time within the preset time period). The deduction value may be a negative number. In practice, the execution subject may determine the weighted sum of the initial distribution value information and the pick-up difficulty information as the distribution value information of the target pick-up user within the preset time period. The distribution value information may characterize the salary that the target pick-up user deserves within the preset time period. Therefore, the salary that the delivery user should receive within the above preset time period can be determined by the determined delivery difficulty information. This can avoid the method of determining salary only by the number of express parcels, and can comprehensively measure the distribution value information of the corresponding delivery user, thereby improving the work quality of the delivery user.

[0103] Optionally, the execution subject may also send the above-mentioned delivery difficulty information to the target terminal device. The target terminal device may be a terminal device of a delivery user who is responsible for delivering each express mail corresponding to the item order information set. Then, in response to receiving the item order rejection delivery request sent by the target terminal device, the target item order information may be sent to at least one terminal device that meets the preset delivery condition. Among them, the target item order information may be the item order information corresponding to the item order rejection delivery request. The item order rejection delivery request may be a request for representing the rejection of the delivery of the express mail corresponding to the target item order information. The item order rejection delivery request may include the order number corresponding to the target item order information. The preset delivery condition may be that the express point corresponding to the terminal device is the same as the express point corresponding to the target terminal device. The express point corresponding to the terminal device may be the express point where the corresponding express mail is delivered by the delivery user corresponding to the terminal device. Finally, in response to receiving the item order reception information corresponding to the target item order information sent by any terminal device among the at least one terminal device, the target item order information may be determined as the item order information of the delivery user corresponding to the any terminal device. The item order reception information may be information indicating that any of the above-mentioned terminal devices agrees to pick up and deliver the express item corresponding to the above-mentioned target item order information. The item order reception information may include the order number corresponding to the above-mentioned target item order information. Thus, the pick-up and delivery user can determine whether to pick up and deliver the express item corresponding to the item order information based on the pick-up and delivery difficulty information. At the same time, when a pick-up and delivery user refuses to pick up and deliver the express item corresponding to the item order information, the item order information can be sent to the terminal devices of other pick-up and delivery users for other pick-up and delivery users to confirm whether to pick up and deliver the express item.

[0104] The above-mentioned embodiments of the present disclosure have the following beneficial effects: through the method for generating the difficulty information of the collection and dispatch in some embodiments of the present disclosure, the applicability of the difficulty information of the collection and dispatch is improved, thereby improving the fulfillment rate, and reducing the customer complaint rate and the item damage rate. Specifically, the reasons for the low applicability of the difficulty information of the collection and dispatch, the poor fulfillment rate, and the high customer complaint rate and item damage rate are: only considering the number of express parcels, resulting in a large difference in the actual difficulty of collecting and dispatching the same number of express parcels, thereby resulting in a low applicability of the difficulty of the determined collection and dispatch of express parcels, and when the courier collects a batch of express parcels with a higher actual difficulty, it leads to a poor fulfillment rate, a high customer complaint rate and an item damage rate. Based on this, the method for generating the difficulty information of the collection and dispatch in some embodiments of the present disclosure, first, obtains a set of item order information. Among them, the item order information in the above-mentioned item order information set includes a demander identifier, a demand location information and an item information. Then, for each item order information in the above-mentioned item order information set, according to the item information and the demand location information included in the above-mentioned item order information, a single collection and dispatch difficulty information corresponding to the above-mentioned item order information is generated. Therefore, the item-related information and the demand location-related information can be used to generate the single collection and delivery difficulty information of a single express delivery dimension. Afterwards, according to the identification of each demander included in the above-mentioned item order information set, the above-mentioned item order information set is aggregated to obtain each item order information cluster. Therefore, each item order information can be aggregated from the dimension of the demander. Secondly, based on the above-mentioned item order information clusters, cluster collection and delivery difficulty information is generated. Therefore, different item order information clusters can be used to generate cluster collection and delivery difficulty information of multiple express delivery dimensions. Finally, based on the obtained individual collection and delivery difficulty information and the above-mentioned cluster collection and delivery difficulty information, the collection and delivery difficulty information corresponding to the above-mentioned item order information set is generated. Therefore, from the dimensions of a single express delivery and multiple express deliveries, the overall collection and delivery difficulty information corresponding to the item order information set can be generated. Also, because the generated collection and delivery difficulty information utilizes the item information and the demand location information, it avoids considering only the number of express parcels. Also, because the collection and delivery difficulty information is generated from the dimensions of a single express parcel and multiple express parcels as a whole, the corresponding item order information set, the applicability of the determined collection and delivery difficulty information is improved, so that it can be used to balance the difficulty of a batch of express parcels collected and delivered by couriers, thereby improving the fulfillment rate and reducing the customer complaint rate and item damage rate.

[0105] Further references Figure 4 , which shows a process 400 of another embodiment of the method for generating the difficulty information of the assignment. The process 400 of the method for generating the difficulty information of the assignment includes the following steps:

[0106] Step 401, obtaining an item order information set.

[0107] Step 402: for each item order information in the item order information set, generate the single delivery difficulty information of the corresponding item order information according to the item information and the required location information included in the item order information.

[0108] Step 403: Aggregate the item order information set according to the identifiers of the demanders included in the item order information set to obtain item order information clusters.

[0109] In some embodiments, the specific implementation of steps 401-403 and the technical effects brought about can be referred to Figure 3 The corresponding steps 301-303 in the embodiments are not described in detail here.

[0110] Step 404, based on the clustering of order information of each item, generate the difficulty information of picking up and dispatching within each cluster.

[0111] In some embodiments, the execution subject of the method for generating the difficulty information of the assignment (for example Figure 2 The computing device 201 shown in the figure can generate the difficulty information of picking up and dispatching in each cluster according to the above-mentioned clusters of item order information. In practice, for each item order information cluster in the above-mentioned clusters of item order information, the above-mentioned execution subject can perform the following steps:

[0112] The first step is to determine the walking distance corresponding to the required location information included in each two item order information in the item order information cluster to obtain a walking distance set. In practice, the execution entity may determine the walking navigation distance between the required addresses included in the required location information included in the two item order information as the walking distance.

[0113] The second step is to generate a total walking distance corresponding to the item order information cluster according to the walking distance set. In practice, the execution entity may determine the average of each walking distance included in the walking distance set as the walking distance average. Then, the product of the walking distance average and the number of item order information included in the item order information cluster may be determined as the total walking distance.

[0114] The third step is to generate a floor dispatch difficulty corresponding to the item order information cluster according to the elevator dispatch identification and floor number included in each item order information in the item order information cluster. In practice, the execution subject may determine the floor dispatch difficulty corresponding to the item order information cluster by multiplying the first floor weighting coefficient and the floor number in response to determining that the elevator dispatch identification indicates an elevator.

[0115] The fourth step is to generate the pickup and delivery time corresponding to the item order information cluster according to the number of item order information included in the item order information cluster. In practice, the execution entity may input the number into a mapping function of a preset number and delivery time to obtain the pickup and delivery time corresponding to the input number, that is, the pickup and delivery time corresponding to the item order information cluster. Here, the mapping function may be pre-fitted without limitation.

[0116] The fifth step is to generate the intra-cluster pickup and dispatch difficulty information based on the above-mentioned total walking distance, the above-mentioned floor pickup and dispatch difficulty and the above-mentioned pickup and dispatch time. In practice, the above-mentioned execution entity may first perform dimensionless processing on the above-mentioned total walking distance, the above-mentioned floor pickup and dispatch difficulty and the above-mentioned pickup and dispatch time to obtain the dimensionless processed total walking distance, floor pickup and dispatch difficulty and pickup and dispatch time. Then, the weighted sum of the dimensionless processed total walking distance, floor pickup and dispatch difficulty and pickup and dispatch time may be determined as the intra-cluster pickup and dispatch difficulty information. Thus, the intra-cluster pickup and dispatch difficulty information within the unified cluster may be determined from multiple dimensions.

[0117] Step 405: Cluster the order information of each item and generate the difficulty information of picking up and dispatching items between clusters.

[0118] In some embodiments, the execution subject may generate inter-cluster delivery difficulty information based on the above-mentioned clusters of item order information. In practice, first, the execution subject may sort the above-mentioned clusters of item order information to obtain a sequence of item order information clusters. Specifically, the optimal sequence of item order information clusters in the cluster arrival order may be solved by the TSP (Traveling Salesman Problem) algorithm. Then, for each two adjacent item order information clusters in the above-mentioned sequence of item order information clusters, the navigation distance of the above-mentioned two adjacent item order information clusters is generated. In practice, the execution subject may be the cluster center point of the above-mentioned two adjacent item order information clusters. The cluster center point may be the geographic coordinates of the express delivery point corresponding to the item order information cluster. Then, the traffic navigation distance of the two determined cluster center points may be determined as the navigation distance. The traffic navigation distance may be a riding distance or a driving navigation distance. Finally, the difficulty information of inter-cluster delivery may be determined based on the generated navigation distances. In practice, the execution subject may first perform dimensionless processing on the above-mentioned navigation distances. Then, the sum of the dimensionless navigation distances can be determined as the inter-cluster dispatch difficulty information.

[0119] Step 406, generating cluster dispatch difficulty information based on the dispatch difficulty information within each cluster and the dispatch difficulty information between clusters.

[0120] In some embodiments, the execution entity may generate cluster dispatch difficulty information based on the above-mentioned intra-cluster dispatch difficulty information and the above-mentioned inter-cluster dispatch difficulty information. In practice, the execution entity may determine the sum of the above-mentioned intra-cluster dispatch difficulty information as the intra-cluster superimposed dispatch difficulty information. Then, the weighted sum of the intra-cluster superimposed dispatch difficulty information and the above-mentioned cluster dispatch difficulty information may be determined as the cluster dispatch difficulty information. Here, the specific setting of the weighting coefficient is not limited.

[0121] Step 407, generating the collection and dispatch difficulty information of the corresponding item order information set based on the obtained individual collection and dispatch difficulty information and cluster collection and dispatch difficulty information.

[0122] In some embodiments, the specific implementation of step 407 and the technical effects brought about can be referred to Figure 3 The corresponding step 305 in the embodiments will not be described in detail here.

[0123] from Figure 4 It can be seen that Figure 3 Compared with the description of some corresponding embodiments, Figure 4 The process 400 of the method for generating the difficulty of dispatching in some corresponding embodiments reflects the steps of expanding the difficulty of dispatching between clusters. Therefore, the schemes described in these embodiments can comprehensively determine the difficulty of dispatching in clusters from the dimensions of the difficulty of dispatching within and between clusters, further improving the applicability of the difficulty of dispatching, thereby improving the fulfillment rate and reducing the customer complaint rate and the rate of item damage.

[0124] Further references Figure 5 As an implementation of the methods shown in the above figures, the present disclosure provides some embodiments of a device for generating information on the difficulty of taking a task, and these device embodiments are similar to Figure 3 Corresponding to the method embodiments shown, the device can be specifically applied to various electronic devices.

[0125] like Figure 5As shown, the device 500 for generating the difficulty of picking up and dispatching in some embodiments includes: an acquisition unit 501, a first generation unit 502, an aggregation unit 503, a second generation unit 504, and a third generation unit 505. The acquisition unit 501 is configured to acquire a set of item order information, wherein the item order information in the above-mentioned item order information set includes a demander identifier, demand location information, and item information; the first generation unit 502 is configured to generate, for each item order information in the above-mentioned item order information set, the single pick-up and dispatch difficulty information corresponding to the above-mentioned item order information according to the item information and the demand location information included in the above-mentioned item order information; the aggregation unit 503 is configured to perform aggregating processing on the above-mentioned item order information set according to each demander identifier included in the above-mentioned item order information set to obtain each item order information cluster; the second generation unit 504 is configured to generate cluster pick-up and dispatch difficulty information according to the above-mentioned each item order information cluster; the third generation unit 505 is configured to generate pick-up and dispatch difficulty information corresponding to the above-mentioned item order information set according to each obtained single pick-up and dispatch difficulty information and the above-mentioned cluster pick-up and dispatch difficulty information.

[0126] Optionally, the above-mentioned item information includes item weight, and the above-mentioned required location information includes elevator dispatch identification and floor number.

[0127] Optionally, the first generating unit 502 can be further configured to: determine the floor weighting coefficient according to the above-mentioned elevator pick-up and dispatch identification; and generate the single pick-up and dispatch difficulty information corresponding to the above-mentioned item order information according to the above-mentioned item weight, the above-mentioned floor number and the above-mentioned floor weighting coefficient.

[0128] Optionally, the above-mentioned item information also includes packaging time, and the above-mentioned required location information also includes probability information.

[0129] Optionally, the first generating unit 502 can be further configured to: in response to determining that the demand task corresponding to the above-mentioned item order information is a collection task, generate the single collection and dispatch difficulty information corresponding to the above-mentioned item order information according to the above-mentioned item weight, the above-mentioned number of floors, the above-mentioned floor weighting coefficient, the above-mentioned packaging time and the above-mentioned probability information; in response to determining that the demand task corresponding to the above-mentioned item order information is a delivery task, generate the single collection and dispatch difficulty information corresponding to the above-mentioned item order information according to the above-mentioned item weight, the above-mentioned number of floors, the above-mentioned floor weighting coefficient and the above-mentioned probability information.

[0130] Optionally, the aggregation unit 503 can be further configured to: aggregate the item order information including the same demander identification into the same item order information group to obtain individual item order information groups; perform spatial aggregation processing on the above-mentioned individual item order information groups according to a preset set of geographic fence areas and individual demand location information corresponding to the obtained individual item order information groups to obtain clusters of individual item order information groups as individual item order information clusters.

[0131] Optionally, the device 500 for generating information on difficulty of delivery also includes: a first determination unit, a second determination unit, a selection unit, and a geo-fence area aggregation unit (not shown in the figure). The first determination unit may be configured to, in response to determining that there is item order information that does not correspond to any item order information cluster in the above-mentioned item order information set, determine the item order information that does not correspond to any item order information cluster as the item order information to be aggregated. The second determination unit may be configured to determine the text similarity between the above-mentioned demand address and the regional text of each geo-fence area in the above-mentioned geo-fence area set based on the demand address included in the demand location information included in the above-mentioned item order information to be aggregated. The selection unit may be configured to select a geo-fence area that meets a preset aggregation condition from the above-mentioned geo-fence area set as the target geo-fence area based on the obtained text similarities, wherein the above-mentioned preset aggregation condition includes a preset similarity condition. The geo-fence area aggregation unit may be configured to aggregate the above-mentioned item order information to be aggregated to the above-mentioned target geo-fence area.

[0132] Optionally, the selection unit can be further configured to: determine the boundary distance between the above-mentioned required address and each geo-fence area in the above-mentioned geo-fence area set based on the above-mentioned required address; and select the geo-fence area that meets the preset aggregation conditions from the above-mentioned geo-fence area set as the target geo-fence area based on the obtained text similarities and boundary distances, wherein the above-mentioned preset aggregation conditions include preset similarity conditions and preset distance conditions.

[0133] Optionally, the second generation unit 504 may include: an intra-cluster dispatch difficulty information generation unit, an inter-cluster dispatch difficulty information generation unit, and a cluster dispatch difficulty information generation unit (not shown in the figure). Among them, the intra-cluster dispatch difficulty information generation unit is configured to generate each intra-cluster dispatch difficulty information according to the above-mentioned clusters of item order information. The inter-cluster dispatch difficulty information generation unit is configured to generate inter-cluster dispatch difficulty information according to the above-mentioned clusters of item order information. The cluster dispatch difficulty information generation unit is configured to generate cluster dispatch difficulty information according to the above-mentioned each intra-cluster dispatch difficulty information and the above-mentioned inter-cluster dispatch difficulty information.

[0134] Optionally, the above-mentioned required location information includes the elevator dispatch identification and the floor number.

[0135] Optionally, the intra-cluster pickup and dispatch difficulty information generating unit may be further configured to: for each item order information cluster in the above-mentioned item order information clusters, perform the following steps: determine the walking distance corresponding to the demand location information included in every two item order information in the above-mentioned item order information cluster to obtain a walking distance set; based on the above-mentioned walking distance set, generate a total walking distance corresponding to the above-mentioned item order information cluster; based on the elevator pickup and dispatch identification and the number of floors included in each item order information in the above-mentioned item order information cluster, generate a floor pickup and dispatch difficulty corresponding to the above-mentioned item order information cluster; based on the number of item order information included in the above-mentioned item order information cluster, generate a pickup and dispatch time corresponding to the above-mentioned item order information cluster; based on the above-mentioned total walking distance, the above-mentioned floor pickup and dispatch difficulty and the above-mentioned pickup and dispatch time, generate intra-cluster pickup and dispatch difficulty information.

[0136] Optionally, the inter-cluster pickup and dispatch difficulty information generating unit may be further configured to: sort the above-mentioned individual item order information clusters to obtain an item order information cluster sequence; for every two adjacent item order information clusters in the above-mentioned item order information cluster sequence, generate a navigation distance between the above-mentioned two adjacent item order information clusters; and determine the inter-cluster pickup and dispatch difficulty information based on the generated individual navigation distances.

[0137] Optionally, the acquisition unit 501 may be further configured to: acquire an item order information set in a target road area, wherein the target road area is a road area divided in a preset area, and the preset area includes a road area set.

[0138] Optionally, the device 500 for generating difficulty information on pickup and dispatch may further include: an execution unit (not shown in the figure), configured to perform the following division steps: for each road zone in the road zone set except the above-mentioned target road zone, generating the pickup and dispatch difficulty information of the above-mentioned road zone; generating pickup and dispatch difficulty change information based on each historical pickup and dispatch difficulty information and each pickup and dispatch difficulty information of each road zone in the road zone set; in response to determining that the above-mentioned pickup and dispatch difficulty change information reaches a preset optimization target, determining the above-mentioned road zone set as a preset area after the division is completed.

[0139] Optionally, the device for generating difficulty information of pickup and dispatch 500 may further include: a division unit (not shown in the figure), which is configured to divide the above-mentioned preset area in response to determining that the above-mentioned pickup and dispatch difficulty change information does not reach the above-mentioned preset optimization target, obtain a divided road area set as a road area set, and execute the above-mentioned division step again.

[0140] Optionally, the acquisition unit 501 may be further configured to: acquire a set of item order information of the target pickup and delivery user within a preset time period.

[0141] Optionally, the dispatch difficulty information generating device 500 may further include: an allocation value information generating unit (not shown in the figure), which is configured to generate the allocation value information of the above-mentioned target dispatch user within the above-mentioned preset time period based on the initial allocation value information corresponding to the above-mentioned target dispatch user and the above-mentioned dispatch difficulty information.

[0142] Optionally, the pickup and dispatch difficulty information generating device 500 may further include: a first sending unit, a second sending unit and an item order information determining unit (not shown in the figure). The first sending unit is configured to send the above-mentioned pickup and dispatch difficulty information to the target terminal device. The second sending unit is configured to send the target item order information to at least one terminal device that meets the preset pickup and dispatch conditions in response to receiving the item order pickup and dispatch rejection request sent by the above-mentioned target terminal device, wherein the above-mentioned target item order information is the item order information corresponding to the above-mentioned item order pickup and dispatch rejection request. The item order information determining unit is configured to determine the above-mentioned target item order information as the item order information of the pickup and dispatch user corresponding to the above-mentioned any terminal device in response to receiving the item order reception information corresponding to the above-mentioned target item order information sent by any terminal device among the above-mentioned at least one terminal device.

[0143] It is understandable that the units recorded in the device for generating the difficulty of dispatching information 500 are similar to the reference Figure 3 Therefore, the operations, features and beneficial effects described above for the method are also applicable to the device 500 and the units included therein, and will not be described in detail here.

[0144] Reference below Figure 6 , which shows an electronic device (eg, Figure 1 A schematic diagram of the structure of the server in FIG600. Figure 6 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.

[0145] like Figure 6 As shown, the electronic device 600 may include a processing device (e.g., a central processing unit, a graphics processing unit, etc.) 601, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 602 or a program loaded from a storage device 608 into a random access memory (RAM) 603. In the RAM 603, various programs and data required for the operation of the electronic device 600 are also stored. The processing device 601, the ROM 602, and the RAM 603 are connected to each other via a bus 604. An input / output (I / O) interface 605 is also connected to the bus 604.

[0146] Typically, the following devices may be connected to the I / O interface 605: an input device 606 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; an output device 607 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 608 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 609. The communication device 609 may allow the electronic device 600 to communicate with other devices wirelessly or by wire to exchange data. Although Figure 6 The electronic device 600 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 6 Each block shown in the figure may represent one device, or may represent multiple devices as required.

[0147] 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 609, or installed from the storage device 608, or installed from the ROM 602. When the computer program is executed by the processing device 601, the above-mentioned functions defined in the method of some embodiments of the present disclosure are executed.

[0148] 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, which carries a computer-readable program code. 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.

[0149] 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.

[0150] 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: obtains a set of item order information, wherein the item order information in the item order information set includes a demander identifier, demand location information, and item information; for each item order information in the item order information set, generates single pick-up and dispatch difficulty information corresponding to the item order information according to the item information and demand location information included in the item order information; aggregates the item order information set according to each demander identifier included in the item order information set to obtain each item order information cluster; generates cluster pick-up and dispatch difficulty information according to each item order information cluster; generates pick-up and dispatch difficulty information corresponding to the item order information set according to each single pick-up and dispatch difficulty information obtained and the cluster pick-up and dispatch difficulty information.

[0151] 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).

[0152] 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.

[0153] 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 an acquisition unit, a first generation unit, an aggregation unit, a second generation unit, and a third generation unit. The names of these units do not constitute a limitation on the units themselves in some cases, for example, the acquisition unit may also be described as a "unit for acquiring a set of item order information".

[0154] 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.

[0155] Some embodiments of the present disclosure also provide a computer program product, including a computer program, which implements any of the above-mentioned methods for generating dispatch difficulty information when executed by a processor.

[0156] 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 generating information on difficulty of dispatching, comprising: Acquire an item order information set, wherein the item order information in the item order information set includes a demander identifier, demand location information, and item information; For each item order information in the item order information set, generating single delivery difficulty information corresponding to the item order information according to the item information and the required location information included in the item order information; According to each demander identifier included in the item order information set, the item order information set is aggregated to obtain each item order information cluster; According to the clustering of the order information of each item, generating clustered delivery difficulty information; The difficulty information for picking up and dispatching corresponding to the item order information set is generated based on the obtained difficulty information for each single pick-up and dispatch and the cluster pick-up and dispatch difficulty information.

2. The method according to claim 1, wherein: The item information includes the item weight, and the required location information includes the elevator dispatch identification and the floor number; as well as The generating, according to the item information and the required location information included in the item order information, the single delivery difficulty information corresponding to the item order information includes: Determine the floor weighting coefficient according to the elevator dispatching identification; According to the weight of the item, the number of floors and the floor weighting coefficient, the single delivery difficulty information corresponding to the item order information is generated.

3. The method according to claim 2, wherein: The item information also includes packaging time, and the required location information also includes probability information; and The generating, according to the weight of the item, the number of floors and the floor weighting coefficient, the single delivery difficulty information corresponding to the item order information comprises: In response to determining that the demand task corresponding to the item order information is a pickup task, generating single pickup and dispatch difficulty information corresponding to the item order information according to the item weight, the number of floors, the floor weighting coefficient, the packaging time and the probability information; In response to determining that the demand task corresponding to the item order information is a delivery task, the single delivery difficulty information corresponding to the item order information is generated according to the item weight, the number of floors, the floor weighting coefficient and the probability information.

4. The method according to claim 1, wherein: The step of aggregating the item order information set according to each demander identifier included in the item order information set to obtain each item order information cluster includes: Aggregate the item order information including the same demander identifier into the same item order information group to obtain individual item order information groups; According to the preset geographic fence area set and each demand location information corresponding to each obtained item order information group, the item order information groups are spatially aggregated to obtain each item order information group cluster as each item order information cluster.

5. The method according to claim 4, wherein: The method further comprises: In response to determining that there is item order information that does not correspond to any item order information cluster in the item order information set, determining the item order information that does not correspond to any item order information cluster as item order information to be aggregated; Determine, according to the required address included in the required location information included in the order information of the item to be aggregated, the text similarity between the required address and the area text of each geo-fenced area in the set of geo-fenced areas; According to the obtained text similarities, a geo-fenced area satisfying a preset aggregation condition is selected from the geo-fenced area set as a target geo-fenced area, wherein the preset aggregation condition includes a preset similarity condition; Aggregate the order information of the items to be aggregated into the target geographic fence area.

6. The method according to claim 5, wherein: The step of selecting, according to the obtained text similarities, a geo-fenced area satisfying a preset aggregation condition from the geo-fenced area set as a target geo-fenced area comprises: Determine, according to the required address, a distance between the required address and a boundary of each geo-fenced area in the set of geo-fenced areas; According to the obtained text similarities and boundary distances, a geo-fenced area satisfying a preset aggregation condition is selected from the geo-fenced area set as a target geo-fenced area, wherein the preset aggregation condition includes a preset similarity condition and a preset distance condition.

7. The method according to claim 1, wherein: The step of clustering the order information of each item to generate cluster delivery difficulty information includes: According to the clustering of the order information of each item, generating the difficulty information of picking up and dispatching in each cluster; According to the clustering of the order information of each item, generating the difficulty information of picking up and dispatching between clusters; The cluster assignment difficulty information is generated based on the difficulty information within each cluster and the difficulty information between clusters.

8. The method according to claim 7, wherein: The required location information includes the elevator dispatch identification and the floor number; as well as The step of clustering the order information of each item and generating the difficulty information of picking up and dispatching within each cluster includes: For each item order information cluster in the item order information clusters, the following steps are performed: Determine the walking distance corresponding to the demand location information included in every two item order information in the item order information cluster to obtain a walking distance set; Generating a total walking distance corresponding to the item order information cluster according to the walking distance set; Generate a floor dispatch difficulty corresponding to the item order information cluster according to the elevator dispatch identifier and the floor number included in each item order information in the item order information cluster; Generating a pickup and delivery time corresponding to the item order information cluster according to the quantity of item order information included in the item order information cluster; The intra-cluster delivery difficulty information is generated according to the total walking distance, the floor delivery difficulty and the delivery time.

9. The method according to claim 7, wherein: The step of clustering the order information of each item to generate the difficulty information of picking up and dispatching between clusters includes: Sorting each of the item order information clusters to obtain an item order information cluster sequence; For every two adjacent item order information clusters in the item order information cluster sequence, generating a navigation distance between the two adjacent item order information clusters; According to each generated navigation distance, the inter-cluster dispatch difficulty information is determined.

10. The method according to claim 1, wherein: The obtaining of the item order information set includes: Acquire a set of item order information in a target road area, wherein the target road area is a road area divided in a preset area, and the preset area includes a road area set; and The method further comprises: Perform the following partitioning steps: For each road area in the road area set except the target road area, generating the pick-up and dispatch difficulty information of the road area; Generate pickup and dispatch difficulty change information based on each historical pickup and dispatch difficulty information and each pickup and dispatch difficulty information of each road area in the road area set; In response to determining that the information on the change in difficulty of picking up and dispatching vehicles reaches a preset optimization target, the road area set is determined as a preset area that has been divided.

11. The method according to claim 10, wherein: The method further comprises: In response to determining that the information on the change in the difficulty of picking up and dispatching has not reached the preset optimization target, the preset area is divided to obtain a divided road area set as a road area set, and the division step is performed again.

12. The method according to claim 1, wherein: The obtaining of the item order information set includes: Obtaining a set of item order information of a target delivery user within a preset time period; and The method further comprises: The allocated value information of the target delivery user within the preset time period is generated according to the initial allocated value information corresponding to the target delivery user and the delivery difficulty information.

13. The method according to claim 1, wherein: The method further comprises: Sending the dispatch difficulty information to a target terminal device; In response to receiving the item order rejection request sent by the target terminal device, sending the target item order information to at least one terminal device that meets the preset pickup and delivery conditions, wherein the target item order information is the item order information corresponding to the item order rejection request; In response to receiving item order reception information corresponding to the target item order information sent by any terminal device among the at least one terminal device, the target item order information is determined as the item order information of the delivery user corresponding to the any terminal device.

14. A device for generating information on difficulty of dispatching, comprising: An acquisition unit is configured to acquire an item order information set, wherein the item order information in the item order information set includes a demander identifier, demand location information, and item information; A first generating unit is configured to generate, for each item order information in the item order information set, single delivery difficulty information corresponding to the item order information according to the item information and the required location information included in the item order information; an aggregation unit configured to aggregate the item order information set according to each demander identifier included in the item order information set to obtain each item order information cluster; A second generating unit is configured to generate clustered delivery difficulty information according to the clustering of the order information of each item; The third generating unit is configured to generate the collection and dispatch difficulty information corresponding to the item order information set based on the obtained individual collection and dispatch difficulty information and the cluster collection and dispatch difficulty information.

15. 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 13.

16. A computer readable medium having a computer program stored thereon, wherein: When the program is executed by a processor, the method according to any one of claims 1 to 13 is implemented.

17. 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 13.

Images