KR102252774B1 - Apparatus, method and recording medium storing commands for managing delivery process - Google Patents

Abstract

The present disclosure proposes a device for managing a delivery process. According to the present disclosure, the device may include a processor and/or a memory. The processor may select a first delivery order from one or more delivery orders. A first delivery person among candidate delivery persons for the first delivery order may determine a first delivery route for performing the first delivery order and one or more second delivery orders held by the first delivery person, determine a first increment of delivery costs by the first delivery order from delivery costs consumed to perform delivery according to the first delivery route, and determine the first delivery man as a delivery man corresponding to the first delivery order, based on the first increment.

Description

A recording medium that records an apparatus, a method, and an instruction for managing the delivery process {APPARATUS, METHOD AND RECORDING MEDIUM STORING COMMANDS FOR MANAGING DELIVERY PROCESS}

The present disclosure relates to a technology for managing the delivery process.

Depending on the customer's delivery order, certain items (eg food) can be delivered to the customer. The delivery man may receive the item to be delivered and deliver it to the customer. However, since resources required to perform delivery, such as a delivery person, are limited, it is required to allocate a delivery person most suitable for the delivery order to be processed.

The present disclosure provides a technique for managing the delivery process.

As an aspect of the present disclosure, an apparatus for managing the delivery process may be proposed. An apparatus according to an aspect of the present disclosure includes: one or more processors; And one or more memories storing instructions for causing the one or more processors to perform an operation when executed by the one or more processors, wherein the one or more processors include a first delivery of one or more delivery orders stored in the one or more memories. A first delivery path for selecting an order, and for performing the first delivery order and one or more second delivery orders held by the first delivery person among at least one candidate delivery person for the first delivery order And, among delivery costs consumed to perform delivery according to the first delivery route, a first increase amount of the delivery cost by the first delivery order is determined, and based on the first increase amount, the first 1 A delivery person may be determined as a delivery person corresponding to the first delivery order, and information on the first delivery order may be transmitted to the terminal of the first delivery person.

In one embodiment, the one or more processors calculate, based on the first increment, a probability used to determine the first delivery person as a delivery person corresponding to the first delivery order, and the probability is the Having a negative correlation with the first increase amount-, according to the probability, the first delivery person may be determined as a delivery person corresponding to the first delivery order.

In one embodiment, the one or more processors, a second delivery person among the one or more candidate delivery personnel, a second delivery for performing the first delivery order and one or more third delivery orders held by the second delivery person Determine a route, determine a second increase amount of the delivery cost by the first delivery order among delivery costs consumed to perform delivery according to the second delivery route, and the first increase amount and the second increase amount It is possible to determine the size of and, according to a determination that the first increase amount is less than the second increase amount, determine the first delivery person as a delivery person corresponding to the first delivery order.

In one embodiment, the one or more processors determine a primary route based on an item receipt and an item delivery destination of one of the first delivery order and the one or more second delivery orders, and Based on the route determination operation, the K-th route is determined by performing a plurality of times-the K is the total number of the first delivery order and the one or more second delivery orders-and the delivery cost is the smallest among the K-th routes. A route is determined as the first delivery route, and the route determination operation is: the N-th order destination and the item delivery destination of a delivery order not included in the N-th route among the first delivery order and the one or more second delivery orders. An operation of generating a plurality of paths in addition to paths-the N is an integer less than K and greater than or equal to 1-; And an operation of determining one or more (N+1)-order routes having a small delivery cost among the plurality of routes.

In one embodiment, the delivery cost exceeds the total time required to perform the delivery order, the time required to deliver the goods to the delivery destination after receipt of the goods, and the target time of receipt of the goods. It may be calculated based on at least one selected from the time and the time passing through the target time of delivery of the goods.

In one embodiment, the one or more processors, based on a preset condition, determine the one or more candidate delivery sources for the first delivery order, and the preset condition is a payment method of the delivery order, It may be a condition set based on at least one selected from among whether alcohol is included in the delivery target product, a location of a delivery destination, a location of a delivery destination, a location of a delivery person, and a means of movement of the delivery person.

In one embodiment, the one or more processors are configured to perform the first delivery order when the first delivery person determined to correspond to the first delivery order is a delivery person who has selected delivery order assignment according to the first method. The first information may be delivered to the terminal of the first delivery person.

In one embodiment, the at least one processor selects and assigns the first delivery order when the first delivery person determined to correspond to the first delivery order is a delivery person who selects delivery order assignment according to the second method. If the second information for receiving is transmitted to the terminal of the first delivery person, and the first delivery order is not allocated within a preset time interval after the delivery of the second information, the first delivery person and the second method are selected. The second information may be additionally transmitted to each of the terminals of the third delivery person.

In one embodiment, the one or more processors, if the first delivery order is not allocated within a preset time interval after the additional delivery of the second information, the first delivery person, the at least one third delivery person, and the second The second information may be additionally delivered to each of the terminals of two or more fourth delivery sources that have selected the method.

In one embodiment, the one or more processors may sequentially select a delivery order having a high delivery cost among the one or more delivery orders and allocate a delivery person.

In one embodiment, it may further include a communication circuit for communicating with the terminal of the user who generated the first delivery order and the terminal of the first delivery person.

As an aspect of the present disclosure, a method for managing the delivery process may be proposed. A method according to an aspect of the present disclosure is a method performed in an apparatus comprising at least one processor and at least one memory in which instructions for execution by the at least one processor are stored, wherein the at least one processor comprises: the at least one memory Selecting a first delivery order from among one or more delivery orders stored in the storage device; Determining, by a first delivery person among at least one candidate delivery person for the first delivery order, a first delivery route for performing the first delivery order and at least one second delivery order held by the first delivery person; Determining a first increase amount of a delivery cost by the first delivery order from among delivery costs consumed to perform delivery according to the first delivery route; Determining the first delivery person as a delivery person corresponding to the first delivery order based on the first increase amount; And transmitting information on the first delivery order to the terminal of the first delivery person.

In one embodiment, the step of determining the first delivery person as a delivery person corresponding to the first delivery order comprises determining the first delivery person as a delivery person corresponding to the first delivery order based on the first increase amount Calculating a probability used to perform-the probability has a negative correlation with the first increase amount -; And determining the first delivery person as a delivery person corresponding to the first delivery order according to the probability.

In one embodiment, the step of determining, by a second delivery person among the at least one candidate delivery person, a second delivery route for performing the first delivery order and at least one third delivery order held by the second delivery person; And determining a second increase amount of the delivery cost by the first delivery order from among delivery costs consumed to perform the delivery according to the second delivery route, wherein the first delivery source The determining of the delivery source corresponding to the delivery order may include: determining a magnitude of the first increase amount and the second increase amount; And determining that the first delivery person is a delivery person corresponding to the first delivery order according to a determination that the first increase amount is less than the second increase amount.

In one embodiment, the determining of the first delivery route comprises: determining a first route based on a destination of a delivery order and a delivery destination of one of the first delivery order and the one or more second delivery orders. ; Determining a K-th route by performing a route determination operation a plurality of times based on the first route, wherein K is the total number of the first delivery order and the one or more second delivery orders; And determining a route having the lowest delivery cost among the K-th routes as the first delivery route, wherein the route determination operation is performed on an N-th route among the first delivery order and the one or more second delivery orders. An operation of generating a plurality of routes by adding an item receiving destination and a delivery destination of the delivery order not included to the N-th route, wherein N is an integer less than K and greater than or equal to 1; And an operation of determining one or more (N+1)-order routes having a small delivery cost among the plurality of routes.

In one embodiment, the delivery cost exceeds the total time required to perform the delivery order, the time required to deliver the goods to the delivery destination after receipt of the goods, and the target time of receipt of the goods. It may be calculated based on at least one selected from the time and the time passing through the target time of delivery of the goods.

In one embodiment, based on a preset condition, further comprising the step of determining the one or more candidate delivery sources capable of performing the first delivery order, wherein the preset condition is a payment method of the delivery order, It may be a condition set based on at least one selected from among whether alcohol is included in the delivery target product, a location of a delivery destination, a location of a delivery destination, a location of a delivery person, and a means of movement of the delivery person.

In one embodiment, the step of transferring the information on the first delivery order to the terminal of the first delivery person, the first delivery person determined to correspond to the first delivery order is assigned a delivery order according to the first method In the case of the delivery person who selects, transmitting the first information for performing the first delivery order to the terminal of the first delivery person.

In one embodiment, the step of transmitting the information on the first delivery order to the terminal of the first delivery person, the first delivery person determined to correspond to the first delivery order is assigned a delivery order according to the second method In the case of the selected delivery person, transmitting second information for selecting and receiving the assignment of the first delivery order to the terminal of the first delivery person; And if the first delivery order is not allocated within a preset time interval after the delivery of the second information, the second information is additionally added to each of the terminals of the first delivery person and at least one third delivery person selecting the second method. It may include the step of delivering.

As an aspect of the present disclosure, a non-transitory computer-readable recording medium in which instructions for managing a delivery process are recorded may be proposed. Instructions recorded in the recording medium according to an aspect of the present disclosure are instructions to be executed on a computer, and when executed by one or more processors, the first delivery order among one or more delivery orders stored in one or more memories And, a first delivery person among at least one candidate delivery person for the first delivery order provides a first delivery route for performing the first delivery order and at least one second delivery order held by the first delivery person. And, among delivery costs consumed to perform delivery according to the first delivery route, a first increase amount of the delivery cost by the first delivery order is determined, and based on the first increase amount, the first A delivery person may be determined as a delivery person corresponding to the first delivery order, and information on the first delivery order may be transmitted to the terminal of the first delivery person.

