WO2018074851A1 - Système et procédé de distribution de commandes de livraison - Google Patents

Système et procédé de distribution de commandes de livraison Download PDF

Info

Publication number
WO2018074851A1
WO2018074851A1 PCT/KR2017/011553 KR2017011553W WO2018074851A1 WO 2018074851 A1 WO2018074851 A1 WO 2018074851A1 KR 2017011553 W KR2017011553 W KR 2017011553W WO 2018074851 A1 WO2018074851 A1 WO 2018074851A1
Authority
WO
WIPO (PCT)
Prior art keywords
delivery
order
orders
location
time
Prior art date
Application number
PCT/KR2017/011553
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 주식회사 우아한형제들
Priority to JP2019520622A priority Critical patent/JP6629490B2/ja
Publication of WO2018074851A1 publication Critical patent/WO2018074851A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/18—Complex mathematical operations for evaluating statistical data, e.g. average values, frequency distributions, probability functions, regression analysis
    • 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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • 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
    • 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
    • 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/10—Office automation; Time management

Definitions

  • the present disclosure relates to a delivery order distribution system and method for distributing orders to deliverymen.
  • the list of products available for ordering through the leaflet or the homepage provided by the company to check the one of them, and then call the company to go through the process of ordering.
  • a separate controller selects an appropriate deliveryman and assigns an order, or a desired deliveryman selects a delivery from a list of received orders.
  • a method of assigning a delivery order selected by the deliveryman to the deliveryman was used.
  • the conventional method when the number of delivery orders and delivery sources to be distributed is large, there is a high possibility of inefficient work distribution.
  • the present invention has been made to solve the above-mentioned conventional problems, and an object of the present disclosure is to provide a delivery order distribution system and method for efficiently distributing a plurality of delivery orders to a plurality of delivery personnel.
  • the information obtaining module of the delivery order distribution system obtaining a plurality of delivery orders from one or more customers, each of the plurality of delivery orders location of the sales office corresponding to the delivery order And a location of a delivery destination corresponding to the delivery order; Acquiring, by the information acquisition module, a location of each delivery source from a terminal of a plurality of delivery persons; Determining, by the delivery order analysis module of the delivery order distribution system, an estimated travel time for each of one or more delivery sources of the plurality of delivery guys for each of the plurality of delivery orders, wherein the expected travel time corresponds to the estimated travel time.
  • a delivery source selection module of the delivery order distribution system is configured to generate a plurality of delivery orders based on the delivery order-deliverer assignment combinations, wherein one or more delivery orders of the plurality of delivery orders are randomly assigned to the one or more delivery sources of the plurality of delivery orders. Determining a total sum of estimated time required for at least one of the delivery orders, wherein the sum of the estimated time required is the sum of the estimated travel times for each delivery order for the at least one delivery order among the plurality of delivery orders.
  • the plurality of delivery orders may include a predetermined number of new delivery orders, new delivery orders accumulated for a certain period, or delivery orders selected for distribution according to a predetermined criterion.
  • the estimated travel time is the first estimated travel time for the delivery person corresponding to the expected travel time to move from the location of the delivery person to the location of the dealership and the delivery person from the location of the dealership. And a second estimated travel time to travel to the location of the delivery destination.
  • the delivery order analysis module of the delivery order distribution system further comprises the step of determining whether the delivery waiter is waiting for the assignment of the delivery order assignment or is currently processing other delivery orders. And determining, for each of the plurality of delivery orders, an estimated travel time of each of the one or more deliverymen of the plurality of deliverymen, if it is determined that the deliveryman is in an allotted wait state, the deliveryman is the current deliveryman of the deliveryman. Determining the estimated time required to move from a location to a location of a sales office of the delivery order as the first estimated travel time of the deliveryman, and determining that the deliveryman is currently processing another delivery order. The other being currently processed by the deliveryman from the current location of the deliveryman.
  • the step of selecting one or more couriers among the plurality of couriers to process the plurality of courier orders among the plurality of couriers may include:
  • the method may include selecting one or more couriers to minimize the value of as one or more couriers to process the plurality of delivery orders (in Equation 1-1, R is a set including a plurality of delivery orders, r is the delivery order for each delivery order, d (r) is the delivery person assigned to delivery order r, P (d (r)) is the location of delivery person d (r), C (r) is the sales office location of delivery order r, D (r) is the location of the delivery destination r of the delivery order r, and T (x, y) represents the estimated travel time from location x to location y).
  • R is a set including a plurality of delivery orders
  • r is the delivery order for each delivery order
  • d (r) is the delivery person assigned to delivery order r
  • P (d (r)) is the location of delivery person d (r)
  • C (r) is the sales office location of delivery order r
  • D (r) is the location of the delivery destination r of the delivery order r
  • the delivery order distribution method, the delivery order analysis module of the delivery order distribution system further comprises the step of determining the estimated time of completion of the preparation of the delivery of each of the plurality of delivery orders-the preparation
  • the estimated completion time includes an estimated time from the point of time when the sales office receives the delivery order to the completion of the preparation of the delivery item.
  • the determining of the total estimated time required includes: The total estimated time may be further determined based on the estimated time of completion of each of the one or more delivery orders.
  • the preparation completion time is based on one or more of the order time of the delivery order corresponding to the preparation completion time, the order quantity of the delivery goods, the items of the delivery goods, or the characteristics of the delivery goods Can be determined.
  • the delivery article includes a delivery food, the characteristics of the delivery article, the type of the delivery food, the complexity of the cooking procedure of the delivery food, the cooking method of the delivery food, the cooking procedure of the delivery food It may include one or more of whether or not a part of can be prepared in advance.
  • the step of selecting one or more couriers to process the plurality of courier orders among the plurality of couriers may include:
  • Equation 2-1
  • R is a set including a plurality of delivery orders, r is each delivery order, d (r) is the delivery person assigned to delivery order r, P (d (r)) is the location of delivery d (r), C (r) is the sales office location of delivery order r, E (r) is the estimated time to complete the delivery of the delivery order r, D (r) is the location of the delivery destination r of the delivery order r, and T (x, y) is the estimated travel time from position x to position y) .
  • the delivery order distribution method, the delivery order analysis module of the delivery order distribution system further comprises the step of determining the fatigue degree of one or more of the plurality of delivery agents, wherein the Selecting one or more couriers to process the plurality of delivery orders may include selecting one or more couriers to process the delivery order from among the plurality of couriers further based on the fatigue level.
  • the fatigue degree is the total travel time of the deliveryman corresponding to the fatigue degree, the total travel distance of the deliveryman, the distance that the deliveryman continuously traveled without rest to date, or the deliveryman continuously without rest to the present It may be determined based on at least one of the travel time.
  • the step of selecting one or more couriers to process the delivery order among the plurality of couriers may include:
  • Equation 1-2
  • R is a set including the plurality of delivery orders.
  • d (r) is the delivery person assigned to delivery order r
  • P (d (r)) is the location of delivery d (r)
  • C (r) is the sales office location of delivery order r
  • D (r) is the location of the delivery destination r of the delivery order r
  • w (d (r)) is the fatigue of the delivery agent d (r)
  • T (x, y) is the estimated travel time from location x to location y) .
  • the delivery order analysis module of the delivery order distribution system further comprises the step of determining the estimated time of completion of the preparation of the delivery of each of the plurality of delivery orders-the preparation Estimated time to complete includes the estimated time it takes from the time the dealer receives the delivery order to the completion of preparation of the delivery item requested by the delivery order;
  • Equation 2-2
  • the method may include selecting one or more couriers to minimize the value of as one or more couriers to process the plurality of delivery orders (in Equation 2-2, R is a set including a plurality of delivery orders, r is each delivery order, d (r) is the delivery person assigned to delivery order r, P (d (r)) is the location of delivery d (r), C (r) is the sales office location of delivery order r, E (r) is the estimated time to complete the delivery of the delivery order r, D (r) is the location of the delivery destination r, w (d (r)) is the fatigue of the delivery agent d (r), T (x, y) represents the estimated travel time from position x to position y).
  • R is a set including a plurality of delivery orders
  • r is each delivery order
  • d (r) is the delivery person assigned to delivery order r
  • P (d (r)) is the location of delivery d (r)
  • C (r) is the sales office location of delivery order r
  • the delivery order distribution method, the statistical data collection module of the delivery order distribution system, collecting delivery order statistics of one or more registered dealerships registered in the delivery order distribution system-the delivery order Statistical data includes statistics for a certain period of time for the number of delivery orders for each day or time of the one or more registered dealerships-The waiting place selection module of the delivery order distribution system, based on the delivery order statistics, Selecting a waiting place of a completed deliveryman who has completed the assigned delivery order among the plurality of deliverymens, and the communication module of the delivery order distribution system transmits the selected waiting place information to the terminal of the completed deliveryman It may further comprise a step.
  • the step of selecting the waiting place of the completed deliveryman, the one or more registered sales based on the data of the day and time zone corresponding to the time when the completed deliveryman completed the delivery order of the statistical data of the delivery order Determining a predicted order number for each business, and obtaining, for each registered retailer, a completed order number, which is the number of orders that have been delivered until the completed deliveryman has completed delivery or is scheduled for delivery completion.
  • Calculating, for each registered dealer, a residual order number by subtracting the completed order number from the predicted order number, and based on the calculated remaining order number for each registered dealer, one or more clusters Determining an area, calculating remaining orders of each registered area by summing remaining orders of registered dealers belonging to each of the clustered areas for each of the one or more clustered areas; Selecting one of the at least one clustered area based on the at least one clustered area, and determining a place belonging to the selected at least one clustered area as the waiting place of the at least one completed delivery person.
  • the step of selecting the waiting place of the completed deliveryman, the one or more registered sales based on the data of the day and time zone corresponding to the time when the completed deliveryman completed the delivery order of the statistical data of the delivery order Determining a predicted order number for each business, determining one or more clustered areas based on the predicted order number for each registered retailer, for each of the one or more clustered areas, for each of the at least one clustered area Calculating the predicted order number for each cluster area by summing up the predicted order number of registered dealers belonging to the registered retailer, and for each cluster area, the order of the completed delivery until the completion delivery time or the scheduled delivery completion time of each delivery area.
  • a computer program stored in a computer readable recording medium which, when executed by a computer, causes the computer to perform the above-described method.
  • an information acquisition module a delivery order analysis module, a delivery person analysis module, a delivery source selection module, a communication module, a statistical data collection module, and a waiting place selection module configured to implement the above-described method and features.
  • a delivery order distribution system comprising a.
  • FIG. 1 is a view for explaining a configuration environment of the delivery order distribution system according to an embodiment of the present disclosure.
  • FIGS. 2A to 2D are block diagrams illustrating a schematic configuration of a delivery order distribution system according to an embodiment of the present disclosure.
  • FIG. 3 is a flowchart schematically illustrating a method of distributing a delivery order by a delivery order distribution system according to an exemplary embodiment of the present disclosure.
  • FIG. 4 is a flowchart illustrating a method of determining an estimated travel time of a particular single deliveryman in one embodiment of the present disclosure.
  • 5 is a view for explaining the expected travel time.
  • FIG. 6 is a flowchart illustrating a method of determining a total estimated time required by a delivery order distribution system according to an exemplary embodiment of the present disclosure.
  • FIG. 7 to 10 are flowcharts illustrating a method of selecting a delivery person in different embodiments of the present disclosure, respectively.
  • FIG. 11 is a flowchart schematically illustrating a method of notifying a delivery place of a delivery person who has completed delivery by a delivery order distribution system according to an exemplary embodiment of the present disclosure.
  • 12 and 13 are flowcharts illustrating specific methods of selecting a waiting place by the delivery order distribution system according to an exemplary embodiment of the present disclosure.
  • FIG. 14 is a flowchart illustrating an example of a method of calculating a predicted order number of a specific sales office by a delivery order distribution system according to an exemplary embodiment of the present disclosure.
  • 15 is a flowchart illustrating an example of a method in which a delivery order distribution system analyzes an order number by a cluster analysis algorithm according to an embodiment of the present disclosure.
  • 16 is a block diagram illustrating a schematic configuration of a computing device in which a delivery order distribution system according to an embodiment of the present disclosure may be implemented.
  • first and second may be used to describe various components, but the components should not be limited by the terms. The terms are used only for the purpose of distinguishing one component from another.
  • the component when one component 'transmits' data to another component, the component may directly transmit the data to the other component, or through at least one other component. Means that the data may be transmitted to the other component.
  • the component when one component 'directly transmits' data to another component, it means that the data is transmitted from the component to the other component without passing through the other component.
  • FIG. 1 is a view for explaining a configuration environment of the delivery order distribution system according to an embodiment of the present disclosure.
  • the delivery order distribution system 100 may be linked with the delivery order relay system 200.
  • the delivery order relay system 200 may relay a delivery order requested by the orderer.
  • the delivery order may be a request to deliver the goods subject to delivery to a place designated by the purchaser.
  • the delivery order relay system 200 may be connected to communicate with the orderer terminal (400 to 400-N) and the affiliated company (that is, sales) terminal (500 to 500-M), Various data and / or information necessary to implement the technical idea of the present disclosure can be transmitted and received.
  • the connection and / or communication between the delivery order relay system 200 and the orderer terminal 400 to 400-N and the delivery order relay system 200 and the sales office terminal 500 to 500-M may be a local area network.
  • Wired networks such as LANs, Wide Area Networks (WANs) or Value Added Networks (VANs), mobile radio communications networks, satellite networks, Bluetooth, and Wibro (Wireless). Broadband Internet), HSDPA (High Speed Downlink Packet Access), etc. can be executed over any kind of wireless network.
  • Delivery order relay system 200 can be connected to a number of ordering terminals (400-1 to 400-N) The delivery order relay system 200 may receive a request for delivery from each orderer terminal 400-1 to 400 -N.
  • the delivery order relay system 200 provides a predetermined DB (not shown) with information about a plurality of sales offices (affiliates) subscribed to the delivery order relay system 200 and information about delivery goods provided by each sales office. Can be stored / managed in The delivery order relay system 200 may provide information on a plurality of affiliates registered in advance in the delivery order relay system 200 at the request of an orderer terminal (for example, 400-1) connected to the delivery order relay system 200. And providing information on a plurality of delivery items provided by each sales office, so that an orderer corresponding to the orderer's terminal (for example, 400-1) selects any one of them and requests a delivery order for the delivery goods. can do.
  • a predetermined DB not shown
  • the delivery order relay system 200 may provide information on a plurality of affiliates registered in advance in the delivery order relay system 200 at the request of an orderer terminal (for example, 400-1) connected to the delivery order relay system 200. And providing information on a plurality of delivery items provided by each sales office, so that an orderer
  • the delivery order relay system 200 may receive a delivery order from the orderer terminal (for example, 400-1).
  • a delivery order may be a delivery request for a specific delivery product provided by a particular retailer.
  • the delivery order may include information about the sales office and information about the delivery goods.
  • the delivery order may further include a variety of information required for delivery (for example, the address of the orderer).
  • the orderer terminal 400-1 may request the delivery order for the delivery goods provided by the sales office from the orderer terminal 400-1.
  • the terminal 400-1 may provide information on delivery goods provided by a sales office.
  • the new delivery order is delivered to the sales office terminal (for example, 500-1) corresponding to the new delivery order.
  • Information about the order can be sent.
  • the delivery order information may include information on the ordered delivery goods and information on the orderer.
  • the information on the delivered goods may include items, quantities, and the like, and the information on the orderer may include the customer's customer number, telephone number, address (delivery address), and the like.
  • the delivery order relay system 200 receives an approval result regarding whether the corresponding delivery order is approved by the sales company corresponding to the sales terminal 500-1 from the sales terminal 500-1 that receives the delivery order. can do.
  • the approval of the delivery order may be information on whether the company corresponding to the sales office terminal 500-1 has approved or rejected the delivery order.
  • the sales office terminal 500-1 may output the contents of the received delivery order, and receive a selection of approval or rejection of the delivery order from the owner or manager of the sales terminal 500-1.
  • the dealership terminal 500-1 may include a display device or a printing device for outputting the contents of the delivery order, and may further include an input button for inputting a selection of approval or rejection for the delivery order.
  • the shop terminal 500-1 may transmit a response to the delivery order to the delivery order relay system 200. Then, the delivery order relay system 200 may transmit the order confirmation information corresponding to the response to the orderer terminal 400-1 when the sales office terminal 500-1 transmits a response to the delivery order. . That is, when the response to the delivery order is the approval of the delivery order, the delivery order relay system 200 may transmit the guide information that the order was successfully received, and when the response to the delivery order is the rejection of the delivery order, delivery The order relay system 200 may transmit guide information indicating that the order was not received.
  • the delivery order distribution system 100 may be connected to each other via the delivery order relay system 200 and a wired or wireless network, and may transmit and receive various data and / or information.
  • the delivery order relay system 200 may transmit the information of the newly received delivery order to the delivery order distribution system 100.
  • the delivery order relay system 200 transmits the information of the received new delivery order to the delivery order distribution system 100 each time a new delivery order is received, or whenever the delivery order distribution system 100 requests. It is also possible to collectively transmit the information of one or more new delivery orders that have been successfully received by.
  • the delivery order distribution system 100 may be registered with a plurality of delivery sources, and can be connected to each other through the terminal (600-1 to 600-K) and wired and wireless networks of each delivery source, the technical idea of the present disclosure It can transmit and receive various data and / or information necessary to implement.
  • the delivery order distribution system 100 may be connected to each other through the manager terminal 300 and a wired or wireless network, etc., and may transmit and receive various data and / or information necessary to implement the technical idea of the present disclosure.
  • the deliverymen's terminals 600-1 to 600 -K may be terminals possessed by each deliveryman registered in the delivery order distribution system 100.
  • the deliverymen's terminals 600-600-K may be mobile phones, smartphones, tablet PCs, mobile devices, including personal digital assistants (PDAs), or other wireless computing devices or other handheld devices having wireless connectivity. It may be a processing device connected to a wireless modem.
  • the terminals 600 to 600-K of the delivery person may be provided with means (for example, a GPS (Golbal Positioning System) device and an IPS (Indoor Positioning System) device) capable of obtaining information regarding its current location. Can be.
  • Terminals 600-1 to 600-K of the delivery person may receive and display information provided by the delivery order distribution system 100, and display various types of information necessary for the delivery order distribution system 100 to drive. Can be collected and sent to the delivery order distribution system 100.
  • the manager terminal 300 may be a terminal for accessing various information held by the delivery order distribution system 100 or controlling the delivery order distribution system 100.
  • the manager terminal 300 may be a desktop, laptop, dummy terminal, wireless computing device or other including a mobile phone, smart phone, tablet PC, mobile device including a PDA, or a handheld device having other wireless access functions. It may be a processing device connected to a wireless modem.
  • the sales terminal may be a desktop, a laptop, a mobile phone, a smartphone, a tablet PC, a mobile device including a personal digital assistant (PDA), or a handheld having other wireless connection functions. It may be a wireless computing device comprising the device or a processing device coupled to another wireless modem.
  • the sales terminal 500 to 500-M may be a type included in a point of sale (POS) terminal or a form connected to a POS terminal through a predetermined interface.
  • the sales terminal ( 500 to 500-M) may perform various functions and credit card inquiry / payment functions necessary to implement the technical idea of the present disclosure.
  • the orderer terminals 400-1 to 400 -N may also be desktops, laptops, mobile phones, smartphones, tablet PCs, mobile devices including personal digital assistants (PDAs), or other handheld devices with wireless connectivity. It may be a wireless computing device or a processing device coupled to another wireless modem.
  • the orderer terminals 400-1 to 400 -N display information on the sales offices pre-registered in the delivery order relay system 200 and the delivery items provided by each sales office, and receive the delivery orders from the user.
  • a delivery application eg, ethnic application of delivery, etc.
  • a delivery application that performs a function of transmitting to the delivery order relay system 200 may be installed in advance.
  • FIG. 1 illustrates an example in which the delivery order distribution system 100 is implemented as a system independent from the delivery order relay system 200
  • the delivery order distribution system 100 according to the embodiment is a delivery order relay system ( It may be implemented as some component contained within 200).
  • FIG. 2A is a block diagram illustrating a schematic configuration of a delivery order distribution system 100 according to an embodiment of the present disclosure.
  • the delivery order distribution system 100 DB 110, communication module 120, DB management module 130, information acquisition module 140, delivery order selection module 150, delivery order analysis
  • the module 155 may include a delivery source analyzing module 160, a delivery source selecting module 170, a statistical data collecting module 180, and a waiting place selecting module 190.
  • some of the components of FIG. 2 may not necessarily correspond to components necessary for the implementation of the present disclosure, and also according to an embodiment, the delivery order distribution system 100 ) May also include more components than this.
  • the delivery order distribution system 100 may include other components included in the delivery order distribution system 100 (eg, DB 110, communication module 120, DB management module 130, and information acquisition module).
  • the delivery order selection module 150 may further include a control module (not shown) to control the function and / or resources of the).
  • the delivery order distribution system 100 may include hardware resources and / or software necessary to implement the technical idea of the present disclosure, and may necessarily mean one physical component or one device. It is not. That is, the delivery order distribution system 100 may refer to a logical combination of hardware and / or software provided to implement the technical spirit of the present disclosure, and if necessary, are installed in devices spaced apart from each other to provide respective functions. It may be implemented as a set of logical configurations for implementing the technical spirit of the present disclosure by performing the following. In addition, the delivery order distribution system 100 may refer to a set of components that are separately implemented for each function or role for implementing the technical spirit of the present disclosure.
  • the DB 110, communication module 120, DB management module 130, information acquisition module 140, delivery order selection module 150, delivery order analysis module 155, delivery analysis module ( 160, the delivery source selection module 170, the statistical data collection module 180, and / or the standby location selection module 190 may be located in different physical devices or may be located in the same physical device.
  • module in the present specification may mean a functional and structural combination of hardware for performing the technical idea of the present disclosure and software for driving the hardware.
  • the module may mean a logical unit of a predetermined code and a hardware resource for performing the predetermined code, and does not necessarily mean a physically connected code or a kind of hardware. It can be easily inferred by those skilled in the art.
  • the communication module 120 may communicate with the deliverymen terminals 600-1 to 600 -K and / or the delivery order relay system 200, and may provide various data, signals, and / or information. Can send and receive
  • DB 110 may store a variety of information about the delivery order requested by the orderer terminal (400-1 to 400-N) and / or a variety of information about the registered delivery agent registered in advance in the delivery order distribution system 100. .
  • the DB management module 130 may generate or delete various kinds of information on the DB 110 and may update various kinds of information on the DB 110 as necessary.
  • the DB management module 130 may generate a record on the DB 110 to store the information of the new delivery order.
  • the information on the delivery order stored on the DB 110 includes the order ID (identification information), the order request time, the sales office information (the sales office ID, the location information of the sales office (for example, the location coordinates of the sales office)). It may include information on the order (item, quantity, etc.), delivery status information, assignment time, pickup time, delivery completion time, scheduled pickup time, delivery completion scheduled, ID of the assigned delivery.
  • the DB management module 130 or the delivery order relay system 200 may update some of the information about the delivery order generated on the DB 110.
  • the DB management module 130 may update the status information of the delivery order in accordance with the delivery status information received from the delivery terminal (for example, 600-1), assignment time, pickup time, delivery completion time It is also possible to update the scheduled pickup time, the scheduled delivery completion time, and the ID of the assigned delivery person.
  • the DB 110 may generate information about a plurality of delivery sources (hereinafter referred to as "registration delivery") registered in advance in the delivery order distribution system 100.
  • the information on the registered delivery person includes the delivery ID, the location information of the delivery person (for example, the current location coordinates of the delivery person), the total travel distance of the delivery person, the total travel time of the delivery person, the information on the assigned delivery order, the status of the delivery person. Information and the like.
  • the state of the courier is the waiting state for the courier waiting for the assignment of the delivery order, the assignment completion state for which the delivery order has been assigned to the courier, the pickup state for the courier moving to the sales office, and the corresponding courier.
  • the information about the registered delivery person may be updated by the DB management module 130.
  • the DB management module 130 may update the deliveryman's status information, the deliveryman's location information according to the information received from the deliveryman terminal (for example, 600-1), the total moving distance of the deliveryman, You can also update the delivery person's daily total travel time and information on assigned delivery orders.
  • Figure 2a shows an example in which the DB 110 is implemented on the delivery order distribution system 100 side, according to the implementation is different from the delivery order relay system 200 is included in the DB (100) It may be present, or may be implemented as a separate independent system.
  • the communication module 120 may receive location information and / or status information of each registered deliveryman from the terminals 600-1 to 600 -K of the registered deliveryman.
  • the terminals 600-1 to 600-K of each registered delivery person may transmit their location information periodically or whenever the delivery order distribution system 100 requests them.
  • each courier may input the changed state to the terminal possessing each time the state of the courier changes, and the terminals 600-1 to 600-K of the courier may change the state of each courier or
  • the delivery order distribution system 100 may transmit the status information of the delivery person whenever requested.
  • the information acquisition module 140 may obtain a plurality of delivery orders from one or more customers.
  • the information acquisition module 140 may obtain the information of the delivery order stored in the DB (110).
  • Each order information may include location information of a sales office and location information of a delivery destination corresponding to the corresponding order information.
  • delivery order itself may be interpreted to include the 'order information for the delivery order' described in detail herein.
  • the information acquisition module 140 may obtain information of the delivery person.
  • the information acquisition module 140 may obtain delivery source information for a plurality of delivery sources.
  • Each deliveryman information may include the location information of the deliveryman corresponding to the deliveryman information.
  • the information acquisition module 140 may obtain information from the DB 110, and in some cases, may obtain information from the terminals 600-1 to 600 -K of the delivery person.
  • the delivery order selection module 150 may select at least some of the new delivery orders added to the DB 110 as a distribution target delivery order.
  • a new delivery order may mean a delivery order that has not yet been assigned to a deliveryman.
  • a new delivery order means all delivery orders that are currently assigned, including delivery orders that have been assigned to the deliveryman but are not canceled or cannot be completed due to any circumstances and require re-allocation. You may.
  • the delivery order selection module 150 may select the predetermined number of new delivery orders as a distribution target delivery order when a certain number of new delivery orders are accumulated in the DB 110. In another embodiment, the delivery order distribution system 100 may select a new delivery order accumulated for a certain period as a distribution target delivery order. In another embodiment, the delivery order selection module 150 may select a new delivery order specified by the manager terminal 300 as a distribution target delivery order. In another embodiment, the delivery order selection module 150 may select a distribution target delivery order according to another arbitrary criterion.
  • FIG. 2b is a block diagram showing the schematic configuration of the delivery order analysis module of Figure 2a.
  • the delivery order analysis module 155 may include an estimated travel time analysis module 156 and / or a preparation time analysis module 157.
  • Estimated travel time analysis module 156 is based on the location information of the sales office included in the order information of the delivery order received from the information acquisition module 140 and the location information of the delivery destination and the delivery information received from the information acquisition module 140. Based on one or more of the location information of the included deliveryman, it is possible to determine the estimated moving time of the deliveryman.
  • the estimated delivery time of the deliveryman may include an estimated time taken to move from the current location of the deliveryman to the sales office corresponding to the delivery order.
  • the estimated delivery time of the deliveryman is a first estimated travel time for the deliveryman to move from the current location of the deliveryman to the location of the dealership and a second time for the deliveryman to move from the location of the dealership to the location of the delivery destination. May include estimated travel time.
  • the preparation expected time analysis module 157 may determine the preparation completion estimated time taken until the preparation of the delivery article is completed after receiving the delivery order from the delivery shop.
  • the estimated time to prepare a delivery item may include an estimated time from the point of time at which the retailer receives the delivery order to the completion of preparation of the delivery item requested by the delivery order.
  • the preparation completion time may be determined based on one or more of the order time of the delivery order, the order quantity of the delivery article, the item of the delivery article, or the characteristics of the delivery article.
  • Figure 2c is a block diagram showing a schematic configuration of the delivery source analysis module 160 of Figure 2a.
  • the delivery agent analysis module 160 may include a state analysis module 161 and / or a fatigue analysis module 162.
  • the state analysis module 161 may determine the state of the delivery person.
  • the status of the deliveryman is the waiting status for the deliveryman who is waiting for the assignment of the delivery order, the completion of the assignment with the delivery order completed to the deliveryman, the pickup of the deliveryman being moved to the sales office, It may be a completion of pickup in which the delivery agent has picked up the delivery item at the sales office, a delivery in which the deliveryman is moving to the delivery destination after completing the pickup, and a delivery completion in which the deliveryman has arrived and completed delivery. .
  • Fatigue analysis module 162 may determine the fatigue of the deliveryman.
  • the fatigue level is, for example, a numerical value determined by the total distance traveled by the deliveryman, the total travel time of the deliveryman, the distance traveled by the deliveryman continuously to the present without break, or the time by which the deliveryman traveled continuously to the present without break. Can be.
  • the delivery source selection module 170 may assign a plurality of distribution target delivery orders to a plurality of delivery sources based on the order information and the delivery source information of the delivery order received from the information acquisition module 140 (that is, each delivery order). You can select a delivery person to handle the process). In one embodiment, the delivery selector module 170 is based on a delivery order-deliverer assignment combinations that randomly assign one or more delivery orders from among a plurality of delivery orders to one or more of the plurality of delivery orders. You can determine the total estimated time required for one or more delivery orders. In one embodiment, the total estimated time required may be determined based on the sum of the estimated travel times for each delivery order for one or more delivery orders among a plurality of delivery orders.
  • the delivery selector module 170 may be configured to select one or more delivery agents to process the plurality of delivery orders of the plurality of delivery agents, based on the delivery order-delivery assignment combination to minimize the total estimated time required.
  • the delivery source selection module 170 selects one or more delivery agents to process a plurality of delivery orders. Additional features of how the delivery source selection module 170 selects one or more delivery agents to process a plurality of delivery orders will be described later.
  • the deliveryman selection module 170 includes a calculation module 171 for calculating various equations and values necessary for selecting a deliveryman, and an estimated time analysis module for determining an estimated time required for one or more delivery orders or a total thereof. And a delivery source determination module 173 for selecting a delivery source based on the calculation value of the calculation module 171 and / or the result value of the estimated time analysis module 172.
  • the communication module 120 may transmit, to each of a plurality of deliverymen, order information of a delivery order assigned to the deliveryman to a terminal of the deliveryman.
  • the statistical data collection module 180 may collect statistical data for a predetermined period (for example, a predetermined period of time) for the number of delivery orders for each day and time of each registered agency registered in the delivery order distribution system 100. have.
  • the waiting place selection module 190 may select the waiting place of the completed deliveryman who completed the assigned delivery order among the plurality of deliverymen based on the collected statistical data.
  • the waiting place selection module 190 determines a plurality of cluster areas based on the remaining orders calculated for each of the registered dealers, and then selects one of the cluster areas to complete any place belonging to the selected cluster area. This can be determined by the delivery person's waiting area.
  • the communication module 120 may transmit the selected waiting place information to the terminal of the completed delivery person.
  • FIG. 3 is a flowchart schematically illustrating a delivery order distribution method performed by a delivery order distribution system 100 according to an exemplary embodiment of the present disclosure.
  • the information acquisition module 140 of the delivery order distribution system 100 may obtain a plurality of delivery orders from one or more customers (S100).
  • each of the plurality of delivery orders may include the location of the sales office corresponding to the delivery order and the location of the delivery destination corresponding to the delivery order.
  • the requested new delivery order may be registered in the DB 110.
  • the information acquisition module 140 may obtain a delivery order registered in the DB 110.
  • the location of the sales office may be expressed in the form of coordinates indicating the location of the sales office, and the location of the delivery destination may be expressed in the form of the coordinates of the location where the goods corresponding to the delivery order will arrive.
  • the delivery order acquired by the information acquisition module 140 may include new delivery orders that have not yet been assigned to the delivery person, or may include all delivery orders that are currently required to be assigned.
  • the plurality of delivery orders may be a certain number of new delivery orders.
  • the information acquisition module 140 continuously checks the number of new delivery orders accumulated in the DB 110, and when a predetermined number of new delivery orders are accumulated, the schedule accumulated in the DB 110. A number of delivery orders can be obtained.
  • the plurality of delivery orders may be new delivery orders accumulated over a period of time.
  • the information acquisition module 140 may collectively obtain new delivery orders registered in the DB 110 at regular intervals.
  • the plurality of delivery orders may include delivery orders selected for distribution according to predetermined criteria.
  • the criteria for selecting may be, for example, the time when the delivery order is registered, the location of the delivery place, the quantity or type of the delivery items corresponding to the delivery order, but the technical spirit of the present disclosure is not limited thereto. Can be.
  • the information acquisition module 140 of the delivery order distribution system 100 may obtain the location information (for example, coordinates indicating the current location of the delivery source) of the plurality of delivery personnel respectively corresponding to the plurality of delivery personnel. (S110).
  • the information acquisition module 140 may obtain the location of the delivery person from the terminal of each delivery person.
  • the location information of each of the plurality of deliverymen is measured by the location determination device (e.g. GPS) of the deliveryman's terminal and received via the communication module 120 of the delivery order distribution system. It may be a coordinate.
  • the location determination device e.g. GPS
  • the communication module 120 of the delivery order distribution system It may be a coordinate.
  • the delivery order analysis module 155 of the delivery order distribution system 100 may determine an estimated movement time of each of one or more delivery sources of the plurality of delivery orders for each of the plurality of delivery orders (S120). In one embodiment, based on one or more of the location of the dealership corresponding to the delivery order, the location of the delivery destination corresponding to the delivery order, and the location of the deliveryman, the estimated travel time of the deliveryman may be determined. In one embodiment, the estimated delivery time of the deliveryman is a first estimated travel time for the deliveryman to move from the current location of the deliveryman to the location of the dealership and a second time for the deliveryman to move from the location of the dealership to the location of the delivery destination. May include estimated travel time.
  • each deliveryman is in a waiting state for waiting for assignment of the delivery order or is currently in progress for another delivery, and determine the estimated moving time in different ways according to the determined deliveryman's state.
  • FIG. 4 is a flowchart illustrating a method of determining an estimated travel time of a particular single deliveryman in one embodiment of the present disclosure.
  • the delivery order analysis module 155 may determine whether a delivery person is in an assignment wait state waiting for an assignment of a delivery order or whether the delivery person is processing another delivery order (S121). In one embodiment, the delivery order analysis module 155 checks the status information of the delivery person stored in the DB 110 to determine whether the delivery is waiting for the assignment of the delivery order or the other delivery orders other delivery orders It can be determined whether the processing state.
  • the delivery order analysis module 155 calculates an estimated time required for the delivery person to move from the present location of the delivery person to the location of the sales office of the delivery order.
  • the first estimated travel time of the delivery person may be determined (S123). This is because the deliveryman can move directly from the current location of the deliveryman to the sales office when the deliveryman is in the wait state. This will be described below with reference to FIG. 5 (a). If the delivery agent A is in the wait state, as shown in Fig.
  • the deliveryman when the deliveryman is currently processing another delivery order, the deliveryman must complete the delivery of the delivery order currently being processed and then move to the sales office of the delivery order. If it is determined that the order is being processed, the estimated travel time from the present location of the deliveryman to the location of the delivery destination of the other delivery order currently being processed by the deliveryman and the location of the delivery destination of the other delivery order currently being processed by the deliveryman; The calculated value of the sum of the estimated travel time from the delivery shop to the location of the sales office of the delivery order can be determined as the first estimated travel time of the delivery person (S124). This will be described with reference to FIG. 5 (b). If the delivery agent A is not in the waiting state (i.e. currently delivering other deliveries), as shown in Fig.
  • the delivery target delivery order is delivered after delivering the delivery item that is currently being delivered to the destination C. Since it is necessary to move to sales office B, the time required to move from the position of the candidate delivery person A to the destination C of the existing delivery (travel time t2) and the time required to move from the destination C to the pickup destination B of the distribution target delivery order (movement) The sum of time t3) becomes the first estimated travel time.
  • the delivery order analysis module 155 moves the first estimated moving time of the delivery person and the delivery person from the location of the sales office to the location of the delivery destination.
  • the estimated travel time of the delivery person may be determined by summing the time required to take the second travel time (ie, the second estimated travel time) (S125).
  • the delivery selector module 170 of the delivery order distribution system 150 is based on a plurality of delivery order-deliverer assignment combinations that randomly assign one or more delivery orders of the plurality of delivery orders to one or more delivery agents of the plurality of delivery orders.
  • the total estimated time required for the one or more of the delivery orders of can be determined (S130).
  • the total estimated time required may be determined based on the sum of estimated travel times for each delivery order for one or more delivery orders among a plurality of delivery orders.
  • an estimate is made for all delivery order-delivery assignments corresponding to the number of cases in which each of all the plurality of deliverers to be distributed is randomly assigned.
  • the total of the time required can be determined.
  • a predetermined delivery order-deliverer assignment is randomly assigned to only a portion of a plurality of delivery orders and / or a plurality of deliverers to be distributed, and then the estimated time required only for that delivery-delivery assignment. The sum of can be determined. In one embodiment, more than one delivery order may be assigned to one of the plurality of delivery agents.
  • the delivery selector module 170 may further determine the total estimated time required based on the estimated time of completion of each delivery order.
  • a flowchart according to the present embodiment is shown in FIG.
  • the estimated time to prepare may be the estimated time to prepare the delivery item requested by the delivery order.
  • the delivery order analysis module 155 of the delivery order distribution system 100 may determine a preparation completion time for each delivery item of a plurality of delivery orders to be distributed (S131).
  • the preparation completion estimated time may include an estimated time from the point of time when the sales office receives the delivery order to the completion of preparation of the delivery article.
  • the delivery order analysis module 155 is based on one or more of the order time of the delivery order, the ordered quantity of the delivery goods, the items of the delivery goods, or the characteristics of the delivery goods corresponding to the preparation completion time By doing so, the preparation completion time can be determined.
  • the characteristics of the delivery product include a type of the delivery food, a complexity of the cooking procedure of the delivery food, a method of cooking the delivery food, and a part of the cooking procedure of the delivery food. It may include one or more of whether or not.
  • the delivery order distribution system 100 may store in advance a list of preparation completion time for each order time of each delivery item, the order time and delivery goods of the distribution target delivery order in the list By selecting an item suitable for the quantity and items of the can be calculated the estimated time to complete the preparation of the delivery of the delivery target delivery target.
  • the expected completion time for each delivery item may be information that is provided in advance from the sales company handling the delivery item.
  • the delivery order distribution system 100 may pre-classify each delivery article according to the characteristics of the delivery article (for example, cooking characteristics), by specifying the expected completion time for each classification You can put it.
  • the classification of the article may be classified according to the cooking method of each dish such as a boiling dish, a baking dish, a stir dish, a fried dish, or a steamed dish.
  • the item must be prepared at least a part of the cooking process before ordering (immediate cooking, semi-cooked food, snack food, fast food, Seolleongtang, etc.), and the cooking process must be performed after the order. Items with the characteristic of being fried (fried, fried, noodle dishes, etc.) can be distinguished.
  • each food may be classified into cultural characteristics such as Korean, Chinese, Western, French, Southeast Asian, and Japanese.
  • the delivery order distribution system 100 determines which category the delivery article of the distribution target delivery order belongs to, and delivers the distribution subject using the estimated completion time specified in the classification to which the delivery article of the distribution target delivery order belongs. Estimated time to complete the order's delivery can be calculated.
  • each delivery article may have one or more characteristics, and the estimated delivery completion time may be determined according to the characteristics of each delivery article.
  • the characteristics of each article can be characterized by the cooking method as described above (e.g., boiling, baking, stir-fried, fried, steamed, etc.), at least part of the cooking process before ordering Or may include a characteristic that the cooking process is to be carried out after the order, cultural characteristics (eg, the food is Korean, Chinese, Western, French, Southeast Asian, Japanese, etc.)
  • the characteristics that each delivery product can have a variety of other characteristics can be used as a matter of course.
  • the delivery order distribution system 100 may predetermine a list of one or more combinations of characteristics of each article and a list of estimated time of preparation in a form similar to the following Table 1 below.
  • the estimated time to complete the preparation can be calculated by comparing the attributes of the delivery items of the target delivery order.
  • the delivery order distribution system 100 may consider each characteristic of the sale article in determining the estimated time to complete the preparation of each sale article in advance. For example, in the case of cooking, the cooking time may vary significantly according to the cooking method of the corresponding cooking, and even if the cooking is performed in the same cooking method, the cooking time may vary depending on whether a part of the cooking procedure can be prepared in advance. have. As such, the delivery order distribution system 100 according to an embodiment of the present disclosure may precisely determine a preparation completion time in consideration of various characteristics that a sales article may have.
  • the delivery order distribution system 100 may further calculate the expected time to prepare in consideration of the order time. For example, since a period in which an order is concentrated or a period in which there are not many orders is generally determined for each retailer, the delivery order distribution system 100 is provided with an estimated number of orders for each retailer's time or day, or each sale. It is possible to predict / determine the estimated number of orders by collecting statistical data for a certain period of time on the number of orders delivered by day or time of the store. Thereafter, the delivery order distribution system 100 may calculate a preparation completion estimated time using an expected order number corresponding to the order time of the distribution target delivery order. Alternatively, the delivery order distribution system 100 may predetermine a list of preparation completion time for each delivery time order time of each delivery goods, and compared with the order time of the delivery goods of the delivery order for the distribution target expected preparation completion The time can be calculated.
  • the delivery source selection module 170 randomly assigns one or more delivery orders of the plurality of delivery orders to one or more delivery agents of the plurality of delivery orders.
  • the total estimated time required may be determined based on the estimated time of completion of delivery of each of the delivery assignees and the plurality of delivery orders (S132).
  • the deliveryman selection module 170 may select one or more deliverymen to process the plurality of delivery orders among the plurality of deliverymen based on the delivery order-delivery assignment combination that minimizes the estimated time required (S140).
  • one of the plurality of couriers may be selected as a courier handling two or more delivery orders.
  • a delivery order-deliverer combination that minimizes the estimated total time required may be determined by any optimized algorithm. In one embodiment, for example, for all of the plurality of delivery orders to be distributed, for all delivery order-delivery assignments corresponding to the number of cases in which all of the plurality of delivery agents to be distributed are randomly assigned. Without having to determine the total estimated time, you can determine a delivery order-deliverer combination that minimizes the estimated total time .
  • the delivery source selection module 170 may generate a list of ⁇ delivery orders, deliverymen assigned to the corresponding delivery order> having the optimal solution. This may mean that the delivery source selection module 170 may select the most optimal combination of the plurality of delivery orders and the possible valid combinations of the plurality of delivery orders to be distributed.
  • FIG. 7 to 10 are flowcharts illustrating specific examples in which the delivery source selection module 170 performs the step S140 according to one embodiment of the present disclosure.
  • the delivery source selection module 170 may process the plurality of delivery orders as one or more delivery sources such that the value of the following [Formula 1] is minimized in consideration of the above-described estimated travel time.
  • the above delivery can be selected (S141-1).
  • R is a set including the plurality of delivery orders, r is each delivery order, d (r) is a delivery person assigned a delivery order r, the P (d (r)) Is the location of the delivery agent d (r), C (r) is the sales office location of the delivery order r, D (r) is the location of the delivery destination of the delivery order r, and T (x, y) is located from the location x It can represent the estimated travel time up to y.
  • the delivery source selection module 170 may further consider a preparation completion estimated time, which is an estimated time taken to prepare a delivery item requested by the delivery order, in selecting a delivery person to process a delivery order. have. That is, in the embodiment illustrated in FIG. 7, the delivery source selection module 170 may select one or more delivery sources to minimize the value of Equation 2 as one or more delivery sources to process the plurality of delivery orders (S141). -2).
  • R is a set including the plurality of delivery orders
  • r is each delivery order
  • the d (r) is a delivery person assigned to the delivery order r
  • the P (d (r)) is a deliveryman
  • the location of d (r) is the sales office location of the delivery order r
  • E (r) is the estimated time to complete the delivery of the delivery order r
  • D (r) is the delivery of the delivery order r
  • the location of the destination, T (x, y) may represent the estimated travel time from the location x to the location y.
  • the delivery source selection module 170 may consider fatigue of each delivery person in selecting a delivery person to process a delivery order.
  • the fatigue degree is at least one of a total moving time of a deliveryman corresponding to the fatigue degree, a total moving distance of the deliveryman, a distance that the deliveryman continuously moves to the present without rest, or a time that the deliveryman continuously moves to the present without rest. It may be a numerical value determined based on.
  • the delivery source selection module 170 may select a delivery person in consideration of only the fatigue degree of each delivery person, and as shown in FIG. .
  • the deliveryman selecting module 170 may determine the fatigue degree of one or more deliverymen among the plurality of deliverymen (S141-3).
  • the delivery source selection module 170 may select one or more delivery sources for processing the plurality of delivery orders such that the delivery source selection module 170 minimizes the value of Equation 3 below. S141-2).
  • R is a set including the plurality of distribution target delivery orders
  • d (r) is a delivery person assigned a delivery order r
  • P (d (r)) is the location of the delivery person d (r)
  • C (r) The location of the dealership of delivery order r
  • D (r) is the location of the destination of delivery order r
  • w (d (r)) is the fatigue of the delivery agent d (r)
  • T (x, y) is the location x May be the expected travel time from to position y.
  • the delivery source selection module 170 may consider all of the above-described fatigue, expected movement time, and preparation completion time.
  • the deliveryman selecting module 170 may determine fatigue levels of one or more deliverymen among the plurality of deliverymen (S141-4).
  • the delivery source selection module 170 may determine the preparation completion time of the delivery of each of the plurality of delivery orders (S131).
  • the delivery source selection module 170 may select one or more delivery sources to minimize the value of Equation 4 as one or more delivery sources to process the plurality of delivery orders (S141-2).
  • R is a set including the plurality of delivery orders, r is each delivery order, d (r) is a delivery person assigned to the delivery order r, the P (d (r)) Is the location of the delivery agent d (r), C (r) is the sales office location of the delivery order r, E (r) is the estimated time to complete the delivery of the delivery order r, D (r) is the delivery order r Where w (d (r)) is the fatigue degree of the delivery agent d (r), and T (x, y) may represent the estimated travel time from position x to position y.
  • the delivery source selection module 170 is extended to the 2-opt algorithm (2-OPT), 3-opt algorithm (3-OPT), to find a solution in which the formula [1] to [Equation 4] is the minimum value
  • Local search algorithms such as the k-opt algorithm can be used.
  • 'individual optimization method' there is a method of optimizing each delivery order or each delivery person (hereinafter referred to as 'individual optimization method'), which can guarantee global optimal solution.
  • 'individual optimization method' There is a disadvantage. For example, when a plurality of delivery orders are concentrated in one sales office, when an individual optimization method is used, a case may be assigned to a plurality of delivery orders to be processed (picked up) in the same sales office.
  • the above-described local search algorithm is a mechanism for comparing and exchanging all possible valid combinations, so that the global optimal solution can be obtained.
  • the communication module 120 of the delivery order distribution system 100 may transmit information on the plurality of delivery orders to a terminal of the selected one or more delivery sources.
  • the delivery order distribution system 100 may provide information about the appropriate waiting place to the delivery person to wait until after the completion of the delivery of the assigned delivery order is assigned to another delivery order, the outline of this An example of the process is shown in FIG.
  • the statistical data collection module () of the delivery order distribution system (100) is a period of the past for the number of delivery orders for each day and time of each registered retailer registered in the delivery order distribution system (100). Statistics can be collected during (S200).
  • the sales office registered in the delivery order distribution system 100 may include a sales office registered in advance in the delivery order relay system 200 that is linked to the delivery order distribution system 100.
  • the delivery order distribution system The waiting place selection module 190 of 100 may select the waiting place of the completed delivery person based on the collected statistical data (S220), and the communication module of the delivery order distribution system 100 may be The selected waiting place information may be transmitted to the terminal of the completed delivery person (S230).
  • the waiting place selection module 190 can be determined in advance in the waiting place for each time zone, and then, if the delivery completion signal is transmitted from the terminal of the completed delivery source, the waiting place determined in advance The information on the waiting place in the time zone in which the delivery completion signal arrives may be transmitted to the terminal of the completion delivery person.
  • step S220 of FIG. 11 a method of selecting a waiting place performed by the waiting place selection module 190 of the delivery order distribution system 100 will be described with reference to FIGS. 12 and 13 (that is, step S220 of FIG. 11). .
  • FIG. 12 is a flowchart illustrating an example of a method for selecting a waiting place by the waiting place selection module 190 of the delivery order distribution system 100 according to an exemplary embodiment of the present disclosure.
  • the waiting place selection module 190 is based on the data of the day and time corresponding to the time when the completed deliveryman completes the delivery order from the collected statistical data.
  • the number can be calculated (S300).
  • FIG. 14 is a flowchart illustrating an example of a method of calculating a predicted order number of a specific sales office.
  • the waiting place selection module 190 may collect a predetermined period of time (eg, in the past several weeks). Based on the data, it is possible to generate the standard demand data for the delivery order demand by day and / or time zone of the corresponding retailer (S510), and based on this, it is possible to calculate the predicted order number of the corresponding retailer.
  • the waiting place selection module 190 may include weather information (for example, information on weather conditions at the time of a delivery order, information on overall weather conditions at the time of a delivery order, etc.)
  • weather information for example, information on weather conditions at the time of a delivery order, information on overall weather conditions at the time of a delivery order, etc.
  • promotion information e.g., discount sales information
  • event information e.g., sporting events, etc.
  • the amount of demand data may be corrected (S520), and the predicted order number of the corresponding retailer may be calculated based on the corrected data.
  • the waiting place selection module 190 may calculate the predicted order number for each registered retailer by applying the standard demand data or corrected data to a predetermined prediction model (S530).
  • the waiting place selection module 190 also includes the number of completed orders, which is the number of delivery orders that have been delivered on the day and time corresponding to the time when the completed deliveryman completed the delivery order, for each registered dealer. To obtain (S310), for each registered dealer, it is possible to calculate the remaining order number by subtracting the completed order number from the predicted order number (S320)
  • the waiting place selection module 190 may determine a cluster area by analyzing the remaining order number for each registered dealer by a cluster analysis algorithm (S330).
  • 15 is a flowchart illustrating an example of a method of analyzing an order number by a cluster analysis algorithm.
  • the waiting place selection module 190 selects a store having a large expected order amount as an initial center point candidate based on the number of orders (for example, the number of remaining orders for each registered dealer). It may be (S610).
  • the waiting place selection module 190 may select a center point of the cluster so that the distance between the center points of the cluster is maximum (S620).
  • the waiting place selection module 190 may repeat the process of reselecting the cluster center point and clustering the cluster so that the sum of the distance differences in the cluster is minimized (S630).
  • the waiting place selection module 190 may calculate the remaining order number of the cluster area by summing up the remaining order number of the registered retailer belonging to the cluster area for each cluster area (S340). ).
  • the waiting area selection module 190 may select the waiting area of the cluster area based on the remaining order number of the cluster area (S350).
  • the waiting place selection module 190 may determine a place belonging to the selected waiting area as the waiting place of the completed delivery person (S360).
  • FIG. 13 is a diagram illustrating another example of a method of selecting a waiting place by the delivery order distribution system 100 according to another exemplary embodiment of the present disclosure.
  • the waiting place selection module 190 is based on the data of the day and time corresponding to the point in time when the completed deliveryman completes the delivery order of the collected statistical data, the predicted order for each registered retailer.
  • the number can be calculated (S400).
  • the waiting place selection module 190 may determine a cluster area by analyzing the predicted order number for each registered dealer by a cluster analysis algorithm (S410), and for each cluster area, registered sales belonging to the cluster area.
  • the estimated order number of the business may be added to calculate the predicted order number of the cluster area (S420).
  • the waiting place selection module 190 obtains the number of completed orders delivered by a registered retailer belonging to the cluster area for each cluster area (S430), and for each of the cluster areas, the completed orders in the predicted order number. The remaining number of orders can be calculated by subtracting the number (S440).
  • the waiting place selection module 190 selects a waiting area among the cluster areas based on the remaining order number of the cluster area (S450), and determines a place belonging to the selected waiting area as the waiting place of the completed deliveryman. There is (S460).
  • the computing device 10 may include a processor 20 and a memory 30.
  • the memory 30 may store a program 31 and data 32, and may transmit and receive instructions and / or data 32 included in the program 31 and a processor through a memory bus 40.
  • the processor 20 may include a single core CPU or a multi core CPU. It may also include general purpose and specific microprocessors.
  • Memory 30 may include read-only memory, fast random access memory, and may include nonvolatile memory, such as one or more magnetic disk storage devices, flash memory devices, or other nonvolatile solid state memory devices. Access to memory by the processor and other components may be controlled by a memory controller (not shown).
  • the program 31 may cause the computing device 10 to perform the delivery order distribution method described above.
  • the delivery order distribution method may be implemented in the form of computer-readable program instructions may be stored in a computer-readable non-transitory recording medium.
  • the computer readable recording medium includes all kinds of recording devices in which data readable by a computer is stored.
  • the program instructions recorded on the computer readable non-transitory recording medium may be those specially designed and constructed for the present disclosure, or may be known and available to those skilled in the software arts.
  • the computer readable recording medium can also be distributed over network coupled computer systems so that the computer readable code is stored and executed in a distributed fashion.
  • Examples of program instructions include not only machine code generated by a compiler, but also devices that process information electronically using an interpreter, for example, high-level language code that can be executed by a computer.
  • the hardware device described above may be configured to operate as one or more software modules to perform the operations of the present disclosure, and vice versa.

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Physics & Mathematics (AREA)
  • Economics (AREA)
  • General Physics & Mathematics (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Theoretical Computer Science (AREA)
  • Operations Research (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Quality & Reliability (AREA)
  • Marketing (AREA)
  • Data Mining & Analysis (AREA)
  • Development Economics (AREA)
  • Mathematical Analysis (AREA)
  • Game Theory and Decision Science (AREA)
  • Mathematical Physics (AREA)
  • Pure & Applied Mathematics (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Optimization (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Evolutionary Biology (AREA)
  • Probability & Statistics with Applications (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Algebra (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Databases & Information Systems (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Educational Administration (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

L'invention concerne un système et un procédé de distribution de commandes de livraison permettant la distribution de commandes à des personnes à livrer. Un système de distribution de commandes de livraison peut consister : à acquérir des commandes de livraison multiples en provenance d'un ou plusieurs clients ; à acquérir chaque emplacement de personne à livrer à partir de terminaux de personnes à livrer multiples ; à déterminer un temps de déplacement estimé de chaque personne à livrer parmi une ou plusieurs personnes à livrer parmi les personnes à livrer multiples, pour chacune des commandes de livraison multiples ; à déterminer un total de temps nécessaire estimé pour une ou plusieurs commandes de livraison parmi les commandes de livraison multiples, en fonction de combinaisons d'attribution de commande de livraison-personne à livrer, dans lesquelles lesdites commandes de livraison dans les commandes de livraison multiples sont attribuées de manière aléatoire auxdites personnes à livrer parmi les personnes à livrer multiples ; à sélectionner une ou plusieurs personnes à livrer afin de gérer les commandes de livraison multiples parmi les personnes à livrer multiples, en fonction d'une combinaison d'attribution de commande de livraison-personne à livrer permettant de minimiser le total du temps nécessaire estimé ; et à transmettre des informations concernant les commandes de livraison multiples auxdits terminaux de personnes à livrer sélectionnées.
PCT/KR2017/011553 2016-10-18 2017-10-18 Système et procédé de distribution de commandes de livraison WO2018074851A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2019520622A JP6629490B2 (ja) 2016-10-18 2017-10-18 デリバリー注文割当システム及び方法

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
KR10-2016-0134934 2016-10-18
KR1020160134934A KR101876713B1 (ko) 2016-10-18 2016-10-18 배달주문 분배시스템 및 방법

Publications (1)

Publication Number Publication Date
WO2018074851A1 true WO2018074851A1 (fr) 2018-04-26

Family

ID=62018796

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2017/011553 WO2018074851A1 (fr) 2016-10-18 2017-10-18 Système et procédé de distribution de commandes de livraison

Country Status (3)

Country Link
JP (1) JP6629490B2 (fr)
KR (1) KR101876713B1 (fr)
WO (1) WO2018074851A1 (fr)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109636198A (zh) * 2018-12-14 2019-04-16 拉扎斯网络科技（上海）有限公司 调度方法、调度装置、计算机可读存储介质和电子设备
CN111311144A (zh) * 2020-01-19 2020-06-19 拉扎斯网络科技（上海）有限公司 数据处理方法、装置、服务器和非易失性存储介质
CN111340363A (zh) * 2020-02-26 2020-06-26 上海东普信息科技有限公司 同城配送订单混合分配方法及装置
CN111612385A (zh) * 2019-02-22 2020-09-01 北京京东尚科信息技术有限公司 一种对待配送物品进行聚类的方法和装置
CN112862319A (zh) * 2021-02-08 2021-05-28 北京顺达同行科技有限公司 订单调度的方法、装置、设备及存储介质
CN113184571A (zh) * 2021-05-24 2021-07-30 中建材（合肥）粉体科技装备有限公司 一种水泥熟料散装下料控制装置的控制方法
WO2022206323A1 (fr) * 2021-03-29 2022-10-06 北京沃东天骏信息技术有限公司 Procédé et appareil de planification, dispositif électronique et support de stockage

Families Citing this family (39)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR102070918B1 (ko) * 2018-12-18 2020-03-03 브이씨엔씨(주) 기사피로도를 고려한 강제배차서버 및 강제배차방법
JP6986529B2 (ja) * 2019-03-25 2021-12-22 本田技研工業株式会社 配達手配システム、及び配達手配方法
KR102308767B1 (ko) * 2019-06-10 2021-10-01 김종완 배달 서비스 제공 장치 및 방법
CN110544062A (zh) * 2019-07-22 2019-12-06 天津五八到家科技有限公司 信息获取方法、装置、设备和存储介质
KR102295006B1 (ko) * 2019-09-04 2021-08-27 주식회사 이유있는사람들 공유주방 설비를 이용한 공유주방 서비스 제공 방법 및 시스템
US20210081904A1 (en) * 2019-09-16 2021-03-18 Coupang Corp. Computer implemented method for automatic assignment and reassignment of flexible delivery work
US10861118B1 (en) * 2019-09-23 2020-12-08 Coupang Corp. Systems and methods for automatic assignment of flexible delivery work
KR102066377B1 (ko) * 2019-09-27 2020-02-17 최영 복수의 배달중개서버와 연동된 배달주문 관리 시스템
JP6971290B2 (ja) * 2019-11-20 2021-11-24 ヤフー株式会社 提供装置、提供方法及び提供プログラム
US10911903B1 (en) * 2020-01-29 2021-02-02 Coupang Corp. Systems and methods for multi-point arrival analysis
US20210256592A1 (en) * 2020-02-19 2021-08-19 Coupang Corp. Systems and methods for intelligent preparation time analysis
KR102252774B1 (ko) * 2020-03-09 2021-05-17 주식회사 우아한형제들 배달 과정을 관리하기 위한 장치, 방법 및 명령을 기록한 기록 매체
KR102557979B1 (ko) * 2020-05-19 2023-08-03 양동욱 Ｏ２ｏ 기반 택배 픽업 서비스 제공 방법
KR20210143054A (ko) * 2020-05-19 2021-11-26 (주)피엘지 배달 지원을 위한 서버 장치 및 그 방법
KR102250745B1 (ko) * 2020-07-03 2021-05-11 쿠팡 주식회사 배달원의 배정을 위한 전자 장치 및 그 동작 방법
KR102563993B1 (ko) * 2020-10-05 2023-08-08 주식회사 부릉 타겟 오더 결정 방법 및 이를 수행하는 서버와 무선 단말
KR20220079276A (ko) 2020-12-04 2022-06-13 이호중 재사용가능한 배달박스를 이용한 배달주문방법 및 시스템
KR102327009B1 (ko) * 2020-12-09 2021-11-16 주식회사 엔터프라이즈블록체인 긱근로자의 잡 스케쥴링 방법 및 장치
KR20220090095A (ko) * 2020-12-22 2022-06-29 주식회사 메쉬코리아 다이렉트 오더의 제공 방법과 이를 수행하는 서버 및 무선 단말
US20220207478A1 (en) * 2020-12-29 2022-06-30 Uber Technologies, Inc. Reinforcement learning model optimizing arrival time for on-demand delivery services
KR102338783B1 (ko) * 2021-02-22 2021-12-14 쿠팡 주식회사 정보 제공 방법 및 장치
KR102315856B1 (ko) * 2021-04-07 2021-10-21 주식회사 커넥트9 음식 배달에 대한 라이더 자동 배차 관리 시스템
KR20220146249A (ko) 2021-04-23 2022-11-01 스피너미디어 주식회사 대신 결제 앱 서버를 이용한 배달 비용 대신 결제를 위한 방법 및 이를 이용한 시스템
US20240185171A1 (en) * 2021-05-31 2024-06-06 Rakuten Group, Inc. Control device, system, and method
KR20230013361A (ko) 2021-07-19 2023-01-26 스피너미디어 주식회사 대신 결제 앱 서버를 이용하여 음식 주문을 위한 지원금 결제 처리 방법 및 이를 이용한 시스템
KR102394988B1 (ko) * 2021-07-30 2022-05-09 쿠팡 주식회사 정보 제공 방법 및 이를 이용한 전자 장치
KR102380643B1 (ko) * 2021-07-30 2022-04-01 쿠팡 주식회사 물품 배송에 관한 시간 정보를 제공하는 방법 및 이를 위한 장치
JP7274545B2 (ja) * 2021-08-30 2023-05-16 楽天グループ株式会社 情報処理装置、システム、及び、方法
WO2023033218A1 (fr) * 2021-08-30 2023-03-09 쿠팡 주식회사 Procédé de fonctionnement pour la fourniture d'informations relatives à un service et dispositif électronique le prenant en charge
KR102371652B1 (ko) * 2021-09-23 2022-03-07 권성택 다중 포스의 연동 및 배달 앱과의 연계를 지원하는 시스템
KR102448463B1 (ko) * 2021-10-26 2022-09-30 쿠팡 주식회사 배송 관련 정보를 처리하는 전자 장치 및 그 방법
KR102403710B1 (ko) * 2021-10-26 2022-05-30 쿠팡 주식회사 배송 주문을 처리하는 전자 장치 및 그 방법
KR102530584B1 (ko) * 2021-10-29 2023-05-10 쿠팡 주식회사 아이템의 배달 정보 제공 방법 및 그 장치
KR102431289B1 (ko) * 2021-12-09 2022-08-11 쿠팡 주식회사 아이템 배달 정보 제공 방법 및 그 장치
KR102484307B1 (ko) * 2022-02-16 2023-01-05 주식회사 코고 역직구 배송 시스템
KR102451607B1 (ko) * 2022-03-02 2022-10-06 쿠팡 주식회사 배달 관련 정보 제공을 위한 전자 장치 및 그 방법
WO2023204356A1 (fr) * 2022-04-21 2023-10-26 쿠팡 주식회사 Procédé et appareil d'attribution d'une commande à un livreur
KR20230164998A (ko) * 2022-05-26 2023-12-05 쿠팡 주식회사 주문을 처리하는 방법 및 그 장치
KR102645487B1 (ko) * 2023-06-15 2024-03-11 쿠팡 주식회사 고객의 배송 주문을 일괄 처리하기 위한 전자 장치 및 그 방법

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20080035906A (ko) * 2006-10-20 2008-04-24 홍석표 위치추적을 이용한 물류배송시스템
KR101371091B1 (ko) * 2013-04-16 2014-03-07 이혜진 음식물 배달 대행 시스템
JP2015122108A (ja) * 2012-05-30 2015-07-02 治 増田 タクシーの最適配置システム
KR101624900B1 (ko) * 2014-12-29 2016-05-30 오석환 배달 예약 방법, 배달 예약을 위한 상품 주문 관리 서버 및 배달 예약 시스템
KR20160098887A (ko) * 2015-02-11 2016-08-19 동국대학교 산학협력단 위치 기반 음식 배달 공유 플랫폼 및 시스템

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4399288B2 (ja) * 2004-02-10 2010-01-13 三菱電機インフォメーションシステムズ株式会社 配達管理システム及び配達管理プログラム
JP2010039961A (ja) * 2008-08-08 2010-02-18 Saroute:Kk 配送業務支援システム、配送予測時間算出方法及びプログラム
KR20160004625A (ko) * 2014-07-03 2016-01-13 신태영 팀플레이를 활용한 지역 통합 배달 서비스 시스템 및 그 방법
KR101641602B1 (ko) * 2015-01-30 2016-07-21 하이플러스카드 주식회사 상품에 대한 결제 방법 및 장치
US20160247113A1 (en) * 2015-02-23 2016-08-25 Flybuy Technologies, Inc. Systems and methods for servicing curb-side deliveries
KR101645157B1 (ko) * 2015-11-10 2016-08-02 주식회사 넥스미디어 통합 음식 제공 서비스 방법 및 장치

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20080035906A (ko) * 2006-10-20 2008-04-24 홍석표 위치추적을 이용한 물류배송시스템
JP2015122108A (ja) * 2012-05-30 2015-07-02 治 増田 タクシーの最適配置システム
KR101371091B1 (ko) * 2013-04-16 2014-03-07 이혜진 음식물 배달 대행 시스템
KR101624900B1 (ko) * 2014-12-29 2016-05-30 오석환 배달 예약 방법, 배달 예약을 위한 상품 주문 관리 서버 및 배달 예약 시스템
KR20160098887A (ko) * 2015-02-11 2016-08-19 동국대학교 산학협력단 위치 기반 음식 배달 공유 플랫폼 및 시스템

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109636198A (zh) * 2018-12-14 2019-04-16 拉扎斯网络科技（上海）有限公司 调度方法、调度装置、计算机可读存储介质和电子设备
CN111612385A (zh) * 2019-02-22 2020-09-01 北京京东尚科信息技术有限公司 一种对待配送物品进行聚类的方法和装置
CN111612385B (zh) * 2019-02-22 2024-04-16 北京京东振世信息技术有限公司 一种对待配送物品进行聚类的方法和装置
CN111311144A (zh) * 2020-01-19 2020-06-19 拉扎斯网络科技（上海）有限公司 数据处理方法、装置、服务器和非易失性存储介质
CN111311144B (zh) * 2020-01-19 2023-09-26 拉扎斯网络科技（上海）有限公司 数据处理方法、装置、服务器和非易失性存储介质
CN111340363A (zh) * 2020-02-26 2020-06-26 上海东普信息科技有限公司 同城配送订单混合分配方法及装置
CN111340363B (zh) * 2020-02-26 2022-06-24 上海东普信息科技有限公司 同城配送订单混合分配方法及装置
CN112862319A (zh) * 2021-02-08 2021-05-28 北京顺达同行科技有限公司 订单调度的方法、装置、设备及存储介质
CN112862319B (zh) * 2021-02-08 2023-10-03 北京顺达同行科技有限公司 订单调度的方法、装置、设备及存储介质
WO2022206323A1 (fr) * 2021-03-29 2022-10-06 北京沃东天骏信息技术有限公司 Procédé et appareil de planification, dispositif électronique et support de stockage
CN113184571A (zh) * 2021-05-24 2021-07-30 中建材（合肥）粉体科技装备有限公司 一种水泥熟料散装下料控制装置的控制方法
CN113184571B (zh) * 2021-05-24 2023-05-02 中建材（合肥）粉体科技装备有限公司 一种水泥熟料散装下料控制装置的控制方法

Also Published As

Publication number Publication date
JP6629490B2 (ja) 2020-01-15
KR101876713B1 (ko) 2018-07-13
KR20180042598A (ko) 2018-04-26
JP2019530935A (ja) 2019-10-24

Similar Documents

Publication Publication Date Title
WO2018074851A1 (fr) Système et procédé de distribution de commandes de livraison
WO2020235785A2 (fr) Système et procédé d'optimisation de trajet
WO2015111950A1 (fr) Procédé d'intermédiation de messages, procédé de traitement de messages, procédé de gestion de service et dispositif de mise en œuvre ceux-ci
WO2016204307A1 (fr) Procédé et serveur pour traiter des informations de livraison et de vérifier la présence au travail
WO2017095041A1 (fr) Procédé de publicité en fonction d'un emplacement et système associé
WO2019039803A1 (fr) Procédé de commande de terminal de communication mobile à fourniture de service de réservation, terminal de communication mobile à fourniture de service de réservation, et système de service de réservation muni de ces derniers
WO2015190822A1 (fr) Dispositif, système et procédé pour un service de livraison de sns
WO2019144585A1 (fr) Procédé, dispositif et équipement de commande de robot virtuel, et support de stockage lisible
WO2016199994A1 (fr) Dispositif et procédé de fourniture de service de livraison préalable d'un produit d'intérêt au moyen d'une boîte de courrier sans opérateur, et support d'enregistrement sur lequel est enregistré un programme informatique
WO2020138826A1 (fr) Système et procédé de mise en correspondance mutuelle de conducteur et de passager dans un service de mobilité
WO2023008636A1 (fr) Procédé de fourniture d'informations et dispositif électronique utilisant ledit procédé
EP2885933A1 (fr) Méthode de gestion de planning, serveur de gestion de planning et terminal mobile utilisant cette méthode
WO2016133355A1 (fr) Dispositif de service de transaction d'articles d'occasion utilisant une application installée sur un terminal portatif, et procédé associé
WO2013081345A1 (fr) Procédé de fourniture d'un service de mise en correspondance de clients et serveur de relais associé
JP2009245221A (ja) 駐車場管理装置
WO2021025387A1 (fr) Procédé de commerce électronique capable de commande intégrée et de distribution intégrée, et serveur associé
WO2015194765A1 (fr) Système de relais d'ordres de livraison et procédé de fourniture associé
WO2019142990A1 (fr) Système permettant de fournir une plateforme d'appariement de cibles commerciales au moyen d'un lien vers une base de données clients
WO2018043859A1 (fr) Dispositif d'analyse automatique de préférence d'article de location au moyen d'une image d'utilisateur et procédé correspondant
WO2018135834A1 (fr) Système et procédé de recherche de billet d'avion au moyen d'un billet d'avion modifié
WO2018043860A1 (fr) Dispositif de recommandation d'article de location au moyen d'un groupe de propension similaire et procédé d'utilisation associé
WO2022225088A1 (fr) Procédé et dispositif pour fournir des informations liées à l'élimination d'un article
WO2022145578A1 (fr) Système et procédé de commande de produit ayant une fonction d'ajout de magasin de commande
WO2023054781A1 (fr) Procédé de fourniture d'informations de mission à un livreur et appareil associé
WO2014035150A1 (fr) Procédé et dispositif d'affichage d'informations

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

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2019520622

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17863038

Country of ref document: EP

Kind code of ref document: A1