KR20230164998A - Method for processing order and apparatus thereof - Google Patents

Abstract

This disclosure relates to a method and device for processing orders. An order processing method according to some embodiments of the present disclosure includes the steps of: identifying a new order including pickup location information; based on the pickup location information, an order processing method performed by an electronic device; Determining an order allocation pool including 1 terminal and a second terminal that is in a delivery state and in a state to complete a pre-assigned order within a first threshold time, according to the status information of each of the plurality of terminals included in the order allocation pool. Based on the step of determining a first temporary assignment terminal matching the new order among the plurality of terminals, and based on the status information of the first temporary assignment terminal, assigning the new order to one of the plurality of terminals It may include steps.

Description

Method and device for processing an order {METHOD FOR PROCESSING ORDER AND APPARATUS THEREOF}

This disclosure relates to a method and device for processing orders. More specifically, it relates to a method for efficiently assigning new orders to delivery performers and a device for performing the method.

As non-face-to-face services expand due to various environmental factors, the size of the delivery service market is growing rapidly. In line with this growth, operators of platforms that provide delivery services are making various efforts to expand the users of their platforms. As part of these efforts, platform operators are lowering the access threshold for delivery services and diversifying their platforms so that consumers can sometimes perform the role of delivery performers.

In order to ensure the continued growth of the delivery service market, the platform operator needs to create a platform that can satisfy each entity participating in the delivery service. As an example, there is a need for technology to efficiently process the allocation of new orders so that each entity participating in the delivery service can be satisfied.

The technical problem to be solved through some embodiments of the present disclosure is to provide a method for efficiently allocating new orders and a device for performing the method.

Other technical problems to be solved through some embodiments of the present disclosure include providing rapid delivery to consumers, providing rapid delivery allocation to suppliers, and providing appropriate delivery allocation opportunities to delivery performers through efficient allocation of new orders. To provide a method for providing and a device for performing the method.

Another technical problem to be solved through some embodiments of the present disclosure is to provide a method for activating a platform providing a delivery service and a device for performing the method.

The technical problems of the present disclosure are not limited to the technical problems mentioned above, and other technical problems not mentioned can be clearly understood by those skilled in the art from the description below.

In order to solve the above technical problem, an order processing method according to some embodiments of the present disclosure includes the steps of: identifying a new order including pickup location information, the pickup location information; Based on this, determining an order allocation pool including a first terminal in an idle state and a second terminal in a delivery state and in a state to complete a previously assigned order within a first threshold time, including the order allocation pool Based on the status information of each of the plurality of terminals, determining a first temporary assignment terminal matching the new order among the plurality of terminals, and based on the status information of the first temporary assignment terminal, placing the new order It may include a step of assigning to one of a plurality of terminals.

In some embodiments, the step of determining the order allocation pool includes excluding from the order allocation pool a terminal located at a location exceeding a reference distance from the pickup location of the new order, based on the pickup location information. can do.

In some embodiments, the step of determining the order allocation pool includes calculating a remaining completion time of the order already assigned to the second terminal, and if the remaining completion time is less than or equal to the first threshold time, the second terminal It may include the step of including the terminal in the order allocation pool. Here, the step of calculating the remaining completion time includes calculating the remaining completion time based on the location of the second terminal and the delivery location information of the pre-assigned order, or the location of the second terminal, It may include calculating the remaining completion time based on delivery location information of the previously assigned order and pickup location information of the new order. Also, here, calculating the remaining completion time may include calculating the remaining completion time based on a delivery means corresponding to the second terminal.

In some embodiments, the status information includes order assignment status, location, delivery method, remaining completion time for previously assigned orders, expected pickup time for the new order, order assignment rejection rate, number of completed orders, order assignment waiting time, and The information may include at least one of the online access times of the order assignment application. Here, the step of determining the first temporarily assigned terminal determines one of the plurality of terminals as the first temporarily assigned terminal based on the calculation of an item included in the status information and a weight corresponding to the item. It may include steps.

In some embodiments, the step of determining the first temporarily assigned terminal includes calculating the expected pickup time for each of the plurality of terminals and determining the terminal with the earliest expected pickup time as the first temporarily assigned terminal. May include steps. Here, the step of calculating the expected pickup time includes calculating the expected pickup time based on the location of the first terminal and pickup location information of the new order, the location of the second terminal, and the location of the previously assigned order. It may include calculating the expected pickup time based on delivery location information and pickup location information of the new order.

In some embodiments, the step of assigning the new order to one of the plurality of terminals includes immediately assigning the new order to the first terminal when the first terminal is determined to be the first temporary assignment terminal. may include.

In some embodiments, the step of assigning the new order to one of the plurality of terminals includes, when the second terminal is determined to be the first temporary assignment terminal, the previously assigned order in a subsequent assignment execution section. Determining whether or not the assignment is complete - the allocation execution interval is a time interval for determining whether allocation of the new order is possible at each second critical time interval, and the second critical time is a time interval shorter than the first critical time. Lim -, when the previously assigned order is determined to be complete, the new order is immediately assigned to the second terminal, and when the previously assigned order is determined to be incomplete, a second temporary order is selected among the plurality of terminals that matches the new order. It may include determining an allocation terminal and assigning the new order to one of the plurality of terminals based on status information of the second temporary allocation terminal. Here, the step of determining the second temporary allocation terminal includes updating the order allocation pool to correspond to a section during the subsequent allocation execution, and determining the second temporary allocation terminal in the updated order allocation pool. May include steps. Also, here, the step of determining the second temporary allocation terminal includes determining that the second terminal is the second temporary allocation terminal, and the previously allocated order is a third threshold time that is a time interval longer than the first threshold time. If it is not determined to be complete within, it may include the step of determining a terminal other than the second terminal among the plurality of terminals as a third temporary assignment terminal, based on the status information of the second temporary assignment terminal, The step of assigning the new order to one of the plurality of terminals may include assigning the new order to one of the plurality of terminals, based on status information of the third temporary assignment terminal. At this time, the third threshold time may be a time period variably determined based on status information of the second terminal. Also, here, based on the status information of the second temporary allocation terminal, the step of allocating the new order is repeated for each section during subsequent allocation execution until the allocation of the new order is completed, and the predetermined temporary allocation is repeated for each section. It may include the step of determining whether an order for a terminal has been completed and determining a new temporarily assigned terminal.

In some embodiments, the step of assigning the new order includes, if the assignment of the new order is rejected from the terminal to which the new order is assigned, from the order allocation pool excluding the terminal to which the new order is assigned, to the new order. It may include determining a matching fourth temporary assignment terminal and assigning the new order based on status information of the fourth temporary assignment terminal.

In some embodiments, the first threshold time may be a time period that is variably determined based on the attributes of the new order.