According to various embodiments of the present disclosure, it is possible to determine an optimal delivery person to perform a delivery order.

According to various embodiments of the present disclosure, a delivery route may be considered in determining an optimal delivery source.

According to various embodiments of the present disclosure, it is possible to efficiently manage delivery costs loaded on the entire delivery system.

1 is a diagram illustrating a process in which a delivery order is generated and performed according to an embodiment of the present disclosure.
2 is a diagram illustrating a process of determining, by an apparatus, a delivery person corresponding to a delivery order according to an embodiment of the present disclosure.
3 is a block diagram of an apparatus according to an embodiment of the present disclosure.
4 is a diagram illustrating a process of determining a delivery cost for one delivery order according to an embodiment of the present disclosure.
5 is a diagram illustrating a process of determining an optimal delivery route according to an embodiment of the present disclosure.
6 is a diagram for explaining a process of probabilistically determining an optimal delivery source for a delivery order according to an embodiment of the present disclosure.
7 is a diagram illustrating a process of expanding a range in which a delivery order to be allocated is exposed to a delivery order list in a contention allocation scheme according to an embodiment of the present disclosure.
8 is a diagram illustrating a process of notifying an item preparation request and an expected delivery completion point according to an embodiment of the present disclosure.
9 is a diagram showing an embodiment of a delivery process management method that can be performed by an apparatus according to the present disclosure.

Various embodiments described in this document are exemplified for the purpose of clearly describing the technical idea of the present disclosure, and are not intended to be limited to specific embodiments. The technical idea of the present disclosure includes various modifications, equivalents, alternatives, and embodiments selectively combined from all or part of each embodiment described in this document. In addition, the scope of the technical idea of the present disclosure is not limited to various embodiments or detailed descriptions thereof presented below.

Terms used in this document, including technical or scientific terms, may have meanings generally understood by those of ordinary skill in the art, unless otherwise defined, to which the present disclosure belongs.

Expressions such as "include", "may include", "have", "can have", "have", "have", etc. used in this document are subject features (eg: Function, operation, or component, etc.) is present, and the presence of other additional features is not excluded. That is, such expressions should be understood as open-ended terms that imply the possibility of including other embodiments.

As used in this document, expressions of the singular form may include the meaning of the plural unless the context indicates otherwise, and this applies to the expression of the singular form in the claims as well.

Expressions such as "first", "second", or "first" and "second" used in this document distinguish one object from another in referring to a plurality of homogeneous objects, unless the context indicates otherwise. It is used to do so, and does not limit the order or importance of the objects.

As used herein, "A, B, and C," "A, B, or C," "A, B, and/or C" or "at least one of A, B, and C," "A, B , Or at least one of C," "at least one of A, B, and/or C," "at least one selected from A, B, and C," "at least one selected from A, B, or C," "A An expression such as "at least one selected from B, and/or C" may mean each listed item or all possible combinations of the listed items. For example, "at least one selected from A and B" is (1) at least one of A, (2) A, (3) B, (4) at least one of B, (5) at least one of A and B At least one of, (6) at least one of A and B, at least one of (7) B, and A, and (8) A and B may all be referred to.

The expression "based on" as used in this document is used to describe one or more factors that influence the act or action of a decision or judgment, which is described in the phrase or sentence in which the expression is included, and the expression is It does not exclude additional factors that influence the action or action of a decision or judgment.

As used in this document, the expression that a component (eg, a first component) is “connected” or “connected” to another component (eg, a second component) means that the component is It may mean not only being directly connected or connected to other components, but also being connected or connected via a new other component (eg, a third component).

The expression "configured to" as used in this document is, depending on the context, "configured to", "having the ability to ...", "modified to", "made to", "to do It may have a meaning such as "can be". The expression is not limited to the meaning of "specially designed for hardware", and for example, a processor configured to perform a specific operation is a generic-purpose processor capable of performing a specific operation by executing software. Can mean

Hereinafter, various embodiments of the present disclosure will be described with reference to the accompanying drawings. In the accompanying drawings and description of the drawings, the same reference numerals may be assigned to the same or substantially equivalent components. In addition, in the following description of various embodiments, overlapping descriptions of the same or corresponding constituent elements may be omitted, but this does not mean that the constituent elements are not included in the exemplary embodiments.

1 is a diagram illustrating a process in which a delivery order is generated and delivery is performed according to an embodiment of the present disclosure. The apparatus 100 according to an embodiment of the present disclosure may manage a process in which goods are delivered according to the delivery process management technology of the present disclosure. The device 100 may be an electronic device (eg, a server, a computer, etc.) of a service provider (eg, a delivery management service company) that manages a delivery process according to the technology of the present disclosure. The device 100 may determine an optimal delivery person for performing delivery according to each delivery order, and assign each delivery order to the optimal delivery person to perform each delivery.

Specifically, the user 110 may create a delivery order 114 using his terminal 112 (eg, a smartphone). For example, the user 110 may create a delivery order 114 using an application program installed in the terminal 112. The user's terminal 112 may transmit the generated delivery order 114 to the device 100. In the present disclosure, the delivery order may be a delivery request for a specific product. In one embodiment, the delivery order is information on an item to be delivered, information on the store 130 providing the item, information on the user 110, information on payment of the item and delivery order fee, It may include information on the destination and delivery destination of the goods and/or other information related to delivery of the goods. In the present disclosure, the user 110 may be a general customer who requests delivery of a specific product (eg, food) by creating a delivery order and receives the delivery.

The device 100 may determine the delivery person 120 corresponding to the delivery order 114. The delivery person 120 may be an optimal delivery person for carrying out the delivery order 114. The process of determining the optimal delivery source will be described later. In one embodiment, the device 100 may allocate the delivery order 114 to the corresponding delivery person 120. The device 100 may transmit information on the delivery order 114 to the terminal 122 of the delivery person 120. In the present disclosure, the delivery person may be a person who delivers an article under the management of the device 100.

The delivery person 120 may check information on the delivery order 114 assigned to the delivery order 114 through his terminal 122 and perform the delivery order 114. The delivery person 120 may move to an item receiving location of the item subject to the delivery order 114 and receive the item (pick-up). In one embodiment, the item receipt may be a store 130 that provides the item. In the present disclosure, the store may be an offline store (eg, a restaurant) that provides an item to be delivered. In one embodiment, the device 100 may communicate through the store 130 and the store terminal 132. In one embodiment, the item receipt may be a separate location designated by the device 100, the user 110, or the store 130 side.

After receiving the goods, the delivery person 120 may deliver the goods to the delivery destination. In one embodiment, the delivery destination may be a current location of the user's terminal 112, a location of the user terminal 112 when the user 110 creates a delivery order, a location designated by the user 110, and the like. In one embodiment, the fact that the delivery of the goods has been completed may be communicated to the device 100 through the deliveryman's terminal 122 and/or the user's terminal 112.

2 is a diagram illustrating a process of determining, by the apparatus 100, an optimal delivery source corresponding to a delivery order according to an embodiment of the present disclosure. The apparatus 100 may determine a delivery person corresponding to each delivery order among all delivery personnel.

Specifically, one or more users may each create one or more delivery orders (210). The generated delivery orders may be transferred from each user's terminal to the device 100. The device 100 may store the delivered delivery orders in a delivery order pool (220). The delivery order pool may be a set of delivery orders managed by the device 100. For example, delivery orders D1, D2, D3, ??, and DN may be stored in the delivery order pool.

The device 100 may pull delivery orders from the delivery order pool according to a preset period (230). The delivery orders being pooled may be delivery orders in a state where no courier has been assigned. The apparatus 100 may collect the pooled delivery orders and generate a matching pool for performing a delivery agent assignment task. In one embodiment, the device 100 may pool delivery orders on a minute-by-minute basis. Since pooling is performed every minute, the pooled delivery orders may be delivery orders created within one minute from the pooling time point or delivery orders that fail to allocate a delivery person from the previous matching pool. For example, the device 100 may generate a matching pool by pooling delivery orders D1, D2, and D3 from the delivery order pool.

The device 100 may select delivery orders one by one from the matching pool, and sequentially match the optimal delivery person (240). Specifically, the device 100 sorts and selects delivery orders from the matching pool one by one according to a preset criterion, first determines an optimal delivery source for the selected delivery order, and then determines the optimal delivery source for the next selected delivery order. You can decide sequentially. In an embodiment, the device 100 may sequentially select a delivery order having a high delivery cost among delivery orders in a matching pool. When the delivery people are allocated in the order of the highest delivery cost, the delivery person who can most efficiently perform the delivery order having a large delivery cost can be assigned with priority. That is, it is possible to avoid that an optimal delivery source for a delivery order having a large delivery cost is assigned to a delivery order having a different small delivery cost, and thus cannot be assigned to a delivery order having a large delivery cost. For example, the device 100 may select a delivery order from the matching pool in the order of D2, D1, and D3. The apparatus 100 may first determine the best delivery source corresponding to D2, and then determine the best delivery source corresponding to D1, D3 in the order. Alternatively, in another embodiment, the device 100 may randomly select a delivery order from a matching pool to match an optimal delivery person.

