WO2021182743A1 - Dispositif et procédé de gestion de processus de livraison, et support d'enregistrement dans lequel une instruction est enregistrée - Google Patents

Dispositif et procédé de gestion de processus de livraison, et support d'enregistrement dans lequel une instruction est enregistrée Download PDF

Info

Publication number
WO2021182743A1
WO2021182743A1 PCT/KR2021/000712 KR2021000712W WO2021182743A1 WO 2021182743 A1 WO2021182743 A1 WO 2021182743A1 KR 2021000712 W KR2021000712 W KR 2021000712W WO 2021182743 A1 WO2021182743 A1 WO 2021182743A1
Authority
WO
WIPO (PCT)
Prior art keywords
delivery
order
person
man
goods
Prior art date
Application number
PCT/KR2021/000712
Other languages
English (en)
Korean (ko)
Inventor
김태훈
윤창근
윤대영
이재일
Original Assignee
주식회사 우아한형제들
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 주식회사 우아한형제들 filed Critical 주식회사 우아한형제들
Publication of WO2021182743A1 publication Critical patent/WO2021182743A1/fr

Links

Images

Classifications

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

Definitions

  • the present disclosure relates to techniques for managing the delivery process.
  • certain items eg food
  • the delivery person may receive the delivery target and deliver it to the customer.
  • 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 techniques for managing the delivery process.
  • An apparatus for managing a delivery process includes one or more processors; and one or more memories stored thereon that, when executed by the one or more processors, cause the one or more processors to perform operations, wherein the one or more processors are configured to: 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 agent by a first delivery person among one or more candidate delivery agents for the first delivery order to determine, among the delivery costs consumed to perform delivery according to the first delivery path, determine a first increase amount of the delivery cost by the first delivery order, and based on the first increase amount, the second 1 may be determined as a delivery man corresponding to the first delivery order, delivery information may be delivered to the first delivery order to the terminal of the first delivery man.
  • the one or more processors calculate, based on the first increment, a probability used to determine the first delivery agent as the delivery agent corresponding to the first delivery order, wherein the probability is Having a negative correlation with the first increase amount - , according to the probability, the first delivery man may be determined as the delivery man corresponding to the first delivery order.
  • the one or more processors a second delivery agent of the one or more candidate delivery agents, a second delivery for performing the first delivery order and one or more third delivery orders held by the second delivery agent determining a route, and determining 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 Determining the magnitude of the, according to the determination that the first increase amount is smaller than the second increase amount, it is possible to determine the first delivery man as a delivery man corresponding to the first delivery order.
  • the one or more processors are configured to: determine a primary route based on a goods delivery destination and an article delivery destination of one of the first delivery order and the one or more second delivery orders; Based on the path determination operation a plurality of times to determine a K-order route, wherein K is the total number of the first delivery order and the one or more second delivery orders-, the delivery cost is the smallest among the K-order routes A route is determined as the first delivery route, and the route determination operation includes: the first delivery order and the one or more second delivery orders.
  • N is an integer less than K and greater than or equal to 1; and an operation of determining one or more (N+1)th-order routes having a small delivery cost among the plurality of routes.
  • the delivery cost is, the total time taken to fulfill the delivery order, the time it takes to deliver the goods to the goods delivery destination after receiving the goods from the goods receiving place, and the delivery target time of the goods is exceeded. It may be calculated based on at least one selected from the time period and the time that passes the target time of delivery of the goods.
  • the one or more processors determine the one or more candidate delivery agents for the first delivery order, and the preset condition includes: a payment method of a delivery order, a delivery order It may be a condition set based on at least one selected from whether alcoholic beverages are included in the delivery target product, the location of the delivery location, the location of the delivery location, the location of the delivery person, and the transportation means of the delivery person.
  • the one or more processors if the first delivery person determined to correspond to the first delivery order is a delivery agent that has selected the delivery order assignment by the first method, for performing the first delivery order
  • the first information may be delivered to the terminal of the first delivery man.
  • the one or more processors if the first delivery person determined to correspond to the first delivery order is a delivery agent that has selected the delivery order allocation by the second method, select the first delivery order and assign If the first delivery order is not assigned 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 above third delivery man.
  • the one or more processors are configured to: if the first delivery order is not assigned within a preset time interval after further delivery of the second information, the first delivery agent, the one or more third delivery agents, and the second delivery agent
  • the second information may be additionally transmitted to each of the terminals of two or more fourth deliverymen who have selected the method.
  • the one or more processors, the one or more delivery orders may be assigned to a delivery man by sequentially selecting from a delivery order with a large delivery cost.
  • it may further include a communication circuit for communicating with the terminal of the first delivery man and the terminal of the user who created the first delivery order.
  • a method for managing a delivery process may be proposed.
  • a method according to an aspect of the present disclosure is a method performed in an apparatus comprising one or more processors and one or more memories in which instructions for execution by the one or more processors are stored, wherein the one or more processors include: selecting a first delivery order from among one or more delivery orders stored in ; Determining a first delivery path for the first delivery person, the first delivery order and one or more second delivery orders held by the first delivery person among one or more candidate delivery agents for the first delivery order; determining a first increase amount of the delivery cost by the first delivery order among delivery costs consumed for performing delivery according to the first delivery route; Based on the first increase amount, determining the first delivery man as a delivery man corresponding to the first delivery order; And it may include the step of transmitting information about the first delivery order to the terminal of the first delivery man.
  • the step of determining the first deliveryman as a deliveryman corresponding to the first delivery order, based on the first increase amount, determining the first deliveryman as a deliveryman corresponding to the first delivery order calculating a probability used to And it may include the step of determining the first delivery man according to the probability as a delivery man corresponding to the first delivery order.
  • the second delivery person of the one or more candidate delivery agents determining a second delivery path for performing the first delivery order and one or more third delivery orders held by the second delivery person; And, among the delivery costs consumed to perform delivery according to the second delivery path, further comprising the step of determining a second increase amount of the delivery cost by the first delivery order, the first delivery person to the first Determining the delivery man corresponding to the delivery order, determining the magnitude of the first increase amount and the second increase amount; And according to the determination that the first increase amount is smaller than the second increase amount, it may include the step of determining the first delivery man as a delivery man corresponding to the first delivery order.
  • the determining of the first delivery route comprises: determining a primary route based on a goods recipient and an article delivery destination of one of the first delivery order and the one or more second delivery orders. ; based on the primary path, performing a path determination operation a plurality of times to determine a K-order path, wherein K is the total number of the first delivery order and the one or more second delivery orders; and determining, as the first delivery route, a route having the smallest delivery cost among the K-order routes, wherein the route determination operation is performed on an N-order route among the first delivery order and the one or more second delivery orders.
  • N is an integer less than K and greater than or equal to 1; and an operation of determining one or more (N+1)th-order routes having a small delivery cost among the plurality of routes.
  • the delivery cost is, the total time taken to fulfill the delivery order, the time it takes to deliver the goods to the goods delivery destination after receiving the goods from the goods receiving place, and the delivery target time of the goods is exceeded. It may be calculated based on at least one selected from the time period and the time that passes the target time of delivery of the goods.
  • the preset condition is, the payment means of the delivery order, the delivery order It may be a condition set based on at least one selected from whether alcoholic beverages are included in the delivery target product, the location of the delivery location, the location of the delivery location, the location of the delivery person, and the transportation means of the delivery person.
  • the step of transmitting the information about the first delivery order to the terminal of the first delivery man, the first delivery person determined to correspond to the first delivery order, delivery order assignment by the first method may include the step of transmitting the first information for performing the first delivery order to the terminal of the first delivery man.
  • the step of transmitting information about the first delivery order to the terminal of the first delivery man, the first delivery person determined to correspond to the first delivery order, delivery order assignment by the second method In the case of the selected delivery man, transmitting second information for selecting and receiving the first delivery order to the terminal of the first delivery man; And if the first delivery order is not assigned within a preset time interval after the delivery of the second information, the second information is added to each of the terminals of the first delivery man and one or more third delivery men who have selected the second method It may include the step of delivering.
  • a non-transitory computer-readable recording medium recording instructions for managing a delivery process may be proposed.
  • the instructions recorded on the recording medium according to one aspect of the present disclosure are instructions to be executed on a computer, and when executed by one or more processors, the one or more processors cause the first delivery order among one or more delivery orders stored in one or more memories.
  • a first delivery path for performing the first delivery order and one or more second delivery orders possessed by the first delivery person, and the first delivery person among one or more candidate delivery agents for the first delivery order Determine, among the delivery costs consumed to perform delivery according to the first delivery path, determine a first increase amount of the delivery cost by the first delivery order, based on the first increase amount, the first It is possible to determine the delivery man as a delivery man corresponding to the first delivery order, and to deliver information about the first delivery order to the terminal of the first delivery man.
  • FIG. 1 is a diagram illustrating a process in which a delivery order is created and performed according to an embodiment of the present disclosure.
  • Figure 2 is a diagram illustrating a process of determining a delivery person corresponding to the device delivery order, according to an embodiment of the present disclosure.
  • FIG. 3 is a diagram illustrating a block diagram of an apparatus according to an embodiment of the present disclosure.
  • FIG. 4 is a diagram illustrating a process of determining a delivery cost for one delivery order, according to an embodiment of the present disclosure.
  • FIG. 5 is a diagram illustrating a process of determining an optimal delivery route, according to an embodiment of the present disclosure.
  • Figure 6 is a diagram for explaining a process of probabilistically determining an optimal delivery person for a delivery order, according to an embodiment of the present disclosure.
  • FIG. 7 is a diagram illustrating a process in which a range in which an allocation target delivery order is exposed in a delivery order list is expanded in a competitive allocation method according to an embodiment of the present disclosure.
  • FIG. 8 is a diagram illustrating a process of notifying an article preparation request and delivery completion expected time, according to an embodiment of the present disclosure.
  • FIG. 9 is a diagram illustrating an embodiment of a delivery process management method, which may be performed by an apparatus according to the present disclosure.
  • A, B, and C 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 The expression “at least one selected from , B, and/or C” may mean each listed item or all possible combinations of the listed items.
  • At least one selected from A and B means (1) at least one of A, (2) at least one of A, (3) at least one of B, (4) B, (5) at least one of A and B (6) at least one of A and B, (7) at least one of B and A, and (8) both A and B.
  • the expression "based on” is used to describe one or more factors affecting the act or action of a decision, judgment, or action described in a phrase or sentence in which the expression is included, and the expression is It does not exclude additional factors influencing the actions or actions of decisions, judgments or actions.
  • a component eg, a first component
  • another component eg, a second component
  • the expression “configured to” means “configured to”, “having the ability to”, “modified to”, “made to”, “to do”, depending on the context. It can have the meaning of “can be”.
  • the expression is not limited to the meaning of "specially designed in terms of hardware", for example, a processor configured to perform a specific operation means a generic-purpose processor capable of performing the specific operation by executing software. can mean
  • the device 100 may manage a process in which an article is 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 provider) that manages a delivery process according to the technology of the present disclosure.
  • the device 100 may determine an optimal delivery person to perform delivery according to each delivery order, and assign each delivery order to the optimal delivery agent so that each delivery is performed.
  • the user 110 may create a delivery order 114 using his/her terminal 112 (eg, a smartphone).
  • the user 110 may create a delivery order 114 by 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 .
  • a delivery order may be a delivery request for a specific item.
  • the delivery order includes information about the item to be delivered, information about the store 130 that provides the item, information about the user 110, information about payment of goods and delivery order fee, It may include information on the place of receipt and delivery of the goods and/or other information related to the performance of the delivery of the goods.
  • the user 110 may be a general customer who requests delivery of a specific item (eg, food) by creating a delivery order and receives the product.
  • the device 100 may determine the delivery person 120 corresponding to the delivery order 114 .
  • the delivery man 120 may be an optimal delivery person to fulfill the delivery order 114 .
  • the process of determining the optimal delivery person will be described later.
  • the device 100 may assign a delivery order 114 to the delivery person 120 .
  • the device 100 may transmit information about the delivery order 114 to the terminal 122 of the delivery man 120 .
  • the delivery person may be a person who performs delivery of goods under the management of the device 100 .
  • the delivery man 120 may check the information on the delivery order 114 assigned to him through his terminal 122 and perform the delivery order 114 .
  • the delivery man 120 may move to a product receiving location of the target of the delivery order 114 to receive (pick-up) the product.
  • the item receiving destination may be a store 130 that provides the item.
  • a store may be an offline store (eg, a restaurant) that provides a delivery target product.
  • the device 100 may communicate with the store 130 through the store terminal 132 .
  • the item pickup location may be a separate location designated by the device 100 , the user 110 , or the store 130 side.
  • the delivery man 120 may deliver the goods to the goods delivery site after receiving the goods.
  • the goods 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.
  • the fact that delivery of the goods has been completed may be communicated to the device 100 via the delivery person's terminal 122 and/or the user's terminal 112 .
  • Figure 2 is a diagram illustrating a process for determining an optimal delivery person corresponding to the delivery order, the device 100, according to an embodiment of the present disclosure.
  • Device 100 may determine a delivery person corresponding to each delivery order among all delivery men.
  • one or more users may each create one or more delivery orders ( 210 ).
  • the generated delivery orders may be transferred from the terminal of each user 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 .
  • delivery orders D1, D2, D3, ..., DN may be stored in a delivery order pool.
  • the device 100 may pull delivery orders from the delivery order pool according to a preset period ( 230 ).
  • the delivery orders that are pooled may be delivery orders that have no delivery person assigned to them.
  • Device 100 may generate a matching pool (matching pool) for collecting the pooled delivery orders to perform the delivery man assignment.
  • the device 100 may pull delivery orders in minute increments. Since pooling is performed in units of 1 minute, the pooled delivery orders may be delivery orders created within 1 minute of the pooling time, or delivery orders that failed to be assigned a delivery person in the previous matching pool. For example, the device 100 may pool the delivery orders D1, D2, and D3 from the delivery order pool to create a matching pool.
  • the device 100 may select one delivery order from the matching pool, and sequentially match the optimal delivery person (240). Specifically, the device 100 sorts the delivery orders in the matching pool according to a preset criterion and selects them one by one, first determines the optimal delivery person for the selected delivery order, and then selects the optimal delivery agent for the next selected delivery order It can be decided sequentially. In an embodiment, the device 100 may sequentially select a delivery order with a large delivery cost from among delivery orders of the matching pool. When the delivery personnel are allocated in the order of the largest delivery cost, the delivery person who can most efficiently perform the delivery order having the large delivery cost may be allocated preferentially.
  • the device 100 may select a delivery order in the order of D2, D1, and D3 from the matching pool. The device 100 may first determine the optimal delivery man corresponding to D2, and then determine the optimal delivery man corresponding to the order of D1, D3. Alternatively, in another embodiment, the device 100 may randomly select a delivery order from the matching pool to match the optimal delivery person.
  • the delivery cost may mean an amount of resources consumed to perform a corresponding delivery order.
  • the delivery cost is the total time it takes for the delivery person to fulfill the delivery order, the time it takes for the goods to be delivered from the destination to the destination, the time beyond the target point of receipt of the goods. (i.e., the time indicating how far past the target point of receipt of the item when the delivery person receives the item) and the time beyond the target point of delivery of the item (i.e., when the delivery person delivers the item, the target point of delivery of the item) It may be determined based on at least one selected from the time indicating how much time elapses).
  • the delivery cost is the amount of resources consumed by the delivery person to perform a delivery order, and may be calculated for a specific delivery person. A specific method of calculating the delivery cost will be described later.
  • the delivery cost is only information determined by the property of the delivery order itself regardless of the delivery person. This can be calculated.
  • the property of the delivery order itself may refer to factors affecting the amount of resources to be consumed when the delivery order is performed, regardless of which delivery person is assigned.
  • information determined by the nature of the delivery order itself may include the preparation time of the item being delivered (eg cooking time), the distance between the delivery destination and the delivery destination, and the amount of time the delivery order has been unassigned.
  • a delivery order for coffee with a short cooking time may have a smaller delivery cost than a delivery order for Gamjatang with a long cooking time.
  • the device 100 may perform a process for determining an optimal delivery person for the first selected delivery order D2 (see 242 in FIG. 2 ) ( 250 ). In order to determine an optimal delivery person, the device 100 may determine one or more candidate delivery agents capable of performing the corresponding delivery order D2. Subsequently, the device 100 may determine an optimal delivery person for performing the corresponding delivery order D2 among one or more candidate delivery agents.
  • the device 100 may determine one or more candidate delivery personnel capable of performing the selected delivery order D2, based on a preset condition.
  • a candidate delivery person may mean a delivery person who is physically, legally or politically capable of performing the delivery order. In order to become a candidate delivery person for the delivery order among all delivery workers, it may be necessary to satisfy a preset condition. Candidate deliveries may or may not be already fulfilling other delivery orders.
  • the device 100 may determine the delivery agents R2 and R7 as candidate delivery agents for the selected delivery order D2.
  • the preset conditions are the payment method of the user 110 for the corresponding delivery order, whether alcoholic beverages are included in the delivery target product of the delivery order, the location of the delivery location, the location of the delivery location, the location of the delivery person, and the delivery person.
  • means of transportation e.g. bicycle, kickboard, car, motorcycle, foot, etc.
  • the number of delivery restrictions per delivery person may be an upper limit of the number of delivery orders that the delivery person can perform during a preset period (eg, the number of delivery limits per month).
  • the operating time limit for each delivery person may be an upper limit of the operating time during which the delivery person can operate the transportation means to fulfill the delivery order for a preset period (eg, the upper limit of the total operating time per week).
  • whether alcoholic beverages are included in the delivery target article may be an allocable condition related to the age of the delivery person.
  • the above-described preset conditions may be set as a policy by a legal restriction or by a service provider.
  • the device 100 may determine an optimal delivery person for performing the corresponding delivery order (D2) among one or more candidate delivery agents (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 assigned and held for each of one or more candidate delivery agents, and in performing delivery through the delivery route, the delivery order D2 It is possible to determine the amount of increase in the delivery cost by
  • the device 100 may perform a process of determining a delivery route and an increase in delivery cost in parallel for each candidate delivery person. A specific method for determining the optimal delivery route will be described later.
  • the device 100 may determine an optimal delivery person corresponding to the delivery order D2 based on the determined delivery cost increase for each candidate delivery agent.
  • delivery man R7 may currently have delivery orders D_c1 and D_c2 that are already assigned.
  • the device 100 may determine an optimal delivery path for the delivery man R7 to perform the delivery orders D_c1, D_c2 and D2 by adding the delivery order D2 to be assigned to the delivery person.
  • the device 100 may determine the amount of increase in 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 path from the total delivery cost of performing the delivery orders D_c1, D_c2, and D2 along the corresponding delivery path. You can determine the amount of increase in cost.
  • the optimal delivery path is ⁇ [Carrier R7's current location] - [Destination of goods in D_c1] - [Destination of goods in D2] - [Delivery destination of goods in D_c1] - [Delivery destination of goods in D_c2] - [Items in D2 Delivery destination] - [D_c2 goods delivery destination] ⁇
  • This delivery route may be a delivery route that starts from the current location of the delivery man R7, passes through the delivery destination of D_c1, the delivery destination of D2, and the like, and reaches the delivery destination of the article D_c2.
  • the total delivery cost for performing the delivery orders D_c1, D_c2, and D2 may mean the delivery cost consumed by the delivery person R7 to perform D_c1, D_c2, and D2 along the corresponding optimal delivery path.
  • the delivery cost for carrying out delivery orders D_c1 and D_c2 along the delivery route is the delivery cost of delivery person R7 ⁇ [delivery agent R7's current location] - [delivery destination of D_c1] - [delivery destination of goods in D_c1] - [delivery destination of goods in D_c2 ] - It may mean a delivery cost consumed to perform delivery orders D_c1 and D_c2 along the path of [Destination of delivery of goods in D_c2].
  • deliveryman R2 may currently have delivery order D_c3 already assigned.
  • the device 100 may determine an optimal delivery path for the delivery person R2 to perform the 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 the corresponding delivery path.
  • the device 100 subtracts the delivery cost of performing the delivery order D_c3 along the delivery path from the total delivery cost of performing the delivery orders D_c3 and D2 along the corresponding delivery path, thereby increasing the amount of delivery cost by the delivery order D2 can decide
  • the device 100 may determine the optimal delivery person corresponding to the delivery order (D2) based on the calculated delivery cost increase for each of the candidate delivery man R2 and R7 (250). In an embodiment, the device 100 may determine a probabilistically optimal delivery person based on each delivery cost increase. The probabilistic optimal delivery person determination process will be described later.
  • the device 100 determines the optimal delivery person corresponding to the delivery order D2, it may transmit information on the delivery order D2 to the terminal of the delivery person. In the example of Figure 2, the delivery man R2 is determined as the optimal delivery man.
  • the device 100 When the device 100 completes the delivery man assignment process for the delivery order D2, it may be sequentially selected and then perform the delivery man assignment process for the delivery order D1 (see 244 of Figure 2). Delivery man assignment process for the delivery order D1 may proceed in the same manner as the delivery man assignment process for the delivery order D2 (260). Since the delivery man assignment process proceeds sequentially, in the delivery man assignment process for the delivery order D1, the result of the delivery man assignment process for the delivery order D2 that has been previously carried out may be affected. For example, in the case of deliveryman R2, which is one of the candidate deliverymen of the delivery order D1, in addition to the delivery order D_c3, it is assumed that the delivery order D2 is also currently held, and the delivery agent assignment process may proceed. The device 100 may determine an optimal delivery agent R2 based on each delivery cost increase after calculating an optimal delivery route and a delivery cost increase, respectively, for the candidate delivery agents R1 and R2 for the delivery order D1.
  • device 100 may include one or more processors 310 and/or one or more memories 320 .
  • processors 310 may be referred to as processors 310 .
  • the expression processor 310 may mean a set of one or more processors, unless the context clearly indicates otherwise.
  • one or more memories 320 may be referred to as a memory 320 .
  • the expression memory 320 may mean a set of one or more memories, unless the context clearly indicates otherwise.
  • the internal and external components of the device 100 may include a bus, a general purpose input/output (GPIO), a serial peripheral interface (SPI), or a mobile industry processor interface (MIPI), etc. They may be connected to each other through the interface to transmit and receive data and/or signals.
  • GPIO general purpose input/output
  • SPI serial peripheral interface
  • MIPI mobile industry processor interface
  • the processor 310 may control at least one component of the device 100 connected to the processor 310 by driving software (eg, an instruction, a program, etc.). In addition, the processor 310 may perform various operations, processing, data generation, processing, etc. related to the present disclosure. In addition, the processor 310 may load data or the like from the memory 320 or store it in the memory 320 . In one embodiment, the processor 310 pools delivery orders from the delivery order pool to create a matching pool, selects a delivery order to be assigned to a delivery person from the matching pool, determines a candidate delivery person for the delivery order, and then each candidate delivery person determines the delivery cost increment according to the delivery route and the delivery route for the information can be transmitted.
  • driving software eg, an instruction, a program, etc.
  • the processor 310 may perform various operations, processing, data generation, processing, etc. related to the present disclosure.
  • the processor 310 may load data or the like from the memory 320 or store it in the memory 320 .
  • the processor 310 pools delivery orders from
  • the memory 320 may store various 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.). Memory 320 may include volatile and/or non-volatile memory. In the present disclosure, commands or programs are software stored in the memory 320 , and various functions so 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 . 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 about delivery people, information about users, information about the store, and the like.
  • device 100 may further include communication circuitry 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.
  • the communication circuit 330 may include enhanced Mobile Broadband (eMBB), Ultra Reliable Low-Latency Communications (URLLC), Massive Machine Type Communications (MMTC), Long-Term Evolution (LTE), LTE Advance (LTE-A).
  • 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 according to a method such as Bluetooth, Near Field Communication (NFC), Global Positioning System (GPS), or Global Navigation Satellite System (GNSS) may be performed.
  • 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).
  • USB Universal Serial Bus
  • HDMI High Definition Multimedia Interface
  • RS-232 Recommended Standard-232
  • POTS Plain Old Telephone Service
  • the communication circuit 330 may perform communication with devices such as the user's terminal 112, the delivery man's terminal 122, the store terminal 132, and the like.
  • 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 .
  • the device 100 may be in various forms other than a server.
  • device 100 may be a device according to a portable communication device, a computer device, or a combination of these devices.
  • the device 100 of the present disclosure is not limited to the above-described devices.
  • FIG. 1 Various embodiments of the apparatus 100 according to the present disclosure may be combined with each other. Each embodiment may be combined according to the number of cases, and the combined embodiment also falls within the scope of the present disclosure.
  • internal/external components of the device 100 according to the present disclosure may be added, changed, replaced, or deleted according to embodiments.
  • internal/external components of the device 100 may be implemented as hardware components.
  • the user's terminal 112 and the delivery man's terminal 122 may be various types of electronic devices.
  • each of the user's terminal 112 and the delivery man's terminal 122 is a portable communication device (eg, a smartphone), a computer device (eg, a tablet PC, a laptop), a portable multimedia device, a wearable (wearable) ) device or a combination of these devices.
  • a program eg, an application program
  • the user's terminal 112 and the delivery man's terminal 122 may access a web page that provides a delivery process management technology according to the present disclosure.
  • Each of the user's terminal 112 and the delivery man's terminal 122 may include one or more processors, one or more memories and/or communication circuitry.
  • the one or more memories may store instructions that, when executed by the one or more processors, cause the one or more processors to perform operations.
  • Each processor of the user's terminal 112 and the delivery man's terminal 122 may perform operations corresponding to the operation of the above-described device 100 according to the delivery process management technology according to the present disclosure.
  • the device 100 the user's terminal 112 through the above-described program (eg, an application program) installed in the user's terminal 112 to the delivery man's terminal 122, the user's terminal 112 to the delivery man's terminal 122 can communicate with
  • the device 100 may provide a web page for providing the delivery process management technology according to the present disclosure.
  • the delivery cost according to a predetermined delivery order may mean the amount of resources consumed to perform the delivery order.
  • the delivery cost can be calculated as the amount of resources consumed by a particular delivery person to fulfill the delivery order.
  • the delivery cost for a given delivery order is the total time it takes one delivery person to fulfill the delivery order, the time it takes to deliver the goods to the delivery destination after receiving the goods from the destination, the amount of the goods. It may be determined based on at least one selected from a time exceeding a target point of receipt and a time passing over a target point of delivery of the goods. In one embodiment, the delivery cost may be calculated according to the following equation.
  • M may mean the total of the time for performing the entire process of the delivery order. That is, M may mean a time from 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. According to an embodiment, M may mean a time expected to be taken to perform the entire process of the above-described delivery order. Estimated time for the entire process is the time allotted for each time of the store, the time to receive the goods by time of the store, the delivery distance, the weather, the number of deliveries per delivery person, the number of deliveries the delivery person has, and the number of deliveries held by the delivery person for a predetermined time (eg 30 minutes). Various factors such as the number of delivery orders in can be determined based on Coefficients for adjusting the weight of the corresponding information may be applied to each piece of information (eg, a distance coefficient for each weather, etc.).
  • A may mean a time beyond the delivery target time.
  • the delivery target time may be a fixed value determined by the device 100 according to a preset criterion when a delivery order is created.
  • A may mean the time when the actual delivery time of the goods exceeds the delivery target point of the delivery order.
  • A may mean a time when the expected delivery time of the product has passed the delivery target point of the delivery order.
  • B may mean a time beyond the target point of receipt.
  • the device 100 or the delivery person may request the store 130 to prepare the delivery target item (eg, cooking of food).
  • the reception target time may be a fixed value determined by the device 100 according to a preset criterion when a request for preparing an article for a delivery order is made.
  • B may mean the time when the actual receipt time of the product at the delivery location exceeds the target delivery time point of the delivery order.
  • B may mean a time when the expected time of receiving the product at the delivery destination exceeds the target point of receipt of the delivery order.
  • C may mean the time from receipt of the goods to the completion of delivery of the goods. 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 the expected delivery time of the article and the expected receipt of the article.
  • A, b, and c in Equation 1 may be parameters for adjusting the quality of delivery.
  • a, b, and c may be determined and adjusted by a service provider (delivery management service provider) according to business, sales, and policy reasons.
  • a may be a parameter that determines to what extent a delivery target time is complied with
  • b may be a parameter that determines to what extent a receipt target time is adhered to.
  • the delivery cost according to the time exceeding the delivery target time is calculated to be larger
  • b is set to be larger, the delivery cost according to the time exceeding the receiving target time can be calculated to be larger.
  • c may be a parameter that determines the degree to which the value of the item decreases over time after receiving the item (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 easily perishable food, the value of the item decreases rapidly with the passage of time, so the value of c may be set large.
  • the delivery cost may be calculated for a case where a given delivery person fulfills a given delivery order, as the cost when a given delivery person fulfills all of the delivery orders to be processed by the given delivery person. It may be calculated, or it may be calculated as a cost in the case of performing all delivery orders to be processed by all delivery men in the entire delivery management system. As described above, at the time of selecting the delivery order from the matching pool, the delivery cost may be calculated only with information determined by the attribute itself of the delivery order regardless of the delivery person.
  • the device 100 may determine, for each of the candidate delivery agents, an optimal delivery path for performing both the delivery order already held by the candidate delivery person and the delivery order to be newly assigned.
  • the processor 310 may determine a delivery path for performing a delivery order D1 to which one candidate delivery man R2 is assigned.
  • the candidate delivery man R2 may already have delivery orders D_c2 and D_c3.
  • the delivery order D1 may have a goods receiving destination p1 and a goods delivery destination d1.
  • the delivery order D_c2 may have a goods receiving destination p_c2 and a goods delivery destination d_c2.
  • the delivery order D_c3 may have a goods receiving destination p_c3 and a goods delivery destination d_c3.
  • the processor 310 may determine a delivery path 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 ).
  • the delivery route may be referred to as a primary route.
  • only one possible delivery route can be derived ( 512 ). Accordingly, only one optimal delivery route among possible delivery routes may be derived ( 514 ).
  • the processor 310 may determine one or more K-order paths by repeatedly performing a 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 the delivery order D1 to be allocated (ie, 3 in the example of FIG. 5 ).
  • the route determination operation selects a delivery order (for example, D_c2) that is not included in the Nth route (for example, the first route) among delivery orders D_c2 and D_c3 that are already in possession and the delivery order D1 to be assigned, and selects the delivery order It may include an operation to create a plurality of routes by adding the goods receiving destination (eg, p_c2) and delivery destination (eg, d_c2) of (eg, D_c2) to the N-th route (eg, the primary route). Also, the route determination operation may include an operation of determining one or more (N+1)-order routes (eg, secondary routes) having a low delivery cost among the generated plurality of routes.
  • N may be an integer smaller than the aforementioned K and greater than or equal to 1.
  • the processor 310 may select a delivery order D_c2 that is not included in the primary path 514 from among the delivery orders D_c2 and D_c3 already held and the delivery order D1 to be allocated.
  • the processor 310 may generate a plurality of routes 522 by adding the goods receiving destination p_c2 and the goods delivery destination d_c2 of the delivery order D_c2 to the corresponding primary path 514 .
  • the goods receiving destination p_c2 and the goods delivery destination d_c2 may be added in combination with, between, or before or after the stopovers p_c3 and d_c3 of the primary route 514, depending on the number of possible cases.
  • the plurality of paths 522 may be paths generated according to all possible combinations in which the goods receiving destination p_c2 and the goods delivery destination d_c2 may be added to the primary path 514 .
  • the processor 310 may select one or more routes in the order of the smallest delivery cost from among the generated plurality of routes 522 , and determine this as the secondary route 524 .
  • the processor 310 may select a preset number of routes in the order of the smallest delivery cost among the plurality of routes. In one embodiment, the number of paths selected may be three.
  • the processor 310 may determine the second, third, ..., K-order paths in the same manner.
  • the processor 310 may select a delivery order D1 that is not included in the secondary path 524 among the delivery orders D_c2 and D_c3 already held and the delivery order D1 to be assigned.
  • the processor 310 may generate a plurality of routes by adding the goods destination p1 and the goods delivery destination d1 of the delivery order D1 to the secondary route 524 . Since one or more secondary paths (eg, three secondary paths) have been determined in the previously performed path determination operation of the secondary path, the processor 310 determines the item recipient p1 by the number of cases for each secondary path 524 . and a delivery destination d1 can be added to create multiple routes.
  • a plurality of routes 534 are created by adding the goods receiving destination p1 and the goods delivery destination d1 to one of the secondary routes, and the plurality of routes 536 by adding the goods receiving destination p1 and the goods delivery destination d1 to the other one of the secondary routes.
  • the processor 310 may select one or more routes having a small delivery cost from among the generated plurality of routes 534 and 536 , and determine it as the tertiary route 538 .
  • the processor 310 may determine one or more K-order paths (eg, tertiary paths) by repeatedly performing the path determination operation in this way.
  • the processor 310 selects one path with the smallest delivery cost among one or more K-order paths (eg, a tertiary path), and selects the optimal path for the candidate delivery man R2 to perform the corresponding delivery orders D_c2, D_c3 and D1. can be determined by the delivery route of
  • Figure 6 is a diagram for explaining a process of probabilistically determining an optimal delivery person for a delivery order, according to an embodiment of the present disclosure.
  • the device 100 determines a delivery path for performing an assignment target delivery order for each candidate delivery person, and increases the delivery cost caused by the assignment target delivery order in performing delivery according to the delivery path. may be determined, and an optimal delivery person corresponding to the delivery order may be determined based on the increase in delivery cost. In an embodiment, the device 100 may determine an optimal delivery person corresponding to the delivery order probabilistically, based on the increase in the delivery cost.
  • the processor 310 may calculate a probability (P) that each candidate delivery person is determined to be a delivery person corresponding to the delivery order, based on the increase in the delivery cost determined for each candidate delivery man. For example, the delivery cost increase may be calculated for the optimal delivery route determined in FIG. 5 .
  • the probability P may be calculated according to the following equation.
  • the probability (P) may have a negative correlation with the increase in delivery cost for each candidate delivery man.
  • Processor 310 based on the calculated probability (P) for each candidate delivery man, may determine one of the candidate delivery man as an optimal delivery man corresponding to the assignment target delivery order. For example, for each of the delivery men R1, R2, R3, R4, R5, ..., Rm, the probability P of 25%, 30%, 20%, 5%, 5%, 1%, etc. can be determined. have. According to the corresponding probability P, the processor 310 selects one of the delivery men R1, R2, R3, R4, R5, ..., Rm, for example, the delivery person R3 as the optimal delivery person corresponding to the assigned delivery order. can be decided.
  • T may be a parameter set to adjust the probability P.
  • the probability that the delivery order is assigned to the candidate delivery agent R2 with the smallest increase in delivery cost may increase.
  • the candidate R2 with the smallest increase in delivery cost can always be determined as the optimal delivery person for the delivery order (greedy method).
  • the processor 310 may determine the magnitude of the increase in the delivery cost of each candidate delivery man, and determine the candidate delivery man R2 with the smallest increase in the delivery cost as the optimal delivery person corresponding to the delivery order.
  • the corresponding delivery order may be assigned to one of the candidate delivery workers (R1, R2, R3, R4, R5, ..., Rm) with almost the same probability. That is, the processor 310 may randomly determine any one delivery person among the candidate delivery agents as the optimal delivery person of the corresponding delivery order.
  • the device 100 determines the delivery person with the smallest increase in delivery cost as the optimal delivery agent, the delivery cost can be minimized in the processing of individual delivery orders.
  • the device 100 probabilistically determines the optimal delivery agent the total delivery cost consumed in the processing of all delivery orders managed by the device 100 may help to optimize. For example, it may be effective to reduce the delivery cost of the overall delivery management system to assign a short-distance delivery order to a delivery person using a slow transportation means rather than a delivery person using a fast transportation means. This is because it is possible to allocate a long-distance delivery order to a delivery person using a fast moving means only by such allocation.
  • the probability calculation process may be adjusted so that the probability (P) of delivery personnel does not differ significantly depending on the transportation means.
  • the device 100 may transmit information about the delivery order (D1) to the terminal of the delivery person.
  • processing after the best delivery person is determined may depend on how the delivery person determined to be the best delivery agent has chosen to be assigned the delivery order.
  • Methods for receiving delivery orders may include an automatic allocation method and a competitive allocation method.
  • the automatic allocation method may be a method in which a delivery management service provider automatically allocates an appropriate delivery order to a delivery person. For example, if the delivery person R3 determined as the optimal delivery person for the delivery order D1 is a delivery person who selects the automatic allocation method, the processor 310 may directly assign the delivery agent R3 as the optimal delivery agent of the delivery order D1. In other words, in receiving the delivery order D1 from the processor 310 to the delivery man R3, there is no competition of other delivery men. The processor 310 may control the communication circuit 330 to transmit the first information for performing the delivery order D1 assigned to the terminal of the deliveryman R3.
  • the first information includes information indicating that the delivery person R3 is assigned to the delivery order D1, information on the goods receipt and delivery destination of the delivery order D1, information on the delivery target goods, information on the store providing the goods, and performing the delivery order D1 It may include information on an optimal route for doing so, payment information for a delivery target product, and the like.
  • the delivery man R3 who has received the first information through his/her terminal may perform the delivery order D1 according to the first information.
  • the delivery management service provider provides a list of delivery orders to delivery workers, and the delivery person directly selects a delivery order to be performed by the delivery person from the list, so that the allocation for the delivery order may be performed.
  • 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 the delivery order D1 to be assigned to the terminal of the corresponding delivery man R1.
  • information for the delivery order D1 to be included in the delivery order list information on the delivery order D1's goods receipt and delivery destination, information on the delivery target product, information on the store providing the goods, and performing the delivery order D1
  • Information on the optimal route for delivery payment information for the item to be delivered, information on when the delivery order D1 is created, information on the number of delivery personnel for which the delivery order D1 is exposed through the delivery order list, delivery order D1 It may include information on the compensation given to the delivery person when performing
  • the terminal of the delivery man R1 may include the information on the delivery order D1 in the delivery order list according to the received second information, and also display the delivery order list through the screen. If the delivery man R1 wants to be assigned the delivery order D1, he can select and assign the delivery order D1 from the delivery order list.
  • FIG. 7 is a diagram illustrating a process in which a range in which an allocation target delivery order is exposed in a delivery order list is expanded in a competitive allocation method according to an embodiment of the present disclosure.
  • the processor 310 transmits the second information to the terminals of other delivery people in addition to the delivery person R1, the delivery order D1 is the delivery order list You can broaden the scope of your exposure.
  • the deliverymen to which the second information is additionally transmitted may be deliverymen who have selected the competitive allocation method.
  • the processor 310 may deliver the second information on the delivery order D1 only to the terminal of the previously determined optimal delivery man R1. Accordingly, the delivery order D1 may be exposed for a preset time interval 710 only in the delivery order list of the optimal delivery man R1. That is, during this time interval 710, the delivery order D1 may be recommended exclusively to the optimal delivery person R1. The time interval for exposure only to the optimal deliveryman R1 may be, for example, 15 seconds. If the delivery order D1 is selected by the optimal delivery person R1 within the corresponding time interval (710, for example, 0-15 seconds), the delivery order D1 is assigned to the optimal delivery agent R1, and may be performed by the optimal delivery agent R1.
  • the processor 310 transmits the second information about the delivery order D1 to one or more delivery agents, including the optimal delivery agent R1, for example, the delivery agent R5. It can be additionally transmitted to the terminal of R4. In one embodiment, the terminal of the delivery man who delivered the second information in the previous time interval may not deliver the second information again in the next time interval. Accordingly, the delivery order D1 may be exposed to other newly added delivery workers R5 and R4 in addition to the optimal delivery person during a preset time interval (720, for example, 15-30 seconds).
  • the delivery workers R5 and R4 to which the delivery order D1 is additionally exposed may be delivery workers of a competitive allocation method who ranked next to the optimal delivery person in the process of selecting the optimal delivery agent based on the preceding probability.
  • the number of additionally exposed deliverymen may be two.
  • the additionally exposed deliverymen R5 and R4 may be deliverymen determined to be suitable for the delivery order D1 in the second and third places respectively following the optimal delivery person R1 in the above-described optimal delivery agent selection process.
  • the ranking among deliverymen who have selected the competitive allocation method according to the probability (P) may be determined.
  • deliveryman R5 may be determined to be second and deliveryman R4 may be determined to be third. If the delivery order D1 within the time interval 720 is selected by one of the delivery men R1, R5 and R4, the delivery order D1 may be assigned to the delivery person and performed.
  • the processor 310 is configured to include one or more delivery personnel R9 and R7, including the delivery agents R1, R5 and R4 that have previously conveyed the second information.
  • the second information on the delivery order D1 may be additionally transmitted 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).
  • the two deliverymen R9 and R7 added here may be deliverymen who placed 4th and 5th respectively in the process of selecting the optimal delivery person. If the delivery order D1 within the corresponding time interval 730 is selected by one of the delivery men R1, R5, R4, R9 and R7, the delivery order D1 may be assigned to the delivery person and performed.
  • the processor 310 is configured to the deliverymen R1, R5, R4, R9 and R7 who have previously delivered the second information. Including, it is possible to additionally deliver the second information about the delivery order D1 to the terminals of one or more deliverymen R13, R15, R6, R10 and R21. Accordingly, the delivery order D1 may be exposed to a total of 10 deliverymen 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 deliverymen may be deliverymen ranked 6-10 respectively. If delivery order D1 is selected by one of the deliverymen R1, R5, R4, R9, R7, R13, R15, R6, R10 and R21 within the corresponding time interval 740, the delivery order D1 is assigned to that delivery person can be performed.
  • the delivery order D1 is included in the next matching pool (second matching pool). and can go through the second delivery man assignment process.
  • the processor 310 creates a matching pool by pooling the delivery orders unassigned by the delivery person at every pooling cycle (eg, 1 minute).
  • the processor 310 sends a preset time interval to a total of 10 deliverymen, including 10 deliverymen R1, R5, R4, R9, R7, R13, R15, R6, R10, and R21, who were exposed in the previous matching pool. 1 minute) to expose the delivery order (D1).
  • 10 deliverymen R1, R5, R4, R9, R7, R13, R15, R6, R10, and R21 who were exposed in the previous matching pool. 1 minute
  • 7 delivery people excluding some (eg, 3 people) who were not previously eligible for referral, were unable to place a delivery order, and ranked 1-3 for delivery order (D1) in the calculation of the second matching pool.
  • the delivery order (D1) may be exposed to three deliverymen of the competitive allocation method occupied.
  • the delivery order (D1) is placed in the next matching pool (three th matching pool) and can go through the third delivery man assignment process. After the third matching process, the delivery order (D1) may be exposed to the candidate deliverymen of all competing allocation schemes.
  • the server may collect delivery orders created between 9:00:00 and 9:00:59 and perform the deliveryman matching calculation at 9:01:00. If the calculation process took 5 seconds and the selected best delivery person is a delivery person with a competitive allocation method, the delivery order can be exclusively recommended to the best delivery person for 15 seconds from 9:01:05. If the delivery order is not assigned by the sole recommendation process, the server can make a competitive recommendation to three deliverymen for 15 seconds from 9:01:20 to 15 seconds. If the delivery order is still not assigned, the server can make a competitive recommendation to five deliverymen for 15 seconds starting at 9:01:35. If the delivery order is still not assigned, the server can make a competitive recommendation to 10 deliverymen for 15 seconds starting at 9:01:50.
  • the delivery order is included in the next matching pool, and the delivery man matching calculation may be performed again.
  • the calculation may be executed at 9:02:05, one minute after the previous calculation of the matching pool was completed at 9:01:05. Until the calculation is completed, for example, if the calculation took 4 seconds, an empty delivery order list may be exposed to delivery workers until 2 minutes and 4 seconds.
  • the number of deliveries (eg, 5) to which additional second information was delivered in one time interval (eg, 740) is equal to the number (eg, 5) deliveries to which additional second information was delivered in a previous time interval (eg, 730).
  • the number of delivery personnel exposed to the delivery order in each time interval may be set differently according to the intention of the operator.
  • a plurality of delivery orders may be arranged and exposed according to the basic sorting order set in the application program of the delivery man terminal.
  • the service provider delivery management service company
  • Each branch can set the delivery order allocation method to be applied to the delivery workers.
  • the Seoul southern branch may determine whether to allow delivery men belonging to the southern Seoul branch to be assigned according to an automatic allocation method.
  • each delivery man of the branch using the automatic allocation method may select the allocation method through the delivery man terminal.
  • FIG. 8 is a diagram illustrating a process of notifying an article preparation request and delivery completion expected time, according to an embodiment of the present disclosure.
  • the delivery person 120 performing the delivery order 114 may directly request the store 130 to prepare the item (eg, cook food). Delivery man 120 may transmit information for requesting the preparation of goods to the terminal 132 of the store 130 through his terminal 122 .
  • the device 100 may request the store to prepare the goods at an appropriate time in anticipation of the delivery time when the delivery person 120 will arrive at the destination or the store 130 . For example, if food that takes 10 minutes to cook needs to be delivered, and it is expected that it will take 15 minutes for the delivery man 120 to move from the current location to the item receiving location, the processor 310 is About 5 minutes after allocating the delivery order, a request for cooking of the corresponding food may be transmitted to the terminal 132 of the store 130 .
  • the product preparation request time of the processor 310 may be changed according to the delivery progress status (movement status) of the corresponding delivery man 120, information such as traffic conditions.
  • the store terminal 132 is provided on the store side to communicate with the device 100, the user's terminal 112 and/or the delivery man's terminal 122 according to the delivery process management technology according to the present disclosure. It may be a device.
  • the store terminal 132 may be a device of various types.
  • the store terminal 132 is connected to 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.
  • POS Point Of Sales
  • It may be a device according to A program (eg, an application program) providing delivery process management technology according to the present disclosure may be installed in the store terminal 132 .
  • the store terminal 132 may access a web page providing 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 delivery person's terminal 122 through the corresponding program or web page.
  • the store terminal 132 may include one or more processors, one or more memories and/or communication circuitry.
  • the one or more memories may store instructions that, when executed by the one or more processors, cause the one or more processors to perform operations.
  • the processor of the store terminal 132 may perform operations corresponding to the operations of the device 100 described above according to the delivery process management technology according to the present disclosure.
  • the processor 310 when the delivery man 120 who is performing the delivery order 114 receives the goods at the goods receiving location, the processor 310 sends the terminal 112 of the user 110 to the expected time at which the goods will arrive at the goods delivery destination. information can be transmitted. The processor 310 may determine an expected time when the goods will arrive at the goods delivery destination based on information such as the moving situation of the delivery man 120, the traffic situation, and the like. Through this, the user 110 may know the expected final delivery time of the goods.
  • the delivery person assigned to the delivery order may cancel the assignment of the delivery order. This may be performed by a preset delivery order cancellation API (Application Program Interface).
  • the de-allocated delivery order may be included in the next matching pool to go through the delivery worker allocation process again.
  • unassigned delivery orders may not be counted in the matching pool and may be exposed to candidate deliverymen of a competitive allocation scheme.
  • the delivery order may be de-assigned if the store has already been requested to prepare the item.
  • the processor 310 may allocate a virtual delivery person for the corresponding delivery order. The processor 310 may determine the time remaining until the preparation time of the item is completed, and may increase the delivery fee according to the remaining time.
  • the delivery fee may be a remuneration paid to the delivery person.
  • a delivery charge surcharge may not be applied to delivery fees for some stores.
  • the time remaining until the preparation of the goods is completed can be obtained by adding the time required for preparing the goods to the time of requesting the preparation of the goods and subtracting the current time again. If the time remaining until the preparation of the goods is less than 9 minutes, the delivery charge may be increased to 1,000 won, and if it is less than 8 minutes, 1,100 won. If the time remaining until the preparation of the goods is less than or equal to the preset time, the service provider of the device 100 may directly determine the processing direction of the corresponding delivery order.
  • FIG. 9 is a diagram illustrating an embodiment of a delivery process management method, which may 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.
  • 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 according to an order that may be arbitrarily combined by the present disclosure, in addition to being performed sequentially.
  • the description according to the present flowchart does not exclude making changes or modifications to the method or algorithm, and does not imply that any step is essential or desirable.
  • at least some of the steps may be performed in parallel, iteratively or heuristically.
  • at least some steps may be omitted or other steps may be added.
  • the device 100 may perform a delivery process management method according to various embodiments of the present disclosure, in allocating a delivery order to a delivery person.
  • the delivery process management method according to an embodiment of the present disclosure includes the step of selecting a first delivery order among one or more delivery orders (S910), a first delivery order by a first delivery person among candidate delivery agents, and a first delivery order by the first delivery person.
  • Determining a first delivery path for performing one or more second delivery orders (S920), among the delivery costs consumed to perform delivery according to the first delivery route, the first delivery cost by the first delivery order 1 step of determining an increase (S930), a step of determining the first delivery man 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 the information.
  • 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 .
  • one or more delivery orders may mean delivery orders included in the matching pool.
  • the first delivery order may mean a delivery order to be assigned to a delivery person.
  • the processor 310 may select delivery orders from the matching pool in the order in which the delivery costs of the delivery orders are greatest.
  • step S920 the processor 310, the first delivery person, one of the one or more candidate delivery agents for the first delivery order, for performing the first delivery order and one or more second delivery orders that the first delivery person has A first delivery route may be determined.
  • the process of determining the delivery route is the same as described above.
  • the processor 310 may determine one or more candidate deliverymen capable of performing the first delivery order based on a preset condition.
  • the preset condition is at least selected from the payment means of the delivery order, whether alcoholic beverages are included in the delivery target of the delivery order, the location of the delivery location, the location of the delivery location, the location of the delivery person, and the delivery means of the delivery person. It may be a condition set based on one.
  • the processor 310 may determine a first increase amount, which is an increase amount of the delivery cost by the first delivery order, among the delivery costs consumed for the first delivery person to perform delivery according to the first delivery path.
  • the processor 310 based on the first increase amount, the first delivery man may be determined as a delivery man corresponding to the first delivery order.
  • the processor 310 may transmit information about the first delivery order to the terminal of the first delivery man by controlling the communication circuit 330.
  • step S940 includes, based on the first increment, calculating the probability P and/or determining the first delivery person as the delivery person corresponding to the first delivery order according to the probability P can do.
  • Probability (P) is a probability used to determine the first delivery man as a delivery man corresponding to the first delivery order, it may have a negative correlation with the first increase amount. This may correspond to an embodiment of determining the optimal delivery person when T in Equation 2 is set to be greater than 0.
  • the processor 310 determines a second delivery route for The process of determining the delivery route is the same 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 the delivery costs consumed by the second delivery person to perform delivery according to the second delivery path.
  • step S920 includes determining a primary route based on a goods receipt and goods delivery destination of one of the first delivery order and the one or more second delivery orders, based on the primary route, determining the route
  • the operation may be repeated one or more times to determine a K-order route, and/or may include determining a route having the smallest delivery cost among the K-order routes as the first delivery route.
  • the path determination operation is the same as described above.
  • the route determination operation is an operation of adding the goods recipient and the goods delivery destination of the delivery order that are not included in the N-order route among the first delivery order and the one or more second delivery orders to the N-order route to generate a plurality of routes, and/or It may include an operation of determining one or more (N+1)th-order routes having a small delivery cost among the plurality of routes.
  • the delivery cost is calculated as the total time it takes for the delivery person to fulfill the delivery order, the time it takes for the goods to be delivered from the pickup location to the delivery location, and the delivery target time is exceeded. It may be calculated based on at least one selected from the time period and the time that passes the target time of delivery of the goods.
  • the delivery cost may be calculated by the processor 310 .
  • step S950 when the first delivery person determined to correspond to the first delivery order is the delivery person who has selected the delivery order assignment by the first manner, the first information for performing the first delivery order is first It may include the step of delivering to the terminal of the delivery man.
  • the first method may be the aforementioned automatic allocation method.
  • step S950 when the first delivery person determined to correspond to the first delivery order is the delivery person who has selected the delivery order assignment by the second method, the second information for selecting the first delivery order to be assigned If the first delivery order is not assigned within a preset time interval after the delivery of the first delivery man's terminal, and / or the delivery of the second information, the terminal of one or more third deliverymen selected the first delivery man and the second method, respectively It may include the step of further transmitting the second information to the.
  • the second method may be the aforementioned contention allocation method.
  • the one or more third deliverymen are deliverymen who have selected a competitive allocation method among the candidate deliverymen of the first delivery order, and may be deliverymen who are additionally exposed to the first delivery order after a preset time interval. As described above, the third deliveryman may be the deliverymen who ranked next to the optimal deliveryman in the process of determining the optimal deliveryman.
  • the software may be software for implementing various embodiments of the present disclosure described above.
  • Software may be inferred from various embodiments of the present disclosure by programmers in the art.
  • software may be machine-readable instructions (eg, code or code segments) or programs.
  • the device is a device capable of operating according to a command called from a recording medium, and may be, for example, a computer.
  • the device may be the device 100 according to embodiments of the present disclosure.
  • the processor of the device may execute the called command to cause components of the device to perform a function corresponding to the command.
  • the processor may be one or more processors 310 according to embodiments of the present disclosure.
  • the recording medium may refer to any type of recording medium in which data that can be read by a device is stored.
  • the recording medium may include, for example, ROM, RAM, CD-ROM, magnetic tape, floppy disk, optical data storage device, and the like.
  • the recording medium may be one or more memories 320 .
  • the recording medium may be implemented as a distributed form in a computer system connected through a network.
  • the software may be distributed, stored, and executed in a computer system or the like.
  • the recording medium may be a non-transitory recording medium.
  • a non-transitory recording medium means a medium that exists regardless of whether data is semi-permanently or temporarily stored, and does not include a transitory propagated signal.

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Development Economics (AREA)
  • Marketing (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Game Theory and Decision Science (AREA)
  • Educational Administration (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Automatic Disk Changers (AREA)

Abstract

La présente divulgation concerne un dispositif de gestion d'un processus de livraison. Le dispositif selon la présente divulgation peut comprendre un processeur et/ou une mémoire. Le processeur peut sélectionner un premier bon de livraison parmi un ou plusieurs bons de livraison, déterminer un premier trajet de livraison dans lequel un premier livreur parmi des livreurs candidats pour le premier bon de livraison effectue le premier bon de livraison et un ou plusieurs seconds bons de livraison détenus par le premier livreur, déterminer un premier incrément du coût de livraison en raison du premier bon de livraison parmi les coûts de livraison utilisés pour effectuer la livraison le long du premier trajet de livraison, et déterminer le premier livreur comme étant le livreur correspondant au premier bon de livraison sur la base du premier incrément.
PCT/KR2021/000712 2020-03-09 2021-01-19 Dispositif et procédé de gestion de processus de livraison, et support d'enregistrement dans lequel une instruction est enregistrée WO2021182743A1 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
KR20200028923 2020-03-09
KR10-2020-0028923 2020-03-09
KR10-2020-0070886 2020-06-11
KR1020200070886A KR102252774B1 (ko) 2020-03-09 2020-06-11 배달 과정을 관리하기 위한 장치, 방법 및 명령을 기록한 기록 매체

Publications (1)

Publication Number Publication Date
WO2021182743A1 true WO2021182743A1 (fr) 2021-09-16

Family

ID=76157911

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2021/000712 WO2021182743A1 (fr) 2020-03-09 2021-01-19 Dispositif et procédé de gestion de processus de livraison, et support d'enregistrement dans lequel une instruction est enregistrée

Country Status (3)

Country Link
KR (1) KR102252774B1 (fr)
TW (1) TWI823066B (fr)
WO (1) WO2021182743A1 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR102403710B1 (ko) * 2021-10-26 2022-05-30 쿠팡 주식회사 배송 주문을 처리하는 전자 장치 및 그 방법
KR102527365B1 (ko) * 2022-08-05 2023-05-02 주식회사 스매피 물품 배송 서비스 시스템, 서버 및 방법

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016204307A1 (fr) * 2015-06-15 2016-12-22 주식회사 메쉬코리아 Procédé et serveur pour traiter des informations de livraison et de vérifier la présence au travail
KR20180013843A (ko) * 2015-01-29 2018-02-07 베이징 디디 인피니티 테크놀로지 앤드 디벨럽먼트 컴퍼니 리미티드 오더 할당 시스템 및 방법
KR20180042598A (ko) * 2016-10-18 2018-04-26 주식회사 우아한형제들 배달주문 분배시스템 및 방법
KR101904168B1 (ko) * 2017-07-06 2018-10-04 주식회사 플로드 물류 배송방법
KR102034768B1 (ko) * 2018-12-11 2019-10-22 (주)델타온 배송인 풀(pool)의 확장성을 높인 배송 서비스 제공 방법 및 이를 위한 서버

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWM491221U (zh) * 2014-07-24 2014-12-01 Chia Nan University Of Phamacy & Science 宅配人力管理系統
CN110648096A (zh) * 2019-08-19 2020-01-03 北京三快在线科技有限公司 一种配送线路的生成方法和装置
CN110807545A (zh) * 2019-10-22 2020-02-18 北京三快在线科技有限公司 任务时长的预估方法、装置、电子设备和存储介质

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20180013843A (ko) * 2015-01-29 2018-02-07 베이징 디디 인피니티 테크놀로지 앤드 디벨럽먼트 컴퍼니 리미티드 오더 할당 시스템 및 방법
WO2016204307A1 (fr) * 2015-06-15 2016-12-22 주식회사 메쉬코리아 Procédé et serveur pour traiter des informations de livraison et de vérifier la présence au travail
KR20180042598A (ko) * 2016-10-18 2018-04-26 주식회사 우아한형제들 배달주문 분배시스템 및 방법
KR101904168B1 (ko) * 2017-07-06 2018-10-04 주식회사 플로드 물류 배송방법
KR102034768B1 (ko) * 2018-12-11 2019-10-22 (주)델타온 배송인 풀(pool)의 확장성을 높인 배송 서비스 제공 방법 및 이를 위한 서버

Also Published As

Publication number Publication date
TWI823066B (zh) 2023-11-21
KR102252774B1 (ko) 2021-05-17
TW202139083A (zh) 2021-10-16

Similar Documents

Publication Publication Date Title
WO2021182743A1 (fr) Dispositif et procédé de gestion de processus de livraison, et support d'enregistrement dans lequel une instruction est enregistrée
EP3886007A1 (fr) Procédé de traitement d'informations et système de traitement d'informations
WO2011028081A2 (fr) Procédé de fonctionnement d'un service de taxi prépayé
WO2013073866A1 (fr) Procédé et appareil de gestion de mémoire tampon dans un système de communication
JP5814378B2 (ja) 予約管理装置、予約管理プログラム、予約管理システム
WO2023008636A1 (fr) Procédé de fourniture d'informations et dispositif électronique utilisant ledit procédé
JP2020166505A (ja) 荷物の配送を支援するシステム
CN110852659A (zh) 物流管理方法和装置
GB2574061A (en) Baggage delivery system and method
WO2022004935A1 (fr) Dispositif électronique et procédé de fonctionnement associé
CN110304385A (zh) 一种仓库上架方法和装置
JP5563688B1 (ja) ポイント充当方法およびそのシステム
JP2020119441A (ja) 配車プログラム及び配車システム
CN111784294A (zh) 一种预付费行李服务确定方法、装置、服务器及存储介质
WO2021002548A1 (fr) Procédé permettant de fournir un service de change en ligne
WO2019146989A1 (fr) Procédé pour service de livraison de colis basé sur des stations-service et système de mise en œuvre de celui-ci
WO2012017699A1 (fr) Système informatique et procédé de gestion de données
WO2019013461A1 (fr) Appareil pour fournir un service de vente de contenu numérique prenant en charge une transaction en ligne de multiples éléments de contenu numérique et son procédé de commande
US20130227049A1 (en) Distributed cache system
CN105792160B (zh) 一种处理计费请求的装置及方法
JP7336897B2 (ja) 配車管理装置、配車管理方法、及び配車管理システム
WO2017082683A1 (fr) Procédé et système pour fournir des informations sur une gestion de dépenses et support d'enregistrement lisible par ordinateur non transitoire
KR20200134047A (ko) 대중교통 안내 서비스 방법
CN100581155C (zh) 处理代理的消息的装置和方法
WO2021029499A1 (fr) Procédé permettant de fournir un service de change de devises en ligne

Legal Events

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

Ref document number: 21767635

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 21767635

Country of ref document: EP

Kind code of ref document: A1