An electronic device according to some embodiments of the present disclosure includes a processor, a network interface, a memory, and a computer program loaded into the memory and executed by the processor, wherein the computer program includes pickup location information. Instructions for identifying a new order to be placed, based on the pickup location information, comprising a first terminal in an idle state and a second terminal in a delivery state and in a state to complete a pre-assigned order within a first threshold time. An instruction for determining an order allocation pool, an instruction for determining a first temporary allocation terminal matching the new order among the plurality of terminals, based on status information of each of a plurality of terminals included in the order allocation pool, and the first Based on the status information of the temporary assignment terminal, it may include an instruction for assigning the new order to one of the plurality of terminals.

In some embodiments, the status information includes order assignment status, location, delivery method, remaining completion time for previously assigned orders, expected pickup time for the new order, order assignment rejection rate, number of completed orders, order assignment waiting time, and The information may include at least one of the online access times of the order assignment application.

According to some embodiments of the present disclosure, allocation of new orders can be streamlined.

According to some embodiments of the present disclosure, by improving the allocation efficiency of new orders, it is possible to provide rapid delivery to consumers, allocation of rapid delivery to suppliers, and opportunity to allocate appropriate deliveries to delivery performers.

According to some embodiments of the present disclosure, the convenience of each entity participating in the delivery service can be increased through the efficiency of allocation of new orders, and the platform access time of each entity can be improved due to the increase in convenience.

According to some embodiments of the present disclosure, it is possible to induce the inflow of new users by improving the allocation efficiency of new orders.

The effects according to the technical idea of the present disclosure are not limited to the effects mentioned above, and other effects not mentioned may be clearly understood by those skilled in the art from the description of the specification.

1 illustrates an example environment in which electronic devices according to some embodiments of the present disclosure may be applied.
2 illustrates an example computing device that can implement various devices in accordance with some embodiments of the present disclosure.
3 is an example flowchart illustrating an order processing method according to some embodiments of the present disclosure.
Figures 4 and 5 are exemplary diagrams to explain in more detail the decision operation of the order allocation pool described with reference to Figure 3.
FIG. 6 is an exemplary flowchart for explaining detailed operations of the decision operation of the order allocation pool shown in FIG. 3.
FIG. 7 is an exemplary flowchart for explaining detailed operations of the remaining completion time calculation operation shown in FIG. 6.
Figures 8 to 10 are exemplary diagrams to explain in more detail the decision operation of the temporary assignment terminal described with reference to Figure 3.
FIG. 11 is an exemplary flowchart for explaining the detailed operation of the decision operation of the temporary assignment terminal shown in FIG. 3.
FIG. 12 is an exemplary flowchart for explaining detailed operations of the new order assignment operation shown in FIG. 3.

Embodiments of the present disclosure are illustrated for the purpose of explaining the technical idea of the present disclosure. Accordingly, the scope of rights according to the present disclosure is not limited to the embodiments presented below or the specific description of these embodiments.

All technical terms and scientific terms used in this disclosure, unless otherwise defined, have meanings commonly understood by those skilled in the art to which this disclosure pertains. All terms used in this disclosure are selected for the purpose of more clearly explaining this disclosure and are not selected to limit the scope of rights according to this disclosure.

Expressions such as “comprising,” “comprising,” “having,” and the like used in the present disclosure are open terms that imply the possibility of including other embodiments, unless otherwise stated in the phrase or sentence containing the expression. It should be understood as (open-ended terms).

The singular forms described in this disclosure may include plural forms unless otherwise stated, and this also applies to the singular forms recited in the claims. Additionally, expressions such as “first” and “second” used in the present disclosure are used to distinguish a plurality of components from each other and do not limit the order or importance of the components.

The term “unit” used in this disclosure refers to software or hardware components such as a field-programmable gate array (FPGA) or an application specific integrated circuit (ASIC). However, the “unit” is not limited to hardware and software, and the “unit” may be configured to reside in an addressable storage medium and may be configured to reproduce on one or more processors. Thus, as examples of what "part" can mean, "part" includes components such as software components, object-oriented software components, class components, and task components, processors, functions, and properties. , procedures, subroutines, segments of program code, drivers, firmware, microcode, circuits, data, databases, data structures, tables, arrays, and variables. Additionally, functions provided within components and “parts” may be combined into smaller numbers of components and “parts” or may be further separated into additional components and “parts”.

As used in this disclosure, the expression "based on" is used to describe one or more factors that influence the act or action of decision, judgment, or action described in the phrase or sentence containing the expression, and this expression It does not exclude additional factors that may influence the decision, act or action of judgment.

In the present disclosure, when a component is expressed as being “connected” or “connected” to another component, it means that the component can be directly connected or connected to another component, or to form another new component. It should be understood as something that can be connected or connected through elements.

The term "artificial intelligence (AI)" used in this disclosure refers to technology that imitates human learning ability, reasoning ability, and perception ability and implements this with a computer, and includes the concepts of machine learning and symbolic logic. It can be included. Here, “machine learning (ML)” may be an algorithmic technology that automatically classifies or learns the characteristics of input data. Specifically, artificial intelligence is a machine learning algorithm that can analyze input data, learn the results of the analysis, and make judgments or predictions based on the results of the learning. Additionally, technologies that mimic the cognitive and judgment functions of the human brain using machine learning algorithms can also be understood as the category of artificial intelligence. For example, it may include technical fields such as verbal understanding, visual understanding, reasoning/prediction, knowledge representation, and motion control.

The term “machine learning” used in this disclosure may refer to the process of training a neural network model using experience processing data. Such machine learning can mean that computer software improves its own data processing capabilities. Here, the “neural network model” is constructed by modeling the correlation between data, and the correlation can be expressed by a plurality of parameters. This neural network model extracts and analyzes features from given data to derive correlations between data. Repeating this process to optimize the parameters of the neural network model can be called machine learning. For example, a neural network model can learn the mapping (correlation) between input and output for data given as input-output pairs. Alternatively, a neural network model may learn the relationships by deriving regularities between given data even when only input data is given.

The terms “artificial intelligence learning model,” “machine learning model,” or “neural network model” used in this disclosure may be designed to implement the human brain structure on a computer, and may be designed to simulate the neurons of a human neural network and have weights. It may include a plurality of network nodes having . Here, the “plurality of network nodes” may have a connection relationship with each other by simulating the synaptic activity of neurons sending and receiving signals through synapses. Specifically, in an artificial intelligence learning model, multiple network nodes are located in layers of different depths and can exchange data according to convolutional connection relationships. The artificial intelligence learning model may be, for example, an artificial neural network model, a convolution neural network model, etc., but the scope of the present disclosure is not limited to the examples described above, and various known It should be noted that neural network models may be applied to the present disclosure.

Hereinafter, embodiments of the present disclosure will be described with reference to the attached drawings. In the accompanying drawings, identical or corresponding components are given the same reference numerals. Additionally, in the description of the following embodiments, overlapping descriptions of identical or corresponding components may be omitted. However, even if descriptions of components are omitted, it is not intended that such components are not included in any embodiment.