In the present disclosure, the delivery cost may mean an amount of resources consumed to perform a corresponding delivery order. In one embodiment, the delivery cost is the total time it takes for the delivery person to fulfill the delivery order, the time it takes to deliver the goods to the delivery destination after receipt of the goods at the delivery order, and the time exceeding the target time of receipt of the goods. (I.e., the time indicating how far beyond the target point of time for receiving the item when the delivery person receives the item) and the time to pass the target point of delivery of the item (i.e., when delivering the item of the delivery person, the target time point for the delivery of the relevant item) It may be determined based on at least one selected from (time indicating how much time has passed). In general, the delivery cost is an amount of resources consumed by a delivery person to fulfill a delivery order, and may be calculated for a specific delivery person. A detailed method of calculating the delivery cost will be described later. However, when the device 100 selects a delivery order from the matching pool, it is before a delivery person is assigned to each delivery order. In this case, the delivery cost is only information determined by the properties of the delivery order itself, irrespective of the delivery person. Can be calculated. Here, the attribute of the delivery order itself may mean factors that affect the amount of resources to be consumed when the delivery order is executed, regardless of which delivery source is allocated. For example, information determined by the nature of the delivery order itself includes the preparation time of the item to be delivered (e.g., cooking time), the distance between the item being received and the item being delivered, and the time the delivery order was unallocated. There may be. For example, a delivery order for coffee having a short cooking time may have a lower delivery cost than an order for delivery of Gamjatang with a long cooking time.

The apparatus 100 may perform a process for determining an optimal delivery source for the delivery order D2 selected first (see 242 in FIG. 2) (250). In order to determine an optimal delivery person, the apparatus 100 may determine one or more candidate delivery persons capable of performing the delivery order D2. Subsequently, the apparatus 100 may determine an optimal delivery person for performing the delivery order D2 among one or more candidate delivery personnel.

Specifically, the device 100 may determine one or more candidate delivery sources capable of executing the selected delivery order D2 based on a preset condition. The candidate delivery person may mean a delivery person capable of physically, legally, or politically performing a corresponding delivery order. Among all delivery personnel, in order to become a candidate delivery person for a corresponding delivery order, it may be necessary to satisfy a preset condition. Candidate couriers may or may not already be fulfilling another delivery order. For example, the device 100 may determine the delivery persons R2 and R7 as candidate delivery persons for the selected delivery order D2.

In one embodiment, the preset conditions are the payment method of the user 110 for the delivery order, whether alcoholic beverages are included in the delivery target product of the delivery order, the location of the delivery order, the location of the delivery destination, the location of the delivery person, and the delivery person. Means of transportation (e.g., bicycle, kickboard, car, motorcycle, walking, etc.), the distance between the current delivery person and the destination (my store), the distance between the current delivery person and the delivery destination (or customer), and the total amount that the delivery person must travel. It may be set based on at least one selected from the distance, the distance from the receipt of the goods to the delivery destination of the goods, the number of delivery restrictions for each delivery person, and the operation time limit for each delivery person. In one embodiment, the number of delivery restrictions per delivery person may be an upper limit of the number of delivery orders that a corresponding delivery person can perform during a preset period (eg, delivery restrictions per month). In one embodiment, the service time limit for each delivery person may be an upper limit of the operation time during which the delivery person can operate the transportation means to fulfill a delivery order for a predetermined period (eg, the upper limit of the total driving time per week). In one embodiment, whether alcohol is included in the delivery object may be a condition related to the age of the assignable delivery person. The above-described preset conditions may be set in a policy by legal restrictions or by a service provider.

The device 100 may determine an optimal delivery person for performing the delivery order D2 from among one or more candidate delivery persons (R2 and R7 in FIG. 2). The device 100 determines a delivery route for performing both the delivery order D2 and the delivery order already allocated and held for each of the one or more candidate delivery agents, and in performing delivery through the delivery route, the delivery order D2 Can determine the amount of increase in delivery cost by The apparatus 100 may perform a process of determining a delivery route and an increase in delivery cost for each candidate delivery person in parallel. A specific method of determining the optimal delivery route will be described later. The apparatus 100 may determine an optimal delivery person corresponding to the delivery order D2 based on the amount of increase in delivery cost determined for each candidate delivery person.

In the example of FIG. 2, the delivery person R7 may currently have delivery orders D_c1 and D_c2 that are already assigned. The apparatus 100 may determine an optimal delivery route for the delivery person R7 to perform delivery orders D_c1, D_c2, and D2 by adding the delivery order D2 to be assigned to the delivery person. The apparatus 100 may determine an increase amount of the delivery cost by the delivery order D2 when the delivery person R7 performs delivery through the optimal delivery route. The device 100 subtracts the delivery cost of performing the delivery orders D_c1 and D_c2 along the corresponding delivery route from the total delivery cost of performing the delivery orders D_c1, D_c2 and D2 along the corresponding delivery route, thereby delivering the delivery by the delivery order D2. You can determine the amount of increase in cost. For example, the optimal delivery route is {[Current location of delivery source R7]-[D_c1 receipt of goods]-[D2 receipt of goods]-[D_c1 delivery of goods]-[D_c2 receipt of goods]-[D2 receipt of goods] Delivery destination]-[D_c2 delivery destination]] can be assumed to be determined. This delivery route may be a delivery route starting from the current position of the delivery person R7, passing through the item receiving place of D_c1, the item receiving place of D2, and the like, and reaching the delivery place of the item of D_c2. In this case, the total delivery cost for performing the delivery orders D_c1, D_c2 and D2 may mean the delivery cost consumed for the delivery person R7 to perform D_c1, D_c2, and D2 along a corresponding optimal delivery route. In addition, the delivery cost for carrying out delivery orders D_c1 and D_c2 along the corresponding delivery route means that the delivery person R7 is {[the delivery person R7's current location]-[D_c1's delivery destination]-[D_c1's delivery destination]-[D_c2's delivery destination] ]-It may mean the delivery cost consumed to perform the delivery orders D_c1 and D_c2 along the path of [D_c2 delivery destination]}.

Likewise, the delivery person R2 may currently have a delivery order D_c3 that is already assigned. The apparatus 100 may determine an optimal delivery route for the delivery person R2 to perform delivery orders D_c3 and D2 by adding the delivery order D2 to be assigned to the delivery person. The device 100 may determine an increase in the delivery cost by the delivery order D2 when the delivery person R2 performs delivery through a corresponding delivery route. The device 100 subtracts the delivery cost for performing the delivery order D_c3 along the delivery route from the total delivery cost for performing the delivery orders D_c3 and D2 along the corresponding delivery route, thereby reducing the increase in the delivery cost by the delivery order D2. You can decide.

The apparatus 100 may determine an optimal delivery person corresponding to the delivery order D2 based on the amount of increase in delivery cost calculated for each of the candidate delivery persons R2 and R7 (250). In one embodiment, the device 100 may determine the optimal delivery source probabilistically based on the amount of each delivery cost increase. A probabilistic optimal delivery source determination process will be described later. When the device 100 determines an optimal delivery person corresponding to the delivery order D2, the device 100 may transmit information on the delivery order D2 to the terminal of the delivery person. In the example of Fig. 2, the delivery person R2 is determined as the optimal delivery person.

When the process of allocating a delivery person for the delivery order D2 is completed, the device 100 may perform a delivery person assignment process for the next delivery order D1 that is sequentially selected (see 244 of FIG. 2). The process of allocating a delivery person for the delivery order D1 may be performed in the same manner as the process of allocating a delivery person for the delivery order D2 (260). Since the delivery person assignment process is sequentially performed, in the delivery person assignment process for the delivery order D1, the result of the delivery person assignment process for the delivery order D2 previously performed may be affected. For example, in the case of delivery person R2, which is one of the candidate delivery persons of delivery order D1, delivery order D2 in addition to delivery order D_c3 is regarded as currently possessed, and the delivery person assignment process may proceed. The apparatus 100 may calculate an optimal delivery route and an increase in delivery cost for each candidate delivery person R1 and R2 for the delivery order D1, and then determine the optimal delivery person R2 based on the increase in delivery cost.

3 is a block diagram of an apparatus 100 according to an embodiment of the present disclosure. In one embodiment, device 100 may include one or more processors 310 and/or one or more memories 320. In one embodiment, at least one of the components of the device 100 may be omitted, or another component may be added to the device 100. In one embodiment, additionally or alternatively, some components may be integrated and implemented, or may be implemented as a singular or plural entity. In the present disclosure, one or more processors 310 may be referred to as processors 310. The expression processor 310 may mean a set of one or more processors, unless clearly expressed otherwise in context. In the present disclosure, one or more memories 320 may be referred to as memory 320. The expression memory 320 may mean a set of one or more memories, unless clearly expressed otherwise in context. In one embodiment, at least some of the components inside and outside the device 100 are a bus, general purpose input/output (GPIO), serial peripheral interface (SPI), mobile industry processor interface (MIPI), and the like. They are connected to each other, and data and/or signals can be exchanged.

The processor 310 may control at least one component of the device 100 connected to the processor 310 by driving software (eg, a command, a program, etc.). In addition, the processor 310 may perform various operations related to the present disclosure, processing, data generation, and processing. In addition, the processor 310 may load data or the like from the memory 320 or may store the data in the memory 320. In one embodiment, the processor 310 creates a matching pool by pooling a delivery order from the delivery order pool, selects a delivery order that is a delivery person assignment target from the matching pool, determines a candidate delivery person for the delivery order, and then each candidate delivery person The delivery route and the amount of increase in delivery cost according to the delivery route are determined, the optimal delivery person corresponding to the delivery order is determined based on the amount of each delivery cost increase, and the communication circuit is controlled to send the delivery order to the determined delivery person's terminal. Can convey information about it.

