WO2021000864A1

WO2021000864A1 - Order backlog processing

Info

Publication number: WO2021000864A1
Application number: PCT/CN2020/099373
Authority: WO
Inventors: 查莹; 王圣尧; 包建东
Original assignee: 北京三快在线科技有限公司
Priority date: 2019-07-01
Filing date: 2020-06-30
Publication date: 2021-01-07
Also published as: CN110443541A

Abstract

The invention comprises: when performing order backlog processing on orders awaiting assignment for any dispatcher, obtaining a predetermined route plan corresponding to the dispatcher (S102); determining a delivery sequence of task points included in the route plan, wherein the task points are pick-up locations and/or delivery locations of orders awaiting assignment included in the route plan (S104); allocating, to the same task package, task points corresponding to the same order, and thus dividing, according to the determined delivery sequence of the task points, the task points included in the route plan into multiple task packages (S106); and selecting multiple task packages from the task packages obtained from the division, and performing order backlog processing on orders awaiting assignment corresponding to task points in the selected task packages (S108).

Description

Order processing

Technical field

The present disclosure relates to the field of computer technology, and in particular to order processing.

Background technique

With the development of technology, the online-to-offline (O2O) model is becoming more and more mature, and it is applied in more and more industries. Among them, a typical example is the fast-growing food delivery industry under the influence of O2O.

Usually, the takeaway distribution platform will determine the matching degree between the dispatcher and the order according to the received user's order, according to the path optimization algorithm, determine the assignment relationship between the order and the dispatcher, and the dispatcher's route plan for the dispatch of the order, and follow the assignment The relationship assigns the order to the shipper.

Summary of the invention

The order processing method provided by the present disclosure includes: obtaining a predetermined route plan corresponding to the dispatcher for any dispatcher; determining the dispatch order of the task points included in the route plan, and the task points Is the pick-up location and/or delivery location of the unassigned order included in the route plan; according to the determined delivery sequence of the task points, the task points corresponding to the same unassigned order are divided into the same task package, Divide the task points included in the path plan into several task packages; select several task packages from the divided task packages, and perform order processing on unassigned orders corresponding to the task points in the selected task packages .

The present disclosure provides an order processing device, including: an acquisition module, for any dispatcher, acquires a predetermined route plan corresponding to the dispatcher; a determination module, which determines the delivery order of task points included in the route plan , The task point is the pick-up location and/or the delivery location of the unassigned order included in the path plan; the division module, according to the determined delivery sequence of the task point, to assign the task points corresponding to the same unassigned order In the way of dividing into the same task package, the task points included in the path plan are divided into several task packages; the execution module selects several task packages from the divided task packages, and compares the tasks in the selected task packages. The unassigned order corresponding to the task point is processed by pressing the order.

The present disclosure provides a computer-readable storage medium, the storage medium stores a computer program, and when the computer program is executed by a processor, the foregoing order processing method is implemented.

An electronic device provided by the present disclosure includes a memory, a processor, and a computer program stored in the memory and capable of running on the processor, and the processor implements the foregoing order processing method when the program is executed.

According to the embodiment of the present disclosure, when the order processing is performed for an unassigned order of any dispatcher, the dispatch order of the task points included in the route plan is determined based on the predetermined route plan corresponding to the dispatcher, wherein, The task point is the pickup location and/or delivery location of the unassigned order included in the route plan. Then, according to the determined delivery sequence of the task points, the task points corresponding to the same unassigned order are divided into the same task package, and the task points included in the path plan are divided into several task packages. Finally, select a number of task packages from the divided task packages, and perform order processing on the unassigned orders corresponding to the task points in the selected task packages. When performing order processing, no single order is the processing object, but a number of task packages are determined according to the degree of order of each unassigned order, and the unassigned orders corresponding to the task points in the task package are used as order processing Object. By dividing the task package, taking several coupled orders as a whole, considering whether the task package is suitable for order pressing, and determining whether the task package is processed or assigned to the dispatcher. It avoids the occurrence of unreasonable order-pressing situations due to individual consideration of whether it is suitable for order-pressing for each order without considering the coupling between orders. Improve the efficiency of distribution.

Description of the drawings

FIG. 1 is a flowchart of a method for processing orders according to an embodiment of the disclosure;

2 is a schematic diagram of path planning provided by an embodiment of the disclosure;