1 illustrates an example environment in which an electronic device 100 according to some embodiments of the present disclosure may be applied. The exemplary environment to be explained through Figure 1 is an example in which a consumer requests an order, a supplier receives the consumer's order, prepares a product corresponding to the order, and a delivery person picks up the prepared product and delivers it to the consumer. It's about. As shown in Figure 1, each subject participating in the delivery service can communicate various information with each other through their terminals 200a, 200b, 300, and 400, where the electronic device 100 is connected to each subject's terminal ( 200a, 200b, 300, 400) can process various information communicated with each other. Various operations performed by the electronic device 100 and the terminals 200a, 200b, 300, and 400 of each subject will be described in more detail later in the specification.

Meanwhile, Figure 1 shows an example in which two delivery performer terminals 200a and 200b, one consumer terminal 300 and one supplier terminal 400 are linked with the electronic device 100, but this is for convenience of understanding. It is only for this purpose, and the number of each terminal representing the number of subjects participating in the delivery service can vary. In addition, Figure 1 only shows a preferred embodiment for achieving the purpose of the present disclosure, and some components may be added or deleted as needed.

Below, each component shown in FIG. 1 will be described in more detail.

First, the electronic device 100 may identify a new order requested from the consumer terminal 300. Here, various technologies may be referred to in the operation of the electronic device 100 to identify a new order. For example, the electronic device 100 may manage the processing of requested orders by managing them in a list, and may identify orders newly added to the list as new orders. As another example, the electronic device 100 may identify a new order based on identification information included in the order. In addition to the examples described above, various operations for identifying a new order requested from the consumer terminal 300 may be included in the scope of the present disclosure, and all operations may be performed as long as it is a method of identifying a new order to manage subsequent processing of the new order. It should be noted that it may be included within the scope of the present disclosure. In this way, the new order identified by the electronic device 100 may include various information. As a specific example, a new order may include various information about the details of the product ordered by the consumer, the supplier of the product, the pickup location of the product (e.g., the supplier's store), and the delivery location of the product.

Additionally, the electronic device 100 may transmit a new order to the supplier terminal 400 corresponding to the new order based on various information included in the new order. Here, the supplier terminal 400 can receive a new order, and the supplier can confirm the new order and prepare a product corresponding to the new order.

Furthermore, the electronic device 100 may assign a new order to one of the plurality of delivery performer terminals 200a and 200b based on various information included in the new order. Here, the electronic device 100 further considers the status information of each of the plurality of delivery agent terminals 200a and 200b in addition to various information included in the new order, and sends a message to any one of the plurality of delivery agent terminals 200a and 200b. You can also assign new orders. Specifically, in further consideration of the status information of the first terminal 200a in an idle state and the second terminal 200b in a delivery state, a new order is assigned to one of the plurality of delivery performer terminals 200a and 200b. However, to avoid redundant explanation, specific operations by which the electronic device 100 assigns a new order will be described in more detail later with reference to the drawings of FIG. 3 and below. In this way, when a new order is assigned to one of the plurality of delivery agent terminals 200a and 200b, the delivery agent can pick up the product corresponding to the new order at the pickup location and deliver it to the delivery location.

The electronic device 100 described so far with reference to FIG. 1, in addition to the above-described operations, interoperates with the delivery performer terminals 200a and 200b, the consumer terminal 300, and the supplier terminal 400 to process orders. It should be understood that various operations can be performed, and that all operations that can be added or modified from order reception to completion can be performed. However, among the various operations performed by the electronic device 100, the operations of assigning new orders to the delivery performer terminals 200a and 200b will be mainly explained through the description of the specification later, and this will be explained in detail by the electronic device 100 It should be noted that other operations performed by are not excluded from the scope of the present disclosure, but are intended not to obscure the subject matter of the present disclosure.

The electronic device 100 described so far may be implemented with one or more computing devices. For example, all functions of electronic device 100 may be implemented in a single computing device. As another example, the first function of the electronic device 100 may be implemented in a first computing device, and the second function may be implemented in a second computing device. Here, the above-mentioned computing device may be a laptop, a desktop, a laptop, etc., but is not limited thereto and may include all types of devices equipped with a computing function. However, if the electronic device 100 is in an environment where orders must be processed in conjunction with various terminals 200a, 200b, 300, and 400, it may be desirable for the electronic device 100 to be implemented as a high-performance server-class computing device, For an example of such a computing device, refer to the description of FIG. 2.

Next, the delivery performer terminals 200a, 200b, the consumer terminal 300, and the supplier terminal 400 are each terminals (200a, 200b, 300, 400) of each subject participating in the delivery service, and are the electronic devices described above ( 100) can perform the functions provided. For a specific example, the consumer terminal 300 may request an order from the electronic device 100, the supplier terminal 400 may receive the consumer's order from the electronic device 100, and the delivery person terminal 200a, 200b) can be assigned an order. Here, the terminals 200a, 200b, 300, and 400 of each subject may have a web browser or a dedicated application installed in order to use the functions provided by the electronic device 100.

In some embodiments, the dedicated applications provided to the terminals 200a, 200b, 300, and 400 of each subject may have at least some user interfaces implemented differently depending on the properties of each subject. Specifically, the first application used by the delivery performer terminals 200a and 200b, the second application used by the consumer terminal 300, and the third application used by the supplier terminal 400 each have at least one application in accordance with the properties of the subjects. Some user interfaces may be implemented differently.

The terminals 200a, 200b, 300, and 400 of each subject described so far include, for example, a desktop, workstation, laptop, tablet, and smart phone. It may be any one of, but is not limited to, and may include all types of devices equipped with computing functions. For an example of such a computing device, refer to the description of FIG. 2.

In some embodiments, the electronic device 100 and the terminals 200a, 200b, 300, and 400 of each subject may communicate with each other through a network. The aforementioned networks include all types of networks, such as, for example, Local Area Network (LAN), Wide Area Network (WAN), mobile radio communication network, and Wireless Broadband Internet (Wibro). /Can be implemented as a wireless network.

So far, exemplary environments in which the electronic device 100 according to some embodiments of the present disclosure can be applied have been described with reference to FIG. 1 . Hereinafter, an exemplary computing device capable of implementing various devices according to some embodiments of the present disclosure will be described with reference to FIG. 2.

2 illustrates an example computing device 500 that can implement various devices in accordance with some embodiments of the present disclosure. In this way, the computing device 500 shown in FIG. 2 may be understood as an exemplary computing device 500 that can implement the various devices 100, 200a, 200b, 300, and 400 shown in FIG. 1.

As shown in FIG. 2 , computing device 500 may include a processor 510, memory 520, and communication circuit 530. However, since only components related to the embodiment of the present disclosure are shown in FIG. 2, a person skilled in the art to which this disclosure pertains may further include other general-purpose components in addition to the components shown in FIG. 2. I can understand that there is. In addition, it should be noted that each component of the computing device 500 shown in FIG. 2 represents functionally distinct functional elements, and a plurality of components may be implemented in an integrated form in an actual physical environment. do. Furthermore, each component of the computing device 500 shown in FIG. 2 is expressed as a single entity, but each component may be implemented as a plurality of entities (e.g., a set of single entities). You should keep in mind.

At least some of the components within the computing device 500 are connected to each other through a bus, General Purpose Input/Output (GPIO), Serial Peripheral Interface (SPI), or Mobile Industry Processor Interface (MIPI), and provide data and/or signals can be exchanged. Hereinafter, each component of the computing device 500 will be described in detail.

First, the processor 510 may perform operations or data processing related to control and/or communication of other components (eg, memory 520) of the computing device 500. Such processor 510 may be operatively coupled to other components of computing device 500, for example. Additionally, the processor 510 may load commands or data received from other components of the computing device 500 into the memory 520 or process commands or data stored in the memory 520 . Furthermore, the processor 510 may store result data according to the command or data in other components of the computing device 500.

As an example of a command or data processed by the processor 510, the processor 510 runs software (e.g., commands, programs, etc.) to enable at least one of the other components of the computing device 500 connected to the processor 510. can be controlled. At this time, the processor 510 may perform various operations related to the present disclosure, such as calculation, processing, data generation, and processing.

Next, the memory 520 may store various data, commands, and/or information. This memory 520 may be implemented with known volatile and/or non-volatile memory.

Data stored in the memory 520 is data acquired, processed, or used by at least one component of the computing device 500, and may include software (eg, commands, programs, etc.). Here, the command or program is software stored in the memory 520, and is an operating system, application, and/or application for controlling the resources of the computing device 500 and various functions so that the application can utilize the resources of the computing device 500. It may include middleware provided to . For a specific example, an instruction or program may include one or more instructions that, when loaded into the memory 520, cause the processor 510 to perform operations according to various embodiments of the present disclosure. That is, the processor 510 can perform operations according to various embodiments of the present disclosure by executing one or more instructions described above.

Next, the communication circuit (network interface, 530) of the computing device 500 can establish a wired or wireless communication channel with an external device and transmit and receive various data with the external device. In some embodiments, the communication circuit 530 may include at least one port to be connected to an external device via a wired cable in order to communicate with the external device via a wired cable. In this case, the communication circuit 530 can communicate with a wired external device through at least one port. In some other embodiments, communication circuitry 530 may include a cellular communication module and be configured to connect to a cellular network (e.g., 3G, LTE, 5G, Wibro, or Wimax). In some other embodiments, the communication circuit 530 includes a short-range communication module to transmit and receive data with an external device using short-range communication (e.g., Wi-Fi, Bluetooth, Bluetooth Low Energy (BLE), UWB). You can. In some other embodiments, the communication circuit 530 may include a contactless communication module for contactless communication. Here, non-contact communication may include at least one non-contact proximity communication technology, such as, for example, near field communication (NFC) communication, radio frequency identification (RFID) communication, or magnetic secure transmission (MST) communication. In addition to the various examples described above, the computing device 500 may be implemented in various known ways for communicating with external devices, and it should be noted that the scope of the present disclosure is not limited to the examples described above.

In addition to the components of the computing device 500 described so far, any number of other components may be included in the computing device 500. For example, the computing device 500 may include a display (not shown), which displays various screens based on control of the processor 510 or receives user input (e.g., touch input, etc.) from the user. You can receive it. As another example, computing device 500 may include an input device (not shown), which may receive commands or data to be used in the operation of processor 510. In addition, it should be noted that various components may be further included in the computing device 500.

So far, an exemplary computing device 500 capable of implementing various devices according to some embodiments of the present disclosure has been described with reference to FIG. 2 . Hereinafter, various methods according to some embodiments of the present disclosure will be described in detail. Although operations are shown in a specific order in the drawings below, it should be noted that the operations do not necessarily have to be executed in the specific order or sequential order shown, or that all of the illustrated operations must be executed to obtain the desired results.

Additionally, each step of the methods to be described with reference to the drawings below may be performed by the computing device 500 shown in FIG. 2. In other words, each step of the methods may be implemented with one or more instructions executed by the processor 510 of the computing device 500. All steps included in these methods may be performed by a single physical computing device 500, however, the first steps of the method are performed by the first computing device and the second steps of the method are performed by the second computing device. It may also be performed by . Hereinafter, the description will be continued assuming that each step of the above-described methods is performed by the electronic device 100 shown in FIG. 1. However, for convenience of explanation, the description of the operator of each step included in the above-described methods may be omitted.

3 is an example flowchart illustrating an order processing method according to some embodiments of the present disclosure.

Referring to Figure 3, in step S100, a new order may be identified. As described with reference to FIG. 1, new orders may be identified in various ways, and the identified new orders may include various information (e.g., pickup location information, delivery location information).

Next, in step S200, an order allocation pool may be determined. Here, the order assignment pool may refer to a set of a plurality of delivery performer terminals for assigning new orders. Specifically, depending on the subsequent operations, which of the plurality of delivery performer terminals included in the order assignment pool A new order may be assigned to one. Hereinafter, the term expressed as “terminal” throughout the description may be understood as an abbreviation for “delivery performer terminal” unless there are special circumstances.

Regarding the order allocation pool described above, in some embodiments, the order allocation pool may include a first terminal that is idle. In this case, by being able to assign a new order to an idle first terminal, the user of the first terminal can pick up the new order at the pickup location and deliver it to the delivery location. In some other embodiments, the order allocation pool may include a second terminal in a delivery state and in a state to complete the previously assigned order within a first threshold time. In this case, even if it is in the delivery state, a new order can be assigned to the second terminal that is in a state of completing the previously assigned order within the first threshold time, so the user of the second terminal can complete the previously assigned order and place a new order. You can pick it up at the pickup location and have it delivered to the delivery location. According to the embodiments described so far in relation to the order allocation pool, when determining the order allocation pool for allocating new orders, both terminals in an idle state and terminals in a state that will soon complete the order even if in a delivery state can be considered. As a result, the order allocation pool can be determined in a way optimized for new orders, compared to the method of determining the order allocation pool by simply considering only idle terminals. In particular, the order allocation pool can be determined in a way optimized for new orders so that new orders can be quickly allocated when there is a shortage of idle terminals (e.g., peak hours).

The above-mentioned first threshold time may be a standard factor for determining which terminals to include in the order allocation pool. In particular, the first critical time may be a reference element for determining whether the terminal can be included in the order allocation pool when the terminal is in a delivery state, and details related to the decision operation of the order allocation pool using the first critical time The operation will be described in more detail later with reference to FIG. 6.

Regarding step S200, in some embodiments, an order allocation pool may be determined based on pickup location information of the new order. In other words, the pickup location information can be considered as a determining factor of the order allocation pool. Specifically, the step of determining the new order allocation pool is based on the pickup location information of the new order, exceeding the standard distance from the pickup location of the new order. It may include a step of excluding a terminal located in a position from the order allocation pool. Here, the standard distance may be a standard element that determines which terminals to include in the order allocation pool, and the standard distance can be changed and applied as much as desired depending on the actual implementation case. As an example, the reference distance may be a fixed value, and depending on the properties of the new order (e.g., details of the ordered product), the reference distance may be set to be relatively short for the first product (e.g., ice cream), and the reference distance may be set to be relatively short for the second product (e.g., : convenience store products), the standard distance may be set to be relatively long. According to this variable change in the reference distance, the order allocation pool for new orders for which delivery must be completed relatively quickly can be determined within a relatively narrow geographical range based on pickup location information, and for new orders for which delivery must be completed relatively slowly. The order allocation pool of new orders to be placed can be determined within a relatively broad geographic range based on pickup location information.

Next, in step S300, a temporarily assigned terminal matching the new order may be determined based on the status information of each of the plurality of terminals included in the order assignment pool.

Here, status information may mean information indicating the status of the terminal, and not only primary information that can be obtained directly from the terminal (e.g., location of the terminal, order assignment status, etc.), but also the primary information can be used to calculate or All statistically processed secondary information (e.g. remaining completion time for already assigned orders, expected pickup time for new orders, etc.) may be included. For example, status information may include order assignment status, location, delivery method, remaining completion time for already assigned orders, expected pickup time for new orders, order assignment rejection rate, number of completed orders, order assignment waiting time, and order assignment application. It may include online access time. However, it should be noted that the scope of the present disclosure is not limited to the above-described example, and that any information may be included in the status information of the present disclosure as long as it is information representing the status of the terminal. Also, here, the temporarily assigned terminal may mean a terminal to which a new order is temporarily assigned prior to the assignment of the new order. According to subsequent operations that will be described later in the specification, if the temporary assignment terminal satisfies certain conditions, a new order may be assigned to the temporary assignment terminal.

In relation to step S300, detailed operations related to the decision operation of the temporary assignment terminal using status information will be described in more detail later with reference to FIG. 11.

Next, in step S400, a new order may be assigned to one of a plurality of terminals, based on the status information of the temporary assignment terminal. Specifically, when executing assignment, status information of the temporary assignment terminal can be confirmed for each section. At this time, according to the status information of the temporary assignment terminal in the section when the assignment is executed, a new order is assigned to the temporary assignment terminal, or when the subsequent assignment is executed, the status information of the temporary assignment terminal is rechecked by waiting for the section, or the temporary assignment terminal is assigned a new order. You can cancel the temporary assignment to the assignment terminal and temporarily assign a new order to another terminal.

Here, the allocation execution time interval may be a time interval for determining whether or not a new order can be assigned at each interval of the second critical time, where the second critical time is shorter than the first critical time described with respect to step S200. It may be a section. That is, by determining whether a new order can be assigned to the temporary assignment terminal at every second critical time, which is a time interval shorter than the first critical time, which can be understood as the maximum remaining completion time that can be included in the order assignment pool, the temporary assignment terminal New orders can be assigned by quickly reflecting changes in status information. This second critical time may be a reference element that determines the interval between sections during repeated allocation execution. Specifically, if the second critical time is set relatively short, it is possible to determine in detail whether or not a new order can be assigned to the temporary assignment terminal, so that changes in the status information of the temporary assignment terminal can be immediately reflected, and the second threshold time can be set to be relatively short. If the time is set to be relatively long, computing resources required for judgment can be saved. Considering the long and short effects of the above-mentioned second critical time, it can be applied to actual implementation cases, and the second critical time may be a fixed value (e.g., 30 seconds) or a variably variable value. Be careful.

In relation to step S400, detailed operations related to the assignment of a new order using status information will be described in more detail later with reference to FIG. 12. Hereinafter, an example diagram regarding the decision operation of the order allocation pool will be described with reference to FIGS. 4 and 5.

Figures 4 and 5 are exemplary diagrams to explain in more detail the decision operation of the order allocation pool described with reference to Figure 3. FIGS. 4 and 5 are examples of a map 10 visualizing the surroundings of 'Station A', and the map 10 is a map that the operator of the electronic device 100 shown in FIG. 1 can visually refer to through the display. It may be a map 10, or a map 10 that users of the delivery person terminals 200a and 200b shown in FIG. 1 can visually refer to through a display. However, when the map 10 is displayed on the delivery agent terminals 200a and 200b, unlike FIGS. 4 and 5, some information (e.g., indicator of another delivery agent terminal, etc.) is omitted or some other information is displayed. Please note that (e.g. delivery method selection button, etc.) may be added and displayed.

The exemplary map 10 shown in FIGS. 4 and 5 includes a new order pickup location indicator 20, idle terminal indicators 30a, 30b, and on-delivery terminal indicators 40a, 40b, 40c. do. A reference distance from the pickup location may be determined as previously described with reference to step S200 of FIG. 3 , and the example map 10 shown in FIG. 5 further includes an area 50 based on the reference distance. Here, terminals corresponding to indicators 30b, 40b, and 40c located within the area 50 shown in FIG. 5 may be included in the order allocation pool, but terminals corresponding to indicators 30a and 40a located outside the area 50 may be included in the order allocation pool. Terminals may be excluded from the order allocation pool. Also, here, even if the terminal corresponds to the indicators 30b, 40b, and 40c located within the area 50 shown in FIG. 5, if the terminal is in a delivery state and does not complete the pre-assigned order within the first critical time, , the terminal may be excluded from the order allocation pool. Hereinafter, detailed operations related to the decision operation of the order allocation pool will be described with reference to FIGS. 6 and 7. Detailed operations related to the determination of the order allocation pool according to FIGS. 6 and 7, which will be described below, can be understood as operations for determining whether a terminal in a delivery state is included in the order allocation pool.

Referring to FIG. 6, in step S210, the remaining completion time of the order previously assigned to the terminal may be calculated. Here, the remaining completion time may mean the estimated time required to complete a pre-assigned order. In the embodiments to be described below, the location of the terminal may be obtained from a sensor (e.g., GPS sensor) built into the terminal, and delivery location information and pickup location information may be obtained by being included in the order requested from the consumer terminal. there is.

Regarding step S210, in some embodiments, calculating the remaining completion time may include calculating the remaining completion time based on the location of the terminal and delivery location information of the previously assigned order. Specifically, the remaining completion time can be calculated using the distance between the location of the terminal and the delivery location of the previously assigned order. In some other embodiments, as shown in FIG. 7, calculating the remaining completion time includes calculating the remaining completion time based on the location of the terminal and the delivery location information of the previously assigned order (S211) and It may include calculating the remaining completion time based on the delivery location information of the previously assigned order and the pickup location information of the new order (S212). Specifically, the remaining completion time can be calculated using both the distance between the location of the terminal and the delivery location of the previously assigned order and the distance between the delivery location and the pickup location of the previously assigned order. In the former case, by determining the delivery completion time of the previously assigned order as the completion time of the previously assigned order, more terminals can be included in the order allocation pool compared to the latter. In the latter case, by determining the completion time of the pre-assigned order as the completion time of the pre-assigned order and arriving at the pickup location, terminals more suitable for new orders compared to the former can be included in the order allocation pool. The former or the latter can be selected and applied depending on the actual implementation case, and in addition to the above-described embodiments, a distance-based time calculation method using the location of the terminal, the delivery location of the already assigned order, and the pickup location of the new order. Any number of other remaining completion time calculation operations may be included in the scope of the present disclosure.

Regarding step S210, in some other embodiments, calculating the remaining completion time may include calculating the remaining completion time based on the delivery means corresponding to the terminal. Here, the delivery means may be input and received from the user of the terminal. For example, the delivery means may include walking, bicycle, motorcycle, and car. That is, the remaining completion time based on the delivery method can be calculated using the average speed of the delivery means or statistical information for each delivery means accumulated according to the operation of the delivery service.

In relation to step S210 described so far, various techniques regarding operations for calculating the distance-based expected time may be referenced. For example, it may refer to technologies for calculating expected times in various technical fields, including navigation services and taxi assignment services. In some embodiments, to calculate the remaining completion time, an artificial intelligence model that calculates the remaining completion time can be used by inputting time zone information, region information, and distance information. In this case, the artificial intelligence model can be learned by deriving a correlation between learning data (e.g., time zone information, region information, distance information, etc.) and the resulting data of the learning data (e.g., remaining completion time), For example, a regression model in supervised learning can be referenced in the training of the artificial intelligence model.

Next, in step S220, a terminal whose remaining completion time is less than or equal to a threshold time (eg, a first threshold time) may be included in the order allocation pool. According to this step, terminals whose remaining completion time exceeds the first threshold time are excluded from the order allocation pool so that only terminals that can quickly pick up new orders and deliver to the delivery location are included in the order allocation pool. can be decided.

Regarding the first threshold time, in some embodiments, the first threshold time may be a time interval that is variably determined based on attributes of the new order. Specifically, depending on the properties of the new order (e.g., details of the ordered product), the first threshold time may be set relatively short for the first product (e.g., ice cream), and the first threshold time may be set relatively short for the second product (e.g., convenience store product). 1 The threshold time may be set to be relatively long. According to this variable change in the first critical time, the order allocation pool of new orders whose delivery must be completed relatively quickly can be determined according to the relatively short first critical time, and new orders whose delivery must be completed relatively slowly The order allocation pool of may be determined according to a relatively long first threshold time.

So far, with reference to FIGS. 6 and 7 , detailed operations related to the decision operation of the order allocation pool have been described. Hereinafter, an example diagram regarding the decision operation of the temporary assignment terminal will be described with reference to FIGS. 8 to 10.

Figures 8 to 10 are exemplary diagrams to explain in more detail the decision operation of the temporary assignment terminal described with reference to Figure 3. FIGS. 8 to 10 are an example of a map 10 visualizing the area around 'Station A', and the description of the map 10 can be understood by referring to the description of FIGS. 4 and 5. In addition, the paths 60a, 60b, and 60c will be described below as paths for calculating the expected pickup time, but note that they can also be understood as paths for calculating the remaining completion time described with reference to FIG. 7. Should be.

The example map 10 shown in Figure 8 shows the path 60a of the idle terminal indicator 30b, and the example map 10 shown in Figures 9 and 10 shows the delivery location indicator ( As a route passing through the delivery location of the previously assigned order corresponding to 70a, 70b), the route 60b, 60c of the delivery status terminal indicators 40b, 40c is shown. In the former case, it is a route that uses the location of the terminal as the starting point and the pickup location of the new order as the end point. In the latter case, it is a route that uses the location of the terminal as the starting point and the delivery location of the already assigned order as the midpoint and picks up the new order. It is a route that has a place as its end point. In this way, the path of the terminal to reach the pickup location of the new order can be determined according to the order assignment status of the terminal, and the expected pickup time can be calculated based on the path. Regarding this operation of calculating the expected pickup time, the operation of calculating the remaining completion time described with reference to FIG. 6 may be referred to, and any operation of calculating the distance-based expected time may be included in the scope of the present disclosure. there is.

8 to 10, in some embodiments, the step of determining a temporarily assigned terminal includes calculating an expected pickup time for each of a plurality of terminals included in the order assignment pool and selecting the terminal with the earliest expected pickup time. It may include a step of determining a temporary assignment terminal. As a specific example, if the delivery means of the terminals shown in FIGS. 8 to 10 are the same, the terminal corresponding to the terminal indicator 40b of the shortest path 60b may be determined as the temporarily assigned terminal for the new order. That is, according to the examples shown in FIGS. 8 to 10, the terminal that can reach the pickup location the fastest may be determined as the temporarily assigned terminal even if the terminal is in a delivery state.

So far, with reference to FIGS. 8 to 10, the operation of determining a temporarily assigned terminal using the expected pickup time among the information included in the terminal status information has been described. Hereinafter, with reference to FIG. 11, an operation of determining a temporarily assigned terminal will be described using various information included in the terminal status information.

FIG. 11 is an exemplary flowchart for explaining the detailed operation of the decision operation of the temporary assignment terminal shown in FIG. 3.

Referring to FIG. 11, in step S310, items included in the status information of each of a plurality of terminals and weights corresponding to the items may be calculated. Here, the item may refer to the value of various pieces of information that may be included in the status information described above, and the weight may refer to a weighted value assigned to the value. In some embodiments, the weight may be a fixed value, but the scope of the present disclosure is not limited thereto, and the weight may be adjusted variably to determine the optimal terminal according to actual implementation cases.

Regarding items: a first item that can be expressed as true or false (e.g., order assignment status, etc.), a second item that can be expressed as a finite number of optional values (e.g., delivery method, etc.), and a second item that can be expressed as a continuous number. A third item (e.g., order assignment waiting time, etc.) may be included in the item, and each item may be subjected to appropriate preprocessing according to the above-mentioned properties for calculation with weight.

Depending on the preprocessing or determination of weights of the above-described items, the operator (eg, platform operator, application operator) of the electronic device 100 shown in FIG. 1 may set criteria for determining the temporarily assigned terminal. For example, a higher weight is determined when the order assignment status is idle than when it is being delivered, a higher weight is determined when the path determined by location is shorter, or a higher weight is determined when the average speed of the delivery vehicle is faster. Alternatively, the shorter the remaining completion time of an already assigned order, the higher the weight is determined, the faster the expected pickup time of a new order, the higher the weight, the lower the order rejection rate, the higher the weight, or the number of completed orders. The higher the value, the higher the weight can be determined, the longer the order allocation waiting time, the higher the weight can be determined, or the longer the online access time of the order allocation application, the higher the weight can be determined. However, it should be noted that the scope of the present disclosure is not limited to the above-described examples, and that the temporarily assigned terminal may be determined according to weights determined differently. In other words, if it is an operation to determine a specific terminal as a temporarily assigned terminal according to the operator's preference based on the calculation of the items included in the status information and the weight corresponding to the item, all operations may be included in the scope of the present disclosure.

Next, in step S320, one of the plurality of terminals may be determined as the temporarily assigned terminal based on the size relationship between the item and the calculated weight value corresponding to the item. In other words, the status information of each of the plurality of terminals can be converted into a single number that can be compared in size relationship, and based on this, one of the plurality of terminals can be determined as the temporarily assigned terminal.

So far, with reference to FIG. 11, the decision operation of the temporary assignment terminal has been described. Hereinafter, the allocation operation of a new order will be described with reference to FIG. 12.

FIG. 12 is an exemplary flowchart for explaining detailed operations of the new order assignment operation shown in FIG. 3.

Referring to FIG. 12, if the temporary assignment terminal is in an idle state (S410), a new order may be assigned to the temporary assignment terminal in step S420. According to this step, a new order can be immediately assigned to the temporary assignment terminal without having to wait for a section during subsequent assignment execution. If the temporary allocation terminal is in a delivery state (S410), in step S430, it may be determined whether the previously allocated order is completed in the subsequent allocation execution section. Here, the determination of whether the order has been completed is based on whether the terminal has arrived at the delivery location of the pre-assigned order, or whether the terminal has received the order completion button provided on the user interface of the application from the user. However, the scope of the present disclosure is not limited to the above-described examples, and completion of the order can be determined in various ways.

Next, if it is determined that the temporary assignment terminal has completed the previously assigned order in the subsequent assignment execution section (S440), a new order may be assigned to the temporary assignment terminal in step S420. If it is determined that the temporarily assigned terminal has not completed the previously assigned order (S440), in step S450, the temporarily assigned terminal matching the new order from among the plurality of terminals included in the order assignment pool may be determined again. Specifically, if it is determined that the first temporary assignment terminal has not completed the previously assigned order, the second temporary assignment terminal may be determined from among a plurality of terminals included in the order assignment pool. Here, the second temporary assignment terminal may be the same terminal as the first temporary assignment terminal, or may be a different terminal, and with respect to the re-determination operation of the temporary assignment terminal, only the initial decision and timing of the temporary assignment terminal are different. Since the specific operation is the same, it can be understood by referring to step S300 of FIG. 3 and the description of FIGS. 8 to 10 and 11.

With respect to step S450, in some embodiments, re-determining the temporary allocation terminal may include updating the order allocation pool to correspond to the interval during subsequent allocation execution and re-determining the temporary allocation terminal from the updated order allocation pool. It may include steps. According to this embodiment, the order allocation pool is updated in response to changes in timing depending on the section when executing allocation, and the temporarily assigned terminal is re-determined from the updated order allocation pool, so that the status information of the terminal changed according to the change in timing. Based on this, a terminal more optimized for new orders can be determined as the temporarily assigned terminal.

Next, if the re-determined temporary assignment terminal (e.g., the second temporary assignment terminal) is the same terminal as before and the limit time (e.g., the third threshold time) has passed (S460), in step S470, the temporary assignment terminal Temporary assignment may be canceled. Here, the limit time can be understood as the maximum time for which the terminal can maintain its qualifications as a temporary allocation terminal, and the limit time may be longer than the first threshold time, which can be a standard element of the order allocation pool. Also, here, when the temporary assignment is canceled (S470), among the plurality of terminals included in the order assignment pool, a terminal other than the terminal for which the temporary assignment has been released may be determined as a temporarily assigned terminal (e.g., a third temporarily assigned terminal). On the other hand, if the re-determined temporary assignment terminal (e.g., the second temporary assignment terminal) is not the same terminal as before, or even if it is the same terminal, the threshold time (e.g., the third threshold time) has not elapsed (S460), in step S430 , it can be determined whether or not the previously assigned order is completed in the section when the subsequent assignment is executed. That is, the operations shown in FIG. 12 are repeated for each section during subsequent assignment execution until the assignment of the new order is completed, determine whether the order of the predetermined temporary assignment terminal has been completed, and determine the new temporary assignment terminal again. It can be understood as actions.

Regarding the above-described limit time, in some embodiments, the limit time may be a time period that is variably determined based on status information of the temporarily assigned terminal. For example, the limit time may be determined variably depending on the delivery method of the temporarily assigned terminal. If the delivery means is a car, the limit time may be set relatively short, and if the delivery means is walking, the limit time may be set relatively long. You can. For another example, if the order assignment rejection rate of the temporary assignment terminal is relatively high, the limit time may be set relatively short, and if the rejection rate is relatively low, the limit time may be set relatively long. Unlike the above-described examples, the limit time can be variably determined based on the status information of the terminal, and even if the limit time is variably determined based on other status information not mentioned, it can be included in the scope of the present disclosure. According to this embodiment, the limit time can be appropriately set using a numerical value representing the reliability of the user corresponding to the temporary assignment terminal, or a limit time suitable for the user's situation can be appropriately set.

According to the operations described with reference to FIG. 12, a new order may be assigned to a specific terminal (S420) as a result of repetition of the section during assignment. In some embodiments, if the assignment of a new order is rejected from the terminal to which the new order was assigned, a temporary assignment terminal (e.g., a fourth temporary assignment terminal) matching the new order from the order assignment pool excluding the terminal to which the new order was assigned. is determined, and the operations shown in FIG. 12 can be performed again based on the status information of the temporarily assigned terminal. According to this embodiment, if a rejection of the assignment occurs even though a new order is assigned, a temporary assignment terminal is determined from the order assignment pool excluding the terminal to which the new order is assigned, and operations for assigning the new order can be performed again. there is.

So far, with reference to FIGS. 3 to 12 , various methods according to some embodiments of the present disclosure have been described. According to the above-described methods, in order to select a terminal optimized for a new order, all terminals in an idle state and terminals in a delivery state or a state in which delivery will be completed soon can be considered. This method of considering terminals in a delivery state can quickly assign new orders, especially when there is a shortage of terminals in an idle state (e.g., peak hours), and new orders can be placed even when there is not a shortage of terminals in an idle state. New orders can be assigned to terminals more suitable for the system. Through this efficiency in allocation of new orders, it is possible to provide rapid delivery to consumers, allocation of rapid delivery to suppliers, and opportunity to allocate appropriate delivery to delivery performers.

So far, various embodiments of the present disclosure and effects according to the embodiments have been mentioned with reference to FIGS. 1 to 12 . The effects according to the technical idea of the present disclosure are not limited to the effects mentioned above, and other effects not mentioned may be clearly understood by those skilled in the art from the description of the specification.

Additionally, the technical idea of the present disclosure described so far with reference to FIGS. 1 to 12 may be implemented as computer-readable code on a recording medium that can be read by a computing device (eg, an electronic device). Here, when a computer program implemented as code is loaded into the memory of the computing device, it may include at least one instruction that causes the processor of the computing device to perform operations according to various embodiments of the present disclosure. Such computer-readable recording media may be, for example, removable recording media (e.g. CD, DVD, Blu-ray Disc, USB storage device, removable hard disk, etc.) or non-removable recording media (e.g. ROM, RAM, computer-equipped recording media). type hard disk, etc.). Additionally, the recording medium may be a non-transitory recording medium. Here, a non-transitory recording medium refers to a tangible medium regardless of whether data is stored semi-permanently or temporarily, and may not include signals that are temporarily propagated. Furthermore, a computer program recorded on a recording medium can be transmitted to and installed on another computing device through a network such as the Internet, and thus can be used on another computing device.