The memory 320 may store various types of data. Data stored in the memory 320 is data acquired, processed, or used by at least one component of the device 100 and may include software (eg, instructions, programs, etc.). The memory 320 may include volatile and/or nonvolatile memory. In the present disclosure, commands or programs are software stored in the memory 320, and various functions such that an operating system, an application program, and/or an application program for controlling the resources of the device 100 can utilize the resources of the device 100. May include middleware that provides the application program to the application program. In one embodiment, the memory 320 may store instructions that cause the processor 310 to perform an operation when executed by the processor 310. In one embodiment, the memory 320 may store one or more delivery orders, information on delivery personnel, information on users, information on stores, and the like.

In one embodiment, the device 100 may further include a communication circuit 330. The communication circuit 330 may perform wireless or wired communication between the device 100 and a server, or between the device 100 and another device. For example, the communication circuit 330 is eMBB (enhanced mobile broadband), 　URLLC (Ultra Reliable Low-Latency Communications), MMTC (Massive Machine Type Communications), LTE (Long-Term Evolution), LTE-A (LTE Advance) , NR (New Radio), UMTS (Universal Mobile Telecommunications System), GSM (Global System for Mobile communications), CDMA (Code Division Multiple Access), WCDMA (Wideband CDMA), WiBro (Wireless Broadband), WiFi (Wireless Fidelity), Wireless communication may be performed according to a method such as Bluetooth, Near Field Communication (NFC), Global Positioning System (GPS), or Global Navigation Satellite System (GNSS). For example, the communication circuit 330 performs wired communication according to a method such as Universal Serial Bus (USB), High Definition Multimedia Interface (HDMI), Recommended Standard-232 (RS-232), or Plain Old Telephone Service (POTS). You can do it. In one embodiment, the communication circuit 330 may communicate with devices such as the user's terminal 112, the deliveryman's terminal 122, and the store terminal 132. In an embodiment, the processor 310 may obtain information from a separate server or database by controlling the communication circuit 330. Information obtained from a separate server or database may be stored in the memory 320.

In one embodiment, the device 100 may be in various forms other than a server. For example, the device 100 may be a portable communication device, a computer device, or a device according to a combination of these devices. However, the device 100 of the present disclosure is not limited to the above-described devices.

Various embodiments of the apparatus 100 according to the present disclosure may be combined with each other. Each of the embodiments may be combined according to the number of cases, and the combined embodiments are also within the scope of the present disclosure. In addition, internal/external components of the device 100 according to the present disclosure may be added, changed, replaced, or deleted according to embodiments. In addition, internal/external components of the device 100 may be implemented as hardware components.

In the present disclosure, the user's terminal 112 and the deliveryman's terminal 122 may be various types of electronic devices. For example, each of the user's terminal 112 and the deliveryman's terminal 122 is a portable communication device (eg, a smartphone), a computer device (eg, a tablet PC, a laptop), a portable multimedia device, and a wearable. ) Device or a combination of these devices. A program (eg, an application program) providing a delivery process management technology according to the present disclosure may be installed in the user's terminal 112 and the delivery person's terminal 122. Alternatively, the user's terminal 112 and the delivery person's terminal 122 may access a web page providing a delivery process management technology according to the present disclosure. Each of the user's terminal 112 and the deliveryman's terminal 122 may include one or more processors, one or more memories, and/or communication circuits. One or more memories may store instructions that cause one or more processors to perform an operation when executed by one or more processors. Each processor of the user's terminal 112 and the delivery person's terminal 122 may perform operations corresponding to the operations of the apparatus 100 described above according to the delivery process management technology according to the present disclosure. The apparatus 100 according to the present disclosure includes the user's terminal 112 to the delivery man's terminal 122 through the above-described program (eg, an application program) installed in the user's terminal 112 to the delivery man's terminal 122. Can communicate with In addition, the device 100 may provide a web page for providing a delivery process management technology according to the present disclosure.

4 is a diagram illustrating a process of determining a delivery cost for one delivery order according to an embodiment of the present disclosure. As described above, the delivery cost according to a predetermined delivery order may mean the amount of resources consumed to perform the delivery order. In general, delivery costs can be calculated as the amount of resources consumed by a specific delivery person to fulfill a delivery order.

In one embodiment, the delivery cost for a given delivery order is the total time it takes for a delivery person to fulfill the delivery order, the time it takes to deliver the goods to the delivery destination after receiving the goods at the delivery order, and the amount of the goods. It may be determined based on at least one selected from a time passing through the target time of receipt and a time passing through the target time of delivery of the goods. In one embodiment, the delivery cost may be calculated according to the following equation.

In Equation 1, M may mean the total amount of time to perform the entire process of the delivery order. That is, M may mean a time from the time when the delivery order is generated by the user 110 to the time when the delivery of the goods is completed when a specific delivery person performs the delivery order. Depending on the embodiment, M may mean a time expected to be taken to perform the entire process of the delivery order described above. Estimated time for the entire process is the allotted time for each store's time zone, the time of receipt of goods by the store's time zone, delivery distance, weather, number of deliveries per delivery person, number of deliveries held by the delivery person, and for a predetermined time (e.g. 30 minutes). Of delivery orders, number of delivery orders assigned during a predetermined time, holiday information, time zone information, delivery agent management point, number of active delivery personnel during the last predetermined time, number of delivery personnel assigned during the last predetermined time, etc. It can be determined based on To each of the pieces of information, coefficients for adjusting the weight of the corresponding information may be applied (eg, a distance coefficient by weather, etc.).

A may mean a time beyond the delivery target time point. The delivery target time may be a fixed value determined by the device 100 according to a preset criterion when a delivery order is generated. When a specific delivery person performs the delivery order, A may mean a time when the actual delivery time of the goods exceeds the delivery target time of the delivery order. Depending on the embodiment, when a specific delivery person performs a corresponding delivery order, A may mean a time when the expected delivery time of the goods exceeds the delivery target time of the delivery order.

B may mean the time beyond the target time of receipt. When a delivery order is generated, the device 100 or the delivery person may request the store 130 to prepare an item to be delivered (eg, cooking food). The target time point for receipt may be a fixed value determined by the device 100 according to a preset criterion when a request for preparation of goods for a delivery order is requested. When the delivery order is performed by a specific delivery person, B may mean a time when the actual receipt of the goods at the delivery order exceeds the target reception time of the delivery order. Depending on the embodiment, when a specific delivery person performs a corresponding delivery order, B may mean a time when the expected time at which the goods are received at the delivery order exceeds the target time of receipt of the delivery order.

C may mean the time from receipt of the item to completion of delivery of the item. In one embodiment, when a specific delivery person performs a delivery order, C may mean a time interval between the delivery time of the actual product and the receipt of the actual product. In one embodiment, when a specific delivery person performs a delivery order, C may mean a time interval between an expected delivery time of the product and an expected delivery of the product.

A, b, and c of Equation 1 may be parameters for adjusting the quality of delivery. A, b and c can be determined and adjusted by a service provider (delivery management service company) according to business, business, and policy reasons. a is a parameter that determines to what extent the delivery target time point is to be observed, and b may be a parameter that determines how much to comply with the receipt target time point. The larger a is set, the larger the delivery cost according to the time elapsed from the delivery target time point, and the larger the b is, the larger the delivery cost according to the time elapsed the receipt target time point may be calculated. For example, when a specific delivery person performs a predetermined delivery order, if the expected item receipt time is expected to exceed the collection target time, the delivery cost of the delivery person for the delivery order is calculated high, and the delivery person The delivery order may not be assigned. c may be a parameter that determines the degree to which the value of the product decreases over time after receiving the product (eg, food). c may be set differently depending on factors such as the store, the item to be delivered, and the weather. For example, in the case of food that is easily perishable, the value of the article rapidly decreases over time, so the value of c may be set large.

In one embodiment, the delivery cost may be calculated for a case where a predetermined delivery person performs a predetermined delivery order, and is a cost incurred when a predetermined delivery person performs all of the delivery orders to be processed. It may be calculated, or it may be calculated as a cost in case all delivery men perform all delivery orders that must be handled by all delivery personnel in the entire delivery management system. As described above, when a delivery order is selected from the matching pool, the delivery cost may be calculated only with information determined by the attribute of the delivery order itself, irrespective of the delivery person.

5 is a diagram illustrating a process of determining an optimal delivery route according to an embodiment of the present disclosure. As described above, for each candidate delivery person, the apparatus 100 may determine an optimal delivery route for performing both a delivery order already held by the corresponding candidate delivery person and a delivery order newly allocated.

Specifically, the processor 310 may determine a delivery path for performing a delivery order D1 to which one candidate delivery person R2 is assigned. In the example of FIG. 5, the candidate delivery person R2 may already hold delivery orders D_c2 and D_c3. Here, the delivery order D1 may have a destination p1 and a delivery destination d1. The delivery order D_c2 may have an item receipt p_c2 and an item delivery d_c2. The delivery order D_c3 may have an item receipt p_c3 and an item delivery d_c3.