FIG. 3a is a schematic diagram of marking task points according to an embodiment of the disclosure;

FIG. 3b is a schematic diagram of task package division provided by an embodiment of the disclosure;

FIG. 4 is a block diagram of a single processing device provided by an embodiment of the disclosure;

Fig. 5 is a block diagram of an electronic device provided by an embodiment of the disclosure.

Detailed ways

In order to make the objectives, technical solutions, and advantages of the present disclosure clearer, the technical solutions of the present disclosure will be described clearly and completely in conjunction with specific embodiments of the present disclosure and the corresponding drawings. Obviously, the described embodiments are only a part of the embodiments of the present disclosure, rather than all the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by those of ordinary skill in the art without creative work shall fall within the protection scope of the present disclosure.

In take-out delivery, because the deliverer encounters uncertain factors in the actual delivery process (for example, the deliverer did not deliver the order according to the planned route, the merchant failed to prepare the delivery on time, due to traffic jams, the delivery speed did not reach the expected value, etc. Etc.), which may lead to changes in the matching degree between the order and the dispatcher, affecting the delivery efficiency and user experience. In order to reduce the impact of uncertain factors, each time the platform dispatches an order (that is, when the order is assigned to the dispatcher), it can target orders with high uncertain factors, orders with unsatisfactory matching, and small impact Order, execute the order processing. Generally, order processing is to perform order processing for a single order that meets the processing conditions for order processing, that is, to consider whether a single order is suitable for order processing. Due to the complicated handling of orders, considering the ordering of a single order alone will lead to unreasonable order suppression, which will lead to a decrease in delivery efficiency.

Hereinafter, some embodiments of the present disclosure will be described in detail with reference to the accompanying drawings.

FIG. 1 is a flow chart of a method for processing orders according to an embodiment of the disclosure. The method may include steps S102-S108.

S102: For any dispatcher, obtain a predetermined path plan corresponding to the dispatcher.

In the present disclosure, the takeaway delivery platform may determine the assignment relationship between the unassigned order and the dispatcher according to the determined path plan corresponding to the dispatcher. Before assigning an unassigned order to a dispatcher, the unassigned order needs to be processed in order to distribute each unassigned order more reasonably, and improve the delivery efficiency and the delivery experience of the dispatcher. Usually, the order processing process is executed on the server of the takeaway delivery platform. Therefore, the present disclosure also takes the server as the execution subject of the order processing process as an example for description.

Route planning usually includes the following data: the delivery location and pickup location of the unassigned order, so that the delivery person can determine how to deliver the delivery.

The estimated waiting time corresponding to the unassigned order, that is, based on the predicted time for the dispatcher to arrive at the merchant and the predicted time for the merchant to prepare the delivery, the obtained dispatcher needs to wait for the estimated waiting time for the merchant to prepare the delivery.

The estimated delivery time of the unassigned order, that is, the estimated time that the shipper will actually arrive at the user when the delivery task is performed.

The promised delivery time of an unassigned order is the delivery time of the delivery promised to the user by the platform after receiving the user's order (for example, if the delivery is promised within half an hour, then half an hour after the user places the order is the promised delivery time ),and many more.

The server can obtain a predetermined route plan corresponding to the dispatcher for any dispatcher who has not been assigned an order. Usually, if the shipper still has uncompleted orders, the delivery location of the uncompleted orders needs to be considered when determining the route planning of the shipper. Therefore, the route planning can also include Various data corresponding to the shipper’s order.

2 is a schematic diagram of the path planning of a certain shipper X determined by the server according to an embodiment of the present disclosure, where the triangle represents the delivery location, the circle represents the pickup location, and the dark-colored graphic represents the delivery location assigned to the shipper X. For orders, the light-colored graphics indicate the unassigned orders that have a high degree of matching with the shipper X, but have not been assigned to the shipper X. The graphics containing the same number correspond to the same order. It can be seen that among the orders that have been assigned to shipper X, the shipper X has already taken the delivery of order 1 and is on the way to deliver the delivery of order 1.

S104: Determine the delivery sequence of the task points included in the path plan, where the task points are the pickup locations and/or delivery locations of the unassigned orders included in the path plan.

