WO2019037368A1 - Procédé et appareil de traitement de tâche de livraison, dispositif électronique et support d'informations pour ordinateur - Google Patents

Procédé et appareil de traitement de tâche de livraison, dispositif électronique et support d'informations pour ordinateur Download PDF

Info

Publication number
WO2019037368A1
WO2019037368A1 PCT/CN2017/118775 CN2017118775W WO2019037368A1 WO 2019037368 A1 WO2019037368 A1 WO 2019037368A1 CN 2017118775 W CN2017118775 W CN 2017118775W WO 2019037368 A1 WO2019037368 A1 WO 2019037368A1
Authority
WO
WIPO (PCT)
Prior art keywords
delivery
task
delivered
current
range
Prior art date
Application number
PCT/CN2017/118775
Other languages
English (en)
Chinese (zh)
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 WO2019037368A1 publication Critical patent/WO2019037368A1/fr

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/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
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group
    • 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

Definitions

  • the present disclosure relates to the field of computer technologies, and in particular, to a delivery task processing method, apparatus, electronic device, and computer storage medium.
  • O2O Online To Offline
  • a current logistics scheduling method is: for a logistics service provider, a plurality of distribution centers are preset in a city, and each distribution center corresponds to a certain coverage area, thereby, for any distribution center A
  • the delivery address that is, the order of the consignee's address within its coverage, will be dispatched to the distribution center A for distribution processing.
  • Embodiments of the present disclosure provide a delivery task processing method, apparatus, electronic device, and computer storage medium.
  • a delivery task processing method is provided in an embodiment of the present disclosure.
  • the delivery task processing method includes:
  • the task group to be delivered includes one or more tasks to be delivered; and the first task to be delivered is the most-distributed task group to be assigned to the current distributor
  • the task to be delivered is first delivered; the second task to be delivered is a task to be delivered that is finally delivered when the task group to be delivered is assigned to the current distributor;
  • determining whether to assign a task group to be delivered to the current distributor according to the delivery scope, the current location, the first to-be-delivered task, and the second to-be-delivered task includes:
  • determining, by the distribution range, the current location, the first to-be-delivered task, and the second to-be-delivered task, the current distribution weight of the current delivery including:
  • the distribution weight value of the current delivery person is set as the first delivery weight value
  • the delivery weight value of the current delivery person is set to the second delivery weight value; the second delivery weight value is greater than the first delivery weight. Weight value; and/or
  • the delivery weight value of the current delivery person is added to the predetermined return weight value.
  • the current delivery scope of the distributor includes The first delivery range and the second delivery range are defined, and the second delivery range is a distribution range in which the first delivery range is expanded according to the delivery capability of the current delivery.
  • the delivery weight value of the current delivery person is determined according to the delivery scope, the current location, the first to-be-delivered task, and the second to-be-delivered task, and the distribution weight value of the current delivery person is set to be one of the following conditions: Minimum weight value:
  • the delivery address of the first to-be-delivered task is within the first delivery range, and the current location of the current delivery person and the delivery address of the second to-be-delivered task are all within the second delivery range;
  • the delivery address of the first to-be-delivered task is between the first delivery range and the second delivery range, and the delivery address of the second to-be-delivered task is outside the second delivery range;
  • the delivery address of the first to-be-delivered task is outside the second delivery range, and the current location of the current delivery is within the second delivery range;
  • the delivery address of the first to-be-delivered task and the current location of the current delivery are both outside the second delivery range, and the second distance is greater than the first distance or the third distance;
  • the first distance is the delivery address of the first task to be delivered
  • the distance between the first delivery range, the second distance is the distance between the delivery address of the second to-be-delivered task and the first delivery range, and the third distance is the distance between the current location of the current delivery person and the first delivery range .
  • the fifth aspect of the first aspect of the disclosure In an implementation manner, determining a distribution weight value of the current distributor according to the delivery scope, the current location, the first to-be-delivered task, and the second to-be-delivered task, including, according to the current condition, the current location and the first waiting
  • the distance between the delivery addresses of the delivery tasks increases the delivery weight value of the current delivery, otherwise the distribution weight of the current delivery is adjusted according to the fourth distance between the current location and the delivery address of the first to-be-delivered task:
  • the delivery address of the first to-be-delivered task and the current location of the current delivery are both between the first delivery range and the second delivery range, and the delivery address of the second delivery task is within the second delivery range, and the first distance is greater than the first a third distance;
  • the first distance is a distance between the first to-be-delivered task and the first delivery range, and the third distance is a distance between the current location of the current delivery person and the first delivery range;
  • the delivery address of the first to-be-delivered task and the current location of the current delivery are both outside the second delivery range, and the first distance is greater than the third distance.
  • the first implementation of the first aspect of the disclosure, the second implementation of the first aspect of the disclosure, and the third implementation of the first aspect of the disclosure, the sixth aspect of the first aspect of the disclosure In an implementation manner, determining a delivery weight value of the current delivery person according to the delivery scope, the current location, the first to-be-delivered task, and the second to-be-delivered task, including reducing the distribution weight of the current delivery person according to the second distance when one of the following conditions is met
  • the value, the second distance is the distance between the delivery address of the second task to be delivered and the first delivery range:
  • the delivery address of the first to-be-delivered task is within the first delivery range, the current location of the current delivery person is within the second delivery range, and the delivery address of the second to-be-delivered task is outside the second delivery range;
  • the delivery address of the first to-be-delivered task is within the first delivery range, the current location of the current delivery person is within the second delivery range, and the delivery address of the second to-be-delivered task is between the first delivery range and the second delivery range;
  • the delivery address of the first to-be-delivered task is between the first delivery range and the second delivery range, and the current location of the current delivery is within the first delivery range, and the delivery address of the second delivery task is within the second delivery range.
  • the seventh aspect of the first aspect of the disclosure In an implementation manner, determining, according to the delivery scope, the current location, the first to-be-delivered task, and the second to-be-delivered task, a distribution weight value of the current delivery, including when the one of the following conditions is met, according to the third distance and the second distance
  • the difference increases the distribution weight value of the current delivery person
  • the second distance is the distance between the delivery address of the second to-be-delivered task and the first delivery range
  • the third distance is between the current position of the current delivery person and the first delivery range the distance:
  • the delivery address of the first to-be-delivered task and the current location of the current delivery are both between the first delivery range and the second delivery range, and the delivery address of the second to-be-delivered task is outside the second delivery range;
  • the delivery address of the first to-be-delivered task is between the first delivery range and the second delivery range, and the current location of the current delivery person and the delivery address of the second delivery task are both outside the second delivery range, and the second distance is not Greater than the third distance;
  • the first to-be-delivered task and the current deliverer are both outside the second delivery range.
  • the first implementation of the first aspect of the disclosure, the second implementation of the first aspect of the disclosure, and the third implementation of the first aspect of the disclosure, the eighth aspect of the first aspect of the disclosure In the implementation manner, determining a distribution weight value of the current distributor according to the delivery scope, the current location, the first to-be-delivered task, and the second to-be-delivered task, including when the one of the following conditions is met, according to the second distance, the fourth distance, and the fifth The ratio of the sum of the distances to the third distance adjusts the distribution weight value of the current delivery person; the second distance is the distance between the delivery address of the second to-be-delivered task and the first delivery range, and the third distance is the current position of the current delivery person The distance from the first delivery range, the fourth distance is the distance between the current location of the current delivery person and the delivery address of the first to-be-delivered task, and the fifth distance is the delivery address of the first to-be-delivered task and the second waiting The distance between the
  • the delivery address of the first to-be-delivered task is within the first delivery range, the current location of the current delivery person is between the first delivery range and the second delivery range, and the delivery address of the second to-be-delivered task is outside the second delivery range;
  • the delivery address of the first to-be-delivered task is between the first delivery range and the second delivery range, the current location of the current delivery person is outside the second delivery range, and the delivery address of the second delivery task is within the second delivery range;
  • the delivery address of the first to-be-delivered task and the current location of the current delivery are both outside the second delivery range.
  • an embodiment of the present disclosure provides a delivery task processing apparatus, including:
  • An acquisition module configured to obtain a delivery range and a current location of the current delivery person
  • a first determining module configured to determine a first to-be-delivered task and a second to-be-delivered task in the task group to be delivered;
  • the to-be-delivered task group includes one or more tasks to be delivered;
  • the first to-be-delivered task is a task to be delivered
  • the task to be delivered that is first distributed when the group is assigned to the current distributor;
  • the second task to be delivered is the task to be delivered that is finally delivered when the task group to be delivered is assigned to the current distributor;
  • the second determining module is configured to determine whether to assign the task group to be delivered to the current distributor according to the delivery scope, the current location, the first to-be-delivered task, and the second to-be-delivered task.
  • the second determining module includes:
  • a first determining submodule configured to determine a distribution weight value of the current distributor according to the delivery scope, the current location, the first to-be-delivered task, and the second to-be-delivered task;
  • the second determining submodule is configured to determine whether to assign the task group to be assigned to the current distributor according to the current distributor's delivery weight value and the predefined weight value.
  • the second determining module includes:
  • a first setting sub-module configured to set a delivery weight value of the current delivery person to a first delivery weight value when the delivery addresses of all the tasks to be delivered in the task group to be delivered are outside the delivery range of the current distributor;
  • a second setting sub-module configured to set a delivery weight value of the current delivery person to a second delivery weight value when the delivery address of any of the tasks to be delivered in the task group to be delivered is within the delivery range of the current delivery person;
  • the second delivery weight value is greater than the first delivery weight value;
  • the add-on module is configured to add the current distributor's delivery weight value to the scheduled return when the current distributor's current location is outside the delivery range, and the delivery address of any of the tasks to be delivered in the to-be-delivered task group is within the delivery range. Weights.
  • the current delivery scope of the distributor includes the pre- The first delivery range and the second delivery range are defined, and the second delivery range is a distribution range in which the first delivery range is expanded according to the delivery capability of the current delivery.
  • the second determining module includes:
  • the third setting sub-module is configured to set the delivery weight value of the current deliverer to the lowest weight value when one of the following conditions is met:
  • the delivery address of the first to-be-delivered task is within the first delivery range, and the current location of the current delivery person and the delivery address of the second to-be-delivered task are all within the second delivery range;
  • the delivery address of the first to-be-delivered task is between the first delivery range and the second delivery range, and the delivery address of the second to-be-delivered task is outside the second delivery range;
  • the delivery address of the first to-be-delivered task is outside the second delivery range, and the current location of the current delivery is within the second delivery range;
  • the delivery address of the first to-be-delivered task and the current location of the current delivery are both outside the second delivery range, and the second distance is greater than the first distance or the third distance;
  • the first distance is the delivery address of the first task to be delivered
  • the distance between the first delivery range, the second distance is the distance between the delivery address of the second to-be-delivered task and the first delivery range, and the third distance is the distance between the current location of the current delivery person and the first delivery range .
  • the second determining module includes:
  • a fourth setting submodule configured to be configured to increase a distribution weight of the current distributor according to a distance between a current location of the current distributor and a delivery address of the first to-be-delivered task when one of the following conditions is met, otherwise
  • the fourth distance between the current location and the delivery address of the first to-be-delivered task adjusts the distribution weight of the current distributor:
  • the delivery address of the first to-be-delivered task and the current location of the current delivery are both between the first delivery range and the second delivery range, and the delivery address of the second delivery task is within the second delivery range, and the first distance is greater than the first a third distance;
  • the first distance is a distance between the first to-be-delivered task and the first delivery range, and the third distance is a distance between the current location of the current delivery person and the first delivery range;
  • the delivery address of the first to-be-delivered task and the current location of the current delivery are both outside the second delivery range, and the first distance is greater than the third distance.
  • the second determining module includes:
  • a fifth setting submodule configured to reduce a distribution weight value of the current delivery person according to the second distance when one of the following conditions is met, where the second distance is a distance between the delivery address of the second to-be-delivered task and the first delivery range :
  • the delivery address of the first to-be-delivered task is within the first delivery range, the current location of the current delivery person is within the second delivery range, and the delivery address of the second to-be-delivered task is outside the second delivery range;
  • the delivery address of the first to-be-delivered task is within the first delivery range, the current location of the current delivery person is within the second delivery range, and the delivery address of the second to-be-delivered task is between the first delivery range and the second delivery range;
  • the delivery address of the first to-be-delivered task is between the first delivery range and the second delivery range, and the current location of the current delivery is within the first delivery range, and the delivery address of the second delivery task is within the second delivery range.
  • the second determining module includes:
  • a sixth setting submodule configured to increase a distribution weight value of the current distributor according to a difference between the third distance and the second distance when the one of the following conditions is met, where the second distance is a delivery address of the second task to be delivered The distance from the first delivery range, the third distance being the distance between the current location of the current distributor and the first delivery range:
  • the delivery address of the first to-be-delivered task and the current location of the current delivery are both between the first delivery range and the second delivery range, and the delivery address of the second to-be-delivered task is outside the second delivery range;
  • the delivery address of the first to-be-delivered task is between the first delivery range and the second delivery range, and the current location of the current delivery person and the delivery address of the second delivery task are both outside the second delivery range, and the second distance is not Greater than the third distance;
  • the first to-be-delivered task and the current deliverer are both outside the second delivery range.
  • the second determining module includes:
  • a seventh setting submodule configured to adjust a distribution weight value of the current distributor according to a ratio of a sum of the second distance, the fourth distance, and the fifth distance to the third distance when one of the following conditions is met;
  • the second distance is The distance between the delivery address of the second delivery task and the first delivery range
  • the third distance is the distance between the current location of the current delivery and the first delivery range
  • the fourth distance is the current location of the current delivery and the first
  • the fifth distance is the distance between the delivery address of the first task to be delivered and the delivery address of the second task to be delivered:
  • the delivery address of the first to-be-delivered task is within the first delivery range, the current location of the current delivery person is between the first delivery range and the second delivery range, and the delivery address of the second to-be-delivered task is outside the second delivery range;
  • the delivery address of the first to-be-delivered task is between the first delivery range and the second delivery range, the current location of the current delivery person is outside the second delivery range, and the delivery address of the second delivery task is within the second delivery range;
  • the delivery address of the first to-be-delivered task and the current location of the current delivery are both outside the second delivery range.
  • the functions can be implemented in hardware or in hardware by executing the corresponding software.
  • the hardware or software includes one or more modules corresponding to the functions described above.
  • the structure of the delivery task processing device includes a memory and a processor for storing one or more computer instructions supporting the delivery task device to perform the delivery task method of the above first aspect, the processor being configured to Used to execute computer instructions stored in memory.
  • the delivery task device can also include a communication interface for the delivery task device to communicate with other devices or communication networks.
  • an embodiment of the present disclosure provides an electronic device including a memory and a processor; wherein the memory is configured to store one or more computer instructions, wherein the one or more computer instructions are executed by the processor to implement the first The method steps of the distribution task method in the aspect.
  • an embodiment of the present disclosure provides a computer readable storage medium, configured to store computer instructions used by a delivery task device, including a computer involved in performing the delivery task method in the first aspect as a delivery task device instruction.
  • the embodiment of the present disclosure determines the delivery scope, the current location, the first to-be-delivered task, and the second to-be-delivered task in the to-be-delivered task group, and determines the task to be delivered according to these factors. Which distributor is assigned to the group; the first to-be-delivered task in the task group to be delivered is the task to be delivered that is first delivered when the task group to be delivered is assigned to the distributor, and the second task to be delivered is the to-be-delivered task The task to be delivered that is finally delivered when the task group is assigned to the distributor.
  • the embodiment of the present disclosure may determine, by the delivery person when the delivery route of the task group to be delivered is delivered, which distribution agent is to be delivered, which may be applicable to the whole city scheduling manner, that is, the delivery address and the delivery address are not limited.
  • this method can more rationally allocate the task group to be distributed to the lesser cost by weighing the distance cost of the distributor on the delivery route.
  • the distributor can improve the distribution efficiency and save the distribution cost.
  • FIG. 1 illustrates a flow chart of a delivery task processing method in accordance with an embodiment of the present disclosure.
  • FIG. 2 shows a flowchart of step S103 in the delivery task processing method according to an embodiment of the present disclosure.
  • FIG. 3 illustrates a flowchart of step S103 in a delivery task processing method according to still another embodiment of the present disclosure.
  • FIG. 4 shows a flowchart of step S103 in the delivery task processing method according to still another embodiment of the present disclosure.
  • FIG. 5 shows a flowchart of step S103 in the delivery task processing method according to still another embodiment of the present disclosure.
  • FIG. 6 shows a flowchart of step S103 in the delivery task processing method according to still another embodiment of the present disclosure.
  • FIG. 7 shows a flowchart of step S103 in the delivery task processing method according to still another embodiment of the present disclosure.
  • FIG. 8 shows a flowchart of step S103 in the delivery task processing method according to still another embodiment of the present disclosure.
  • FIG. 9 is a block diagram showing the structure of a delivery task processing apparatus according to an embodiment of the present disclosure.
  • Fig. 10 is a block diagram showing the configuration of a second determination module 903 in the delivery task processing apparatus according to an embodiment of the present disclosure.
  • FIG. 11 is a block diagram showing the structure of a second determining module 903 in the delivery task processing apparatus according to still another embodiment of the present disclosure.
  • FIG. 12 is a block diagram of an electronic device suitable for implementing a delivery task processing method in accordance with an embodiment of the present disclosure.
  • an e-commerce operation platform such as a take-out order
  • an e-commerce operation platform usually requires the order taking address and the delivery address of the order to be in the same business district, and assigns the order to the corresponding distributor of the business circle, if the meal address and If the delivery address is not in the same business district, the user cannot place an order.
  • the method of dispatching the distributors in the whole city can better meet the needs of users.
  • the way of dispatching in the whole city is that there is no business circle restriction when the user places an order, which may easily lead to the meal address and the delivery address of each delivery order. Not in a business district, the distribution distance is far. Therefore, the order allocation method in the above prior art is not suitable for the whole city scheduling scenario.
  • the first task to be delivered in the task group to be delivered is the task to be delivered that is first delivered when the task group to be delivered is assigned to the supplier
  • the second task to be delivered is The task to be delivered that is finally delivered when the to-be-delivered task group is assigned to the dispatcher.
  • the embodiment of the present disclosure may determine, by the delivery person when the delivery route of the task group to be delivered is delivered, which distribution agent is to be delivered, which may be applicable to the whole city scheduling manner, that is, the delivery address and the delivery address are not limited.
  • this method can more appropriately allocate the task group to be distributed to the distribution cost by weighing the distance cost of the distributor on the delivery route.
  • the distributor can improve the distribution efficiency and save the distribution cost.
  • FIG. 1 illustrates a flow chart of a delivery task processing method in accordance with an embodiment of the present disclosure.
  • the delivery task processing method includes the following steps S101-S103:
  • step S101 obtaining a delivery scope and a current location of the current delivery person
  • step S102 determining a first to-be-delivered task and a second to-be-delivered task in the task group to be delivered;
  • the task group to be delivered includes one or more tasks to be delivered; and the first task to be delivered is to assign the task group to be delivered to
  • the task to be delivered is the first to be delivered when the current distributor is delivered;
  • the second task to be delivered is the task to be delivered that is finally delivered when the task group to be delivered is assigned to the current distributor;
  • step S103 it is determined whether to assign the task group to be delivered to the current distributor according to the delivery scope, the current location, the first to-be-delivered task, and the second to-be-delivered task.
  • each distributor has a corresponding delivery range, which is predefined.
  • the task group to be delivered is pre-determined according to the delivery address of the task to be delivered and the corresponding rule, and may include one or more tasks to be delivered, and the rules of grouping are not within the scope of the disclosure, and will not be described in detail herein.
  • the task to be delivered can be any task that needs to be delivered to the delivery address, such as a takeaway order, a courier, and the like.
  • a task to be delivered can be a meal picking task or a meal delivery task, which is also applicable to other similar tasks, such as errands, instant delivery, and the like.
  • a task group to be delivered may be assigned to a dispatcher, and after assigning the task group to be delivered to a dispatcher, according to the location information of the deliverer and the delivery of each task to be delivered in the task group to be delivered.
  • the information is planned to be the distribution route, that is, the order of the tasks to be delivered in the task group to be delivered, and the specific path planning method is not within the scope of the disclosure, and will not be described in detail herein.
  • the first to-be-delivered task is the first task to be delivered in the corresponding task group to be delivered
  • the second to-be-delivered task is the last task to be delivered in the corresponding task group to be delivered, and the same to-be-delivered task group is assigned.
  • step S102 is for the current distributor, if the to-be-delivered task group is assigned to For the current distributor, the first to-be-delivered task and the second to-be-delivered task are determined according to the planned delivery route.
  • the first to-be-delivered task and the second to-be-delivered task may also be determined according to the time sequence of the task to be delivered received in the task group to be delivered, in this manner, for the same to-be-delivered task group,
  • the first to-be-delivered task and the second to-be-delivered task are always the same and will not be different depending on the distributor.
  • a cost assessment can be performed for each candidate distributor, and finally the task group to be assigned is assigned to the appropriate distributor based on the distribution cost and other relevant factors.
  • the current distributor in the actual application process, for each candidate deliverer, it is possible to determine whether to assign the task group to be assigned to the distributor by performing the above method of the embodiment.
  • the task to be delivered can be assigned to the shortest route with the shortest route, and if the time is the shortest priority,
  • the assignor to which the task to be delivered is assigned to the shortest time for delivery is different because the delivery speed of each dispenser is different, so the shortest path and the shortest time are not necessarily proportional, so it can be selected according to the actual situation.
  • the time and path there are other conditions that can be selected, depending on the actual situation.
  • step S103 that is, determining whether to assign the task group to be delivered to the current according to the delivery scope, the current location, the first to-be-delivered task, and the second to-be-delivered task.
  • the step of the distributor further includes the following steps S201-S202:
  • step S201 the delivery weight value of the current delivery person is determined according to the delivery scope, the current location, the first to-be-delivered task, and the second to-be-delivered task;
  • step S202 it is determined whether to assign the task group to be assigned to the current distributor according to the current distributor's distribution weight value and the predefined weight value.
  • whether to assign the task group to be delivered to the current distributor may depend on a plurality of conditions, the “distribution range, the current location, the first to-be-delivered task, and the second to-be-delivered task in this embodiment. It can be part of it, so you can determine whether to assign the task group to be assigned to the current distributor by calculating the weight value of each condition. For example, three conditions are needed to determine which distribution group the task group to be assigned is assigned to, and then the rating can be determined by the condition of each distributor, and the finally obtained distributor with the highest score can obtain the task to be assigned. group.
  • the distribution weight value in this embodiment may be a partial score of the current distributor determined according to the “distribution range, the current location, the first to-be-delivered task, and the second to-be-delivered task”, and the predefined weight value may be through other conditions. Determine the other parts of the current distributor's score. Whether or not the task group to be delivered is assigned to the current distributor can be determined by combining the weights of the ownership values, and in this way, the distribution of the distribution tasks can be rationalized.
  • step S103 that is, determining the distribution weight value of the current distributor according to the delivery scope, the current location, the first to-be-delivered task, and the second to-be-delivered task Further comprising the following steps S301-S303:
  • step S301 when the delivery addresses of all the tasks to be delivered in the task group to be delivered are all outside the delivery range of the current distributor, the delivery weight value of the current delivery person is set as the first delivery weight value;
  • step S302 when the delivery address of any task to be delivered in the task group to be delivered is within the delivery range of the current distributor, the delivery weight value of the current delivery person is set as the second delivery weight value; the second delivery weight The value is greater than the first delivery weight value; and/or
  • step S303 when the current location of the current distributor is outside the delivery range, and the delivery address of any of the tasks to be delivered in the task group to be delivered is within the delivery range, the delivery weight value of the current delivery is added to the predetermined return weight value.
  • the distribution weight value of the current distributor is determined according to the current location of the current distributor, the delivery range, and the delivery address of each task to be assigned in the task group to be assigned. If the delivery addresses of all the tasks to be assigned in the task group to be assigned are not within the delivery scope of the current distributor, at this time, since the current distributor distributes the tasks to be assigned in the task group to be assigned, the distribution scope is required from beginning to end.
  • the distribution scope needs to be returned from the outside of the distribution range, and the required distance and time are relatively long, so the first distribution weight value set for the current distributor is small, that is, the score is lower;
  • the time and path used are at least It is less than the above, so the second distribution weight value set is higher than the first distribution weight value.
  • the current position of the current delivery person may be within the delivery range, and at least one task to be delivered in the delivery task group is in the delivery scope.
  • the return weight value is added to the current distributor. This is because if a reasonable route planning is performed, for example, the task to be delivered within the delivery scope is used as the last delivery task, then the current distributor can be considered to be returning to the delivery scope.
  • a single task is delivered along the way, which is equivalent to reducing the distance of the delivery of a single task, reducing the distribution cost of the current distributor, and thus can add points to the current distributor.
  • the size of the return weight value may be preset to a fixed value, or may be calculated according to a distance algorithm based on the current position of the current distributor according to a preset algorithm.
  • the optional implementation method improves the distribution weight value of the distributor by increasing the return value of the delivery person who can deliver the task in the return process when the task is to be delivered, thereby making the balance of other conditions
  • the distributor is preferentially selected as the distributor of the task group to be delivered.
  • the current delivery scope of the distributor includes a predefined first delivery range and a second delivery range, and the second delivery range is expanded according to the current delivery capability of the delivery provider. Delivery Area.
  • the first delivery range may be a delivery range selected according to the current distributor's will or other conditions, the current delivery person usually activities within the first delivery range when the task is not performed; and the second delivery scope is based on the current delivery provider's delivery capability.
  • the expanded distribution range is performed on the basis of the first delivery range, and the first delivery range is within the second delivery range.
  • the current distributor's distribution ability includes the vehicle used by the current distributor at the time of delivery, the average delivery speed of the current distributor in the past delivery process, and the like.
  • the second delivery range may be an expanded delivery range according to the current delivery scope of the first delivery, and of course the second delivery range may also be consistent with the first delivery range.
  • the current distributor determines the first delivery range, and the system considers that the distribution scope of the current distributor can be further expanded according to the previous distribution experience of the distributor or the distribution experience of other distributors whose distribution capabilities are similar in all aspects.
  • a second delivery range that is larger than the first delivery range can be set.
  • step S103 that is, determining the distribution weight value of the current distributor according to the delivery scope, the current location, the first to-be-delivered task, and the second to-be-delivered task, further including :
  • step S400 the distribution weight value of the current distributor is set to the lowest weight value when one of the following conditions is satisfied:
  • condition 401 the first to-be-delivered task is within the first delivery range, and the current delivery person and the second to-be-delivered task are all within the second delivery range;
  • the first to-be-delivered task is between the first delivery range and the second delivery range, and the second to-be-delivered task is outside the second delivery range;
  • condition 403 the first to-be-delivered task is outside the second delivery range, and the current delivery is within the first delivery range or the second delivery range;
  • the first to-be-delivered task and the current deliverer are both outside the second delivery range, and the second distance is greater than the first distance or the third distance; the first distance is the first to-be-delivered task and the first delivery range The distance between the second distance is the distance between the second to-be-delivered task and the first delivery range, and the third distance is the distance between the current position of the current delivery person and the first delivery range.
  • the lowest weight value can be set according to the actual situation.
  • the lowest delivery value may be infinite, in order to assign the to-be-delivered task group to the distributor regardless of the score under other conditions as long as it is set to the lowest weight value.
  • the lowest weight value may also be a fixed value, so that the distributor has a lower score under the condition, and if the scores under other conditions are still high, in the case of integrating various conditions. The task group to be delivered can still be assigned to the distributor.
  • the first distance, the second distance, and the third distance may respectively be a delivery address of the first to-be-delivered task, a delivery address of the second to-be-delivered task, and a straight line of the current delivery person's delivery address to the boundary of the first delivery range.
  • the distance may also be a delivery address of the first to-be-delivered task, a delivery address of the second to-be-delivered task, and a path distance of the current delivery person's delivery address to the boundary of the first delivery range.
  • the first distance may be the shortest straight line distance from the delivery address of the first to-be-delivered task to the boundary of the first delivery range, that is, the connection between the delivery address of the first to-be-delivered task and any point on the boundary of the first delivery range.
  • the shortest distance may also be the best route from the delivery address of the first to-be-delivered task to the optional path of the first delivery range boundary.
  • the optimal path may be the shortest path, or may be selected considering factors such as smooth walking. The best path can be set according to the actual situation.
  • the second distance may be the shortest straight line distance from the delivery address of the second to-be-delivered task to the boundary of the first delivery range, that is, the shortest of the connection between the delivery address of the second to-be-delivered task and any point on the boundary of the first delivery range
  • the distance may also be the best route among the delivery address of the second to-be-delivered task to the optional path of the first delivery range boundary, and the optimal path may be the shortest path or the most selected considering factors such as smooth walking. Good path, can be set according to the actual situation.
  • the third distance may be a straight line distance from the current position of the current distributor to the boundary of the first delivery range, that is, the shortest distance between the current position of the current distributor and any point on the boundary of the first delivery range, or may be The optimal path of the current position of the current distributor to the optional path of the first delivery range boundary, the optimal path may be the shortest path, or the optimal path selected considering factors such as smooth walking, etc., depending on the actual Situation settings.
  • the current distributor's delivery weight value is set to the lowest weight value in the following four situations:
  • the first task in the task group to be delivered that is, the first to-be-delivered task is within the first delivery scope
  • the current delivery person and the last single task, that is, the second to-be-delivered task are not in the first delivery scope and the second delivery scope. That is, outside the second delivery range area, at this time, since the current delivery first needs to deliver the first to-be-delivered task, the first delivery task is delivered from the second delivery range to the first delivery range, and then the intermediate delivery task is completed.
  • the first task in the task group to be delivered that is, the first to-be-delivered task is between the first delivery scope and the second delivery scope
  • the last single task that is, the second to-be-delivered task is outside the second delivery scope
  • the current delivery person needs to move from the first delivery scope to the delivery final task outside the second delivery scope, and then return to the first delivery scope, which obviously makes the current delivery person's delivery process Moving, resulting in a large distribution cost, it is possible to avoid assigning the task to be delivered to the current distributor by setting the delivery weight value of the current delivery to the lowest weight value.
  • the first order task in the task group to be delivered is outside the second delivery range, and when the current delivery person is within the first delivery range or the second delivery range, the current delivery person needs to be from the first delivery range or the second delivery.
  • the range moves outside the second delivery range to deliver the first order task, and returns to the first delivery range after the last single task is delivered, causing the current distributor to move back and forth on the path, which increases the delivery cost of the distributor and affects subsequent
  • the delivery weight value of the delivery person can be set to the lowest weight value to avoid or try not to assign the to-be-delivered task group to the delivery person.
  • the first task in the task group to be delivered that is, the first to-be-delivered task is not in the first delivery scope and the second delivery scope, and the current delivery person is not in the first delivery scope and the second delivery scope, if the last order is
  • the second distance of the delivery address of the task to the first delivery range is greater than the first distance of the delivery address of the first task to the first delivery range or the third distance of the current delivery to the first delivery range, because the current delivery is in the delivery In the last single task, it needs to move outwards to the delivery range, which increases the distribution cost of the current delivery. Therefore, the delivery weight value of the delivery person can be set to the lowest weight value to avoid or try not to distribute the task to be delivered.
  • the group is assigned to the distributor.
  • the delivery may be moved back and forth from the delivery scope to the delivery scope to complete the delivery.
  • the task either need to be directed to the delivery task to be delivered to a farther location, so based on the above four situations, the current delivery person's distribution weight value is set to the lowest, to avoid or try not to assign the to-be-delivered task group to the delivery.
  • the current delivery person's distribution weight value is set to the lowest value, the current delivery person can be excluded, so that the current delivery person can no longer be scored.
  • step S103 that is, determining a distribution weight of the current distributor according to the delivery scope, the current location, the first to-be-delivered task, and the second to-be-delivered task, further include:
  • step S500 when one of the following conditions is met, the distribution weight value of the current distributor is increased according to the distance between the current location of the current distributor and the delivery address of the first task to be delivered, otherwise the first to be delivered according to the current location
  • the fourth distance between the delivery addresses of the tasks adjusts the distribution weight of the current distributor:
  • the first to-be-delivered task and the current delivery are both between the first delivery range and the second delivery range, the second to-be-delivered task is within the second delivery range, and the first distance is greater than the third distance; a distance is a distance between the first to-be-delivered task and the first delivery range, and the third distance is a distance between the current location of the current delivery person and the first delivery range;
  • both the first to-be-delivered task and the current deliverer are not within the first delivery range or the second delivery range, and the first distance is greater than the third distance.
  • the first task that is, the delivery address of the first to-be-delivered task and the current delivery person are both between the first delivery scope and the second delivery scope, and the delivery address of the last single task is not in the second delivery.
  • the current distributor's weight value is set to the lowest value, see condition 402 above
  • the first task If the delivery address is further away from the first delivery range, it means that the current delivery person has to move away from the first delivery range to deliver the first single task, so the distance between the current delivery person and the delivery address of the first task can be The distribution weight value is reduced.
  • the first single task and the current delivery are outside the second delivery range, and compared to the current delivery, the delivery address of the first task is further away from the first delivery range, which means that the current delivery person deviates from the first delivery.
  • the distribution range moves outward to deliver the first order task, so the distribution weight value can be deducted by the distance between the current delivery person and the delivery address of the first order task.
  • the fourth distance may be a linear distance between the current location of the current delivery person and the delivery address of the first to-be-delivered task, or may be between the current location of the current delivery person and the delivery address of the first to-be-delivered task.
  • the optimal path distance in the optional path, the best path may be the shortest path, or the best path selected considering factors such as smooth walking, and may be set according to actual conditions.
  • whether to deduct the deduction is determined by determining whether the current distributor is moving outwards toward the first delivery range when the first task is delivered. According to the distance between the first task, that is, the distance between the delivery address of the first to-be-delivered task and the current position of the current delivery person, the specific deduction rules can be obtained according to the previous distribution experience.
  • the following formula may be used according to the distance between the first order task, that is, the distance between the delivery address of the first to-be-delivered task and the current position of the current distributor:
  • f(x) is the distribution weight value
  • x is the distance between the delivery address of the first to-be-delivered task and the current position of the current distributor
  • the unit is km
  • e, f, and g are constants greater than 0, e Both g and g are greater than 1, and g is greater than e.
  • the constants in the formula can be set according to the empirical value and the actual situation.
  • a formula with less reduction ie, -ex+1
  • x when x is less than 0.5 km, since the delivery address of the first to-be-delivered task is not too far from the current delivery, a formula with less reduction (ie, -ex+1) may be used, and when x is greater than 0.5.
  • the formula with higher deduction points ie -g(xf)
  • f can be set to 0.5, e to 2, and g to 5.
  • the distance adjusts the delivery weight value of the current delivery. For example, when the fourth distance is less than a certain value, that is, when the current delivery person is closer to the first order task, the distribution weight value of the current delivery person may be increased, and when the fourth distance is greater than a certain value, that is, when the current delivery person is far away from the first single task, The distribution weight value of the current distributor can be reduced. That is to say, the distribution weight value of the distributor closer to the first order in this manner is higher.
  • adjusting the current distributor's distribution weight value according to the fourth distance between the current location and the delivery address of the first to-be-delivered task uses the following function:
  • f(x) is the distribution weight value
  • x is the fourth distance between the current location and the delivery address of the first to-be-delivered task
  • a and b are constants greater than zero.
  • step S103 that is, determining a distribution weight of the current distributor according to the delivery scope, the current location, the first to-be-delivered task, and the second to-be-delivered task, further include:
  • step S600 when one of the following conditions is met, the distribution weight value of the current delivery person is reduced according to the second distance, and the second distance is the distance between the delivery address of the second to-be-delivered task and the first delivery range:
  • condition 601 the first to-be-delivered task is within the first delivery range, the current delivery is within the second delivery range, and the second to-be-delivered task is outside the second delivery range;
  • condition 602 the first to-be-delivered task is within the first delivery range, the current delivery is within the second delivery range, and the second to-be-delivered task is between the first delivery range and the second delivery range;
  • condition 603 the first to-be-delivered task is between the first delivery range and the second delivery range, and the current delivery is within the first delivery range and the second to-be-delivered task is outside the second delivery range.
  • the distribution weight value of the current distributor is deducted according to the last task, that is, the distance from the second to-be-delivered task to the first delivery range. It can be seen from the above three situations that basically the delivery address of the first single task is within the first delivery range or the second delivery range, and the current delivery person needs to deviate from the first delivery range when the final delivery task is delivered.
  • the distribution weight value of the current distributor is deducted.
  • the second distance determining the level of the deducted score according to the distance of the second distance, if the last single task is far from the first delivery range, that is, the second distance is larger, the deduction score is more.
  • the second distance is small, the score of the buckle is small, and the specific value can be set according to the experience value and the actual situation in the past delivery process.
  • the following function may be employed when deducting according to the second distance:
  • f(x) is the distribution weight value
  • x is the second distance
  • M is the distance from the first delivery range to the second delivery range
  • M may be the linear distance from the boundary of the first delivery range to the boundary of the second delivery range, if The first delivery range and the second delivery range are not regular shapes, and M may be a maximum distance, a minimum distance, or an average distance between the first delivery range and the second delivery range, and may be specifically set according to actual conditions.
  • c and d are constants greater than 0, which are set according to actual conditions. This formula is summarized based on the past distribution experience value and the delivery ability of the distributor. In the specific implementation, it can be changed according to the actual situation. For example, c can be set to 2, and d can be set to 3.
  • step S103 that is, determining a distribution weight of the current distributor according to the delivery scope, the current location, the first to-be-delivered task, and the second to-be-delivered task, further include:
  • step S700 when one of the following conditions is met, the distribution weight value of the current distributor is increased according to the difference between the third distance and the second distance, and the second distance is between the second to-be-delivered task and the first delivery range.
  • the distance, the third distance is the distance between the current position of the current distributor and the first delivery range:
  • condition 701 the first to-be-delivered task and the current delivery are both between the first delivery range and the second delivery range, and the second to-be-delivered task is outside the second delivery range;
  • the first to-be-delivered task is between the first delivery range and the second delivery range, and the current delivery and the second to-be-delivered task are both outside the second delivery range, and the second distance is not greater than the third distance. ;
  • both the first to-be-delivered task and the current deliverer are outside the second delivery range.
  • the current delivery when the delivery address of the current distributor and the first task is not in the first delivery range, and the last task is not outside the second delivery range, the current delivery returns to the first delivery.
  • the current distributor is added, that is, the distribution weight of the current distributor is increased.
  • the increase of the distribution weight value may be related to the difference between the current distance from the current distributor to the first delivery range and the second distance from the delivery address of the last task to the first delivery range, so that the greater the difference, the higher the score High, so that it is preferable to assign the task group to be assigned to the distributor who is more likely to return to the first delivery range, that is, the return distance, when the delivery of the single task, that is, the second to-be-delivered task.
  • increasing the distribution weight value of the current distributor according to the difference between the third distance and the second distance may take the following function:
  • f(x) is the distribution weight value
  • x is the difference between the third distance and the second distance
  • h and i are both constants greater than 1
  • i is greater than h.
  • the exponential function is used when x is greater than 0, in order to decrease the weight of the distribution weight value as the difference increases, that is, the increase of the distribution weight value becomes weaker as the difference increases, avoiding an infinite increase.
  • the distribution weight value reduces the influence of other conditions on the distribution weight value.
  • h can be set to 1.2 and i to 5. Of course, this function can be changed according to the actual situation.
  • step S103 that is, determining a distribution weight of the current distributor according to the delivery scope, the current location, the first to-be-delivered task, and the second to-be-delivered task, further include:
  • step S800 when one of the following conditions is met, the distribution weight value of the current distributor is adjusted according to the ratio of the sum of the second distance, the fourth distance, and the fifth distance to the third distance; the second distance is the second task to be delivered.
  • the distance between the delivery address and the first delivery range, the third distance is the distance between the current location of the current delivery and the first delivery range, and the fourth distance is the current location of the current delivery and the first to be delivered task
  • the distance between the delivery addresses, the fifth distance is the distance between the first to-be-delivered task and the delivery address of the second to-be-delivered task:
  • condition 801 the first to-be-delivered task is within the first delivery range, the current delivery is between the first delivery range and the second delivery range, and the second to-be-delivered task is outside the second delivery range;
  • condition 802 the first to-be-delivered task is between the first delivery range and the second delivery range, the current delivery person is outside the second delivery range, and the second to-be-delivered task is within the second delivery range;
  • both the first to-be-delivered task and the current deliverer are outside the second delivery range.
  • the main consideration is the cost of the journey taken by the current distributor after returning to the first delivery range after the delivery of the task group is completed. Therefore, in the above three cases, by calculating the fourth distance of the current delivery to the delivery address of the first task, the fifth distance from the delivery address of the first task to the delivery address of the last task, and the current delivery return The ratio of the distance from the delivery address of the last single task to the second distance of the first delivery range is adjusted from the current position of the current distributor to the distance of the first delivery range, that is, the distance directly returned by the current delivery to the first delivery range. .
  • the distribution weight value is larger.
  • the relationship between the above ratio and the distribution weight value can be summarized based on actual conditions and past distribution experience.
  • the fifth distance may be a linear distance between the delivery address of the first task to be delivered and the delivery address of the second task to be delivered, or may be the delivery address of the first task to be delivered and the second task to be delivered.
  • the optimal path distance in the optional path between the delivery addresses, the best path may be the shortest path, or the best path selected considering factors such as smooth walking, which may be set according to actual conditions.
  • adjusting the distribution weight value of the current distributor according to the ratio of the sum of the second distance, the fourth distance, the fifth distance, and the third distance may be implemented by the following function:
  • f(x) is the distribution weight value
  • x is the ratio of the sum of the second distance, the fourth distance, and the fifth distance to the third distance.
  • j is a constant greater than 0. It can be determined according to the previous distribution experience and the actual situation that the distribution weight value is negative when x is greater than, and then the appropriate j is selected, for example, j can be set to 0.35, which makes x be greater than 1.2 due to The delivery address of the first order and the last order task is more than the current position of the current distributor, and the calculated distribution weight value is negative, that is, the current distributor is deducted.
  • x is greater than or equal to 1.2, since the delivery address of the first order and the last single task is near the path where the current delivery person returns to the first delivery range, the path cost is basically not increased, so the current distributor can be added.
  • the delivery task processing apparatus includes an acquisition module 901, a first determination module 902, and a second determination module 903:
  • the obtaining module 901 is configured to acquire a delivery scope and a current location of the current delivery person
  • the first determining module 902 is configured to determine a first to-be-delivered task and a second to-be-delivered task in the task group to be delivered; the task group to be delivered includes one or more tasks to be delivered; and the first task to be delivered is to be delivered The task to be delivered that is first delivered when the task group is assigned to the current distributor; the second task to be delivered is the task to be delivered that is finally delivered when the task group to be delivered is assigned to the current distributor;
  • the second determining module 903 is configured to determine whether to assign the task group to be delivered to the current distributor according to the delivery scope, the current location, the first to-be-delivered task, and the second to-be-delivered task.
  • each distributor has a corresponding delivery range, which is predefined.
  • the task group to be delivered is pre-determined according to the delivery address of the task to be delivered and the corresponding rule, and may include one or more tasks to be delivered, and the rules of grouping are not within the scope of the disclosure, and will not be described in detail herein.
  • the task to be delivered can be any task that needs to be delivered to the delivery address, such as a takeaway order, a courier, and the like.
  • a task to be delivered can be a meal picking task or a meal delivery task, which is also applicable to other similar tasks, such as flash delivery.
  • a task group to be delivered may be assigned to a dispatcher, and after assigning the task group to be delivered to a dispatcher, according to the location information of the deliverer and the delivery of each task to be delivered in the task group to be delivered.
  • the information is planned to be the distribution route, that is, the order of the tasks to be delivered in the task group to be delivered, and the specific path planning method is not within the scope of the disclosure, and will not be described in detail herein.
  • the first to-be-delivered task is the first task to be delivered in the corresponding task group to be delivered
  • the second to-be-delivered task is the last task to be delivered in the corresponding task group to be delivered, and the same to-be-delivered task group is assigned.
  • the planned route may be different, and the first to-be-delivered task and the second to-be-delivered task may also be different.
  • the first determining module 902 is for the current dispatcher, if the task group to be delivered is If it is assigned to the current distributor, the first to-be-delivered task and the second to-be-delivered task are determined according to the planned delivery route.
  • the first to-be-delivered task and the second to-be-delivered task may also be determined according to the time sequence of the task to be delivered received in the task group to be delivered, in this manner, for the same to-be-delivered task group,
  • the first to-be-delivered task and the second to-be-delivered task are always the same and will not be different depending on the distributor.
  • a cost assessment can be performed for each candidate distributor, and finally the task group to be assigned is assigned to the appropriate distributor based on the distribution cost and other relevant factors.
  • the current distributor in the actual application process, for each candidate deliverer, it is possible to determine whether to assign the task group to be assigned to the distributor by performing the above method of the embodiment.
  • the task to be delivered can be assigned to the shortest route with the shortest route, and if the time is the shortest priority,
  • the assignor to which the task to be delivered is assigned to the shortest time for delivery is different because the delivery speed of each dispenser is different, so the shortest path and the shortest time are not necessarily proportional, so it can be selected according to the actual situation.
  • the time and path there are other conditions that can be selected, depending on the actual situation.
  • the second determining module 903 further includes the following modules:
  • the first determining sub-module 1001 is configured to determine a distribution weight value of the current distributor according to the delivery scope, the current location, the first to-be-delivered task, and the second to-be-delivered task;
  • the second determining sub-module 1002 is configured to determine whether to assign the task group to be assigned to the current distributor according to the current distributor's delivery weight value and the predefined weight value.
  • whether to assign the task group to be delivered to the current distributor may depend on a plurality of conditions, the “distribution range, the current location, the first to-be-delivered task, and the second to-be-delivered task in this embodiment. It can be part of it, so you can determine whether to assign the task group to be assigned to the current distributor by calculating the weight value of each condition. For example, three conditions are needed to determine which distribution group the task group to be assigned is assigned to, and then the rating can be determined by the condition of each distributor, and the finally obtained distributor with the highest score can obtain the task to be assigned. group.
  • the distribution weight value in this embodiment may be a partial score of the current distributor determined according to the “distribution range, the current location, the first to-be-delivered task, and the second to-be-delivered task”, and the predefined weight value may be through other conditions. Determine the other parts of the current distributor's score. Whether or not the task group to be delivered is assigned to the current distributor can be determined by combining the weights of the ownership values, and in this way, the distribution of the distribution tasks can be rationalized.
  • the second determining module 903 further includes the following modules:
  • the first setting sub-module 1101 is configured to set the delivery weight value of the current delivery person to the first delivery weight value when the delivery addresses of all the tasks to be delivered in the task group to be delivered are all outside the delivery range of the current distributor;
  • the second setting sub-module 1102 is configured to set the delivery weight value of the current delivery person to the second delivery weight value when the delivery address of any of the tasks to be delivered in the task group to be delivered is within the delivery range of the current distributor The second delivery weight value is greater than the first delivery weight value; and/or
  • the adder module 1103 is configured to add the current distributor's delivery weight value to the predetermined time when the current position of the current delivery person is outside the delivery range, and the delivery address of any of the tasks to be delivered in the task group to be delivered is within the delivery range. Return weight value.
  • the distribution weight value of the current distributor is determined according to the current location of the current distributor, the delivery range, and the delivery address of each task to be assigned in the task group to be assigned. If the delivery addresses of all the tasks to be assigned in the task group to be assigned are not within the delivery scope of the current distributor, at this time, since the current distributor distributes the tasks to be assigned in the task group to be assigned, the distribution scope is required from beginning to end.
  • the distribution scope needs to be returned from the outside of the distribution range, and the required distance and time are relatively long, so the first distribution weight value set for the current distributor is small, that is, the score is lower;
  • the time and path used are at least It is less than the above, so the second distribution weight value set is higher than the first distribution weight value.
  • the current position of the current delivery person may be within the delivery range, and at least one task to be delivered in the delivery task group is in the delivery scope.
  • the return weight value is increased for the current distributor. This is because if a reasonable route planning is performed, for example, the task to be delivered within the delivery scope is used as the last delivery task, then the current distributor can be considered to be returning to the delivery scope.
  • a single task is delivered along the way, which is equivalent to reducing the distance of the delivery of a single task, reducing the distribution cost of the current distributor, and thus can add points to the current distributor.
  • the size of the return weight value may be preset to a fixed value, or may be calculated according to a distance algorithm based on the current position of the current distributor according to a preset algorithm.
  • the optional implementation method improves the distribution weight value of the distributor by increasing the return value of the delivery person who can deliver the task in the return process when the task is to be delivered, thereby making the balance of other conditions
  • the distributor is preferentially selected as the distributor of the task group to be delivered.
  • the current delivery scope of the distributor includes a predefined first delivery range and a second delivery range, and the second delivery range is expanded according to the current delivery capability of the delivery provider. Delivery Area.
  • the first delivery range may be a delivery range selected according to the current distributor's will or other conditions, the current delivery person usually activities within the first delivery range when the task is not performed; and the second delivery scope is based on the current delivery provider's delivery capability.
  • the expanded distribution range is performed on the basis of the first delivery range, and the first delivery range is within the second delivery range.
  • the current distributor's distribution ability includes the vehicle used by the current distributor at the time of delivery, the average delivery speed of the current distributor in the past delivery process, and the like.
  • the second delivery range may be an expanded delivery range according to the current delivery scope of the first delivery, and of course the second delivery range may also be consistent with the first delivery range.
  • the current distributor determines the first delivery range, and the system considers that the distribution scope of the current distributor can be further expanded according to the previous distribution experience of the distributor or the distribution experience of other distributors whose distribution capabilities are similar in all aspects.
  • a second delivery range that is larger than the first delivery range can be set.
  • the second determining module 903 further includes:
  • the third setting sub-module is configured to set the distribution weight value of the current deliverer to the lowest weight value when one of the following conditions is met:
  • the first to-be-delivered task is within the first delivery range, and the current delivery person and the second to-be-delivered task are all within the second delivery range;
  • the first to-be-delivered task is between the first delivery range and the second delivery range, and the second to-be-delivered task is outside the second delivery range;
  • the first to-be-delivered task is outside the second delivery range, and the current delivery person is within the first delivery range or the second delivery range;
  • the first to-be-delivered task and the current delivery are both outside the second delivery range, and the second distance is greater than the first distance or the third distance; the first distance is the distance between the first to-be-delivered task and the first delivery range, The second distance is a distance between the second to-be-delivered task and the first delivery range, and the third distance is a distance between the current location of the current delivery person and the first delivery range.
  • the lowest weight value can be set according to the actual situation.
  • the lowest delivery value may be infinite, in order to assign the to-be-delivered task group to the distributor regardless of the score under other conditions as long as it is set to the lowest weight value.
  • the lowest weight value may also be a fixed value, so that the distributor has a lower score under the condition, and if the scores under other conditions are still high, in the case of integrating various conditions. The task group to be delivered can still be assigned to the distributor.
  • the current distributor's delivery weight value is set to the lowest weight value in the following four situations:
  • the first task in the task group to be delivered that is, the first to-be-delivered task is within the first delivery scope
  • the current delivery person and the last single task, that is, the second to-be-delivered task are not in the first delivery scope and the second delivery scope. That is, outside the second delivery range area, at this time, since the current delivery first needs to deliver the first to-be-delivered task, the first delivery task is delivered from the second delivery range to the first delivery range, and then the intermediate delivery task is completed.
  • the first task in the task group to be delivered that is, the first to-be-delivered task is between the first delivery scope and the second delivery scope
  • the last single task that is, the second to-be-delivered task is outside the second delivery scope
  • the current delivery person needs to move from the first delivery scope to the delivery final task outside the second delivery scope, and then return to the first delivery scope, which obviously makes the current delivery person's delivery process Moving, resulting in a large distribution cost, it is possible to avoid assigning the task to be delivered to the current distributor by setting the delivery weight value of the current delivery to the lowest weight value.
  • the first order task in the task group to be delivered is outside the second delivery range, and when the current delivery person is within the first delivery range or the second delivery range, the current delivery person needs to be from the first delivery range or the second delivery.
  • the range moves outside the second delivery range to deliver the first order task, and returns to the first delivery range after the last single task is delivered, causing the current distributor to move back and forth on the path, which increases the delivery cost of the distributor and affects subsequent
  • the delivery weight value of the delivery person can be set to the lowest weight value to avoid or try not to assign the to-be-delivered task group to the delivery person.
  • the first task in the task group to be delivered that is, the first to-be-delivered task is not in the first delivery scope and the second delivery scope, and the current delivery person is not in the first delivery scope and the second delivery scope, if the last order is
  • the second distance of the delivery address of the task to the first delivery range is greater than the first distance of the delivery address of the first task to the first delivery range or the third distance of the current delivery to the first delivery range, because the current delivery is in the delivery In the last single task, it needs to move outwards to the delivery range, which increases the distribution cost of the current delivery. Therefore, the delivery weight value of the delivery person can be set to the lowest weight value to avoid or try not to distribute the task to be delivered.
  • the group is assigned to the distributor.
  • the first distance, the second distance, and the third distance may be a linear distance to a boundary of the first delivery range, or may be a path distance.
  • the first distance may be a straight line distance from the delivery address of the first to-be-delivered task to the boundary of the first delivery range, or may be the best of the first delivery target to be delivered to the first delivery range boundary.
  • the path, the optimal path may be the shortest path, or the best path selected considering factors such as smooth walking, and may be set according to actual conditions.
  • the delivery may be moved back and forth from the delivery scope to the delivery scope to complete the delivery.
  • the task either need to be directed to the delivery task to be delivered to a farther location, so based on the above four situations, the current delivery person's distribution weight value is set to the lowest, to avoid or try not to assign the to-be-delivered task group to the delivery.
  • the current delivery person's distribution weight value is set to the lowest value, the current delivery person can be excluded, so that the current delivery person can no longer be scored.
  • the second determining module 903 further includes:
  • a fourth setting sub-module configured to increase a distribution weight of the current distributor according to a distance between a current location of the current distributor and a delivery address of the first to-be-delivered task when one of the following conditions is met, otherwise, according to the current location
  • the fourth distance between the delivery addresses of the first to-be-delivered task adjusts the distribution weight of the current distributor:
  • the first to-be-delivered task and the current delivery are both between the first delivery range and the second delivery range, the second to-be-delivered task is in the second delivery range, and the first distance is greater than the third distance;
  • the first distance is the first The distance between the task to be delivered and the first delivery range, and the third distance is the distance between the current location of the current distributor and the first delivery range;
  • the first to-be-delivered task and the current delivery are neither in the first delivery range or the second delivery range, and the first distance is greater than the third distance.
  • the first task that is, the delivery address of the first to-be-delivered task and the current delivery person are both between the first delivery scope and the second delivery scope, and the delivery address of the last single task is not in the second delivery.
  • the delivery address of the first task is farther away from the first delivery range than the current location of the current delivery, it means that the current delivery person has to move away from the first delivery range to deliver the first task. Therefore, the distribution weight value can be deducted by the distance between the current delivery person and the delivery address of the first order task.
  • the first single task and the current delivery are outside the second delivery range, and compared to the current delivery, the delivery address of the first task is further away from the first delivery range, which means that the current delivery person deviates from the first delivery.
  • the distribution range moves outward to deliver the first order task, so the distribution weight value can be deducted by the distance between the current delivery person and the delivery address of the first order task.
  • whether to deduct the deduction is determined by determining whether the current distributor is moving outwards toward the first delivery range when the first task is delivered. According to the distance between the first task, that is, the distance between the delivery address of the first to-be-delivered task and the current position of the current delivery person, the specific deduction rules can be obtained according to the previous distribution experience.
  • the following formula may be used according to the distance between the first order task, that is, the distance between the delivery address of the first to-be-delivered task and the current position of the current distributor:
  • f(x) is the distribution weight value
  • x is the distance between the delivery address of the first to-be-delivered task and the current position of the current distributor
  • the unit is km
  • e, f, and g are constants greater than 0, e Both g and g are greater than 1, and g is greater than e.
  • the constants in the formula can be set according to the empirical value and the actual situation.
  • a formula with less reduction ie, -ex+1
  • x when x is less than 0.5 km, since the delivery address of the first to-be-delivered task is not too far from the current delivery, a formula with less reduction (ie, -ex+1) may be used, and when x is greater than 0.5.
  • the formula with higher deduction points ie -g(xf)
  • f can be set to 0.5, e to 2, and g to 5.
  • the current distance is adjusted according to the fourth distance between the current delivery person and the delivery address of the first task, that is, the first to-be-delivered task.
  • the delivery weight value of the distributor For example, when the fourth distance is less than a certain value, that is, when the current delivery person is closer to the first order task, the distribution weight value of the current delivery person may be increased, and when the fourth distance is greater than a certain value, that is, when the current delivery person is far away from the first single task, The distribution weight value of the current distributor can be reduced. That is to say, the distribution weight value of the distributor closer to the first order in this manner is higher.
  • adjusting the current distributor's distribution weight value according to the fourth distance between the current location and the delivery address of the first to-be-delivered task uses the following function:
  • f(x) is the distribution weight value
  • x is the fourth distance between the current location and the delivery address of the first to-be-delivered task
  • a and b are constants greater than zero.
  • the second determining module 903 further includes:
  • a fifth setting submodule configured to reduce a distribution weight value of the current delivery person according to the second distance when one of the following conditions is met, where the second distance is a distance between the delivery address of the second to-be-delivered task and the first delivery range :
  • the first to-be-delivered task is within the first delivery range, the current delivery is within the second delivery range, and the second to-be-delivered task is outside the second delivery range;
  • the first to-be-delivered task is within the first delivery range
  • the current delivery person is within the second delivery range
  • the second to-be-delivered task is between the first delivery range and the second delivery range
  • the first to-be-delivered task is between the first delivery range and the second delivery range, and the current delivery person is within the first delivery range, and the second to-be-delivered task is outside the second delivery range.
  • the distribution weight value of the current distributor is deducted according to the last task, that is, the distance from the second to-be-delivered task to the first delivery range. It can be seen from the above three situations that basically the delivery address of the first single task is within the first delivery range or the second delivery range, and the current delivery person needs to deviate from the first delivery range when the final delivery task is delivered.
  • the distribution weight value of the current distributor is deducted.
  • the second distance determining the level of the deducted score according to the distance of the second distance, if the last single task is far from the first delivery range, that is, the second distance is larger, the deduction score is more.
  • the second distance is small, the score of the buckle is small, and the specific value can be set according to the experience value and the actual situation in the past delivery process.
  • the following function may be employed when deducting according to the second distance:
  • f(x) is the distribution weight value
  • x is the second distance
  • M is the distance from the first delivery range to the second delivery range
  • M may be the linear distance from the boundary of the first delivery range to the boundary of the second delivery range, if The first delivery range and the second delivery range are not regular shapes, and M may be a maximum distance, a minimum distance, or an average distance between the first delivery range and the second delivery range, and may be specifically set according to actual conditions.
  • c and d are constants greater than 0, which are set according to the actual situation. This formula is summarized based on the past distribution experience value and the delivery ability of the distributor. In the specific implementation, it can be changed according to the actual situation. For example, c can be set to 2, and d can be set to 3.
  • the second determining module 903 further includes:
  • a sixth setting submodule configured to increase a distribution weight value of the current distributor according to a difference between the third distance and the second distance when the one of the following conditions is met, where the second distance is the second task to be delivered and the first The distance between the distribution ranges, the third distance is the distance between the current position of the current distributor and the first delivery range:
  • the first to-be-delivered task and the current delivery are both between the first delivery range and the second delivery range, and the second to-be-delivered task is outside the second delivery range;
  • the first to-be-delivered task is between the first delivery range and the second delivery range, and the current delivery person and the second to-be-delivered task are both outside the second delivery range, and the second distance is not greater than the third distance;
  • the first to-be-delivered task and the current deliverer are both outside the second delivery range.
  • the current delivery when the delivery address of the current distributor and the first task is not in the first delivery range, and the last task is not outside the second delivery range, the current delivery returns to the first delivery.
  • the current distributor is added, that is, the distribution weight of the current distributor is increased.
  • the increase of the distribution weight value may be related to the difference between the current distance from the current distributor to the first delivery range and the second distance from the delivery address of the last task to the first delivery range, so that the greater the difference, the higher the score High, so that it is preferable to assign the task group to be assigned to the distributor who is more likely to return to the first delivery range, that is, the return distance, when the delivery of the single task, that is, the second to-be-delivered task.
  • increasing the distribution weight value of the current distributor according to the difference between the third distance and the second distance may take the following function:
  • f(x) is the distribution weight value
  • x is the difference between the third distance and the second distance
  • h and i are both constants greater than 1
  • i is greater than h.
  • the exponential function is used when x is greater than 0, in order to decrease the weight of the distribution weight value as the difference increases, that is, the increase of the distribution weight value becomes weaker as the difference increases, avoiding an infinite increase.
  • the distribution weight value reduces the influence of other conditions on the distribution weight value.
  • h can be set to 1.2 and i to 5. Of course, this function can be changed according to the actual situation.
  • the second determining module 903 further includes:
  • a seventh setting submodule configured to adjust a distribution weight value of the current distributor according to a ratio of a sum of the second distance, the fourth distance, and the fifth distance to the third distance when one of the following conditions is met;
  • the second distance is The distance between the delivery address of the second delivery task and the first delivery range
  • the third distance is the distance between the current location of the current delivery and the first delivery range
  • the fourth distance is the current location of the current delivery and the first
  • the fifth distance is the distance between the first to-be-delivered task and the delivery address of the second to-be-delivered task:
  • the first to-be-delivered task is within the first delivery range, the current delivery person is between the first delivery range and the second delivery range, and the second to-be-delivered task is outside the second delivery range;
  • the first to-be-delivered task is between the first delivery range and the second delivery range, the current delivery person is outside the second delivery range, and the second to-be-delivered task is within the second delivery range;
  • the first to-be-delivered task and the current deliverer are both outside the second delivery range.
  • the main consideration is the cost of the journey taken by the current distributor after returning to the first delivery range after the delivery of the task group is completed. Therefore, in the above three cases, by calculating the fourth distance of the current delivery to the delivery address of the first task, the fifth distance from the delivery address of the first task to the delivery address of the last task, and the current delivery return The ratio of the distance from the delivery address of the last single task to the second distance of the first delivery range is adjusted from the current position of the current distributor to the distance of the first delivery range, that is, the distance directly returned by the current delivery to the first delivery range. .
  • the distribution weight value is larger.
  • the relationship between the above ratio and the distribution weight value can be summarized based on actual conditions and past distribution experience.
  • adjusting the distribution weight value of the current distributor according to the ratio of the sum of the second distance, the fourth distance, the fifth distance, and the third distance may be implemented by the following function:
  • f(x) is the distribution weight value
  • x is the ratio of the sum of the second distance, the fourth distance, and the fifth distance to the third distance.
  • j is a constant greater than 0. It can be determined according to the previous distribution experience and the actual situation that the distribution weight value is negative when x is greater than, and then the appropriate j is selected, for example, j can be set to 0.35, which makes x be greater than 1.2 due to The delivery address of the first order and the last order task is more than the current position of the current distributor, and the calculated distribution weight value is negative, that is, the current distributor is deducted.
  • x is greater than or equal to 1.2, since the delivery address of the first order and the last single task is near the path where the current delivery person returns to the first delivery range, the path cost is basically not increased, so the current distributor can be added.
  • FIG. 12 is a block diagram of an electronic device suitable for implementing a delivery task processing method in accordance with an embodiment of the present disclosure.
  • the electronic device 1200 includes a central processing unit (CPU) 1201 that can be loaded into a program in a random access memory (RAM) 1203 according to a program stored in a read only memory (ROM) 1202 or from a storage portion 1208.
  • CPU central processing unit
  • RAM random access memory
  • ROM read only memory
  • the various processes in the embodiment shown in Fig. 1 described above are executed.
  • RAM 1203 various programs and data required for the operation of the electronic device 1200 are also stored.
  • the CPU 1201, the ROM 1202, and the RAM 1203 are connected to each other through a bus 1204.
  • An input/output (I/O) interface 1205 is also coupled to bus 1204.
  • the following components are connected to the I/O interface 1205: an input portion 1206 including a keyboard, a mouse, etc.; an output portion 1207 including a cathode ray tube (CRT), a liquid crystal display (LCD), and the like, and a speaker; a storage portion 1208 including a hard disk or the like And a communication portion 1209 including a network interface card such as a LAN card, a modem, and the like.
  • the communication section 1209 performs communication processing via a network such as the Internet.
  • Driver 1210 is also coupled to I/O interface 1205 as needed.
  • a removable medium 1211 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory or the like, is mounted on the drive 1210 as needed so that a computer program read therefrom is installed into the storage portion 1208 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 delivery task processing of FIG.
  • the computer program can be downloaded and installed from the network via the communication portion 1209, and/or installed from the removable medium 1211.
  • each block in the roadmap or block diagram can represent a module, a program segment, or a portion of code that contains one or more executables for implementing the specified logical functions. instruction.
  • the functions noted in the blocks may also occur in a different order than that illustrated in the drawings. For example, two successively represented blocks may in fact be executed substantially in parallel, and they may 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 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 assembled A computer readable storage medium in a 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.

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Strategic Management (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Development Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Game Theory and Decision Science (AREA)
  • Educational Administration (AREA)
  • Information Transfer Between Computers (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

L'invention concerne un procédé et un appareil de traitement de tâche de livraison, un dispositif électronique et un support d'informations pour ordinateur. Le procédé comprend les étapes qui consistent : à acquérir une distance de livraison et la position courante d'un livreur courant (S101) ; à déterminer une première et une seconde tâche à livrer dans un groupe de tâches à livrer, le groupe de tâches à livrer incluant une ou plusieurs tâches à livrer, la première tâche à livrer étant une tâche à livrer qui est livrée d'abord lorsque le groupe de tâches à livrer est attribué au livreur courant, et la seconde tâche à livrer étant une tâche à livrer qui est finalement livrée quand le groupe de tâches à livrer est attribué au livreur courant (S102) ; et à exécuter un traitement prédéfini sur des données de valeur clé et/ou un ensemble de données de valeur clé occupant un espace dépassant un premier seuil d'espace (S103). Le procédé peut attribuer de manière plus rationnelle à un livreur un groupe de tâches à livrer avec un coût de livraison moindre, améliorer l'efficacité de livraison et réduire le coût de la livraison.
PCT/CN2017/118775 2017-08-22 2017-12-26 Procédé et appareil de traitement de tâche de livraison, dispositif électronique et support d'informations pour ordinateur WO2019037368A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710724495.6 2017-08-22
CN201710724495.6A CN107844881B (zh) 2017-08-22 2017-08-22 配送任务处理方法、装置、电子设备及存储介质

Publications (1)

Publication Number Publication Date
WO2019037368A1 true WO2019037368A1 (fr) 2019-02-28

Family

ID=61682942

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/118775 WO2019037368A1 (fr) 2017-08-22 2017-12-26 Procédé et appareil de traitement de tâche de livraison, dispositif électronique et support d'informations pour ordinateur

Country Status (2)

Country Link
CN (1) CN107844881B (fr)
WO (1) WO2019037368A1 (fr)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108647927B (zh) * 2018-05-17 2020-01-24 北京顺丰同城科技有限公司 一种订单分配方法以及装置
CN109615122B (zh) * 2018-11-27 2021-02-02 拉扎斯网络科技（上海）有限公司 配送范围的生成方法、装置、电子设备和存储介质
CN111612202B (zh) * 2019-02-26 2024-04-19 北京京东乾石科技有限公司 物品运输方法和运输系统

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030078802A1 (en) * 2001-10-22 2003-04-24 International Business Machines Corporation Method, system and program for creating a delivery plan
CN103810552A (zh) * 2012-11-09 2014-05-21 西安景行数创信息科技有限公司 一种快餐行业送餐调度系统
CN105719010A (zh) * 2015-07-24 2016-06-29 北京小度信息科技有限公司 配送任务的处理方法及装置
CN105930920A (zh) * 2016-04-11 2016-09-07 深圳市联文智能技术有限公司 物流配送管理方法和物流配送管理装置
CN106228419A (zh) * 2016-07-13 2016-12-14 深圳市拓源天创实业发展有限公司 一种订单处理方法及系统
CN106447169A (zh) * 2016-08-31 2017-02-22 广州增信信息科技有限公司 一种电子围栏调度优化方法

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101041515B1 (ko) * 1999-05-19 2011-06-16 디지맥 코포레이션 컴퓨터들을 제어하거나 물리적 및 전자적 객체들로부터 인터넷 리소스들에 링크하기 위한 방법들 및 시스템들
US6633791B1 (en) * 1999-10-28 2003-10-14 Taiwan Semiconductor Manufacturing Company Dispatching system with dynamically forward loading (DFL) intensity to solve nonlinear wafer out problem
US20090106124A1 (en) * 2000-12-08 2009-04-23 Ping Yang Method and apparatus for ordering and delivering of meals
CN102799971A (zh) * 2012-08-08 2012-11-28 中国烟草总公司江西省公司 烟草订单供货过程控制系统
CN102982431A (zh) * 2012-11-14 2013-03-20 上海虹迪物流有限公司 快递分配系统
CN103761639A (zh) * 2014-02-17 2014-04-30 江苏亲民网络股份有限公司 互联网电子商务物流管理系统中订单分配的处理方法
CN104200369B (zh) * 2014-08-27 2019-12-31 北京京东尚科信息技术有限公司 一种确定商品配送范围的方法和装置
CN104751271A (zh) * 2015-03-04 2015-07-01 径圆（上海）信息技术有限公司 智能订单调度方法、服务器、电动车、移动终端及系统
CN106779910B (zh) * 2016-11-24 2020-08-04 北京星选科技有限公司 配送订单分配方法和装置
CN106652232A (zh) * 2016-12-28 2017-05-10 北京拜克洛克科技有限公司 一种自行车共享方法及系统
CN106682779A (zh) * 2016-12-30 2017-05-17 浙江支氏生态农业开发有限公司 食材配送系统、装置和方法

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030078802A1 (en) * 2001-10-22 2003-04-24 International Business Machines Corporation Method, system and program for creating a delivery plan
CN103810552A (zh) * 2012-11-09 2014-05-21 西安景行数创信息科技有限公司 一种快餐行业送餐调度系统
CN105719010A (zh) * 2015-07-24 2016-06-29 北京小度信息科技有限公司 配送任务的处理方法及装置
CN105930920A (zh) * 2016-04-11 2016-09-07 深圳市联文智能技术有限公司 物流配送管理方法和物流配送管理装置
CN106228419A (zh) * 2016-07-13 2016-12-14 深圳市拓源天创实业发展有限公司 一种订单处理方法及系统
CN106447169A (zh) * 2016-08-31 2017-02-22 广州增信信息科技有限公司 一种电子围栏调度优化方法

Also Published As

Publication number Publication date
CN107844881A (zh) 2018-03-27
CN107844881B (zh) 2020-07-03

Similar Documents

Publication Publication Date Title
CN110645983B (zh) 用于无人车的路径规划方法、装置和系统
CN107909261B (zh) 订单推送方法和装置
CN106779910B (zh) 配送订单分配方法和装置
JP2020126692A (ja) 共有可能な注文を割り当てるためのシステムおよび方法
CN110741402B (zh) 用于运力调度的系统和方法
WO2021147353A1 (fr) Répartition de commandes
US20180225796A1 (en) Resource Allocation in a Network System
WO2019205784A1 (fr) Procédé et appareil d'attribution de tâche de livraison, dispositif électronique et support de stockage informatique
Shao et al. Synchronizing e-commerce city logistics with sliding time windows
CN111639854B (zh) 车辆分配方法、装置、电子设备和存储介质
CN108154298B (zh) 配送任务分配方法、装置、电子设备及计算机存储介质
WO2019000784A1 (fr) Procédé et dispositif d'attribution de commandes
CN109146349B (zh) 订单分配方法及装置
CN109816128B (zh) 网约车订单的处理方法、装置、设备及可读存储介质
WO2019037368A1 (fr) Procédé et appareil de traitement de tâche de livraison, dispositif électronique et support d'informations pour ordinateur
CN110020894B (zh) 信息处理方法、装置及服务器
CN110633928A (zh) 一种商品逆配决策方法和装置
CN113128744A (zh) 配送规划方法和装置
WO2018146622A1 (fr) Sélection dynamique d'options de service sur une base géographique dans un système de réseau
CN111027853A (zh) 密集仓储的订单分配方法、装置和电子设备
CN109934427B (zh) 生成物品分配方案的方法和装置
CN111695842A (zh) 配送方案确定方法、装置、电子设备及计算机存储介质
CN112232613A (zh) 任务调度方法、装置、电子设备及计算机可读存储介质
CN111612286B (zh) 一种订单分配方法、装置、电子设备及存储介质
CN110956384A (zh) 配送任务的处理方法、装置、电子设备及可读存储介质

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: 17922336

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 11/09/2020)

122 Ep: pct application non-entry in european phase

Ref document number: 17922336

Country of ref document: EP

Kind code of ref document: A1