WO2019153761A1 - 配送任务分配方法、装置、电子设备及计算机存储介质 - Google Patents

配送任务分配方法、装置、电子设备及计算机存储介质 Download PDF

Info

Publication number
WO2019153761A1
WO2019153761A1 PCT/CN2018/108868 CN2018108868W WO2019153761A1 WO 2019153761 A1 WO2019153761 A1 WO 2019153761A1 CN 2018108868 W CN2018108868 W CN 2018108868W WO 2019153761 A1 WO2019153761 A1 WO 2019153761A1
Authority
WO
WIPO (PCT)
Prior art keywords
delivery
address
index
pickup
distribution
Prior art date
Application number
PCT/CN2018/108868
Other languages
English (en)
French (fr)
Inventor
梁福坤
Original Assignee
北京小度信息科技有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 北京小度信息科技有限公司 filed Critical 北京小度信息科技有限公司
Publication of WO2019153761A1 publication Critical patent/WO2019153761A1/zh

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G06Q10/0835—Relationships between shipper or supplier and carriers
    • G06Q10/08355—Routing methods
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations

Definitions

  • the present disclosure relates to the field of information processing technologies, and in particular, to a distribution task assignment method, apparatus, electronic device, and computer readable storage medium.
  • Embodiments of the present disclosure provide a delivery task assignment method, apparatus, electronic device, and computer readable storage medium.
  • a distribution task assignment method is provided in an embodiment of the present disclosure.
  • the distribution task allocation method includes:
  • the unallocated delivery task is assigned to the delivery resource.
  • the determining, by the distribution resource, an initial delivery index for an unassigned delivery task includes:
  • the distribution distance index and the delivery time index are weighted and added to obtain the initial distribution index.
  • the calculating a distribution distance index of the unallocated delivery task and the delivery task that has been allocated to the delivery resource but not delivered include:
  • a distance between the first pickup address and the first delivery address, a distance between the second pickup address and the second delivery address, the first pickup address and the location The distance between the second pickup address, the distance between the first delivery address and the second delivery address determines the delivery distance index.
  • the calculating a delivery time index of the unassigned delivery task and the delivery task that has been allocated to the delivery resource but not delivered include:
  • the delivery time index is determined based on the first delivery waiting time and the second delivery waiting time.
  • the present disclosure is based on a delivery address of an unassigned delivery task and a delivery address of a delivery task that has been assigned to the delivery resource but is not delivered.
  • the mutual exclusion between the initial distribution index is corrected to obtain a revised distribution index, including:
  • the initial distribution index is corrected according to the mutual exclusion index to obtain a corrected distribution index.
  • the first mutual exclusion index, the second mutual exclusion index, the third mutually exclusive index, and the fourth mutually exclusive index are determined according to mutual exclusion of different regions.
  • the determining the first pickup address, the second pickup address, the first delivery address, and the second The area where the shipping address is located including:
  • the determining the first pickup address, the second pickup address, the The first shipping address and the area where the second shipping address is located including:
  • the determining the first pickup address, The area of the second pickup address, the first delivery address, and the second delivery address includes:
  • the preset address keyword fails to be obtained, acquiring geographical location information of the first pickup address, the second pickup address, the first delivery address, and the second delivery address;
  • the unallocated delivery task is allocated to the distribution resource, including:
  • a distribution task distribution apparatus is provided in an embodiment of the present disclosure.
  • the distribution task allocation device includes:
  • a determination module configured to determine an initial delivery index of the distribution resource for the unassigned delivery task
  • the correction module corrects the initial distribution index according to the mutual exclusion between the delivery address of the unassigned delivery task and the delivery address of the delivery task that has been allocated to the delivery resource but is not delivered, Obtaining a revised distribution index, wherein the mutual exclusion is used to characterize a degree to which the unassigned delivery task and the delivery task that has been allocated to the delivery resource but are not delivered are suitable for being merged;
  • an allocation module configured to allocate the unallocated delivery task to the distribution resource if the corrected delivery index is higher than a preset delivery threshold.
  • the determining module includes:
  • a first calculation sub-module configured to calculate a delivery distance index of the unassigned delivery task and the delivery task that has been allocated to the delivery resource but not delivered;
  • a second calculation sub-module configured to calculate a delivery time index of the unassigned delivery task and the delivery task that has been allocated to the delivery resource but not delivered;
  • the addition submodule is configured to weight-add the distribution distance index and the delivery time index to obtain the initial distribution index.
  • the determining module includes:
  • a first obtaining unit configured to acquire a first pickup address and a first delivery address of the unassigned delivery task
  • a second obtaining unit configured to acquire a second pickup address and a second delivery address of the delivery task that has been allocated to the delivery resource but not delivered;
  • a first determining unit configured to: according to a distance between the first pickup address and the first delivery address, a distance between the second pickup address and the second delivery address, The distance between the first pickup address and the second pickup address, the distance between the first delivery address and the second delivery address determines the delivery distance index.
  • the second computing submodule includes:
  • a third obtaining unit configured to acquire a first pickup address and a first delivery address of the unassigned delivery task
  • a fourth obtaining unit configured to acquire a second pickup address and a second delivery address of the delivery task that has been allocated to the delivery resource but not delivered;
  • a second determining unit configured to determine a first picking waiting time of the distribution resource at the first picking address and a second picking waiting time at the second picking address, and the distribution resource a first delivery waiting time at the first shipping address and a second delivery waiting time at the second shipping address;
  • the third determining unit is configured to determine the delivery time index according to the first delivery waiting time and the second delivery waiting time.
  • the modifying module includes:
  • a first obtaining submodule configured to acquire a first pickup address, a first delivery address, and a first estimated pickup time of the unassigned delivery task
  • a second obtaining submodule configured to acquire a second pickup address, a second delivery address, and a second estimated pickup time of the delivery task that has been allocated to the delivery resource but not delivered;
  • a first determining submodule configured to determine a first mutual exclusion index between the area where the first pickup address is located and the area where the second pickup address is located, an area where the first delivery address is located, and the a second mutual exclusion index between the areas where the second delivery address is located, a third mutual exclusion index between the area where the first pickup address is located and the area where the second delivery address is located, and the first delivery a fourth mutual exclusion index between the area where the cargo address is located and the area where the second pickup address is located;
  • a calculation submodule configured to: according to the first mutual exclusion index, the second mutual exclusion index, the third mutual exclusion index, the fourth mutual exclusion index, and the first estimated pickup time and Calculating a mutual exclusion index between the unallocated delivery task and the delivery task that has been allocated to the distribution resource but not delivered;
  • the correction submodule is configured to correct the initial distribution index according to the mutual exclusion index to obtain a corrected distribution index.
  • the determining submodule includes:
  • a fourth determining unit configured to determine an area where the first pickup address, the second pickup address, the first delivery address, and the second delivery address are located;
  • the fifth determining unit is configured to determine the first mutual exclusion index, the second mutual exclusion index, the third mutual exclusion index, and the fourth mutual exclusion index according to mutual exclusion of different regions.
  • the fourth determining unit includes:
  • a first obtaining subunit configured to acquire a preset address keyword of the first pickup address, the second pickup address, the first delivery address, and the second delivery address;
  • a first determining subunit configured to determine, according to the preset address keyword, the first pickup address, the second pickup address, the first delivery address, and the second delivery address Area.
  • the fourth determining unit includes:
  • a second obtaining subunit configured to acquire geographic location information of the first pickup address, the second pickup address, the first delivery address, and the second delivery address;
  • a second determining subunit configured to determine, according to the geographic location information, an area where the first pickup address, the second pickup address, the first delivery address, and the second delivery address are located .
  • the fourth determining unit includes:
  • a determining subunit configured to determine whether the first address of the first pickup address, the second pickup address, the first delivery address, and the preset address keyword of the second delivery address are acquired
  • a third determining subunit configured to determine, according to the address keyword, the first pickup address, the second pickup address, and the first delivery address if the preset address keyword is successfully acquired And an area where the second shipping address is located;
  • a third obtaining subunit configured to acquire the first picking address, the second picking address, the first shipping address, and the second sending if the preset address keyword fails to be acquired Geographic location information of the cargo address;
  • a fourth determining subunit configured to determine, according to the geographic location information, an area where the first pickup address, the second pickup address, the first delivery address, and the second delivery address are located .
  • the distribution module includes:
  • a second determining submodule configured to determine a delivery pressure index of the distribution resource
  • the distribution sub-module is configured to allocate the unallocated delivery task to the distribution resource if the corrected delivery index is higher than a preset delivery threshold and the delivery pressure index of the delivery resource is lower than a preset pressure threshold.
  • an embodiment of the present disclosure provides an electronic device, including a memory and a processor, where the memory is configured to store one or more computer instructions that support a distribution task assignment device to perform the distribution task assignment method in the first aspect,
  • the processor is configured to execute computer instructions stored in the memory.
  • the distribution task assignment device may also include a communication interface for the distribution task assignment device to communicate with other devices or communication networks.
  • an embodiment of the present disclosure provides a computer readable storage medium, configured to store computer instructions used by a distribution task distribution apparatus, where the method for distributing a distribution task in the first aspect is performed by a distribution task distribution device Computer instructions involved.
  • the above technical solution comprehensively considers the distance factor, the time factor, and the mutual exclusion factor between the delivery addresses to determine whether to assign a distribution task to a distribution resource, so as to achieve the optimization of the distribution task allocation process or the combined delivery process, thereby
  • the utilization time of fully utilizing the distribution resources is achieved, the scheduling efficiency of the distribution resources is improved, the service quality is improved, and the technical effect of the user experience is enhanced.
  • FIG. 1 shows a flow chart of a delivery task assignment method in accordance with an embodiment of the present disclosure
  • FIG. 2 is a flow chart showing the step S101 of the delivery task assignment method according to the embodiment shown in Figure 1;
  • FIG 3 is a flow chart showing the step S201 of the delivery task assignment method according to the embodiment shown in Figure 2;
  • Figure 4 is a flow chart showing the step S202 of the delivery task assignment method according to the embodiment shown in Figure 2;
  • FIG. 5 is a flow chart showing the step S102 of the delivery task assignment method according to the embodiment shown in Figure 1;
  • Figure 6 is a flow chart showing the step S503 of the delivery task assignment method according to the embodiment shown in Figure 5;
  • FIG. 7 to 9 are flowcharts showing a step S601 of the delivery task assignment method according to the embodiment shown in Fig. 6;
  • Figure 10 is a flow chart showing the step S103 of the delivery task assignment method according to the embodiment shown in Figure 1;
  • FIG. 11 is a block diagram showing the structure of a delivery task distribution device according to an embodiment of the present disclosure.
  • FIG. 12 is a block diagram showing the structure of the determining module 1101 of the distribution task assigning apparatus according to the embodiment shown in FIG. 11;
  • Figure 13 is a block diagram showing the structure of a first calculation sub-module 1201 of the delivery task distribution device according to the embodiment shown in Figure 12;
  • Figure 14 is a block diagram showing the structure of a second calculation sub-module 1202 of the delivery task assignment device according to the embodiment shown in Figure 12;
  • Figure 15 is a block diagram showing the structure of a correction module 1102 of the delivery task distribution device according to the embodiment shown in Figure 11;
  • Figure 16 is a block diagram showing the structure of a first determining sub-module 1503 of the distribution task assigning apparatus according to the embodiment shown in Figure 15;
  • FIG. 17 to FIG. 19 are block diagrams showing the configuration of a fourth determining unit 1601 of the delivery task assigning device according to the embodiment shown in FIG. 16;
  • Figure 20 is a block diagram showing the structure of the distribution module 1103 of the delivery task distribution device according to the embodiment shown in Figure 11;
  • 21 is a block diagram showing the structure of an electronic device according to an embodiment of the present disclosure.
  • FIG. 22 is a block diagram of a computer system suitable for implementing a delivery task assignment method in accordance with an embodiment of the present disclosure.
  • the technical solution provided by the embodiment of the present disclosure comprehensively considers the distance factor, the time factor, and the mutual exclusion factor between the delivery addresses to determine whether to assign a delivery task to a distribution resource to achieve the distribution task allocation process or the combined delivery process.
  • the optimization is to achieve the full utilization of the available time of the distribution resources, improve the scheduling efficiency of the distribution resources, thereby improving the quality of the service and enhancing the technical effect of the user experience.
  • FIG. 1 illustrates a flow chart of a delivery task assignment method in accordance with an embodiment of the present disclosure.
  • the distribution task assignment method includes the following steps S101-S103:
  • step S101 determining an initial distribution index of the distribution resource for the unassigned delivery task
  • step S102 the initial delivery index is performed according to the mutual exclusion between the delivery address of the unassigned delivery task and the delivery address of the delivery task that has been allocated to the delivery resource but not delivered. Correcting, obtaining a corrected distribution index, wherein the mutual exclusion is used to characterize a degree to which the unassigned delivery task and the delivery task that has been allocated to the delivery resource but are not delivered are suitable for being merged;
  • step S103 when the corrected delivery index is higher than a preset delivery threshold, the unallocated delivery task is assigned to the delivery resource.
  • the conventional processing may be merged, that is, Assigning the unallocated delivery task to the distribution resource, but in actual application, if one of the two delivery addresses belongs to an area with many restrictions, such as a cell that can only walk in, and the The entry is far from the delivery address of another merged delivery task, in which case, if the unassigned delivery task is merged with the delivery task that has been assigned to the delivery resource but not delivered, It is not necessarily an optimal distribution result.
  • a distribution task assignment method which first determines an initial distribution index of a distribution resource for an unassigned delivery task according to a distance factor and a time factor according to a conventional method; and then according to the unallocated The mutual exclusion between the delivery address of the delivery task and the delivery address of the delivery task that has been allocated to the delivery resource but not delivered, the initial delivery index is corrected, and the corrected delivery index is obtained; When the modified delivery index is higher than the preset delivery threshold, the unallocated delivery task is allocated to the delivery resource.
  • the embodiment comprehensively considers the distance factor, the time factor and the mutual exclusion factor between the delivery addresses to determine whether to assign a distribution task to a distribution resource, so as to achieve the optimization of the distribution task allocation process or the combined delivery process, thereby achieving Make full use of the available time of distribution resources, improve the scheduling efficiency of distribution resources, and then improve the quality of service and enhance the technical effect of user experience.
  • the mutual exclusion is used to represent the extent to which the unassigned delivery task and the delivery task that has been allocated to the delivery resource but are not delivered are suitable for being merged, for example, if an address is combined with other addresses for processing.
  • the delivery time of the distribution resource can be saved, the delivery distance of the distribution resource is saved, and the distribution efficiency of the distribution resource is improved, the mutual exclusion between the address and other addresses is weak, and if one address is combined with other addresses for processing, At the same time, it will waste the delivery time of the distribution resources, increase the distribution distance of the distribution resources, and reduce the distribution efficiency of the distribution resources, so the mutual exclusion between the address and other addresses is stronger.
  • the mutual exclusion between addresses can be obtained according to the historical distribution data in the preset historical time period.
  • the mutual exclusion can also be related to the time factor. For example, for a commercial building, the pedestrian density is large at noon on weekends, and the elevator waits. The longer time is the peak period of the activity, and the pedestrian density at noon on the working day is small, the waiting time of the elevator is short, and it is in the low peak period of activity. Then the commercial building is at the peak time of the noon on the weekend, and it is between other addresses. The mutual exclusion is stronger, and in other low-peak periods, the mutual exclusion between it and other addresses is weak.
  • the step S101 that is, the step of determining an initial distribution index of the distribution resource for the unassigned delivery task, includes steps S201-S203:
  • step S201 calculating a delivery distance index of the unassigned delivery task and the delivery task that has been allocated to the delivery resource but not delivered;
  • step S202 calculating a delivery time index of the unassigned delivery task and the delivery task that has been allocated to the delivery resource but not delivered;
  • step S203 the distribution distance index and the delivery time index are weighted and added to obtain the initial distribution index.
  • the delivery time index between the distribution tasks of the resources but not delivered; finally, the distribution distance index and the delivery time index are weighted and added to obtain the initial distribution index.
  • the step S201 is to calculate a delivery distance of the unassigned delivery task and the delivery task that has been allocated to the delivery resource but not delivered.
  • the step of indexing includes steps S301-S303:
  • step S301 acquiring a first pickup address and a first delivery address of the unassigned delivery task
  • step S302 acquiring a second pickup address and a second delivery address of the delivery task that has been allocated to the delivery resource but not delivered;
  • step S303 according to the distance between the first pickup address and the first delivery address, the distance between the second pickup address and the second delivery address, the first pickup address and the second pickup The distance between the addresses, the distance between the first shipping address and the second shipping address determines the delivery distance index.
  • the delivery distance index is determined based on a relationship between a delivery address of an unassigned delivery task and a delivery address of a delivery task that has been assigned to the delivery resource but not delivered.
  • the average value of the historical distribution distance generated in the preset historical time period can be used as the distance reference value, and the corresponding distribution distance index reference value is set to 1, then If the distribution distance between the distribution resource and the delivery task is greater than the distance reference value, the corresponding delivery distance index may be set to be less than 1, indicating that the delivery resource is not suitable for the delivery task; otherwise, if the distribution resource is to the delivery task If the distribution distance between the distances is less than the distance reference value, the corresponding delivery distance index may be set to be greater than 1, indicating that the distribution resource is suitable for delivering the delivery task.
  • the delivery distances of the two delivery tasks combined processing and the separate processing may be respectively calculated according to the size of the two delivery distances and
  • the distance reference index is used to determine the distribution distance index. For example, if the distance reference value is 3 km, the corresponding delivery distance index reference value is 1, and the delivery distance generated after the two delivery tasks are combined is 2 km, and processed separately.
  • the distribution distance index can be set to 1.5, which means that the two delivery tasks are suitable for the combined processing; otherwise, the delivery distance generated after the combination of the two delivery tasks is 4km, and the distribution distance generated by the separate processing For 2.5km, the delivery distance index can be set to 0.7, indicating that the two delivery tasks are not suitable for consolidation.
  • the delivery distance refers to a distance generated by the distribution resource to complete a delivery task.
  • the step S202 is to calculate a delivery time of the unassigned delivery task and the delivery task that has been allocated to the delivery resource but not delivered.
  • the step of indexing includes steps S401-S404:
  • step S401 acquiring a first pickup address and a first delivery address of the unassigned delivery task
  • step S402 acquiring a second pickup address and a second delivery address of the delivery task that has been allocated to the delivery resource but not delivered;
  • step S403 determining a first pickup waiting time and a second pickup waiting time of the delivery resource at the first pickup address and the second pickup address, and the delivery resource at the first delivery address and the first The first delivery waiting time and the second delivery waiting time at the second shipping address;
  • step S404 the delivery time index is determined according to the first delivery waiting time and the second delivery waiting time.
  • the delivery time index is determined based on the waiting time at a plurality of addresses.
  • the average value of the waiting time occurring in the preset historical time period can be used as the time reference value, and the corresponding delivery time index reference value is set to 1, then, if the delivery resource waits for more than the time The time reference value, the corresponding delivery time index may be set to be less than 1, indicating that the delivery resource is not suitable for delivery of the delivery task; conversely, if the delivery resource waiting time is less than the time reference value, the corresponding delivery time index Can be set to be greater than 1, indicating that the distribution resource is suitable for delivery of the delivery task.
  • the waiting time generated by the combination processing of the two delivery tasks and the separate processing may be separately calculated, and according to the size of the waiting time and the location
  • the comparison of the time reference values determines the delivery time index. For example, if the time reference value is 1 hour, the corresponding delivery time index reference value is 1, the waiting time after the merger of the two delivery tasks is 0.5 hours, and the waiting time for the separate processing is 1.5 hours, then the delivery time can be The index is set to 1.4, which means that the two delivery tasks are suitable for the combined processing; otherwise, the waiting time after the combination of the two delivery tasks is 1.5 hours, and the waiting time for the separate processing is 45 minutes, the delivery time index can be set. At 0.8, the two delivery tasks are not suitable for consolidation.
  • the step S102 that is, according to the delivery address of the unassigned delivery task and the delivery task that has been allocated to the delivery resource but not delivered
  • the mutual exclusion between the shipping addresses, the initial distribution index is corrected, and the step of correcting the delivery index is obtained, including steps S501-S505:
  • step S501 acquiring a first pickup address, a first delivery address, and a first estimated pickup time of the unassigned delivery task
  • step S502 acquiring a second pickup address, a second delivery address, and a second estimated pickup time of the delivery task that has been allocated to the delivery resource but not delivered;
  • step S503 determining a first mutual exclusion index between the area where the first pickup address is located and the area where the second pickup address is located, between the area where the first delivery address is located and the area where the second delivery address is located a second mutual exclusion index, a third mutual exclusion index between the area where the first pickup address is located and the area where the second delivery address is located, and the area between the area where the first delivery address is located and the area where the second delivery address is located Four mutually exclusive indices;
  • step S504 calculating, according to the first mutual exclusion index, the second mutual exclusion index, the third mutual exclusion index, the fourth mutual exclusion index, and the first estimated pickup time and the second estimated pickup time Determining a mutual exclusion index between an unassigned delivery task and a delivery task that has been assigned to the distribution resource but not delivered;
  • step S505 the initial distribution index is corrected according to the mutual exclusion index to obtain a corrected distribution index.
  • the mutual exclusion between the undelivered delivery task and the delivery task that has been allocated to the delivery resource but not delivered is obtained according to the mutual exclusion between the delivery addresses and the delivery time of the delivery task. index. specifically:
  • the mutual exclusion index is calculated according to the first mutual exclusion index and the second mutual exclusion index, for example, the first mutually exclusive index and the second mutually exclusive index may be weighted and summed to obtain the mutual Rejection index.
  • the third mutual exclusion index may be used as the mutual exclusion index.
  • the fourth mutual exclusion index may be used as the mutual exclusion index.
  • the distribution distance index is expressed as f dist (x1, x2)
  • the delivery time index is expressed as f time (x1, x2), where x1, x2 respectively represent the unassigned delivery task and have been assigned to
  • the distribution task Score (x1, x2) obtained by the mutual exclusion index correction may be expressed as:
  • f mutex (x1, x2) represents the mutual exclusion index
  • w dist , w time and w mutex respectively represent the weight value corresponding to the distribution distance index, the delivery time index and the mutual exclusion index, and the weight value may be according to the needs of the actual application. Or based on prior knowledge.
  • the step S503 is to determine a first mutual exclusion index between the area where the first pickup address is located and the area where the second pickup address is located.
  • a second mutual exclusion index between the area where the first delivery address is located and the area where the second delivery address is located, a third mutual exclusion index between the area where the first pickup address is located and the area where the second delivery address is located, and
  • the step of the fourth mutual exclusion index between the area where the first delivery address is located and the area where the second pickup address is located includes steps S601-S602:
  • step S601 determining an area where the first pickup address, the second pickup address, the first delivery address, and the second delivery address are located;
  • step S602 the first mutual exclusion index, the second mutual exclusion index, the third mutual exclusion index, and the fourth mutual exclusion index are determined according to mutual exclusion of different regions.
  • the mutual exclusion index may be set according to the mutual exclusion definition mentioned above, and the specific setting method may be selected according to the needs of the actual application, may be obtained according to prior knowledge, or may be distributed according to history.
  • the data is obtained by the normalization method. For example, for the two regions of the merge processing, the mutual exclusion index reference value corresponding to the mean historical distribution cost average is set to 1, and the distribution cost is higher than the historical distribution cost average.
  • the mutual exclusion index between the regions is set to be less than 1, indicating that the two regions are not suitable for the merge processing, and the mutual exclusion index between the two regions whose distribution cost is lower than the historical distribution cost average is set to be greater than 1, indicating that the two The area is suitable for consolidation.
  • step S601 that is, determining the first pickup address, the second pickup address, the first delivery address, and the second delivery address.
  • steps S701-S702 The steps of the area, including steps S701-S702:
  • step S701 the preset address keywords of the first pickup address, the second pickup address, the first delivery address, and the second delivery address are acquired;
  • step S702 an area where the first pickup address, the second pickup address, the first delivery address, and the second delivery address are located is determined according to the preset address keyword.
  • the preset address keyword may include information such as a province, a city, a district/county, a street, a street number, a building/community name, and the like.
  • the step S601 that is, determining the first pickup address, the second pickup address, the first delivery address, and the second delivery
  • the step of the area where the address is located includes steps S801-S802:
  • step S801 acquiring geographic location information of the first pickup address, the second pickup address, the first delivery address, and the second delivery address;
  • step S802 an area in which the first pickup address, the second pickup address, the first delivery address, and the second delivery address are located is determined according to the geographical location information.
  • the geographic location information may be obtained by using an existing positioning method, and the geographic location information may be a geographic coordinate value, or may be a latitude and longitude and other data that can identify a geographical location of an address.
  • the step S601 that is, determining the first pickup address, the second pickup address, the first delivery address, and the second delivery
  • the step of the area where the address is located includes steps S901-S904:
  • step S901 it is determined whether the preset address keywords of the first pickup address, the second pickup address, the first delivery address, and the second delivery address can be acquired;
  • step S902 when the preset address keyword is successfully acquired, determining, according to the address keyword, the first pickup address, the second pickup address, the first delivery address, and the second delivery address. Area;
  • step S903 when the acquisition of the preset address keyword fails, acquiring geographical location information of the first pickup address, the second pickup address, the first delivery address, and the second delivery address;
  • step S904 an area in which the first pickup address, the second pickup address, the first delivery address, and the second delivery address are located is determined according to the geographical location information.
  • the address keyword method is first used to determine the area where the address is located. If the method fails, the location information method is used to determine the area where the address is located.
  • the foregoing embodiment may establish a database storing area address information and/or area location information according to prior knowledge, wherein the area may be divided according to an administrative area, or may be divided according to a business circle, or according to a building/ In the cell division, the data corresponding to the area stores address information or geographical location information in the area and higher-level geographic information to which the area belongs. For example, if an office building is used as a regional division, the database includes not only the name of the area, location information of the area, but also a higher-level name geographic location of the street, district/county, city, and province to which the area belongs. Information, the database may also include a region border formed along a periphery of an area.
  • the hierarchical hierarchical search and search can be performed in the database according to the name and geographic information of the address, so as to reduce the search workload. Improve search efficiency.
  • the database may also store mutually exclusive data corresponding to each area and other areas, so that the mutual exclusion data of the area may be obtained while determining the area where the address is located, thereby saving more. Time, improve efficiency.
  • the step S103 is to allocate the unallocated delivery task to the distribution resource when the corrected delivery index is higher than the preset delivery threshold.
  • the steps include steps S1001-S1002:
  • step S1001 determining a distribution pressure index of the distribution resource
  • step S1002 when the corrected delivery index is higher than a preset delivery threshold and the delivery pressure index of the delivery resource is lower than a preset pressure threshold, the unallocated delivery task is allocated to the delivery resource.
  • the delivery pressure index may include a delivery distance pressure index, a delivery task pressure index, a delivery time pressure index, and the like. For example, if the distance between the delivery resource and the unassigned delivery task pickup address is too far, the delivery distance pressure The index is higher; if the number of delivery tasks assigned to the distribution resource is large, the distribution task pressure index is higher; if the available time of the distribution resource is relatively tight, the delivery time pressure index is higher. Only when the corrected delivery index is higher than the preset delivery threshold and the delivery pressure index of the distribution resource is lower than the preset pressure threshold, that is, when the unallocated delivery task is suitable for the distribution resource, and the distribution resource has sufficient capacity to accept the The unallocated delivery task is assigned to the delivery resource only during the task.
  • the distribution task distribution device includes:
  • a determining module 1101 configured to determine an initial delivery index of the distribution resource for the unassigned delivery task
  • the correction module 1102 is configured to perform the initial delivery according to the mutual exclusion between the delivery address of the unassigned delivery task and the delivery address of the delivery task that has been allocated to the delivery resource but not delivered Correcting the index to obtain a corrected distribution index, wherein the mutual exclusion is used to characterize the extent to which the unassigned delivery task and the delivery task that has been allocated to the delivery resource but are not delivered are suitable for being merged;
  • the distribution module 1103 is configured to allocate the unallocated delivery task to the distribution resource when the corrected delivery index is higher than a preset delivery threshold.
  • the conventional processing may be merged, that is, Assigning the unallocated delivery task to the distribution resource, but in actual application, if one of the delivery addresses belongs to an area with many restrictions, such as a cell that can only walk in, and the entrance of the cell is The delivery addresses of another merged delivery task are far apart. In this case, if the delivery tasks are combined, it is not necessarily an optimal allocation result.
  • a distribution task assignment device which determines, by the determination module 1101, an initial distribution index of a distribution resource for an unassigned delivery task according to a distance factor and a time factor according to a conventional method; 1102 correcting the initial delivery index according to the mutual exclusion between the delivery address of the unassigned delivery task and the delivery address of the delivery task that has been allocated to the delivery resource but not delivered, and the correction is obtained.
  • a distribution index when the revised delivery index is higher than a preset delivery threshold, the distribution module 1103 assigns the unallocated delivery task to the delivery resource.
  • the embodiment comprehensively considers the distance factor, the time factor and the mutual exclusion factor between the delivery addresses to determine whether to assign a distribution task to a distribution resource, so as to achieve the optimization of the distribution task allocation process or the combined delivery process, thereby achieving Make full use of the available time of distribution resources, improve the scheduling efficiency of distribution resources, and then improve the quality of service and enhance the technical effect of user experience.
  • the determining module 1101 includes:
  • the first calculation sub-module 1201 is configured to calculate a delivery distance index of the unassigned delivery task and the delivery task that has been allocated to the delivery resource but not delivered;
  • a second calculation sub-module 1202 configured to calculate a delivery time index of the unassigned delivery task and the delivery task that has been allocated to the delivery resource but not delivered;
  • the addition sub-module 1203 is configured to weight-add the distribution distance index and the delivery time index to obtain the initial distribution index.
  • the first calculating submodule 1201 includes:
  • the first obtaining unit 1301 is configured to acquire a first pickup address and a first delivery address of the unassigned delivery task
  • the second obtaining unit 1302 is configured to acquire a second pickup address and a second delivery address of the delivery task that has been allocated to the delivery resource but not delivered;
  • the first determining unit 1303 is configured to: according to the distance between the first pickup address and the first delivery address, the distance between the second pickup address and the second delivery address, the first pickup address and The distance between the second pickup address, the distance between the first delivery address and the second delivery address determines the delivery distance index.
  • the delivery distance index is determined based on a relationship between a delivery address of an unassigned delivery task and a delivery address of a delivery task that has been assigned to the delivery resource but not delivered.
  • the second calculating submodule 1202 includes:
  • the third obtaining unit 1401 is configured to acquire the first pickup address and the first delivery address of the unassigned delivery task
  • the fourth obtaining unit 1402 is configured to acquire a second pickup address and a second delivery address of the delivery task that has been allocated to the delivery resource but not delivered;
  • the second determining unit 1403 is configured to determine a first picking waiting time and a second picking waiting time of the distribution resource at the first picking address and the second picking address, and the delivery resource is sent in the first First delivery waiting time and second delivery waiting time at the cargo address and the second shipping address;
  • the third determining unit 1404 is configured to determine the delivery time index according to the first delivery waiting time and the second delivery waiting time.
  • the delivery time index is determined based on the waiting time at a plurality of addresses.
  • the modification module 1102 includes:
  • the first obtaining submodule 1501 is configured to acquire a first pickup address, a first delivery address, and a first estimated pickup time of the unassigned delivery task;
  • a second obtaining sub-module 1502 configured to acquire a second pickup address, a second delivery address, and a second estimated pickup time of the delivery task that has been allocated to the delivery resource but not delivered;
  • the first determining submodule 1503 is configured to determine a first mutual exclusion index, a first shipping address area, and a second shipping address between the area where the first pickup address is located and the area where the second pickup address is located a second mutual exclusion index between the regions, a third mutual exclusion index between the region where the first pickup address is located and the region where the second delivery address is located, and the region where the first delivery address is located and the second pickup address
  • the calculating sub-module 1504 is configured to: according to the first mutual exclusion index, the second mutual exclusion index, the third mutual exclusion index, the fourth mutual exclusion index, and the first estimated pickup time and the second estimated pickup time Calculating a mutual exclusion index between the unallocated delivery task and a delivery task that has been allocated to the delivery resource but not delivered;
  • the correction sub-module 1505 is configured to correct the initial distribution index according to the mutual exclusion index to obtain a corrected distribution index.
  • the mutual exclusion between the undelivered delivery task and the delivery task that has been allocated to the delivery resource but not delivered is obtained according to the mutual exclusion between the delivery addresses and the delivery time of the delivery task. index.
  • the first determining submodule 1503 includes:
  • the fourth determining unit 1601 is configured to determine an area where the first pickup address, the second pickup address, the first delivery address, and the second delivery address are located;
  • the fifth determining unit 1602 is configured to determine the first mutual exclusion index, the second mutual exclusion index, the third mutual exclusion index, and the fourth mutual exclusion index according to mutual exclusion of different regions.
  • the fourth determining unit 1601 includes:
  • the first obtaining subunit 1701 is configured to acquire preset address keywords of the first pickup address, the second pickup address, the first delivery address, and the second delivery address;
  • the first determining subunit 1702 is configured to determine an area where the first pickup address, the second pickup address, the first delivery address, and the second delivery address are located according to the preset address keyword.
  • the preset address keyword may include information such as a province, a city, a district/county, a street, a street number, a building/community name, and the like.
  • the fourth determining unit 1601 includes:
  • the second obtaining subunit 1801 is configured to acquire geographical location information of the first pickup address, the second pickup address, the first delivery address, and the second delivery address;
  • the second determining subunit 1802 is configured to determine an area where the first pickup address, the second pickup address, the first delivery address, and the second delivery address are located according to the geographical location information.
  • the geographic location information may be obtained by using an existing positioning method, and the geographic location information may be a geographic coordinate value, or may be a latitude and longitude and other data that can identify a geographical location of an address.
  • the fourth determining unit 1601 includes:
  • the determining subunit 1901 is configured to determine whether the preset address keywords of the first pickup address, the second pickup address, the first delivery address, and the second delivery address can be acquired;
  • the third determining subunit 1902 is configured to, when successfully acquiring the preset address keyword, determine the first pickup address, the second pickup address, the first delivery address, and the first The area where the second shipping address is located;
  • the third obtaining subunit 1903 is configured to acquire the geography of the first pickup address, the second pickup address, the first delivery address, and the second delivery address when the acquisition of the preset address keyword fails location information;
  • the fourth determining subunit 1904 is configured to determine an area in which the first pickup address, the second pickup address, the first delivery address, and the second delivery address are located according to the geographic location information.
  • the address keyword method is first used to determine the area where the address is located. If the method fails, the location information method is used to determine the area where the address is located.
  • the distribution module 1103 includes:
  • a second determining sub-module 2001 configured to determine a delivery pressure index of the distribution resource
  • the distribution sub-module 2002 is configured to allocate the unallocated delivery task to the distribution resource when the corrected delivery index is higher than a preset delivery threshold and the delivery pressure index of the delivery resource is lower than a preset pressure threshold .
  • FIG. 21 is a block diagram showing the structure of an electronic device according to an embodiment of the present disclosure. As shown in FIG. 21, the electronic device 2100 includes a memory 2101 and a processor 2102.
  • the memory 2101 is for storing one or more computer instructions, wherein the one or more computer instructions are executed by the processor 2102 to implement any of the method steps described above.
  • FIG. 22 is a block diagram showing the structure of a computer system suitable for implementing a delivery task assignment method in accordance with an embodiment of the present disclosure.
  • computer system 2200 includes a central processing unit (CPU) 2201 that can be loaded into a program in random access memory (RAM) 2203 according to a program stored in read only memory (ROM) 2202 or from storage portion 2208.
  • CPU central processing unit
  • RAM random access memory
  • ROM read only memory
  • computer system 2200 includes a central processing unit (CPU) 2201 that can be loaded into a program in random access memory (RAM) 2203 according to a program stored in read only memory (ROM) 2202 or from storage portion 2208.
  • RAM random access memory
  • ROM read only memory
  • RAM 2203 various programs and data required for the operation of the system 2200 are also stored.
  • the CPU 2201, the ROM 2202, and the RAM 2203 are connected to each other through a bus 2204.
  • An input/output (I/O) interface 2205 is also coupled to bus 2204.
  • the following components are connected to the I/O interface 2205: an input portion 2206 including a keyboard, a mouse, etc.; an output portion 2207 including a cathode ray tube (CRT), a liquid crystal display (LCD), and the like, and a speaker; a storage portion 2208 including a hard disk or the like And a communication portion 2209 including a network interface card such as a LAN card, a modem, or the like.
  • the communication section 2209 performs communication processing via a network such as the Internet.
  • Driver 2210 is also coupled to I/O interface 2205 as needed.
  • a removable medium 2211 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory or the like is mounted on the drive 2210 as needed so that a computer program read therefrom is installed into the storage portion 2208 as needed.
  • an embodiment of the present disclosure includes a computer program product comprising a computer program tangibly embodied on a readable medium therewith, the computer program comprising program code for performing the distribution task assignment method of FIGS. 1-10 .
  • the computer program can be downloaded and installed from the network via the communication portion 2209, and/or installed from the removable medium 2211.
  • each block in the diagram or block diagram can represent a module, a program segment, or a portion of code that includes one or more of Executable instructions.
  • the functions noted in the blocks may also occur in a different order than that illustrated in the drawings.
  • the blocks shown in succession can in fact be executed substantially in parallel, and they can sometimes be executed in the reverse order, depending upon the functionality involved.
  • each block of the block diagrams and/or flowcharts, and combinations of blocks in the block diagrams and/or flowcharts can be implemented in a dedicated hardware-based system that performs the specified function or operation. Or it can be implemented by a combination of dedicated hardware and computer instructions.
  • the units or modules described in the embodiments of the present disclosure may be implemented by software or by hardware.
  • the described units or modules may also be provided in a processor, the names of which do not in any way constitute a limitation of the unit or the module itself.
  • the present disclosure further provides a computer readable storage medium, which may be a computer readable storage medium included in the apparatus in the above embodiment; or may exist separately, not A computer readable storage medium that is assembled into the device.
  • a computer readable storage medium stores one or more programs that are used by one or more processors to perform the methods described in the present disclosure.