In the present disclosure, the server can divide each unassigned order with coupling among the unassigned orders into a task package based on the unassigned orders included in the path plan and according to the coupling between the unassigned orders. In order to determine the unassigned orders corresponding to the task points in the task packages that need to be processed for order processing in the subsequent steps, the divided task packages are the objects of the order processing. The coupling between unassigned orders is related to the delivery order of the task points corresponding to each unassigned order in the route planning, so the server can first determine the delivery order of the task points included in the route planning, where the task points are in the route planning Contains the pickup location and/or delivery location of the unassigned order. In other words, in the present disclosure, the task point can be either a pick-up location for an unassigned order or a delivery location for an unassigned order.

Specifically, the server may determine the pickup location and delivery location of each unassigned order included in the route plan corresponding to the dispatcher, such as the light-colored triangle and the light-colored circle as shown in FIG. 2. Since the pickup location and the delivery location are both task points, the server can determine the delivery order of each task point according to the path plan.

S106: According to the determined delivery order of the task points, the task points corresponding to the same unassigned order are divided into the same task package, and the task points included in the path plan are divided into several task packages.

In the present disclosure, after the server determines the delivery order of each task point, the task points corresponding to the same unassigned order can be divided into the same task package to divide the determined task points into several task packages.

Specifically, the server may first determine the last task point that is not divided into the task package as the first designated task point according to the delivery order of each task point determined in step S104 from morning to night.

Secondly, according to the delivery order of each task point from late to early, the second designated task point is searched from the first designated task point. Wherein, when searching for the second designated task point, the server may determine the second designated task point in a manner that the number of pickup locations and delivery locations from the first designated task point to the second designated task point are the same.

Finally, the task points from the first designated task point to the second designated task point are divided into a task package. Then re-determine the first designated task point and re-search for the second designated task point until all the task points are divided into task packages.

For example, first, the server can mark the task point belonging to the delivery location in the route planning as -1, and the task point belonging to the pickup location as 1, which is used to determine how to determine the pickup location and the quantity of the delivery location. the same. As shown in FIG. 3a, FIG. 3a is a schematic diagram of marking based on each task point in FIG. 2 provided by an embodiment of the disclosure.

Then, because the task points are marked, the sum of the values of the delivery position and the pickup position of an unassigned order corresponding to the task points' marks is 0. In order to improve delivery efficiency, the delivery process of the distributor generally does not take the delivery of an order, then send the delivery of this order to the user, and then take the delivery of the next order, but may be separately on the road After taking the delivery items of several orders, they will be delivered separately. Therefore, in order to divide the task package reasonably, the point to divide the task package can be determined according to the tag value of the task point.

Specifically, according to the delivery order of each task point from late to early, the second designated task point is searched from the last task point that is not divided into the task package. Among them, the last task point that is not divided into the task package is the first designated task point, and it is the last task point in Figure 3a. Since the task points belonging to the meal delivery location and the meal pickup location are marked differently, and the sum of the marked values of the task points of the same number of meal delivery locations and meal pickup locations is 0, if the first designated task point When the number of the pick-up location and the delivery location to the second designated task point is different, the cumulative result is not 0. Therefore, the server can accumulate the tag value of the task point according to the delivery order of the task point from late to early, starting from the first designated task point, and determine the second designated task point (that is, when the accumulated result is 0). The task point whose cumulative result is 0 is determined as the second designated task point), at this time, the number of pick-up locations and delivery locations from the first designated task point to the second designated task point is the same.

FIG. 3b is a schematic diagram of determining the first and second designated task points provided by an embodiment of the disclosure. Among them, the thick arrow represents the process of continuously determining the first designated task point and the second designated task point. The sum of the marked values of the task points in the dashed box is 0, so each dashed box corresponds to a task package.

S108: Select several task packages from the divided task packages, and perform order processing on unassigned orders corresponding to the task points in the selected task packages.

In the present disclosure, after determining each task package, the server can select a number of task packages, and perform order processing on unassigned orders corresponding to the task points in the selected task packages.

Specifically, because the unassigned orders corresponding to the task points in the task package have the order of delivery, the task package also has a corresponding delivery order. The server can determine whether each task package conforms to the order of delivery from late to early. The order processing conditions are pressed, and the first task package that does not meet the order processing conditions is determined as a marked package. Finally, the unassigned orders corresponding to the task points in the task package whose delivery sequence is later than the marked package are selected for order processing, and the unassigned orders corresponding to the task points in the remaining task packages are assigned to the dispatcher.