The processor 310 may determine a delivery route by selecting one of the delivery orders D_c2 and D_c3 already held and the delivery order D1 to be allocated, for example, D_c3 (510). This delivery route can be called a primary route. In the case of a single delivery order, since there is only one delivery destination for the goods and one delivery destination for the goods, only one possible delivery route can be derived (512). Therefore, only one optimal delivery route among possible delivery routes may be derived (514).

The processor 310 may determine one or more K-th paths by repeatedly performing the path determination operation one or more times based on the determined primary path (520, 530). K may be the total number of delivery orders D_c2 and D_c3 already held and delivery orders D1 to be allocated (ie, 3 in the example of FIG. 5). The route determination operation selects a delivery order (e.g. D_c2) not included in the Nth route (e.g., 1st route) among delivery orders D_c2 and D_c3 already held and the delivery order D1 to be assigned to the delivery order. It may include an operation that creates a plurality of routes by adding an item receiving destination (e.g. p_c2) and a delivery destination (e.g. d_c2) of (e.g. D_c2) to an N-th route (e.g., a primary route). In addition, the route determination operation may include an operation of determining one or more (N+1)-order routes (eg, secondary routes) having a small delivery cost among the plurality of generated routes. Here, N may be an integer less than K and greater than or equal to 1.

Specifically, the processor 310 may select a delivery order D_c2 that is not included in the primary path 514 from among delivery orders D_c2 and D_c3 already held and delivery orders D1 to be allocated. The processor 310 may generate a plurality of paths 522 by adding the item receiving destination p_c2 and the product delivery destination d_c2 of the delivery order D_c2 to the corresponding primary route 514. The item destination p_c2 and the item delivery destination d_c2 may be added in between, or before or after, in combination with the waypoints p_c3 and d_c3 of the primary route 514, depending on the number of possible cases. That is, the plurality of paths 522 may be paths generated according to all possible combinations in which the item receiving point p_c2 and the article delivery point d_c2 can be added to the primary route 514. The processor 310 may select one or more routes from among the plurality of generated routes 522 in the order of lower delivery cost, and determine this as the secondary route 524. In an embodiment, the processor 310 may select a preset number of paths in the order of a small delivery cost among a plurality of paths. In one embodiment, the number of selected paths may be three.

The processor 310 may determine the 2nd, 3rd, ..., K-th path in the same manner. In the example of FIG. 5, the processor 310 may select a delivery order D1 not included in the secondary path 524 from among delivery orders D_c2 and D_c3 already held and delivery orders D1 to be allocated. The processor 310 may generate a plurality of routes by adding the item receipt p1 and the item delivery destination d1 of the delivery order D1 to the second route 524. In the path determination operation of the secondary path previously performed, since one or more secondary paths (eg, three secondary paths) have been determined, the processor 310 is configured to receive the item p1 for each secondary path 524 by the number of cases. You can create multiple routes by adding the delivery destination d1 and the goods. In other words, a plurality of routes 534 are created by adding an item receipt p1 and an item delivery destination d1 to one of the secondary routes, and a plurality of routes 536 by adding an item receipt p1 and an item delivery destination d1 to the other one of the secondary routes. ) Can be created. The processor 310 may select one or more routes having a low delivery cost from among the generated plurality of routes 534 and 536 and determine this as the third route 538.

The processor 310 may repeatedly perform a path determination operation in this manner to determine one or more K-order paths (eg, a third-order path). The processor 310 selects one path with the lowest delivery cost among one or more K-th paths (eg, a third path), and this is optimal for the corresponding candidate delivery person R2 to perform the corresponding delivery orders D_c2, D_c3, and D1. Can be determined by the delivery route of.

6 is a diagram for explaining a process of probabilistically determining an optimal delivery source for a delivery order according to an embodiment of the present disclosure. As described above, the device 100 determines a delivery path for performing an allocation target delivery order for each candidate delivery person, and the amount of increase in delivery cost generated by the allocation target delivery order in performing delivery according to the delivery path May be determined, and an optimal delivery source corresponding to the delivery order may be determined based on the amount of increase in delivery cost. In one embodiment, the device 100 may determine an optimal delivery source corresponding to the delivery order probabilistically based on the amount of increase in the delivery cost.

Specifically, the processor 310 may calculate a probability P that each candidate delivery person is determined to be a delivery person corresponding to a corresponding delivery order, based on the amount of increase in delivery cost determined for each candidate delivery person. For example, the amount of increase in delivery cost may be calculated for the optimal delivery route determined in FIG. 5. Probability P can be calculated according to the following equation.

As in Equation 2, the probability P may have a negative correlation with an increase in delivery cost for each candidate delivery source. In other words, the larger the delivery increase, the smaller the probability (P), and the smaller the delivery increase, the larger the probability (P). The processor 310 may determine one of the candidate delivery persons as the best delivery person corresponding to the delivery order to be assigned based on the calculated probability P for each candidate delivery person. For example, the probability (P) of 25%, 30%, 20%, 5%, 5%, 1%, etc. can be determined for each of the delivery people R1, R2, R3, R4, R5, ..., Rm. have. According to the probability (P), the processor 310 is one of the delivery people R1, R2, R3, R4, R5, ..., Rm, for example, the delivery person R3 is the best delivery person corresponding to the delivery order to be assigned. Can be determined.

In Equation 2, T may be a parameter set to adjust the probability P. As T is set to a value close to 0, the probability that the delivery order will be allocated to the candidate delivery person R2 with the smallest increase in delivery cost may increase. When T is set to a value close enough to 0, the candidate R2 with the smallest increase in delivery cost can always be determined as the best delivery source of the corresponding delivery order (greedy method). In this case, the processor 310 may determine the magnitude of the increase in delivery cost of each candidate delivery person, and determine the candidate delivery person R2 with the smallest increase in delivery cost as an optimal delivery person corresponding to the delivery order. Meanwhile, as T is set larger, the corresponding delivery order may be allocated to one of the candidate delivery agents R1, R2, R3, R4, R5, ..., Rm with almost the same probability. That is, the processor 310 may randomly determine a delivery person among the candidate delivery persons as the best delivery person for the corresponding delivery order.

When the device 100 determines the delivery person with the smallest amount of increase in delivery cost as the optimal delivery person, the delivery cost can be minimized in processing individual delivery orders. When the device 100 determines the optimal delivery source probabilistically, it may be helpful to optimize the total delivery cost consumed for processing all delivery orders managed by the device 100. For example, short-distance delivery orders may be more effective in reducing the delivery cost of the entire delivery management system if they are assigned to a delivery person using a slower vehicle rather than a delivery person using a fast vehicle. This is because it is possible to allocate a long-distance delivery order to a delivery person using a fast transportation means only when this allocation is made. However, for delivery orders where the difference in delivery costs between means of transportation is not significant, assignment to a delivery person using a slow means of transportation may be effective in reducing delivery costs of the entire delivery management system. To this end, for delivery orders in which the difference in delivery cost between the means of transportation is not large, the probability calculation process may be adjusted so that the probability (P) of the delivery personnel does not differ significantly depending on the means of transportation.

As described above, when an optimal delivery person corresponding to one delivery order D1 is determined, the device 100 may transmit information on the delivery order D1 to the terminal of the delivery person. In one embodiment, processing after the optimal delivery person is determined may vary depending on how the delivery person determined as the optimal delivery person selects to be assigned a delivery order.

There may be an automatic allocation method and a competitive allocation method as a method of receiving delivery order allocation. The automatic allocation method may be a method in which a delivery management service company automatically allocates an appropriate delivery order to a delivery person. For example, if the delivery person R3 determined as the best delivery person for the delivery order D1 is the delivery person who has selected the automatic allocation method, the processor 310 may directly allocate the delivery person R3 as the best delivery person of the delivery order D1. In other words, in receiving the delivery order D1 from the processor 310 and the delivery person R3, there is no competition between other delivery personnel. The processor 310 may control the communication circuit 330 to transmit first information for executing the delivery order D1 allocated to the terminal of the delivery person R3. The first information includes information indicating that the delivery person R3 is assigned to the delivery order D1, information on the destination and delivery destination of the delivery order D1, information on the goods to be delivered, information on the store that provides the goods, and performs the delivery order D1. Information on an optimal route to be delivered, payment information for an item to be delivered, and the like may be included. The deliveryman R3, which has received the first information through his terminal, may perform a delivery order D1 according to the first information.

The competition allocation method may be a method in which a delivery management service company provides a list of delivery orders to delivery persons, and the delivery person directly selects a delivery order to be performed by himself from the corresponding list, so that the delivery order is allocated. For example, if the delivery person R1 determined as the best delivery person for the delivery order D1 is the delivery person who selects the competition allocation method, the processor 310 may expose the delivery order D1 to the delivery order list of the delivery person R1. That is, the processor 310 may transmit the second information for selecting and receiving the delivery order D1 to the terminal of the delivery person R1. In the second information, information for the delivery order D1 to be included in the delivery order list, information on the destination and delivery destination of the delivery order D1, information on the goods to be delivered, information on the store providing the goods, and performing the delivery order D1. Information on the optimal route for delivery, payment information for the goods to be delivered, information on the time when delivery order D1 is created, information on the number of couriers exposed through the delivery order list by delivery order D1, delivery order D1 It may include information on the compensation given to the delivery person when performing the procedure. The terminal of the delivery person R1 may include information on the delivery order D1 in the delivery order list according to the received second information, and display the delivery order list through the screen. If the delivery person R1 wants to be assigned the delivery order D1, it can select and receive the delivery order D1 from the delivery order list.