Abstract

本公开实施例公开了一种配送任务分配方法、装置、电子设备及计算机存储介质，所述方法包括：确定配送资源对于未分配配送任务的初始配送指数；根据未分配配送任务的取送货地址与已分配给配送资源但未配送的配送任务的取送货地址之间的互斥性，对初始配送指数进行修正，得到修正配送指数，其中，互斥性用于表征未分配配送任务与已分配给配送资源但未配送的配送任务适合被合并处理的程度；若修正配送指数高于预设配送阈值，将未分配配送任务分配给配送资源。本公开实施例能够使得配送任务分配处理或者合并配送处理的最优化，从而取得充分利用配送资源的可用时间，提高配送资源的调度效率，进而提升服务质量，增强用户体验的技术效果。

Description

配送任务分配方法、装置、电子设备及计算机存储介质
相关申请的交叉引用
本申请要求于2018年2月6日提交的中国专利申请号为“CN2018101179271”的优先权，其全部内容作为整体并入本申请中。
技术领域
本公开涉及信息处理技术领域，具体涉及一种配送任务分配方法、装置、电子设备及计算机可读存储介质。
背景技术
随着互联网技术的发展，越来越多的商家或者服务提供商通过互联网平台来为用户提供服务，很多互联网服务都需要配送员进行配送，因此，快速增长的互联网服务对于配送员的调度质量提出了很高的要求。
发明内容
本公开实施例提供一种配送任务分配方法、装置、电子设备及计算机可读存储介质。
第一方面，本公开实施例中提供了一种配送任务分配方法。
具体的，所述配送任务分配方法，包括：
确定配送资源对于未分配配送任务的初始配送指数；
根据所述未分配配送任务的取送货地址与已分配给所述配送资源但未配送的配送任务的取送货地址之间的互斥性，对所述初始配送指数进行修正，得到修正配送指数，其中，所述互斥性用于表征所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务适合被合 并处理的程度；
若所述修正配送指数高于预设配送阈值，将所述未分配配送任务分配给所述配送资源。
结合第一方面，本公开在第一方面的第一种实现方式中，所述确定配送资源对于未分配配送任务的初始配送指数，包括：
计算所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务合并处理的配送距离指数；
计算所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务合并处理的配送时间指数；
将所述配送距离指数和所述配送时间指数进行加权相加，得到所述初始配送指数。
结合第一方面，本公开在第一方面的第一种实现方式中，所述计算所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务合并处理的配送距离指数，包括：
获取所述未分配配送任务的第一取货地址和第一送货地址；
获取所述已分配给所述配送资源但未配送的配送任务的第二取货地址和第二送货地址；
根据所述第一取货地址与所述第一送货地址之间的距离、所述第二取货地址与所述第二送货地址之间的距离、所述第一取货地址与所述第二取货地址之间的距离、所述第一送货地址与所述第二送货地址之间的距离确定所述配送距离指数。
结合第一方面，本公开在第一方面的第一种实现方式中，所述计算所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务合并处理的配送时间指数，包括：
获取所述未分配配送任务的第一取货地址和第一送货地址；
获取所述已分配给所述配送资源但未配送的配送任务的第二取货地址和第二送货地址；
确定所述配送资源在所述第一取货地址处的第一取货等待时间和所述第二取货地址处的第二取货等待时间以及所述配送资源在所述第 一送货地址处的第一送货等待时间和所述第二送货地址处的第二送货等待时间；
根据所述第一送货等待时间和所述第二送货等待时间确定所述配送时间指数。
结合第一方面，本公开在第一方面的第一种实现方式中，所述根据未分配配送任务的取送货地址与已分配给所述配送资源但未配送的配送任务的取送货地址之间的互斥性，对所述初始配送指数进行修正，得到修正配送指数，包括：
获取所述未分配配送任务的第一取货地址、第一送货地址和第一预计取货时间；
获取所述已分配给所述配送资源但未配送的配送任务的第二取货地址、第二送货地址和第二预计取货时间；
确定所述第一取货地址所在区域与所述第二取货地址所在区域之间的第一互斥指数、所述第一送货地址所在区域与所述第二送货地址所在区域之间的第二互斥指数、所述第一取货地址所在区域与所述第二送货地址所在区域之间的第三互斥指数，以及所述第一送货地址所在区域与所述第二取货地址所在区域之间的第四互斥指数；
根据所述第一互斥指数、所述第二互斥指数、所述第三互斥指数、所述第四互斥指数以及所述第一预计取货时间和所述第二预计取货时间计算得到所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务之间的互斥指数；
根据所述互斥指数对于所述初始配送指数进行修正，得到修正配送指数。
结合第一方面，本公开在第一方面的第一种实现方式中，所述确定所述第一取货地址所在区域与所述第二取货地址所在区域之间的第一互斥指数、所述第一送货地址所在区域与所述第二送货地址所在区域之间的第二互斥指数、所述第一取货地址所在区域与所述第二送货地址所在区域之间的第三互斥指数，以及所述第一送货地址所在区域与所述第二取货地址所在区域之间的第四互斥指数，包括：
确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域；
根据不同区域的互斥性确定所述第一互斥指数、所述第二互斥指数、所述第三互斥指数和所述第四互斥指数。
结合第一方面，本公开在第一方面的第一种实现方式中，所述确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域，包括：
获取所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址的预设地址关键词；
根据所述预设地址关键词确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域。
结合第一方面和第一方面的第一种实现方式，本公开在第一方面的第二种实现方式中，所述确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域，包括：
获取所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址的地理位置信息；
根据所述地理位置信息确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域。
结合第一方面、第一方面的第一种实现方式和第一方面的第二种实现方式，本公开在第一方面的第三种实现方式中，所述确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域，包括：
判断能否获取所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址的预设地址关键词；
若成功获取所述预设地址关键词，根据所述地址关键词确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域；
若获取所述预设地址关键词失败，获取所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址的地理位置信息；
根据所述地理位置信息确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域。
结合第一方面，本公开在第一方面的第一种实现方式中，所述若修正配送指数高于预设配送阈值，将所述未分配配送任务分配给所述配送资源，包括：
确定所述配送资源的配送压力指数；
若所述修正配送指数高于预设配送阈值且所述配送资源的配送压力指数低于预设压力阈值，将所述未分配配送任务分配给所述配送资源。
第二方面，本公开实施例中提供了一种配送任务分配装置。
具体的，所述配送任务分配装置，包括：
确定模块，被配置为确定配送资源对于未分配配送任务的初始配送指数；
修正模块，根据所述未分配配送任务的取送货地址与已分配给所述配送资源但未配送的配送任务的取送货地址之间的互斥性，对所述初始配送指数进行修正，得到修正配送指数，其中，所述互斥性用于表征所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务适合被合并处理的程度；
分配模块，被配置为若所述修正配送指数高于预设配送阈值，将所述未分配配送任务分配给所述配送资源。
结合第二方面，本公开在第二方面的第一种实现方式中，所述确定模块包括：
第一计算子模块，被配置为计算所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务合并处理的配送距离指数；
第二计算子模块，被配置为计算所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务合并处理的配送时间指数；
加法子模块，被配置为将所述配送距离指数和所述配送时间指数进行加权相加，得到所述初始配送指数。
结合第二方面，本公开在第二方面的第一种实现方式中，所述确定模块包括：
第一获取单元，被配置为获取所述未分配配送任务的第一取货地址和第一送货地址；
第二获取单元，被配置为获取所述已分配给所述配送资源但未配送的配送任务的第二取货地址和第二送货地址；
第一确定单元，被配置为根据所述第一取货地址与所述第一送货地址之间的距离、所述第二取货地址与所述第二送货地址之间的距离、所述第一取货地址与所述第二取货地址之间的距离、所述第一送货地址与所述第二送货地址之间的距离确定所述配送距离指数。
结合第二方面，本公开在第二方面的第一种实现方式中，所述第二计算子模块包括：
第三获取单元，被配置为获取所述未分配配送任务的第一取货地址和第一送货地址；
第四获取单元，被配置为获取所述已分配给所述配送资源但未配送的配送任务的第二取货地址和第二送货地址；
第二确定单元，被配置为确定所述配送资源在所述第一取货地址处的第一取货等待时间和所述第二取货地址处的第二取货等待时间以及所述配送资源在所述第一送货地址处的第一送货等待时间和所述第二送货地址处的第二送货等待时间；
第三确定单元，被配置为根据所述第一送货等待时间和所述第二送货等待时间确定所述配送时间指数。
结合第二方面，本公开在第二方面的第一种实现方式中，所述修正模块包括：
第一获取子模块，被配置为获取所述未分配配送任务的第一取货地址、第一送货地址和第一预计取货时间；
第二获取子模块，被配置为获取所述已分配给所述配送资源但未配送的配送任务的第二取货地址、第二送货地址和第二预计取货时间；
第一确定子模块，被配置为确定所述第一取货地址所在区域与所述第二取货地址所在区域之间的第一互斥指数、所述第一送货地址所在区域与所述第二送货地址所在区域之间的第二互斥指数、所述第一取货地 址所在区域与所述第二送货地址所在区域之间的第三互斥指数，以及所述第一送货地址所在区域与所述第二取货地址所在区域之间的第四互斥指数；
计算子模块，被配置为根据所述第一互斥指数、所述第二互斥指数、所述第三互斥指数、所述第四互斥指数以及所述第一预计取货时间和所述第二预计取货时间计算得到所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务之间的互斥指数；
修正子模块，被配置为根据所述互斥指数对于所述初始配送指数进行修正，得到修正配送指数。
结合第二方面，本公开在第二方面的第一种实现方式中，所述确定子模块包括：
第四确定单元，被配置为确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域；
第五确定单元，被配置为根据不同区域的互斥性确定所述第一互斥指数、所述第二互斥指数、所述第三互斥指数和所述第四互斥指数。
结合第二方面，本公开在第二方面的第一种实现方式中，所述第四确定单元包括：
第一获取子单元，被配置为获取所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址的预设地址关键词；
第一确定子单元，被配置为根据所述预设地址关键词确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域。
结合第二方面和第二方面的第一种实现方式，本公开在第二方面的第二种实现方式中，所述第四确定单元包括：
第二获取子单元，被配置为获取所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址的地理位置信息；
第二确定子单元，被配置为根据所述地理位置信息确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域。
结合第二方面、第二方面的第一种实现方式和第二方面的第二种实现方式，本公开在第二方面的第三种实现方式中，所述第四确定单元包括：
判断子单元，被配置为判断能否获取所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址的预设地址关键词；
第三确定子单元，被配置为若成功获取所述预设地址关键词，根据所述地址关键词确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域；
第三获取子单元，被配置为若获取所述预设地址关键词失败，获取所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址的地理位置信息；
第四确定子单元，被配置为根据所述地理位置信息确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域。
结合第二方面，本公开在第二方面的第一种实现方式中，所述分配模块包括：
第二确定子模块，被配置为确定所述配送资源的配送压力指数；
分配子模块，被配置为若所述修正配送指数高于预设配送阈值且所述配送资源的配送压力指数低于预设压力阈值，将所述未分配配送任务分配给所述配送资源。
第三方面，本公开实施例提供了一种电子设备，包括存储器和处理器，所述存储器用于存储一条或多条支持配送任务分配装置执行上述第一方面中配送任务分配方法的计算机指令，所述处理器被配置为用于执行所述存储器中存储的计算机指令。所述配送任务分配装置还可以包括通信接口，用于配送任务分配装置与其他设备或通信网络通信。
第四方面，本公开实施例提供了一种计算机可读存储介质，用于存储配送任务分配装置所用的计算机指令，其包含用于执行上述第一方面中配送任务分配方法为配送任务分配装置所涉及的计算机指令。
上述技术方案，综合考虑距离因素、时间因素以及取送货地址之间 的互斥因素来决定是否将一配送任务分配给一配送资源，以达到配送任务分配处理或者合并配送处理的最优化，从而达到充分利用配送资源的可用时间，提高配送资源的调度效率，进而提升服务质量，增强用户体验的技术效果。
应当理解的是，以上的一般描述和后文的细节描述仅是示例性和解释性的，并不能限制本公开。
附图说明
结合附图，通过以下非限制性实施方式的详细描述，本公开的其它特征、目的和优点将变得更加明显。在附图中：
图1示出根据本公开一实施方式的配送任务分配方法的流程图；
图2示出根据图1所示实施方式的配送任务分配方法的步骤S101的流程图；
图3示出根据图2所示实施方式的配送任务分配方法的步骤S201的流程图；
图4示出根据图2所示实施方式的配送任务分配方法的步骤S202的流程图；
图5示出根据图1所示实施方式的配送任务分配方法的步骤S102的流程图；
图6示出根据图5所示实施方式的配送任务分配方法的步骤S503的流程图；
图7-图9示出根据图6所示实施方式的配送任务分配方法的步骤S601的流程图；
图10示出根据图1所示实施方式的配送任务分配方法的步骤S103的流程图；
图11示出根据本公开一实施方式的配送任务分配装置的结构框图；
图12示出根据图11所示实施方式的配送任务分配装置的确定模块1101的结构框图；
图13示出根据图12所示实施方式的配送任务分配装置的第一计算子模块1201的结构框图；
图14示出根据图12所示实施方式的配送任务分配装置的第二计算子模块1202的结构框图；
图15示出根据图11所示实施方式的配送任务分配装置的修正模块1102的结构框图；
图16示出根据图15所示实施方式的配送任务分配装置的第一确定子模块1503的结构框图；
图17-图19示出根据图16所示实施方式的配送任务分配装置的第四确定单元1601的结构框图；
图20示出根据图11所示实施方式的配送任务分配装置的分配模块1103的结构框图；
图21示出根据本公开一实施方式的电子设备的结构框图；
图22是适于用来实现根据本公开一实施方式的配送任务分配方法的计算机系统的结构示意图。
具体实施方式
下文中，将参考附图详细描述本公开的示例性实施方式，以使本领域技术人员可容易地实现它们。此外，为了清楚起见，在附图中省略了与描述示例性实施方式无关的部分。
在本公开中，应理解，诸如“包括”或“具有”等的术语旨在指示本说明书中所公开的特征、数字、步骤、行为、部件、部分或其组合的存在，并且不欲排除一个或多个其他特征、数字、步骤、行为、部件、部分或其组合存在或被添加的可能性。
另外还需要说明的是，在不冲突的情况下，本公开中的实施例及实施例中的特征可以相互组合。下面将参考附图并结合实施例来详细说明本公开。
本公开实施例提供的技术方案，综合考虑距离因素、时间因素以及 取送货地址之间的互斥因素来决定是否将一配送任务分配给一配送资源，以达到配送任务分配处理或者合并配送处理的最优化，从而达到充分利用配送资源的可用时间，提高配送资源的调度效率，进而提升服务质量，增强用户体验的技术效果。
图1示出根据本公开一实施方式的配送任务分配方法的流程图。如图1所示，所述配送任务分配方法包括以下步骤S101-S103：
在步骤S101中，确定配送资源对于未分配配送任务的初始配送指数；
在步骤S102中，根据所述未分配配送任务的取送货地址与已分配给所述配送资源但未配送的配送任务的取送货地址之间的互斥性，对所述初始配送指数进行修正，得到修正配送指数，其中，所述互斥性用于表征所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务适合被合并处理的程度；
在步骤S103中，在所述修正配送指数高于预设配送阈值时，将所述未分配配送任务分配给所述配送资源。
目前在分配配送任务时，为了提高任务配送的效率，通常基于配送资源需行进的距离和所需花费的时间来决定是否将一配送任务分配给一个配送资源，或者是否将该配送任务与已分配给该配送资源的其他配送任务或者配送任务组进行合并处理。比如，当未分配配送任务的送货地址与已分配给配送资源但还未配送的一个配送任务的送货地址之间的距离比较近时，按照常规处理方式有可能会被合并处理，也就是将所述未分配配送任务分配给该配送资源，但在实际应用中，若两个送货地址中的其中一个属于一个存在很多限制的区域，比如一个只能步行进入的小区，而且这个小区的入口与另一个合并处理的配送任务的送货地址相距较远，在这种情况下，若将所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务合并处理，未必是一个最优的分配结果。
考虑到上述缺陷，在该实施方式中，提出一种配送任务分配方法，该方法首先按照常规方法根据距离因素和时间因素确定配送资源对于未分配配送任务的初始配送指数；然后根据所述未分配配送任务的取送 货地址与已分配给所述配送资源但未配送的配送任务的取送货地址之间的互斥性，对所述初始配送指数进行修正，得到修正配送指数；最后在所述修正配送指数高于预设配送阈值时，将所述未分配配送任务分配给所述配送资源。该实施方式综合考虑距离因素、时间因素以及取送货地址之间的互斥因素来决定是否将一配送任务分配给一配送资源，以达到配送任务分配处理或者合并配送处理的最优化，从而达到充分利用配送资源的可用时间，提高配送资源的调度效率，进而提升服务质量，增强用户体验的技术效果。
其中，所述互斥性用于表征所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务适合被合并处理的程度，比如，如果一个地址与其他地址合并进行处理时，能够节省配送资源的配送时间、省却配送资源的配送路程、提高配送资源的配送效率，那么该地址与其他地址之间的互斥性比较弱，反之，如果一个地址与其他地址合并进行处理时，反倒会浪费配送资源的配送时间、增加配送资源的配送路程、降低配送资源的配送效率，那么该地址与其他地址之间的互斥性就比较强。地址之间的互斥性可根据预设历史时间段内的历史配送数据来得到，所述互斥性还可与时间因素有关，比如对于某一商业楼，周末中午行人密度较大，电梯等待时间较长，是一个活动高峰期，而工作日的中午行人密度较小，电梯等待时间较短，处于活动低峰期，那么该商业楼在周末中午的高峰时段内，其与其他地址之间的互斥性就比较强，而在其他低峰时段内，其与其他地址之间的互斥性比较弱。
在本实施例的一个可选实现方式中，如图2所示，所述步骤S101，即确定配送资源对于未分配配送任务的初始配送指数的步骤，包括步骤S201-S203：
在步骤S201中，计算所述未分配配送任务与已分配给所述配送资源但未配送的配送任务合并处理的配送距离指数；
在步骤S202中，计算所述未分配配送任务与已分配给所述配送资源但未配送的配送任务合并处理的配送时间指数；
在步骤S203中，将所述配送距离指数和配送时间指数进行加权相 加，得到所述初始配送指数。
在该实施方式中，首先计算所述未分配配送任务与已分配给所述配送资源但未配送的配送任务之间的配送距离指数；然后计算所述未分配配送任务与已分配给所述配送资源但未配送的配送任务之间的配送时间指数；最后将所述配送距离指数和配送时间指数进行加权相加，得到所述初始配送指数。
在本实施例的一个可选实现方式中，如图3所示，所述步骤S201，即计算所述未分配配送任务与已分配给所述配送资源但未配送的配送任务合并处理的配送距离指数的步骤，包括步骤S301-S303：
在步骤S301中，获取所述未分配配送任务的第一取货地址和第一送货地址；
在步骤S302中，获取已分配给所述配送资源但未配送的配送任务的第二取货地址和第二送货地址；
在步骤S303中，根据所述第一取货地址与第一送货地址之间的距离、第二取货地址与第二送货地址之间的距离、第一取货地址与第二取货地址之间的距离、第一送货地址与第二送货地址之间的距离确定所述配送距离指数。
在该实施方式中，根据未分配配送任务的取送货地址与已分配给所述配送资源但未配送的配送任务的取送货地址之间的关系来确定所述配送距离指数。
实际上，所述配送距离指数的计算方法有很多种，比如，可将预设历史时间段内产生的历史配送距离的平均值作为距离参考值，相应的配送距离指数参考值设置为1，那么，若配送资源到配送任务之间的配送距离大于所述距离参考值，则相应的配送距离指数可设置为小于1，说明该配送资源不适合配送该配送任务；反之，若配送资源到配送任务之间的配送距离小于所述距离参考值，则相应的配送距离指数可设置为大于1，说明该配送资源适合配送该配送任务。
对于未分配配送任务和已分配给所述配送资源但未配送的配送任务来说，可分别计算这两个配送任务合并处理以及单独处理而产生的配 送距离，根据两个配送距离的大小以及与所述距离参考值的比较来确定所述配送距离指数，比如，若距离参考值为3km，相应的配送距离指数参考值为1，两个配送任务合并处理后产生的配送距离为2km，单独处理产生的配送距离为4km，则可将配送距离指数设置为1.5，说明将这两个配送任务适合合并处理；反之，两个配送任务合并处理后产生的配送距离为4km，单独处理产生的配送距离为2.5km，则可将配送距离指数设置为0.7，说明将这两个配送任务不适合进行合并处理。
其中，所述配送距离指的是配送资源完成一配送任务而产生的距离。
在本实施例的一个可选实现方式中，如图4所示，所述步骤S202，即计算所述未分配配送任务与已分配给所述配送资源但未配送的配送任务合并处理的配送时间指数的步骤，包括步骤S401-S404：
在步骤S401中，获取所述未分配配送任务的第一取货地址和第一送货地址；
在步骤S402中，获取已分配给所述配送资源但未配送的配送任务的第二取货地址和第二送货地址；
在步骤S403中，确定所述配送资源在第一取货地址和第二取货地址处的第一取货等待时间和第二取货等待时间以及所述配送资源在第一送货地址和第二送货地址处的第一送货等待时间和第二送货等待时间；
在步骤S404中，根据所述第一送货等待时间和所述第二送货等待时间确定所述配送时间指数。
在该实施方式中，根据在多个地址的等待时间确定所述配送时间指数。
比如，与配送距离指数的计算相似，可将预设历史时间段内发生的等待时间的平均值作为时间参考值，相应的配送时间指数参考值设置为1，那么，若配送资源等待的时间大于所述时间参考值，则相应的配送时间指数可设置为小于1，说明该配送资源不适合配送该配送任务；反之，若配送资源等待的时间小于所述时间参考值，则相应的配送时间指数可设置为大于1，说明该配送资源适合配送该配送任务。
对于未分配配送任务和已分配给所述配送资源但未配送的配送任务来说，可分别计算这两个配送任务合并处理以及单独处理而产生的等待时间，并根据等待时间的大小以及与所述时间参考值的比较来确定所述配送时间指数。比如，若时间参考值为1小时，相应的配送时间指数参考值为1，两个配送任务合并处理后发生的等待时间为0.5小时，单独处理发生的等待时间为1.5小时，那么可将配送时间指数设置为1.4，说明将这两个配送任务适合合并处理；反之，两个配送任务合并处理后发生的等待时间为1.5小时，单独处理发生的等待时间为45分钟，则可将配送时间指数设置为0.8，说明将这两个配送任务不适合进行合并处理。
在本实施例的一个可选实现方式中，如图5所示，所述步骤S102，即根据未分配配送任务的取送货地址与已分配给所述配送资源但未配送的配送任务的取送货地址之间的互斥性，对所述初始配送指数进行修正，得到修正配送指数的步骤，包括步骤S501-S505：
在步骤S501中，获取所述未分配配送任务的第一取货地址、第一送货地址和第一预计取货时间；
在步骤S502中，获取已分配给所述配送资源但未配送的配送任务的第二取货地址、第二送货地址和第二预计取货时间；
在步骤S503中，确定所述第一取货地址所在区域与第二取货地址所在区域之间的第一互斥指数、第一送货地址所在区域与第二送货地址所在区域之间的第二互斥指数、第一取货地址所在区域与第二送货地址所在区域之间的第三互斥指数，以及第一送货地址所在区域与第二取货地址所在区域之间的第四互斥指数；
在步骤S504中，根据第一互斥指数、第二互斥指数、第三互斥指数、第四互斥指数以及所述第一预计取货时间和所述第二预计取货时间计算得到所述未分配配送任务与已分配给所述配送资源但未配送的配送任务之间的互斥指数；
在步骤S505中，根据所述互斥指数对于所述初始配送指数进行修正，得到修正配送指数。
在该实施方式中，根据取送货地址之间的互斥性以及配送任务的取送货时间来得到未分配配送任务与已分配给所述配送资源但未配送的配送任务之间的互斥指数。具体地：
若所述第一预计取货时间晚于第二预计取货时间且两者之差小于配送资源从第二取货地址经第二送货地址再到第一取货地址预计所花费的时间总和，或者所述第一预计取货时间早于第二预计取货时间且两者之差小于配送资源从第一取货地址经第一送货地址再到第二取货地址预计所花费的时间总和，则根据所述第一互斥指数和第二互斥指数来计算所述互斥指数，比如可对于所述第一互斥指数和第二互斥指数进行加权求和来得到所述互斥指数。
若所述第一预计取货时间晚于第二预计取货时间且两者之差大于配送资源从第二取货地址经第二送货地址再到第一取货地址预计所花费的时间总和，则根据所述第三互斥指数来计算所述互斥指数，比如可将所述第三互斥指数作为所述互斥指数。
若所述第一预计取货时间早于第二预计取货时间且两者之差大于配送资源从第一取货地址经第一送货地址再到第二取货地址预计所花费的时间总和，则根据所述第四互斥指数来计算所述互斥指数，比如可将所述第四互斥指数作为所述互斥指数。
对于所述步骤S505，若将配送距离指数表示为f dist(x1，x2)，将配送时间指数表示为f time(x1，x2)，其中，x1，x2分别表示未分配配送任务和已分配给所述配送资源但未配送的配送任务，那么经互斥指数修正后得到的修正配送指数Score (x1，x2)可以表示为：
Score (x1，x2)
＝f dist(x1，x2)*w dist+f time(x1，x2)*w time
+f mutex(x1，x2)*w mutex
其中，f mutex(x1，x2)表示互斥指数，w dist、w time和w mutex分别表示配送距离指数、配送时间指数和互斥指数对应的权重值，所述权重值可根据实际应用的需要或者根据先验知识获得。
在本实施例的一个可选实现方式中，如图6所示，所述步骤S503， 即确定所述第一取货地址所在区域与第二取货地址所在区域之间的第一互斥指数、第一送货地址所在区域与第二送货地址所在区域之间的第二互斥指数、第一取货地址所在区域与第二送货地址所在区域之间的第三互斥指数，以及第一送货地址所在区域与第二取货地址所在区域之间的第四互斥指数的步骤，包括步骤S601-S602：
在步骤S601中，确定所述第一取货地址、第二取货地址、第一送货地址以及第二送货地址所在的区域；
在步骤S602中，根据不同区域的互斥性确定所述第一互斥指数、第二互斥指数、第三互斥指数和第四互斥指数。
在该实施方式中，所述互斥指数可根据上文提到的互斥性定义进行设置，具体的设置方法可根据实际应用的需要进行选择，可根据先验知识获得，也可以根据历史配送数据通过归一化方法获得，比如，对于合并处理的两个区域，将所花费的历史配送成本均值对应的互斥指数参考值设为1，则将配送成本高于历史配送成本均值的两个区域之间的互斥指数设置为小于1，说明这两个区域不适合合并处理，将配送成本低于历史配送成本均值的两个区域之间的互斥指数设置为大于1，说明这两个区域适合合并处理。
在本实施例的一个可选实现方式中，如图7所示，所述步骤S601，即确定所述第一取货地址、第二取货地址、第一送货地址以及第二送货地址所在的区域的步骤，包括步骤S701-S702：
在步骤S701中，获取所述第一取货地址、第二取货地址、第一送货地址以及第二送货地址的预设地址关键词；
在步骤S702中，根据所述预设地址关键词确定所述第一取货地址、第二取货地址、第一送货地址以及第二送货地址所在的区域。
其中，所述预设地址关键词可包括省、市、区/县、街道、街道编号、楼宇/小区名称等信息。
在本实施例的另一个可选实现方式中，如图8所示，所述步骤S601，即确定所述第一取货地址、第二取货地址、第一送货地址以及第二送货地址所在的区域的步骤，包括步骤S801-S802：
在步骤S801中，获取所述第一取货地址、第二取货地址、第一送货地址以及第二送货地址的地理位置信息；
在步骤S802中，根据所述地理位置信息确定所述第一取货地址、第二取货地址、第一送货地址以及第二送货地址所在的区域。
其中，所述地理位置信息可通过现有定位手段来获取，所述地理位置信息可以为地理坐标值，也可以为经纬度以及其他能够标识某一地址的地理位置的数据。
在本实施例的另一个可选实现方式中，如图9所示，所述步骤S601，即确定所述第一取货地址、第二取货地址、第一送货地址以及第二送货地址所在的区域的步骤，包括步骤S901-S904：
在步骤S901中，判断能否获取所述第一取货地址、第二取货地址、第一送货地址以及第二送货地址的预设地址关键词；
在步骤S902中，在成功获取所述预设地址关键词时，根据所述地址关键词确定所述第一取货地址、第二取货地址、第一送货地址以及第二送货地址所在的区域；
在步骤S903中，在获取所述预设地址关键词失败时，获取所述第一取货地址、第二取货地址、第一送货地址以及第二送货地址的地理位置信息；
在步骤S904中，根据所述地理位置信息确定所述第一取货地址、第二取货地址、第一送货地址以及第二送货地址所在的区域。
在该实施方式中，首先使用地址关键词方法确定某一地址所在的区域，若该方法失败，再使用地理位置信息方法确定该地址所在的区域。
上述实施方式在实施前，可根据先验知识建立一个存储有区域地址信息和/或区域位置信息的数据库，其中，所述区域可按照行政区域划分，也可按照商圈划分，或者按照楼宇/小区划分，所述区域对应的数据中存储有该区域内的地址信息或地理位置信息以及所隶属的更高级的地理信息。比如，如果以一个写字楼作为一个区域划分，那么所述数据库中不仅包括该区域的名称、该区域的位置信息，还包括该区域所属街道、区/县、市、省等更高级的名称地理位置信息，所述数据库还可以包括沿 一区域外围所形成的区域边框。这样在根据地址关键词或地理位置信息确定某一地址所在的区域时，就可根据所述地址的各级名称、地理信息，在数据库中进行分级分层的检索和查找，以减少检索工作量，提高检索效率。
另外，所述数据库中还可存储与每个区域相对应的与其他区域之间的互斥性数据，这样在确定某一地址所在区域的同时还可得到该区域的互斥性数据，更加节省时间、提高效率。
在本实施例的另一个可选实现方式中，如图10所示，所述步骤S103，即在修正配送指数高于预设配送阈值时，将所述未分配配送任务分配给所述配送资源的步骤，包括步骤S1001-S1002：
在步骤S1001中，确定所述配送资源的配送压力指数；
在步骤S1002中，在所述修正配送指数高于预设配送阈值且所述配送资源的配送压力指数低于预设压力阈值时，将所述未分配配送任务分配给所述配送资源。
其中，所述配送压力指数可包括配送距离压力指数、配送任务压力指数、配送时间压力指数等等，比如，若配送资源距离未分配配送任务取货地址之间的距离过远，则配送距离压力指数较高；若已分配给配送资源的配送任务数量较多，则配送任务压力指数较高；若配送资源的可用时间比较紧张，则配送时间压力指数较高。只有当修正配送指数高于预设配送阈值且配送资源的配送压力指数低于预设压力阈值时，也就是当未分配配送任务适合分配给该配送资源，而且该配送资源也有充足的能力接受该任务时，才将所述未分配配送任务分配给该配送资源。
下述为本公开装置实施例，可以用于执行本公开方法实施例。
图11示出根据本公开一实施方式的配送任务分配装置的结构框图，该装置可以通过软件、硬件或者两者的结合实现成为电子设备的部分或者全部。如图11所示，所述配送任务分配装置包括：
确定模块1101，被配置为确定配送资源对于未分配配送任务的初始配送指数；
修正模块1102，被配置为根据所述未分配配送任务的取送货地址与 已分配给所述配送资源但未配送的配送任务的取送货地址之间的互斥性，对所述初始配送指数进行修正，得到修正配送指数，其中，所述互斥性用于表征所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务适合被合并处理的程度；
分配模块1103，被配置为在所述修正配送指数高于预设配送阈值时，将所述未分配配送任务分配给所述配送资源。
目前在分配配送任务时，为了提高任务配送的效率，通常基于配送资源需行进的距离和所需花费的时间来决定是否将一配送任务分配给一个配送资源，或者是否将该配送任务与已分配给该配送资源的其他配送任务或者配送任务组进行合并处理。比如，当未分配配送任务的送货地址与已分配给配送资源但还未配送的一个配送任务的送货地址之间的距离比较近时，按照常规处理方式有可能会被合并处理，也就是将所述未分配配送任务分配给该配送资源，但在实际应用中，若送货地址中的其中一个属于一个存在很多限制的区域，比如一个只能步行进入的小区，而且这个小区的入口与另一个合并处理的配送任务的送货地址相距较远，在这种情况下，若将配送任务合并处理，未必是一个最优的分配结果。
考虑到上述缺陷，在该实施方式中，提出一种配送任务分配装置，该装置通过确定模块1101按照常规方法根据距离因素和时间因素确定配送资源对于未分配配送任务的初始配送指数；通过修正模块1102根据所述未分配配送任务的取送货地址与已分配给所述配送资源但未配送的配送任务的取送货地址之间的互斥性，对所述初始配送指数进行修正，得到修正配送指数；在所述修正配送指数高于预设配送阈值时，分配模块1103将所述未分配配送任务分配给所述配送资源。该实施方式综合考虑距离因素、时间因素以及取送货地址之间的互斥因素来决定是否将一配送任务分配给一配送资源，以达到配送任务分配处理或者合并配送处理的最优化，从而达到充分利用配送资源的可用时间，提高配送资源的调度效率，进而提升服务质量，增强用户体验的技术效果。
在本实施例的一个可选实现方式中，如图12所示，所述确定模块 1101包括：
第一计算子模块1201，被配置为计算所述未分配配送任务与已分配给所述配送资源但未配送的配送任务合并处理的配送距离指数；
第二计算子模块1202，被配置为计算所述未分配配送任务与已分配给所述配送资源但未配送的配送任务合并处理的配送时间指数；
加法子模块1203，被配置为将所述配送距离指数和配送时间指数进行加权相加，得到所述初始配送指数。
在本实施例的一个可选实现方式中，如图13所示，所述第一计算子模块1201包括：
第一获取单元1301，被配置为获取所述未分配配送任务的第一取货地址和第一送货地址；
第二获取单元1302，被配置为获取已分配给所述配送资源但未配送的配送任务的第二取货地址和第二送货地址；
第一确定单元1303，被配置为根据所述第一取货地址与第一送货地址之间的距离、第二取货地址与第二送货地址之间的距离、第一取货地址与第二取货地址之间的距离、第一送货地址与第二送货地址之间的距离确定所述配送距离指数。
在该实施方式中，根据未分配配送任务的取送货地址与已分配给所述配送资源但未配送的配送任务的取送货地址之间的关系来确定所述配送距离指数。
在本实施例的一个可选实现方式中，如图14所示，所述第二计算子模块1202包括：
第三获取单元1401，被配置为获取所述未分配配送任务的第一取货地址和第一送货地址；
第四获取单元1402，被配置为获取已分配给所述配送资源但未配送的配送任务的第二取货地址和第二送货地址；
第二确定单元1403，被配置为确定所述配送资源在第一取货地址和第二取货地址处的第一取货等待时间和第二取货等待时间以及所述配送资源在第一送货地址和第二送货地址处的第一送货等待时间和第二 送货等待时间；
第三确定单元1404，被配置为根据所述第一送货等待时间和所述第二送货等待时间确定所述配送时间指数。
在该实施方式中，根据在多个地址的等待时间确定所述配送时间指数。
在本实施例的一个可选实现方式中，如图15所示，所述修正模块1102包括：
第一获取子模块1501，被配置为获取所述未分配配送任务的第一取货地址、第一送货地址和第一预计取货时间；
第二获取子模块1502，被配置为获取已分配给所述配送资源但未配送的配送任务的第二取货地址、第二送货地址和第二预计取货时间；
第一确定子模块1503，被配置为确定所述第一取货地址所在区域与第二取货地址所在区域之间的第一互斥指数、第一送货地址所在区域与第二送货地址所在区域之间的第二互斥指数、第一取货地址所在区域与第二送货地址所在区域之间的第三互斥指数，以及第一送货地址所在区域与第二取货地址所在区域之间的第四互斥指数；
计算子模块1504，被配置为根据第一互斥指数、第二互斥指数、第三互斥指数、第四互斥指数以及所述第一预计取货时间和所述第二预计取货时间计算得到所述未分配配送任务与已分配给所述配送资源但未配送的配送任务之间的互斥指数；
修正子模块1505，被配置为根据所述互斥指数对于所述初始配送指数进行修正，得到修正配送指数。
在该实施方式中，根据取送货地址之间的互斥性以及配送任务的取送货时间来得到未分配配送任务与已分配给所述配送资源但未配送的配送任务之间的互斥指数。
在本实施例的一个可选实现方式中，如图16所示，所述第一确定子模块1503包括：
第四确定单元1601，被配置为确定所述第一取货地址、第二取货地址、第一送货地址以及第二送货地址所在的区域；
第五确定单元1602，被配置为根据不同区域的互斥性确定所述第一互斥指数、第二互斥指数、第三互斥指数和第四互斥指数。
在本实施例的一个可选实现方式中，如图17所示，所述第四确定单元1601包括：
第一获取子单元1701，被配置为获取所述第一取货地址、第二取货地址、第一送货地址以及第二送货地址的预设地址关键词；
第一确定子单元1702，被配置为根据所述预设地址关键词确定所述第一取货地址、第二取货地址、第一送货地址以及第二送货地址所在的区域。
其中，所述预设地址关键词可包括省、市、区/县、街道、街道编号、楼宇/小区名称等信息。
在本实施例的另一个可选实现方式中，如图18所示，所述第四确定单元1601包括：
第二获取子单元1801，被配置为获取所述第一取货地址、第二取货地址、第一送货地址以及第二送货地址的地理位置信息；
第二确定子单元1802，被配置为根据所述地理位置信息确定所述第一取货地址、第二取货地址、第一送货地址以及第二送货地址所在的区域。
其中，所述地理位置信息可通过现有定位手段来获取，所述地理位置信息可以为地理坐标值，也可以为经纬度以及其他能够标识某一地址的地理位置的数据。
在本实施例的另一个可选实现方式中，如图19所示，所述第四确定单元1601包括：
判断子单元1901，被配置为判断能否获取所述第一取货地址、第二取货地址、第一送货地址以及第二送货地址的预设地址关键词；
第三确定子单元1902，被配置为在成功获取所述预设地址关键词时，根据所述地址关键词确定所述第一取货地址、第二取货地址、第一送货地址以及第二送货地址所在的区域；
第三获取子单元1903，被配置为在获取所述预设地址关键词失败时， 获取所述第一取货地址、第二取货地址、第一送货地址以及第二送货地址的地理位置信息；
第四确定子单元1904，被配置为根据所述地理位置信息确定所述第一取货地址、第二取货地址、第一送货地址以及第二送货地址所在的区域。
在该实施方式中，首先使用地址关键词方法确定某一地址所在的区域，若该方法失败，再使用地理位置信息方法确定该地址所在的区域。
在本实施例的另一个可选实现方式中，如图20所示，所述分配模块1103包括：
第二确定子模块2001，被配置为确定所述配送资源的配送压力指数；
分配子模块2002，被配置为在所述修正配送指数高于预设配送阈值且所述配送资源的配送压力指数低于预设压力阈值时，将所述未分配配送任务分配给所述配送资源。
应当理解，图11-图20中记载的诸模块、子模块、单元或子单元与参考图1-图10描述的方法中的各个步骤相对应。由此，上文针对方法描述的操作和特征同样适用于图11-图20中的装置及其中包含的模块、子模块、单元或子单元，在此不再赘述。
本公开还公开了一种电子设备，图21示出根据本公开一实施方式的电子设备的结构框图，如图21所示，所述电子设备2100包括存储器2101和处理器2102；其中，
所述存储器2101用于存储一条或多条计算机指令，其中，所述一条或多条计算机指令被所述处理器2102执行以实现上述任一方法步骤。
图22适于用来实现根据本公开实施方式的配送任务分配方法的计算机系统的结构示意图。
如图22所示，计算机系统2200包括中央处理单元(CPU)2201，其可以根据存储在只读存储器(ROM)2202中的程序或者从存储部分2208加载到随机访问存储器(RAM)2203中的程序而执行上述图1-10所示的实施方式中的各种处理。在RAM2203中，还存储有系统2200操作所需的各种程序和数据。CPU2201、ROM2202以及RAM2203通过总 线2204彼此相连。输入/输出(I/O)接口2205也连接至总线2204。
以下部件连接至I/O接口2205：包括键盘、鼠标等的输入部分2206；包括诸如阴极射线管(CRT)、液晶显示器(LCD)等以及扬声器等的输出部分2207；包括硬盘等的存储部分2208；以及包括诸如LAN卡、调制解调器等的网络接口卡的通信部分2209。通信部分2209经由诸如因特网的网络执行通信处理。驱动器2210也根据需要连接至I/O接口2205。可拆卸介质2211，诸如磁盘、光盘、磁光盘、半导体存储器等等，根据需要安装在驱动器2210上，以便于从其上读出的计算机程序根据需要被安装入存储部分2208。
特别地，根据本公开的实施方式，上文参考图1-10描述的方法可以被实现为计算机软件程序。例如，本公开的实施方式包括一种计算机程序产品，其包括有形地包含在及其可读介质上的计算机程序，所述计算机程序包含用于执行图1-10的配送任务分配方法的程序代码。在这样的实施方式中，该计算机程序可以通过通信部分2209从网络上被下载和安装，和/或从可拆卸介质2211被安装。
附图中的流程图和框图，图示了按照本公开各种实施方式的系统、方法和计算机程序产品的可能实现的体系架构、功能和操作。在这点上，路程图或框图中的每个方框可以代表一个模块、程序段或代码的一部分，所述模块、程序段或代码的一部分包含一个或多个用于实现规定的逻辑功能的可执行指令。也应当注意，在有些作为替换的实现中，方框中所标注的功能也可以以不同于附图中所标注的顺序发生。例如，接连地表示的方框实际上可以基本并行地执行，它们有时也可以按相反的顺序执行，这依所涉及的功能而定。也要注意的是，框图和/或流程图中的每个方框、以及框图和/或流程图中的方框的组合，可以用执行规定的功能或操作的专用的基于硬件的系统来实现，或者可以用专用硬件与计算机指令的组合来实现。
描述于本公开实施方式中所涉及到的单元或模块可以通过软件的方式实现，也可以通过硬件的方式来实现。所描述的单元或模块也可以设置在处理器中，这些单元或模块的名称在某种情况下并不构成对该单 元或模块本身的限定。
作为另一方面，本公开还提供了一种计算机可读存储介质，该计算机可读存储介质可以是上述实施方式中所述装置中所包含的计算机可读存储介质；也可以是单独存在，未装配入设备中的计算机可读存储介质。计算机可读存储介质存储有一个或者一个以上程序，所述程序被一个或者一个以上的处理器用来执行描述于本公开的方法。
以上描述仅为本公开的较佳实施例以及对所运用技术原理的说明。本领域技术人员应当理解，本公开中所涉及的发明范围，并不限于上述技术特征的特定组合而成的技术方案，同时也应涵盖在不脱离所述发明构思的情况下，由上述技术特征或其等同特征进行任意组合而形成的其它技术方案。例如上述特征与本公开中公开的(但不限于)具有类似功能的技术特征进行互相替换而形成的技术方案。