In the present disclosure, after each task package is determined, each task package can be used as the object of the order processing, and for each task package, it is determined whether the task package meets the order processing conditions. Since the order of delivery exists for the task points in each task package, the order of delivery also exists between each task package.

Order processing is usually to order orders that need to be delivered later, so that there will be no delay in delivery, so the server can determine the divided tasks according to the delivery order of each unassigned order of the shipper The delivery order of the package.

For example, suppose that each unassigned order of shipper X is divided into three task packages, as shown in Table 1.

Table 1

According to the delivery order of the task points contained in the task package I, the task package II and the task package III, the delivery order of each task package can be determined as the first delivery task package I, then the task package II, and finally the task package III.

In addition, in some embodiments of the present disclosure, the single processing condition may include at least one of the following three types.

The first order processing condition: whether each unassigned order corresponding to the task point in the task package is less than the preset first threshold for the time elapsed since the user placed the order. If so, the task package meets the order processing conditions , Continue to judge the next task package, if not, the unassigned order corresponding to the task point in the task package whose delivery sequence is later than that of the task package is processed, and the task points in the remaining task package are corresponding to the unassigned orders. Assign the order to the shipper. Wherein, if the elapsed time after the user places an order is short (ie, does not exceed the preset first threshold), it indicates that the delivery time of the unassigned order is relatively sufficient, and the delivery can be suspended (that is, the order processing can be performed).

The second order processing condition: the estimated waiting time of the unassigned order corresponding to the task point with the earliest delivery order in the task package exceeds the preset second threshold. Among them, according to the delivery order of the task points in the task package, determine the unassigned order corresponding to the task point with the earliest delivery order, and then determine the expected waiting time according to the determined order content of the unassigned order, and finally determine whether the expected waiting time is If the second threshold is exceeded, if yes, determine that the task package meets the order processing conditions, and continue to judge the next task package; if not, the delivery order is later than the unassigned order corresponding to the task point in the task package of the task package Perform order processing and assign the unassigned orders corresponding to the task points in the remaining task packages to the shipper. Among them, the estimated waiting time is the time determined according to the route plan corresponding to the delivery person to wait for the delivery item from the merchant after the delivery person arrives at the merchant (for example, the time that the delivery person needs to wait for the restaurant to eat after arriving at the restaurant) ), if the time is too long, it will reduce the delivery efficiency of the distributor, so the order can be processed.

The third order processing condition: the estimated waiting time for each unassigned order corresponding to the task point in the task package exceeds the preset third threshold, and the expected delivery time for each unassigned order corresponding to the task point is all Earlier than the promised delivery time. For each unassigned order corresponding to the task point in the task package, the server can determine whether the estimated waiting time corresponding to the unassigned order exceeds the preset third threshold, and determine whether the estimated delivery time of the unassigned order is earlier than The delivery time is promised. If the judgment result is yes, it is determined that the task package meets the order processing conditions, and the next task package is judged. If any judgment result is no, the delivery order will be later than that of the task package. The unassigned orders corresponding to the task points in the task package are processed, and the unassigned orders corresponding to the task points in the remaining task packages are assigned to the dispatcher. Among them, the estimated delivery time is the time predicted by the server to deliver the order's delivery to the delivery location, and the promised delivery time is the latest time that the deliverer promises to the user to arrive at the delivery location. For each task package, if the delivery time of each unassigned order corresponding to the task point in the task package is earlier than the promised time, it means that if the task point in the task package corresponds to each unassigned order All orders are postponed to be assigned to the shipper, and the delivery efficiency and user experience will not be affected, so the order can be processed.

The above three order processing conditions provided in this disclosure can be used alone, for example, as long as one condition is met, order processing can be carried out, or they can be used in combination, for example, two or three of them need to be met at the same time. Only one of them can be used as the order processing condition, which is not limited in the present disclosure. In addition, the first threshold, the second threshold, and the third threshold can be set as required, and the present disclosure does not limit it.