Although the technical idea of the present disclosure has been described through some embodiments and examples shown in the accompanying drawings, the technical idea of the present disclosure is not beyond the technical scope of the present disclosure that can be understood by a person skilled in the art to which the present disclosure pertains. It should be noted that various substitutions, modifications and changes may be made. Furthermore, such substitutions, modifications and alterations are intended to fall within the scope of the appended claims.

Claims (20)

In an order processing method performed by an electronic device,
identifying a new order that includes pickup location information;
Based on the pickup location information, determining an order allocation pool including a first terminal in an idle state and a second terminal in a delivery state and in a state to complete a pre-assigned order within a first threshold time;
Based on the status information of each of the plurality of terminals included in the order allocation pool, determining a first temporary allocation terminal matching the new order among the plurality of terminals; and
Comprising the step of assigning the new order to one of the plurality of terminals, based on the status information of the first temporary assignment terminal.
How to process your order.
According to paragraph 1,
The step of determining the order allocation pool is,
Based on the pickup location information, excluding a terminal located at a location exceeding a reference distance from the pickup location of the new order from the order allocation pool,
How to process your order.
According to paragraph 1,
The step of determining the order allocation pool is,
calculating the remaining completion time of the previously assigned order to the second terminal; and
If the remaining completion time is less than or equal to the first threshold time, including the second terminal in the order allocation pool,
How to process your order.
According to paragraph 3,
The step of calculating the remaining completion time is,
Comprising the step of calculating the remaining completion time based on the location of the second terminal and the delivery location information of the previously assigned order,
How to process your order.
According to paragraph 3,
The step of calculating the remaining completion time is,
Comprising the step of calculating the remaining completion time based on the location of the second terminal, delivery location information of the previously assigned order, and pickup location information of the new order,
How to process your order.
According to paragraph 3,
The step of calculating the remaining completion time is,
Comprising the step of calculating the remaining completion time based on the delivery means corresponding to the second terminal,
How to process your order.
According to paragraph 1,
The status information is,
At least one of order assignment status, location, delivery method, remaining completion time for previously assigned orders, expected pickup time for the new order, order assignment rejection rate, number of completed orders, order assignment waiting time, and online access time of the order assignment application. Information containing,
How to process your order.
In clause 7,
The step of determining the first temporary assignment terminal is,
Comprising the step of determining one of the plurality of terminals as the first temporarily assigned terminal, based on the calculation of an item included in the status information and a weight corresponding to the item.
How to process your order.
In clause 7,
The step of determining the first temporary assignment terminal is,
calculating the expected pickup time for each of the plurality of terminals; and
Comprising the step of determining the terminal with the fastest expected pickup time as the first temporarily assigned terminal,
How to process your order.
According to clause 9,
The step of calculating the expected pickup time is,
Calculate the expected pickup time based on the location of the first terminal and pickup location information of the new order,
Comprising the step of calculating the expected pickup time based on the location of the second terminal, delivery location information of the previously assigned order, and pickup location information of the new order,
How to process your order.
According to paragraph 1,
The step of assigning the new order to one of the plurality of terminals,
When the first terminal is determined to be the first temporary assignment terminal, immediately assigning the new order to the first terminal,
How to process your order.
According to paragraph 1,
The step of assigning the new order to one of the plurality of terminals,
If the second terminal is determined to be the first temporarily assigned terminal, determining whether the previously assigned order is completed in a subsequent assignment execution section - the assignment execution section is configured to determine whether the new order is completed at an interval of a second threshold time. It is a time interval for determining whether or not an order can be assigned, and the second critical time is a time interval shorter than the first critical time -;
If the previously assigned order is determined to be complete, the new order is immediately assigned to the second terminal, and if the previously assigned order is determined to be incomplete, a second temporarily assigned terminal matching the new order is selected from among the plurality of terminals. deciding step; and
Comprising the step of assigning the new order to one of the plurality of terminals, based on the status information of the second temporary assignment terminal.
How to process your order.
According to clause 12,
The step of determining the second temporary assignment terminal is,
updating the order allocation pool to correspond to the interval during the subsequent allocation execution; and
Comprising determining the second temporary allocation terminal in the updated order allocation pool,
How to process your order.
According to clause 12,
The step of determining the second temporary assignment terminal is,
If the second terminal is determined to be the second temporarily assigned terminal, and the previously assigned order is not determined to be completed within a third threshold time, which is a time interval longer than the first threshold time, the second terminal among the plurality of terminals Including the step of determining a terminal other than the terminal as the third temporarily assigned terminal,
The step of assigning the new order to one of the plurality of terminals based on the status information of the second temporary assignment terminal,
Comprising the step of assigning the new order to one of the plurality of terminals, based on the status information of the third temporary assignment terminal.
How to process your order.
According to clause 14,
The third critical time is,
A time period that is variably determined based on the status information of the second terminal,
How to process your order.
According to clause 12,
The step of assigning the new order based on the status information of the second temporary assignment terminal,
Until the allocation of the new order is completed, repeating each section during the subsequent allocation execution, determining whether the order of the predetermined temporary allocation terminal has been completed, and determining a new temporary allocation terminal.
How to process your order.
According to paragraph 1,
The step of assigning the new order is,
If the assignment of the new order is rejected from the terminal to which the new order is assigned, a fourth temporarily assigned terminal matching the new order is determined from the order assignment pool excluding the terminal to which the new order is assigned, and the fourth Comprising the step of assigning the new order based on the status information of the temporary assignment terminal,
How to process your order.
According to paragraph 1,
The first critical time is,
A time interval that is variably determined based on the properties of the new order,
How to process your order.
processor;
network interface;
Memory; and
Includes a computer program loaded into the memory and executed by the processor,
The computer program is,
Instructions to identify new orders, including pickup location information;
Based on the pickup location information, instructions for determining an order allocation pool including a first terminal in an idle state and a second terminal in a delivery state and in a state to complete a pre-assigned order within a first threshold time;
An instruction for determining a first temporary allocation terminal matching the new order among the plurality of terminals, based on status information of each of the plurality of terminals included in the order allocation pool; and
Based on the status information of the first temporary assignment terminal, including instructions for assigning the new order to one of the plurality of terminals,
Electronic devices.
According to clause 19,
The status information is,
At least one of order assignment status, location, delivery method, remaining completion time for previously assigned orders, expected pickup time for the new order, order assignment rejection rate, number of completed orders, order assignment waiting time, and online access time of the order assignment application. Information containing,
Electronic devices.

Images