7 is a diagram illustrating a process of expanding a range in which a delivery order to be allocated is exposed to a delivery order list in a contention allocation scheme according to an embodiment of the present disclosure. If the delivery order D1 is not assigned to the delivery person R1 within a preset time interval in the delivery order list, the processor 310 transmits the second information to terminals of other delivery personnel other than the delivery person R1, so that the delivery order D1 can display the delivery order list. Through this, you can expand the range of exposure. In this case, the delivery personnel to which the second information is additionally transmitted may be delivery personnel who have selected the contention allocation method.

Specifically, when the delivery order D1 is included in the matching pool for the first time and undergoes a delivery agent assignment process, the processor 310 may transmit the second information on the delivery order D1 only to the terminal of the optimal delivery person R1 determined previously. Accordingly, the delivery order D1 may be exposed only to the delivery order list of the optimal delivery person R1 for a preset time interval 710. That is, during this time interval 710, the delivery order D1 may be recommended only to the best delivery person R1. The time interval exposed only to the optimal delivery source R1 may be, for example, 15 seconds. If the delivery order D1 is selected to the best delivery person R1 within the corresponding time interval 710 (eg, 0-15 seconds), the delivery order D1 is assigned to the best delivery person R1, and may be performed by the best delivery person R1.

If the delivery order D1 is not selected for the best delivery person R1 within the time interval 710, the processor 310 may transfer the second information on the delivery order D1 with one or more delivery people, for example delivery person R5, including the best delivery person R1. It can be additionally delivered to the terminal of R4. In one embodiment, the second information may not be delivered again at the next time interval to the terminal of the delivery person who transmitted the second information at the previous time interval. Accordingly, the delivery order D1 may be exposed to other delivery people R5 and R4 newly added in addition to the optimal delivery person during a preset time interval (720, for example, 15-30 seconds). Here, the delivery personnel R5 and R4 to which the delivery order D1 is additionally exposed may be delivery personnel of a competitive allocation scheme who occupied a ranking next to the optimal delivery person in the process of selecting an optimal delivery person based on a previous probability. In one embodiment, the number of additionally exposed delivery personnel may be two. In this case, the additionally exposed delivery people R5 and R4 may be delivery people determined to be suitable for the delivery order D1, respectively, second and third place after the best delivery person R1 in the process of selecting the optimal delivery person described above. In the above-described process of selecting an optimal delivery person, when delivery person R1 is determined as the best delivery person according to a probability of 25%, a ranking among delivery persons who select a competition allocation method may be determined according to the probability P. For example, delivery person R5 may be ranked second, and delivery person R4 may be determined third. When the delivery order D1 is selected by one of the delivery persons R1, R5, and R4 within the time interval 720, the delivery order D1 may be assigned to and executed by the corresponding delivery person.

If the delivery order D1 is not selected to the delivery persons R1, R5, and R4 within the time interval 720, the processor 310 includes one or more delivery persons R9 and R7 including the delivery persons R1, R5 and R4 that previously delivered the second information. The second information on the delivery order D1 may be additionally delivered to the terminal of. Accordingly, the delivery order D1 may be exposed to a total of five delivery men R1, R5, R4, R9, and R7 during the next time interval (730, for example, 30-45 seconds). Here, the two additional delivery personnel R9 and R7 may be delivery personnel who ranked 4th and 5th respectively in the process of selecting an optimal delivery person. If the delivery order D1 is selected by one of the delivery persons R1, R5, R4, R9, and R7 within the corresponding time interval 730, the delivery order D1 may be assigned to and executed by the corresponding delivery person.

If the delivery order D1 is not selected to the delivery people R1, R5, R4, R9 and R7 within the time interval 730, the processor 310 is the delivery people R1, R5, R4, R9 and R7 who previously delivered the second information. Including, the second information on the delivery order D1 may be additionally delivered to the terminals of one or more delivery sources R13, R15, R6, R10, and R21. Accordingly, the delivery order D1 may be exposed to a total of 10 delivery men R1, R5, R4, R9, R7, R13, R15, R6, R10, and R21 during the next time interval (740, for example, 45-60 seconds). The five additional couriers could each be the couriers in the 6th-10th place. If the delivery order D1 within the time interval 740 is selected by one of the delivery people R1, R5, R4, R9, R7, R13, R15, R6, R10 and R21, the delivery order (D1) is assigned to the delivery person. Can be done.

In this way, if delivery order D1 is exposed during the time interval corresponding to the pooling period (e.g., 1 minute) and cannot be selected by the delivery man, the delivery order D1 is included in the next matching pool (second matching pool). As a result, you can go through the process of assigning a delivery person second. As described above, this is because the processor 310 generates a matching pool by pooling unallocated delivery orders by the delivery person every pooling period (eg, 1 minute).

The processor 310 is a preset time interval for a total of 10 delivery personnel, including 10 delivery persons R1, R5, R4, R9, R7, R13, R15, R6, R10, R21, who were exposed in the previous matching pool (e.g.: Delivery order (D1) can be exposed for 1 minute). In one embodiment, 7 couriers excluding some (e.g., 3) who were unable to perform delivery orders out of 10 previously recommended targets, and ranked 1-3 for delivery order (D1) in the second matching pool calculation. The delivery order D1 may be exposed to three delivery men in the occupied competitive allocation scheme.

In this way, if a delivery order (D1) is exposed during the time interval corresponding to the second pooling cycle (e.g., 1 minute) and cannot be selected by the delivery man, the delivery order (D1) is transferred to the next matching pool (three minutes). It is included in the third matching pool) and can go through the process of assigning a delivery person for the third time. After the third matching process, the delivery order D1 may be exposed to candidate deliverers of all competing allocation schemes.

For example, the server may collect delivery orders generated between 9:00:00 and 9:00:59, and perform a deliveryman matching calculation at 9:01:00. If the calculation process took 5 seconds and the selected optimal delivery person is the delivery person of the competitive allocation method, the delivery order can be independently recommended to the optimal delivery person from 9:01:05 to 15 seconds. If the delivery order is not assigned by the single recommendation process, the server can make a competitive recommendation to 3 delivery people from 9:01:20 to 15 seconds. If the delivery order is still not assigned, the server can make a competitive recommendation to 5 couriers from 9:01:35 to 15 seconds. If the delivery order is still not assigned, the server can make a competitive recommendation to 10 couriers from 9:01:50 to 15 seconds. If the delivery order allocation fails, the delivery order is included in the next matching pool, and the deliveryman matching calculation may be performed again. The calculation may be executed at 9:2:05, which is one minute after 9:01:05 when the calculation of the previous matching pool is completed. Until the completion of the calculation, for example, if the calculation took 4 seconds, up to 2 minutes and 4 seconds, an empty delivery order list may be exposed to the delivery personnel.

In one embodiment, the number of delivery people (eg, 5 people) to whom the second information was transmitted additionally in one time interval (eg, 740) is the delivery agency to whom the second information was transmitted in addition to the previous time interval (eg, 730). May be greater than or equal to the number of (eg 2). In one embodiment, the number of delivery people to whom the delivery order is exposed at each time interval may be set differently according to the intention of the implementer.

In one embodiment, when a plurality of delivery orders are exposed to a delivery order list of a delivery person, a plurality of delivery orders may be arranged and exposed according to a basic sort order set in an application program of the delivery person terminal. In an embodiment, a service provider (delivery management service company) may have a branch (eg, a branch in southern Seoul) that manages delivery personnel for each region. Each branch can set the delivery order allocation method to be applied to the corresponding deliverers. For example, the southern Seoul branch may decide whether to allow delivery workers belonging to the southern Seoul branch to be assigned according to the automatic allocation method. In one embodiment, each delivery person at a point using the automatic allocation scheme may select an allocation scheme through the delivery person terminal.

8 is a diagram illustrating a process of notifying an item preparation request and an expected delivery completion point according to an embodiment of the present disclosure. In one embodiment, the delivery person 120 performing the delivery order 114 may directly request the store 130 to prepare an article (eg, food cooking). The delivery person 120 may transmit information for requesting preparation of goods to the terminal 132 of the store 130 through his terminal 122.

In one embodiment, the device 100 may predict the time when the delivery person 120 will arrive at the item receiving point or the store 130 and request the preparation of the item at an appropriate time point. For example, if food that takes 10 minutes for cooking needs to be delivered, and it is expected that it will take 15 minutes for the delivery person 120 to move from the current location to the destination, the processor 310 About 5 minutes after the delivery order is allocated, a request for cooking the food may be transmitted to the terminal 132 of the store 130. In one embodiment, the time point of the request for preparation of goods by the processor 310 may be changed according to information such as a delivery progress state (movement state) and a traffic state of the corresponding delivery person 120.

In the present disclosure, the store terminal 132 is provided on the store side in order to communicate with the device 100, the user's terminal 112 and/or the deliveryman's terminal 122 according to the delivery process management technology according to the present disclosure. It can be a device. The store terminal 132 may be a device of various types. For example, the store terminal 132 may be used in a portable communication device (eg, a smartphone), a computer device (eg, a tablet PC, a laptop, a desktop), a portable multimedia device, a Point Of Sales (POS) device, or a combination of these devices. It may be a device according to. A program (eg, an application program) providing a delivery process management technology according to the present disclosure may be installed in the store terminal 132. Alternatively, the store terminal 132 may access a web page providing a delivery process management technology according to the present disclosure. The store terminal 132 may communicate with the device 100, the user's terminal 112, and/or the deliveryman's terminal 122 through a corresponding program or web page. The store terminal 132 may include one or more processors, one or more memories and/or communication circuits. One or more memories may store instructions that cause one or more processors to perform an operation when executed by one or more processors. The processor of the store terminal 132 may perform operations corresponding to the operation of the apparatus 100 described above according to the delivery process management technology according to the present disclosure.