According to the embodiment of the present disclosure, when the order processing is performed for an unassigned order of any dispatcher, the dispatch order of the task points included in the route plan is determined based on the predetermined route plan corresponding to the dispatcher, wherein, The task point is the pickup location and/or delivery location of the unassigned order included in the route plan. Then, according to the determined delivery sequence of the task points, the task points corresponding to the same unassigned order are divided into the same task package, and the task points included in the path plan are divided into several task packages. Finally, select a number of task packages from the divided task packages, and perform order processing on the unassigned orders corresponding to the task points in the selected task packages. When processing the order, no single order is the processing object, but according to the degree of order of each unassigned order, several task packages are determined, and the task package is the object of the order processing. It avoids the occurrence of unreasonable order-pressing situations caused by considering whether it is suitable for order-pressing for each order separately without considering the relationship between orders.

In addition, in step S106 of the present disclosure, the interference between the task packages divided by this task package division method is small, that is, the order processing of any task package will not affect the correspondence of other task packages. The delivery route. Conversely, for each task package, if any order in the task package is processed, it will affect the distribution path corresponding to each order in the task package. Or, the task package after the division can be regarded as dividing the delivery route of the distributor into several road sections that have no mutual influence. Each road section moving out of the delivery route of the distributor will not cause the distributor Detour, and once the order within each section changes, it may cause the delivery person to detour during delivery.

The present disclosure is not limited to only dividing the task package in the manner described in step S106. As long as it conforms to the order processing of any task package, it will not affect the distribution path corresponding to other task packages, and the server can also use other methods to divide task packages. For example, first, determine the delivery sequence of the pickup location and delivery location of each unassigned order in the route planning. After that, it is determined whether the pick-up location of the unassigned order delivered last is included between the pick-up location and the delivery location of any unassigned order. If yes, according to the sequence in the route plan, start from the pick-up location and look forward to determine that the pick-up location does not include any unassigned orders between the pick-up location and the delivery location of any unassigned order, and the delivery sequence The pick-up location and delivery location corresponding to each unassigned order not earlier than the determined unassigned order are divided into a task package, and the search is continued according to the delivery order from late to early until the unassigned orders are divided complete. If not, it is determined that each unassigned order that has not been divided cannot be further divided, and the remaining undivided orders can be determined as the pick-up location and delivery location in the same task package.

Further, when the server selects the task package in step S108, it can also select the task package that meets the order processing conditions from the divided task packages based only on the order processing conditions, that is, as long as there is a task package that meets the order processing conditions, For the task package of the processing condition, the unassigned order corresponding to the task point in the task package is processed without considering the delivery order of each task package.

Based on the order processing method shown in FIG. 1, the embodiment of the present disclosure also correspondingly provides an order processing device.

Fig. 4 is a block diagram of a single processing device provided by an embodiment of the disclosure. The device includes:

The obtaining module 200, for any dispatcher, obtains a predetermined route plan corresponding to the dispatcher;

The determining module 202 determines the delivery sequence of the task points included in the path plan, where the task points are the pickup locations and/or delivery locations of the unassigned orders included in the path plan;

The dividing module 204 divides the task points included in the path plan into several task packages by dividing the task points corresponding to the same unassigned order into the same task package according to the determined delivery sequence of the task points;

The execution module 206 selects several task packages from the divided task packages, and performs order processing on unassigned orders corresponding to the task points in the selected task packages.

Optionally, the division module 202 is configured to perform the following operations: according to the delivery sequence of the task points from morning to night in the route planning, determine the last task point that is not divided into the task package as the first designated task point ; According to the delivery sequence of task points from late to early in the path planning, search for a second designated task point starting from the first designated task point, wherein, from the first designated task point to the second designated task The number of pick-up locations and delivery locations are the same; the task points from the first designated task point to the second designated task point are divided into a task package; the above operations are repeated until all task points are divided into tasks So far.

Optionally, the execution module 206 is configured to: determine the delivery order of the divided task packages according to the determined delivery order of the task points; determine that the order processing conditions are not met according to the delivery order of the divided task packages The task package with the latest delivery sequence among the task packages is used as the marked package; the task package with the delivery sequence later than the marked package is selected.

Optionally, the execution module 206 is configured to select a task package that meets the order processing condition from the divided task packages.

Optionally, the order processing conditions include at least one of the following: each unassigned order corresponding to the task point in the task package has a time elapsed since the user placed an order that is less than a preset first threshold; delivery in the task package The estimated waiting time of the unassigned order corresponding to the task point with the earliest sequence exceeds the preset second threshold; and the estimated waiting time of each unassigned order corresponding to the task point in the task package exceeds the preset third threshold, and the task point The estimated delivery time corresponding to each unassigned order is earlier than the promised delivery time.