Claims (22)

  1. 一种配送任务分配方法，包括：
    确定配送资源对于未分配配送任务的初始配送指数；
    根据所述未分配配送任务的取送货地址与已分配给所述配送资源但未配送的配送任务的取送货地址之间的互斥性，对所述初始配送指数进行修正，得到修正配送指数，其中，所述互斥性用于表征所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务适合被合并处理的程度；
    若所述修正配送指数高于预设配送阈值，将所述未分配配送任务分配给所述配送资源。
  2. 根据权利要求1所述的配送任务分配方法，所述确定配送资源对于未分配配送任务的初始配送指数，包括：
    计算所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务合并处理的配送距离指数；
    计算所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务合并处理的配送时间指数；
    将所述配送距离指数和所述配送时间指数进行加权相加，得到所述初始配送指数。
  3. 根据权利要求2所述的配送任务分配方法，其中，所述计算所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务合并处理的配送距离指数，包括：
    获取所述未分配配送任务的第一取货地址和第一送货地址；
    获取所述已分配给所述配送资源但未配送的配送任务的第二取货地址和第二送货地址；
    根据所述第一取货地址与所述第一送货地址之间的距离、所述第二取货地址与所述第二送货地址之间的距离、所述第一取货地址与所述第二取货地址之间的距离、所述第一送货地址与所述第二送货地址之间的距离确定所述配送距离指数。
  4. 根据权利要求2所述的配送任务分配方法，其中，所述计算所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务合并处理的配送时间指数，包括：
    获取所述未分配配送任务的第一取货地址和第一送货地址；
    获取所述已分配给所述配送资源但未配送的配送任务的第二取货地址和第二送货地址；
    确定所述配送资源在所述第一取货地址处的第一取货等待时间和所述第二取货地址处的第二取货等待时间以及所述配送资源在所述第一送货地址处的第一送货等待时间和所述第二送货地址处的第二送货等待时间；
    根据所述第一送货等待时间和所述第二送货等待时间确定所述配送时间指数。
  5. 根据权利要求1所述的配送任务分配方法，其中，所述根据未分配配送任务的取送货地址与已分配给所述配送资源但未配送的配送任务的取送货地址之间的互斥性，对所述初始配送指数进行修正，得到修正配送指数，包括：
    获取所述未分配配送任务的第一取货地址、第一送货地址和第一预计取货时间；
    获取所述已分配给所述配送资源但未配送的配送任务的第二取货地址、第二送货地址和第二预计取货时间；
    确定所述第一取货地址所在区域与所述第二取货地址所在区域之间的第一互斥指数、所述第一送货地址所在区域与所述第二送货地址所在区域之间的第二互斥指数、所述第一取货地址所在区域与所述第二送货地址所在区域之间的第三互斥指数，以及所述第一送货地址所在区域与所述第二取货地址所在区域之间的第四互斥指数；
    根据所述第一互斥指数、所述第二互斥指数、所述第三互斥指数、所述第四互斥指数以及所述第一预计取货时间和所述第二预计取货时间计算得到所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务之间的互斥指数；
    根据所述互斥指数对于所述初始配送指数进行修正，得到修正配送指数。
  6. 根据权利要求5所述的配送任务分配方法，其中，所述确定所述第一取货地址所在区域与所述第二取货地址所在区域之间的第一互斥指数、所述第一送货地址所在区域与所述第二送货地址所在区域之间的第二互斥指数、所述第一取货地址所在区域与所述第二送货地址所在区域之间的第三互斥指数，以及所述第一送货地址所在区域与所述第二取货地址所在区域之间的第四互斥指数，包括：
    确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域；
    根据不同区域的互斥性确定所述第一互斥指数、所述第二互斥指数、所述第三互斥指数和所述第四互斥指数。
  7. 根据权利要求6所述的配送任务分配方法，其中，所述确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域，包括：
    获取所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址的预设地址关键词；
    根据所述预设地址关键词确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域。
  8. 根据权利要求6所述的配送任务分配方法，其中，所述确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域，包括：
    获取所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址的地理位置信息；
    根据所述地理位置信息确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域。
  9. 根据权利要求6所述的配送任务分配方法，其中，所述确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域，包括：
    判断能否获取所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址的预设地址关键词；
    若成功获取所述预设地址关键词，根据所述地址关键词确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域；
    若获取所述预设地址关键词失败，获取所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址的地理位置信息；
    根据所述地理位置信息确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域。
  10. 根据权利要求1所述的配送任务分配方法，其中，所述若修正配送指数高于预设配送阈值，将所述未分配配送任务分配给所述配送资源，包括：
    确定所述配送资源的配送压力指数；
    若所述修正配送指数高于预设配送阈值且所述配送资源的配送压力指数低于预设压力阈值，将所述未分配配送任务分配给所述配送资源。
  11. 一种配送任务分配装置，包括：
    确定模块，被配置为确定配送资源对于未分配配送任务的初始配送指数；
    修正模块，根据所述未分配配送任务的取送货地址与已分配给所述配送资源但未配送的配送任务的取送货地址之间的互斥性，对所述初始配送指数进行修正，得到修正配送指数，其中，所述互斥性用于表征所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务适合被合并处理的程度；
    分配模块，被配置为若所述修正配送指数高于预设配送阈值，将所述未分配配送任务分配给所述配送资源。
  12. 根据权利要求11所述的配送任务分配装置，其中，所述确定模块包括：
    第一计算子模块，被配置为计算所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务合并处理的配送距离指数；
    第二计算子模块，被配置为计算所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务合并处理的配送时间指数；
    加法子模块，被配置为将所述配送距离指数和所述配送时间指数进行加权相加，得到所述初始配送指数。
  13. 根据权利要求12所述的配送任务分配装置，其中，所述第一计算子模块包括：
    第一获取单元，被配置为获取所述未分配配送任务的第一取货地址和第一送货地址；
    第二获取单元，被配置为获取所述已分配给所述配送资源但未配送的配送任务的第二取货地址和第二送货地址；
    第一确定单元，被配置为根据所述第一取货地址与所述第一送货地址之间的距离、所述第二取货地址与所述第二送货地址之间的距离、所述第一取货地址与所述第二取货地址之间的距离、所述第一送货地址与所述第二送货地址之间的距离确定所述配送距离指数。
  14. 根据权利要求12所述的配送任务分配装置，其中，所述第二计算子模块包括：
    第三获取单元，被配置为获取所述未分配配送任务的第一取货地址和第一送货地址；
    第四获取单元，被配置为获取所述已分配给所述配送资源但未配送的配送任务的第二取货地址和第二送货地址；
    第二确定单元，被配置为确定所述配送资源在所述第一取货地址处的第一取货等待时间和所述第二取货地址处的第二取货等待时间以及所述配送资源在所述第一送货地址处的第一送货等待时间和所述第二送货地址处的第二送货等待时间；
    第三确定单元，被配置为根据所述第一送货等待时间和所述第二送货等待时间确定所述配送时间指数。
  15. 根据权利要求11所述的配送任务分配装置，其中，所述修正模块包括：
    第一获取子模块，被配置为获取所述未分配配送任务的第一取货地 址、第一送货地址和第一预计取货时间；
    第二获取子模块，被配置为获取所述已分配给所述配送资源但未配送的配送任务的第二取货地址、第二送货地址和第二预计取货时间；
    第一确定子模块，被配置为确定所述第一取货地址所在区域与所述第二取货地址所在区域之间的第一互斥指数、所述第一送货地址所在区域与所述第二送货地址所在区域之间的第二互斥指数、所述第一取货地址所在区域与所述第二送货地址所在区域之间的第三互斥指数，以及所述第一送货地址所在区域与所述第二取货地址所在区域之间的第四互斥指数；
    计算子模块，被配置为根据所述第一互斥指数、所述第二互斥指数、所述第三互斥指数、所述第四互斥指数以及所述第一预计取货时间和所述第二预计取货时间计算得到所述未分配配送任务与所述已分配给所述配送资源但未配送的配送任务之间的互斥指数；
    修正子模块，被配置为根据所述互斥指数对于所述初始配送指数进行修正，得到修正配送指数。
  16. 根据权利要求15所述的配送任务分配装置，其中，所述确定子模块包括：
    第四确定单元，被配置为确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域；
    第五确定单元，被配置为根据不同区域的互斥性确定所述第一互斥指数、所述第二互斥指数、所述第三互斥指数和所述第四互斥指数。
  17. 根据权利要求16所述的配送任务分配装置，其中，所述第四确定单元包括：
    第一获取子单元，被配置为获取所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址的预设地址关键词；
    第一确定子单元，被配置为根据所述预设地址关键词确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域。
  18. 根据权利要求16所述的配送任务分配装置，其中，所述第四 确定单元包括：
    第二获取子单元，被配置为获取所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址的地理位置信息；
    第二确定子单元，被配置为根据所述地理位置信息确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域。
  19. 根据权利要求16所述的配送任务分配装置，其中，所述第四确定单元包括：
    判断子单元，被配置为判断能否获取所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址的预设地址关键词；
    第三确定子单元，被配置为若成功获取所述预设地址关键词，根据所述地址关键词确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域；
    第三获取子单元，被配置为若获取所述预设地址关键词失败，获取所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址的地理位置信息；
    第四确定子单元，被配置为根据所述地理位置信息确定所述第一取货地址、所述第二取货地址、所述第一送货地址以及所述第二送货地址所在的区域。
  20. 根据权利要求11所述的配送任务分配装置，其中，所述分配模块包括：
    第二确定子模块，被配置为确定所述配送资源的配送压力指数；
    分配子模块，被配置为若所述修正配送指数高于预设配送阈值且所述配送资源的配送压力指数低于预设压力阈值，将所述未分配配送任务分配给所述配送资源。
  21. 一种电子设备，包括存储器和处理器；其中，
    所述存储器用于存储一条或多条计算机指令，其中，所述一条或多条计算机指令被所述处理器执行以实现权利要求1-10任一项所述的方法步骤。
  22. 一种计算机可读存储介质，其上存储有计算机指令，该计算机指令被处理器执行时实现权利要求1-10任一项所述的方法步骤。