In one embodiment, when the delivery man 120 performing the delivery order 114 receives the item at the item receiving location, the processor 310 is the terminal 112 of the user 110 at the expected time when the item will arrive at the item delivery location. Can convey information about. The processor 310 may determine an expected time point when the product will arrive at the delivery destination based on information such as a moving situation and a traffic situation of the delivery person 120. Through this, the user 110 can know when the final delivery of the goods is expected.

In one embodiment, the delivery man assigned to the delivery order may cancel the assignment of the delivery order. This can be done by a preset delivery order cancellation API (Application Program Interface). In one embodiment, the delivery order for which the allocation has been canceled may be included in the next matching pool and undergo the delivery agent allocation process again. In one embodiment, a delivery order whose allocation has been canceled may not be calculated from a matching pool, but may be exposed to candidate deliverers of a competitive allocation scheme. In one embodiment, the store has already requested preparation of the item, but the allocation of the delivery order may be canceled. In this case, the processor 310 may once allocate a virtual delivery person for the delivery order. The processor 310 may determine the remaining time until the preparation completion time of the article, and may increase the delivery fee according to the remaining time. Delivery charges may be remuneration paid to the delivery person. In one embodiment, a delivery charge premium may not be applied to delivery charges for some stores. For example, the time remaining until product preparation is completed can be obtained by adding the time required for preparing the product to the time the product is requested to be prepared, and subtracting the current time again. If the remaining time until preparation of the goods is less than 9 minutes, the delivery fee may be increased to 1,000 won, and if it is less than 8 minutes, the delivery fee may be increased to 1,100 won. If the remaining time until product preparation is less than or equal to the preset time, the service provider of the device 100 may directly determine the processing direction of the delivery order.

9 is a diagram showing an embodiment of a delivery process management method that can be performed by the device 100 according to the present disclosure. The delivery process management method according to the present disclosure may be a computer-implemented method. Although each step of the method or algorithm according to the present disclosure is described in a sequential order in the illustrated flowchart, each step may be performed in an order that can be arbitrarily combined by the present disclosure, in addition to being performed sequentially. The description in accordance with this flowchart does not exclude making changes or modifications to the method or algorithm, and does not imply that any step is essential or desirable. In one embodiment, at least some of the steps may be performed in parallel, repetitively or heuristically. In one embodiment, at least some of the steps may be omitted or other steps may be added.

The apparatus 100 according to the present disclosure may perform a delivery process management method according to various embodiments of the present disclosure in allocating a delivery order to a delivery person. In the delivery process management method according to an embodiment of the present disclosure, the step of selecting a first delivery order from among one or more delivery orders (S910), a first delivery person among candidate delivery persons, a first delivery order and a first delivery person already holding Determining a first delivery route for performing one or more second delivery orders (S920), among delivery costs consumed to perform delivery according to the first delivery route, a reduction of the delivery cost according to the first delivery order 1 determining an increase amount (S930), determining a first delivery person as a delivery person corresponding to the first delivery order based on the first increase amount (S940), and/or the first delivery order to the terminal of the first delivery person It may include a step (S950) of transmitting information about.

In step S910, the processor 310 of the device 100 may select a first delivery order from among one or more delivery orders stored in the memory 320. Here, the one or more delivery orders may mean delivery orders included in the matching pool. The first delivery order may refer to a delivery order that has been assigned to a delivery person. As described above, the processor 310 may select delivery orders from the matching pool in the order in which the delivery cost of the delivery order is large.

In step S920, the processor 310, the first delivery person, one of the one or more candidate delivery personnel for the first delivery order, for performing the first delivery order and one or more second delivery orders held by the first delivery person. The first delivery route can be determined. The process of determining the delivery route is as described above. In an embodiment, the processor 310 may determine one or more candidate delivery agents capable of performing the first delivery order based on a preset condition. In one embodiment, the preset condition is at least selected from the payment method of the delivery order, whether alcoholic beverages are included in the delivery target product of the delivery order, the location of the receipt of the goods, the location of the delivery destination, the location of the delivery person, and the means of movement of the delivery person. It may be a condition set based on one.

In step S930, the processor 310 may determine a first increase amount, which is an increase amount of the delivery cost by the first delivery order, among delivery costs consumed by the first delivery person to perform delivery according to the first delivery route. In step S940, the processor 310 may determine the first delivery person as the delivery person corresponding to the first delivery order based on the first increase amount. In step S950, the processor 310 may control the communication circuit 330 to transmit information on the first delivery order to the terminal of the first delivery person.

In one embodiment, step S940 includes the step of calculating a probability P and/or determining a first delivery person as a delivery person corresponding to the first delivery order according to the probability P, based on the first increase amount. can do. The probability P is a probability used to determine the first delivery person as the delivery person corresponding to the first delivery order, and may have a negative correlation with the first increase amount. This may correspond to an embodiment of determining an optimal delivery source when T is set to be greater than 0 in Equation 2.

In one embodiment, the processor 310, as in steps S920 and S930, a second delivery person, one of the one or more candidate delivery personnel, performs one or more third delivery orders already held by the first delivery order and the second delivery person. It is possible to determine a second delivery route for the purpose. The process of determining the delivery route is as described above. The processor 310 may determine a second increase amount, which is an increase amount of the delivery cost by the first delivery order, among delivery costs consumed by the second delivery person to perform delivery according to the second delivery route. At this time, in step S940, the processor 310 determines the magnitude of the first increase amount and the second increase amount, and/or according to the determination that the first increase amount is less than the second increase amount, the first delivery person order the first delivery. It is possible to perform the step of determining the delivery source corresponding to. This may correspond to an embodiment in which T=0 in Equation 2, that is, an embodiment in which an optimal delivery source is determined according to a greedy method.

In one embodiment, step S920, the first delivery order and the step of determining a first route based on the item delivery destination and the item delivery destination of one of the first delivery order and one or more second delivery orders, based on the first route, determining the route It may include determining the K-th path by repeatedly performing the operation at least once, and/or determining a path having the lowest delivery cost among the K-th paths as the first delivery path. The path determination operation is as described above. The route determination operation is an operation of generating a plurality of routes by adding an item destination and an item delivery destination of a delivery order not included in the N-th route among the first delivery order and one or more second delivery orders to the N-th route, and/or It may include an operation for determining one or more (N+1)-order routes having a small delivery cost among the plurality of routes.

In one embodiment, the delivery cost is the total time it takes for the delivery person to perform the delivery order, the time it takes to deliver the goods to the delivery destination after receiving the goods at the delivery order, and exceeds the target time of receipt of the goods. It may be calculated based on at least one selected from the time and the time passing through the target time of delivery of the goods. The delivery cost may be calculated by the processor 310.

In an embodiment, in step S950, when the first delivery person determined to correspond to the first delivery order is the delivery person who selects delivery order assignment according to the first method, first information for performing the first delivery order is provided to the first delivery person. It may include the step of transmitting to the terminal of the delivery person. Here, the first method may be the above-described automatic allocation method.

In an embodiment, in step S950, when the first delivery person determined to correspond to the first delivery order is the delivery person who selects delivery order assignment according to the second method, second information for selecting and receiving the first delivery order is provided. If the first delivery order is not allocated within a preset time interval after the step of delivering to the terminal of the first delivery person and/or the delivery of the second information, each of the terminals of the first delivery person and at least one third delivery person selecting the second method It may include the step of additionally transmitting the second information to the. Here, the second scheme may be the aforementioned contention allocation scheme. The at least one third delivery person may be a delivery person who selects a competitive allocation method among candidate delivery personnel of the first delivery order, and may be delivery personnel to which the first delivery order is additionally exposed after a preset time interval. As described above, the third delivery person may be delivery people who rank next to the best delivery person in the process of determining the optimum delivery person.

Various embodiments of the present disclosure may be implemented as software recorded on a machine-readable recording medium. The software may be software for implementing the various embodiments of the present disclosure described above. Software may be inferred from various embodiments of the present disclosure by programmers in the art to which this disclosure pertains. For example, software may be a device-readable instruction (eg, code or code segment) or program. The device is a device capable of operating according to a command called from a recording medium, and may be, for example, a computer. In one embodiment, the device may be the device 100 according to embodiments of the present disclosure. In one embodiment, the processor of the device may execute a called command so that components of the device perform a function corresponding to the command. In one embodiment, the processor may be one or more processors 310 according to embodiments of the present disclosure. The recording medium may refer to any kind of recording medium in which data is stored that can be read by a device. The recording medium may include, for example, ROM, RAM, CD-ROM, magnetic tape, floppy disk, optical data storage device, and the like. In one embodiment, the recording medium may be one or more memories 320. In one embodiment, the recording medium may be implemented in a distributed form in a computer system connected by a network or the like. The software can be distributed, stored, and executed in a computer system or the like. The recording medium may be a non-transitory recording medium. The non-transitory recording medium refers to a tangible medium irrespective of whether data is semi-permanently or temporarily stored, and does not include a signal propagated in a transient manner.