The embodiment of the present disclosure also provides a computer-readable storage medium, the storage medium stores a computer program, and the computer program can be used to execute the order processing method provided by the above-mentioned embodiment.

Based on the single processing method shown in FIG. 1, an embodiment of the present disclosure also provides an electronic device. As shown in FIG. 5, the electronic device may include a processor, an internal bus, a network interface, a memory and a non-volatile memory, and may also include hardware required for other services. The processor reads the corresponding computer program from the non-volatile memory into the memory and then runs it, so as to implement the single processing method provided by the above-mentioned embodiment.

In addition to the software implementation, the present disclosure does not exclude other implementations, such as logic devices or a combination of software and hardware, etc. That is to say, the execution body of the processing flow is not limited to each logic unit, and can also be hardware or logic. Device.

The systems, devices, modules, or units illustrated in the above embodiments may be specifically implemented by computer chips or entities, or implemented by products with certain functions. A typical implementation device is a computer. Specifically, the computer may be, for example, a personal computer, a laptop computer, a cell phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or Any combination of these devices.

For the convenience of description, when describing the above device, the functions are divided into various units and described separately. Of course, when implementing the present disclosure, the functions of each unit may be integrated into the same one or more software and/or hardware.

Those skilled in the art should understand that the embodiments of the present disclosure can be provided as methods, systems, or computer program products. Therefore, the present disclosure may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present disclosure may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes.

The present disclosure is described with reference to flowcharts and/or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present disclosure. It should be understood that each process and/or block in the flowchart and/or block diagram, and the combination of processes and/or blocks in the flowchart and/or block diagram can be implemented by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing equipment to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing equipment are generated It is a device that implements one or more processes in the flowchart and/or one or more blocks in the block diagram.

These computer program instructions can also be stored in a computer-readable memory that can guide a computer or other programmable data processing equipment to work in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture including the instruction device. The device implements the functions specified in one or more processes in the flowchart and/or one or more blocks in the block diagram.

These computer program instructions can also be loaded on a computer or other programmable data processing equipment, so that a series of operation steps are executed on the computer or other programmable equipment to produce computer-implemented processing, so as to execute on the computer or other programmable equipment. The instructions provide steps for implementing functions specified in one or more processes in the flowchart and/or one or more blocks in the block diagram.

In a typical configuration, the computing device includes one or more processors (CPU), input/output interfaces, network interfaces, and memory.

The memory may include non-permanent memory in computer readable media, random access memory (RAM) and/or non-volatile memory, such as read-only memory (ROM) or flash memory (flash RAM). Memory is an example of computer readable media.

Computer-readable media include permanent and non-permanent, removable and non-removable media, and information storage can be realized by any method or technology. The information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, magnetic cartridge Tape, magnetic tape, magneto-disk storage or other magnetic storage devices or any other non-transmission media can be used to store information that can be accessed by computing devices. According to the definition in this article, computer-readable media does not include transitory media, such as modulated data signals and carrier waves.

It should also be noted that the terms "include", "include" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, product or equipment including a series of elements not only includes those elements, but also includes Other elements that are not explicitly listed, or include elements inherent to this process, method, commodity, or equipment. If there are no more restrictions, the element defined by the sentence "including a..." does not exclude the existence of other identical elements in the process, method, commodity or equipment that includes the element.

The present disclosure may be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. The present disclosure can also be practiced in distributed computing environments, in which tasks are performed by remote processing devices connected through a communication network. In a distributed computing environment, program modules can be located in local and remote computer storage media including storage devices.

The various embodiments in the present disclosure are described in a progressive manner, and the same or similar parts between the various embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, as for the system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and for related parts, please refer to the part of the description of the method embodiment.

The above are only the embodiments of the present disclosure, and are not used to limit the present disclosure. For those skilled in the art, the present disclosure can have various modifications and changes. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present disclosure should be included in the scope of the claims of the present disclosure.

Claims

An order processing method, including:

For any dispatcher, obtain the predetermined route plan corresponding to the dispatcher;

Determining the delivery sequence of task points included in the path plan, where the task points are the pick-up locations and/or delivery locations of unassigned orders included in the path plan;