PCT/CN2018/108868 2018-02-06 2018-09-29 配送任务分配方法、装置、电子设备及计算机存储介质 WO2019153761A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810117927.1 2018-02-06
CN201810117927.1A CN108335071B (zh) 2018-02-06 2018-02-06 配送任务分配方法、装置、电子设备及计算机存储介质

Publications (1)

Publication Number Publication Date
WO2019153761A1 true WO2019153761A1 (zh) 2019-08-15

Family

ID=62928437

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/108868 WO2019153761A1 (zh) 2018-02-06 2018-09-29 配送任务分配方法、装置、电子设备及计算机存储介质

Country Status (2)

Country Link
CN (1) CN108335071B (zh)
WO (1) WO2019153761A1 (zh)

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108335071B (zh) * 2018-02-06 2020-09-11 北京小度信息科技有限公司 配送任务分配方法、装置、电子设备及计算机存储介质
CN111308995B (zh) * 2018-11-27 2024-01-16 北京京东乾石科技有限公司 搬运机器人的调度方法、装置、介质及电子设备
CN111275231B (zh) * 2018-12-04 2023-12-08 北京京东乾石科技有限公司 任务分配方法、装置、系统和介质
CN109800997A (zh) * 2019-01-30 2019-05-24 拉扎斯网络科技（上海）有限公司 一种订单分配方法、装置、存储介质和电子设备
CN110163474A (zh) * 2019-04-12 2019-08-23 平安普惠企业管理有限公司 一种任务分配的方法及设备
CN110298774A (zh) * 2019-06-27 2019-10-01 上海瑞涯信息科技有限公司 一种用于量化教师授课负担指数的计算方法
CN110472769A (zh) * 2019-07-03 2019-11-19 天津五八到家科技有限公司 运输任务处理方法、装置及电子设备
CN110609733A (zh) * 2019-09-18 2019-12-24 拉扎斯网络科技（上海）有限公司 数据处理方法及装置、电子设备、可读存储介质
CN110705865A (zh) * 2019-09-27 2020-01-17 苏州达家迎信息技术有限公司 任务分配方法、装置、设备及存储介质
CN110659863B (zh) * 2019-10-08 2022-06-21 拉扎斯网络科技（上海）有限公司 对象监听方法、装置、电子设备及计算机可读存储介质
CN111260281A (zh) * 2020-01-13 2020-06-09 拉扎斯网络科技（上海）有限公司 任务处理方法、装置、电子设备及计算机可读存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012129166A1 (en) * 2011-03-21 2012-09-27 Amazon Technologies, Inc. Courier management
CN105719009A (zh) * 2015-07-24 2016-06-29 北京小度信息科技有限公司 配送任务的处理方法及装置
CN106447080A (zh) * 2016-08-31 2017-02-22 四川创物科技有限公司 订单分发方法、装置及订单处理系统
CN106952060A (zh) * 2016-08-04 2017-07-14 北京小度信息科技有限公司 物流调度方法及装置
CN108335071A (zh) * 2018-02-06 2018-07-27 北京小度信息科技有限公司 配送任务分配方法、装置、电子设备及计算机存储介质

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1257889A4 (en) * 1999-12-17 2010-07-14 Ochoa Optics Llc SYSTEM AND METHOD FOR CLIENTS TO CONTROL SELECTED PRODUCTS IN A WIDE RANGE OF PRODUCTS OFFERED BY MULTIPLE PARTICIPATING COMMER ANTS
CN105719010A (zh) * 2015-07-24 2016-06-29 北京小度信息科技有限公司 配送任务的处理方法及装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012129166A1 (en) * 2011-03-21 2012-09-27 Amazon Technologies, Inc. Courier management
CN105719009A (zh) * 2015-07-24 2016-06-29 北京小度信息科技有限公司 配送任务的处理方法及装置
CN106952060A (zh) * 2016-08-04 2017-07-14 北京小度信息科技有限公司 物流调度方法及装置
CN106447080A (zh) * 2016-08-31 2017-02-22 四川创物科技有限公司 订单分发方法、装置及订单处理系统
CN108335071A (zh) * 2018-02-06 2018-07-27 北京小度信息科技有限公司 配送任务分配方法、装置、电子设备及计算机存储介质