Although the technical idea of the present disclosure has been described above by various embodiments, the technical idea of the present disclosure includes various substitutions, modifications, and changes that can be made within a range that can be understood by those of ordinary skill in the art to which the present disclosure belongs. Includes. In addition, it is to be understood that such substitutions, modifications and changes may be included within the scope of the appended claims.

Claims (20)

One or more processors; And
When executed by the one or more processors, including one or more memories storing instructions for causing the one or more processors to perform an operation,
The one or more processors,
Selecting a first delivery order from among one or more delivery orders stored in the one or more memories,
In order to determine a first delivery route for performing the first delivery order and one or more second delivery orders held by the first delivery person among the at least one candidate delivery person for the first delivery order, Determining a primary route based on an item receipt and an item delivery destination of one of the first delivery order and the one or more second delivery orders,
Based on the primary route, a route determination operation is performed a plurality of times to determine the K-th route, wherein K is the total number of the first delivery order and the at least one second delivery order,
A route having the lowest delivery cost among the K-th routes is determined as the first delivery route,
Of the delivery costs consumed to perform the delivery according to the first delivery route, a first increase amount of the delivery cost by the first delivery order is determined, and
Based on the first increase amount, determining the first delivery person as a delivery person corresponding to the first delivery order,
Delivering information on the first delivery order to the terminal of the first delivery person,
The path determination operation is:
A plurality of routes are created by selecting a delivery order not included in the N-th route among the first delivery order and the one or more second delivery orders, and adding the item receipt and delivery address of the selected delivery order to the N-th route. -N is an integer less than K and greater than or equal to 1 -; And
And an operation of determining a preset number of (N+1)-th paths in an order of small delivery cost among the plurality of paths.
The method of claim 1,
The one or more processors,
Based on the first increase amount, a probability used to determine the first delivery person as a delivery person corresponding to the first delivery order is calculated-the probability has a negative correlation with the first increase amount-,
Determining the first delivery person as a delivery person corresponding to the first delivery order according to the probability.
The method of claim 1,
The one or more processors,
A second delivery person among the one or more candidate delivery persons determines a second delivery route for performing the first delivery order and one or more third delivery orders held by the second delivery person,
Of the delivery costs consumed to perform the delivery according to the second delivery route, a second increase amount of the delivery cost due to the first delivery order is determined, and
Determining a magnitude of the first increase amount and the second increase amount,
According to a determination that the first increase amount is less than the second increase amount, determining the first delivery person as a delivery person corresponding to the first delivery order.
delete The method of claim 1,
The delivery cost is the total time required to execute the delivery order, the time required to deliver the goods to the delivery destination after receipt of the goods, the time to pass the target time of receipt of the goods, and the delivery target of the goods. The apparatus, which is calculated based on at least one selected from among times passing through the viewpoint.
The method of claim 1,
The one or more processors, based on a preset condition, determine the one or more candidate delivery sources for the first delivery order,
The preset condition is based on at least one selected from the payment method of the delivery order, whether alcoholic beverages are included in the delivery target product of the delivery order, the location of the delivery order, the location of the delivery destination, the location of the delivery person, and the transportation means of the delivery person. The device, which is a set condition.
The method of claim 1,
The one or more processors, when the first delivery person determined to correspond to the first delivery order is a delivery person who has selected delivery order assignment according to the first method, the first information for performing the first delivery order. 1 Device that delivers to the terminal of the delivery person.
The method of claim 1,
The one or more processors,
When the first delivery person determined to correspond to the first delivery order is a delivery person who selects delivery order assignment according to the second method, the terminal of the first delivery person receives second information for selecting and receiving the assignment of the first delivery order. And pass it to,
If the first delivery order is not allocated within a preset time interval after the delivery of the second information, the second information is additionally delivered to each of the terminals of the first delivery person and at least one third delivery person selecting the second method. To do, the device.
The method of claim 8,
The one or more processors,
If the first delivery order is not allocated within a preset time interval after the additional delivery of the second information, each of the terminals of the first delivery person, the at least one third delivery person, and the at least two fourth delivery people selecting the second method And further conveying the second information.
The method of claim 1,
The at least one processor sequentially selects a delivery order having a high delivery cost among the at least one delivery order and allocates a delivery person.
The method of claim 1,
The apparatus further comprises a communication circuit for communicating with a terminal of a user who has generated the first delivery order and a terminal of the first delivery person.
A method performed in an apparatus comprising at least one processor and at least one memory in which instructions for execution by the at least one processor are stored,
The one or more processors,
Selecting a first delivery order from among one or more delivery orders stored in the one or more memories;
In order to determine a first delivery route for performing the first delivery order and one or more second delivery orders held by the first delivery person among the at least one candidate delivery person for the first delivery order, Determining a primary route based on a destination of a delivery order and a delivery destination of one of the first delivery order and the one or more second delivery orders;
Determining a K-th route by performing a route determination operation a plurality of times based on the first route, wherein K is the total number of the first delivery order and the one or more second delivery orders;
Determining a route having the lowest delivery cost among the K-th routes as the first delivery route;
Determining a first increase amount of a delivery cost by the first delivery order from among delivery costs consumed to perform delivery according to the first delivery route;
Determining the first delivery person as a delivery person corresponding to the first delivery order based on the first increase amount; And
Including the step of transmitting information on the first delivery order to the terminal of the first delivery person,
The path determination operation is:
A plurality of routes are created by selecting a delivery order not included in the N-th route among the first delivery order and the one or more second delivery orders, and adding the item receipt and delivery address of the selected delivery order to the N-th route. Where N is an integer less than K and greater than or equal to 1; And
And an operation of determining a preset number of (N+1)-th paths in an order of small delivery cost among the plurality of paths.
The method of claim 12, wherein determining the first delivery person as a delivery person corresponding to the first delivery order,
Calculating a probability used to determine the first delivery person as a delivery person corresponding to the first delivery order based on the first increase amount-the probability has a negative correlation with the first increase amount- ; And
And determining the first delivery person as a delivery person corresponding to the first delivery order according to the probability.
The method of claim 12,
Determining, by a second delivery person among the at least one candidate delivery person, a second delivery route for performing the first delivery order and at least one third delivery order held by the second delivery person; And
The step of determining a second increase amount of the delivery cost by the first delivery order from among delivery costs consumed to perform the delivery according to the second delivery route,
The step of determining the first delivery person as a delivery person corresponding to the first delivery order,
Determining a magnitude of the first increase amount and the second increase amount; And
Upon determining that the first increase amount is less than the second increase amount, determining the first delivery person as a delivery person corresponding to the first delivery order
Including, the method.
delete The method of claim 12,
The delivery cost is the total time required to execute the delivery order, the time required to deliver the goods to the delivery destination after receipt of the goods, the time to pass the target time of receipt of the goods, and the delivery target of the goods. It is calculated based on at least one selected from the time passing through the viewpoint.
The method of claim 12,
Based on a preset condition, further comprising the step of determining the at least one candidate delivery person capable of performing the first delivery order,
The preset condition is based on at least one selected from the payment method of the delivery order, whether alcoholic beverages are included in the delivery target product of the delivery order, the location of the delivery order, the location of the delivery destination, the location of the delivery person, and the transportation means of the delivery person. The set condition, the method.
The method of claim 12, wherein the transmitting of the information on the first delivery order to the terminal of the first delivery person comprises the first delivery person determined to correspond to the first delivery order to allocate the delivery order according to the first method. If you are the courier who chooses,
And transmitting first information for performing the first delivery order to the terminal of the first delivery person.
The method of claim 12, wherein the transmitting of the information on the first delivery order to the terminal of the first delivery person comprises the first delivery person determined to correspond to the first delivery order to allocate delivery order according to the second method. If you are the courier who chooses,
Selecting the first delivery order and transmitting second information for receiving allocation to the terminal of the first delivery person; And
If the first delivery order is not allocated within a preset time interval after the delivery of the second information, the second information is additionally delivered to each of the terminals of the first delivery person and at least one third delivery person selecting the second method. A method comprising the step of:
In the non-transitory computer-readable recording medium recording instructions for causing the one or more processors to perform an operation when executed by one or more processors,
The instructions, the one or more processors,
Select a first delivery order from among one or more delivery orders stored in the one or more memories,
In order to determine a first delivery route for performing the first delivery order and one or more second delivery orders held by the first delivery person among the at least one candidate delivery person for the first delivery order, Determining a primary route based on an item receipt and an item delivery destination of one of the first delivery order and the one or more second delivery orders,
Based on the primary route, a route determination operation is performed a plurality of times to determine the K-th route, wherein K is the total number of the first delivery order and the at least one second delivery order,
A route having the lowest delivery cost among the K-th routes is determined as the first delivery route,
Of the delivery costs consumed to perform the delivery according to the first delivery route, a first increase amount of the delivery cost by the first delivery order is determined, and
Based on the first increase amount, determining the first delivery person as a delivery person corresponding to the first delivery order,
To transmit information on the first delivery order to the terminal of the first delivery person,
The path determination operation is:
A plurality of routes are created by selecting a delivery order not included in the N-th route among the first delivery order and the one or more second delivery orders, and adding the item receiving destination and the item delivery address of the selected delivery order to the N-th route. -N is an integer less than K and greater than or equal to 1; And
And an operation of determining a preset number of (N+1)-th paths in the order of a small delivery cost among the plurality of paths.

Images