According to the determined delivery sequence of the task points, the task points included in the path plan are divided into several task packages by dividing the task points corresponding to the same unassigned order into the same task package;

Select several task packages from the divided task packages, and perform order processing on unassigned orders corresponding to the task points in the selected task packages.
The method according to claim 1, wherein, according to the determined delivery sequence of the task points, the task points corresponding to the same unassigned order are divided into the same task package, and the tasks included in the route plan are divided The points are divided into several task packages, including the following operations:

According to the delivery order of the task points from morning to night in the path plan, determine the last task point that is not allocated to the task package as the first designated task point;

According to the delivery sequence of the task points from late to early in the route plan, the second designated task point is searched from the first designated task point, wherein, from the first designated task point to the second designated task point The number of pick-up locations and delivery locations at the task point is the same;

Dividing the task points from the first designated task point to the second designated task point into a task package;

Repeat the above operations until all the task points are divided into task packages.
8. The method of claim 1, wherein selecting several task packages from the divided task packages comprises:

Determine the delivery order of the divided task packages according to the delivery order of the determined task points;

According to the delivery sequence of the divided task packages, determine the task package with the latest delivery sequence among the task packages that do not meet the order processing conditions as the marked package;

Select the task package whose delivery sequence is later than the marked package.
8. The method of claim 1, wherein selecting several task packages from the divided task packages comprises:

Select a task package that meets the order processing condition from the divided task packages.
The method according to claim 3 or 4, wherein the order processing conditions include at least one of the following:

The elapsed time of each unassigned order corresponding to the task point in the task package from the user placing the order is less than the preset first threshold;

The estimated waiting time of the unassigned order corresponding to the task point with the earliest delivery sequence in the task package exceeds the preset second threshold; and

The expected waiting time for each unassigned order corresponding to the task point in the task package exceeds the preset third threshold, and the expected delivery time for each unassigned order corresponding to the task point is earlier than the promised delivery time. Up to time.
A bill processing device, including:

The acquisition module, for any dispatcher, acquires the predetermined route plan corresponding to the dispatcher;

The determining module determines the delivery sequence of the task points included in the path plan, where the task points are the pick-up locations and/or delivery locations of the unassigned orders included in the path plan;

The dividing module divides the task points included in the path plan into several task packages by dividing the task points corresponding to the same unassigned order into the same task package according to the determined delivery sequence of the task points;

The execution module selects several task packages from the divided task packages, and performs order processing on unassigned orders corresponding to the task points in the selected task packages.
7. The apparatus of claim 6, wherein the dividing module is configured to perform the following operations:

According to the delivery order of the task points from morning to night in the path plan, determine the last task point that is not allocated to the task package as the first designated task point;

According to the delivery sequence of the task points from late to early in the route plan, the second designated task point is searched from the first designated task point, wherein, from the first designated task point to the second designated task point The number of pick-up locations and delivery locations at the task point is the same;

Dividing the task points from the first designated task point to the second designated task point into a task package;

Repeat the above operations until all the task points are divided into task packages.
7. The apparatus of claim 6, wherein the execution module is configured to:

Determine the delivery order of the divided task packages according to the delivery order of the determined task points;

According to the delivery sequence of the divided task packages, determine the task package with the latest delivery sequence among the task packages that do not meet the order processing conditions as the marked package;

Select the task package whose delivery sequence is later than the marked package.
7. The device according to claim 6, wherein the execution module is configured to select a task package that meets the order processing condition from the plurality of divided task packages.
The device according to claim 8 or 9, wherein the order processing conditions include at least one of the following:

The elapsed time of each unassigned order corresponding to the task point in the task package from the user placing the order is less than the preset first threshold;

The estimated waiting time of the unassigned order corresponding to the task point with the earliest delivery sequence in the task package exceeds the preset second threshold; and

The expected waiting time for each unassigned order corresponding to the task point in the task package exceeds the preset third threshold, and the expected delivery time for each unassigned order corresponding to the task point is earlier than the promised delivery time. Up to time.
A computer-readable storage medium, the storage medium stores a computer program, and when the computer program is executed by a processor, the order processing method according to any one of claims 1-5 is realized.
An electronic device including a memory and a processor, in which,

A computer program is stored on the memory, and the computer program can be executed by a processor to realize the order processing method according to any one of claims 1-5.