Also Published As

Publication number Publication date
CN108335071A (zh) 2018-07-27
CN108335071B (zh) 2020-09-11

Similar Documents

Publication Publication Date Title
WO2019153761A1 (zh) 配送任务分配方法、装置、电子设备及计算机存储介质
Tong et al. Dynamic pricing in spatial crowdsourcing: A matching-based approach
US10460411B2 (en) Real-time resource management for on-demand services
US10142255B1 (en) Allocating dynamic resources to service clusters
To et al. A server-assigned spatial crowdsourcing framework
CN110741402B (zh) 用于运力调度的系统和方法
US10567520B2 (en) Multi-user requests for service and optimizations thereof
CN110645983B (zh) 用于无人车的路径规划方法、装置和系统
WO2019037367A1 (zh) 配送任务处理方法、装置及电子设备
US10692028B2 (en) Optimal demand-based allocation
WO2019196561A1 (zh) 配送任务分配方法、装置、电子设备及计算机存储介质
WO2021147353A1 (zh) 订单调度
US11514796B2 (en) System and method for determining and recommending vehicle pick-up location
US20180238705A1 (en) System and methods for performing multivariate optimizations based on location data
WO2019205784A1 (zh) 配送任务分配方法、装置、电子设备及计算机存储介质
US20170059334A1 (en) Method and system for scheduling vehicles along routes in a transportation system
CN102567115A (zh) 基于云的系统中的信息技术资源分配和利用跟踪
US10972862B2 (en) Visitor insights based on hyper-locating places-of-interest
CN110769038A (zh) 服务器调度方法及装置、存储介质、电子设备
US20140358435A1 (en) Travel departure time determination using social media and regional event information
US20150356483A1 (en) Method and system for improving route assignment performance
Jie et al. Online task scheduling for edge computing based on repeated Stackelberg game
WO2018146622A1 (en) Dynamic selection of geo-based service options in a network system
US20170118286A1 (en) Non-transitory computer-readable storage medium, exclusive switching method and exclusive switching apparatus
US20190205796A1 (en) System and method for optimizing allocation of different categories of vehicles

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18905573

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18905573

Country of ref document: EP

Kind code of ref document: A1