WO2024011971A1 - Procédé et appareil de traitement de commandes et support de stockage lisible par ordinateur - Google Patents

Procédé et appareil de traitement de commandes et support de stockage lisible par ordinateur Download PDF

Info

Publication number
WO2024011971A1
WO2024011971A1 PCT/CN2023/086799 CN2023086799W WO2024011971A1 WO 2024011971 A1 WO2024011971 A1 WO 2024011971A1 CN 2023086799 W CN2023086799 W CN 2023086799W WO 2024011971 A1 WO2024011971 A1 WO 2024011971A1
Authority
WO
WIPO (PCT)
Prior art keywords
order
orders
route
path
collection
Prior art date
Application number
PCT/CN2023/086799
Other languages
English (en)
Chinese (zh)
Inventor
李双双
夏春浩
郭策
商春鹏
Original Assignee
北京沃东天骏信息技术有限公司
北京京东世纪贸易有限公司
北京京东乾石科技有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 北京沃东天骏信息技术有限公司, 北京京东世纪贸易有限公司, 北京京东乾石科技有限公司 filed Critical 北京沃东天骏信息技术有限公司
Publication of WO2024011971A1 publication Critical patent/WO2024011971A1/fr

Links

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
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/0601—Electronic shopping [e-shopping]
    • G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
    • G06Q30/0635—Processing of requisition or of purchase orders
    • 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
    • G06Q10/0835—Relationships between shipper or supplier and carriers
    • G06Q10/08355—Routing methods

Definitions

  • the present disclosure relates to the field of data processing, and in particular to an order processing method, device and computer-readable storage medium.
  • the store's contract performance scope includes an area with the store as the center and a certain length (for example, 3 kilometers) as the radius.
  • the store's contract performance scope is divided into multiple road areas according to neighborhoods or streets.
  • the store before issuing a picking task, the store combines the received orders into a collection order based on the same expected delivery time and road area of the user. During production, goods are picked according to the collection order, and during distribution, goods are collected according to the collection order. It is expected that the work efficiency of production and distribution personnel can be improved through the collection order.
  • an order processing method including: performing path planning according to the delivery address of the order in the order pool to generate a path collection order corresponding to the path planning result; and aggregating the order according to the path , generate one or more picking set orders.
  • performing path planning based on the shipping address of the order in the order pool to generate a path set order corresponding to the path planning result includes: under the preset first constraint, based on the shipping address of the order in the order pool Perform path planning to generate a path collection order corresponding to the path planning result; where the first constraint includes the maximum order quantity, earliest delivery time, dispersion of delivery addresses, and number of inventory units of the orders involved in the path collection order At least one of the upper limit, whether the delivery address spans regions, the upper weight limit, the upper limit of the distance of the order, the delivery sequence, the time window of expected delivery, or whether it spans production waves.
  • performing path planning based on the delivery address of the order in the order pool to generate a path set order corresponding to the path planning result includes: using a first algorithm to perform path planning on the delivery address of the order in the order pool to generate The path set order corresponding to the path planning result; wherein, the first algorithm includes: randomly selecting from the order pool
  • the machine selects an order and inserts it into the path collection order, including: in the case of an existing path collection order, if a matching position can be found in the existing path collection order using the matching strategy, the randomly selected order is inserted into the matching position; And, if a matching position cannot be found in the existing route set order, or there is currently no route set order, the randomly selected order will be inserted into the new route set order; wherein, the above process is repeated to randomly select one from the order pool. Orders are inserted into the path collection order step until there are no orders in the order pool.
  • performing path planning based on the delivery address of the order in the order pool to generate a path set order corresponding to the path planning result includes: using a second algorithm to perform path planning on the delivery address of the order in the order pool to generate The path set order corresponding to the path planning result; wherein, the second algorithm includes: dividing the orders in the order pool into seed orders and non-seed orders according to the classification rules; repeated execution: randomly selecting a seed order from multiple seed orders as the basic order , and use the matching strategy to select seed orders and non-seed orders that can be placed in the same path set order with the basic order to generate a path set order until multiple seed orders are processed.
  • the order processing method further includes: when the route set order satisfies the second constraint, issuing the route set order at the issuance time of the route set order; or when the route set order does not satisfy the second constraint. If the conditions are met and the issuance time of the route set order is reached, the route set order is issued; where the issuance time of the route set order is determined based on the earliest issuance time of the orders in the route set order.
  • route planning is performed based on the delivery addresses of orders in the order pool at a preset cycle.
  • the orders in the route set order participate in the route planning of the next cycle.
  • the second constraint includes at least one of the following: the earliest production time of the route collection order is greater than the sum of the current time and preset parameters, where the earliest production time is the production time of each order in the route collection order the earliest time in the route collection order; the total number of orders in the route collection order is not within the preset range; or in the route collection order, the delivery time of the target category order is greater than the delivery time of the non-target category order.
  • the order processing method further includes: for orders in the order pool that have not been added to the route set orders, when the order issuance time is currently reached, issue the order.
  • the order processing method further includes: determining a time to add the generated order to the order pool based on the expected delivery time of the generated order.
  • the order processing method further includes: in the case where a picking collection order is generated according to the route collection order, allocating all orders in the picked collection order to the same distribution unit for delivery; or, When multiple picking set orders are generated based on route set orders, multiple picking sets are processed. Orders in the picking set order in normal outbound status are assigned to the same delivery unit for delivery.
  • an order processing device including: a route set order generation module configured to perform route planning based on the delivery address of the order in the order pool to generate a route planning result corresponding to The path collection order; the picking collection order generation module is configured to generate one or more picking collection orders based on the path collection order.
  • an order processing device including: a memory; and a processor coupled to the memory, the processor being configured to execute any of the foregoing based on instructions stored in the memory. How to process orders.
  • an order processing system including: any of the foregoing order processing devices; and an order pool, where the order pool is configured in a database.
  • the order processing system further includes: a production subsystem configured to generate a sorting task according to the sorting collection order, and send the sorting task to the terminal device.
  • a computer-readable storage medium on which a computer program is stored, wherein when the program is executed by a processor, any one of the foregoing order processing methods is implemented.
  • Figure 1 shows a schematic flowchart of an order processing method according to some embodiments of the present disclosure.
  • FIGS. 2A and 2B are schematic diagrams of path collection orders according to some embodiments of the present disclosure.
  • 3A and 3B are schematic diagrams of path set orders according to other embodiments of the present disclosure.
  • Figure 4 shows a schematic flowchart of a method for issuing a route collection order according to some embodiments of the present disclosure.
  • Figure 5 shows a schematic structural diagram of an order processing device according to some embodiments of the present disclosure.
  • Figure 6 shows a schematic structural diagram of an order processing system according to some embodiments of the present disclosure.
  • Figure 7 shows a schematic structural diagram of an order processing device according to other embodiments of the present disclosure.
  • FIG. 8 shows a schematic structural diagram of an order processing device according to further embodiments of the present disclosure.
  • any specific values are to be construed as illustrative only and not as limiting. Accordingly, other examples of the exemplary embodiments may have different values.
  • the inventor found that the orders participating in the order collection were all orders in the same time period, and the production time and delivery time were relatively concentrated, which could easily lead to the failure of the store's production and delivery to fulfill the contract. Moreover, the number of orders collected by the system cannot meet the order quantity requirements of delivery personnel for a single delivery. Delivery personnel need to manually wait for the orders to be consolidated, and then plan the delivery sequence according to the address, which affects delivery efficiency and user experience. Once a large number of orders are backlogged, a large amount of data will accumulate in the order, sorting, and outbound data systems, causing excessive pressure on the system and resulting in problems such as untimely response.
  • a technical problem to be solved by the embodiments of the present disclosure is: how to process orders to improve the operating efficiency and distribution efficiency of the data system.
  • Figure 1 shows a schematic flowchart of an order processing method according to some embodiments of the present disclosure. As shown in Figure 1, the order processing method in this embodiment includes steps S102 to S106.
  • step S102 obtain the orders in the order pool.
  • the order pool is implemented in the form of a database or data table. That is, orders added to the order pool are stored in a preset database or data table. In addition, you can also check the order corresponding to the order added to the order pool. The data entry adds the preset order pool ID. When an order is removed from the order pool, such as when the order is canceled or a production task has been released, the order will be deleted from the preset database or data table, or the preset order pool ID will be modified. If necessary, those skilled in the art can also implement it in other ways, which will not be described again here.
  • the time to add the generated order to the order pool is determined based on the expected delivery time of the generated order. For example, if the expected delivery time of order 1 is a certain time period of the day, it will be added to the order pool after the order is generated; if the expected delivery time of order 2 is a certain time of the next day, it will be added at 0:00 the next day. to the order pool. Thus, the generated route order set has higher availability.
  • orders are obtained from an order pool at a preset period. That is, the process of automatic order collection is triggered periodically.
  • step S104 route planning is performed based on the delivery address of the order in the order pool to generate a route set order corresponding to the route planning result.
  • the route collection order includes part or all of the information of the original order in the order pool, such as the consignee, delivery address, list of goods to be delivered, expected delivery time,
  • the orders participating in path planning in the order pool are for the same store, and the starting point and end point of the planned path are the same, that is, the delivery unit (such as a rider, a courier vehicle, etc.) starts from one store and travels to multiple locations. A user returns to the store after delivery. This enables single-point to multi-point distribution.
  • route planning is performed based on the delivery address of the order in the order pool to generate a route set order corresponding to the route planning result.
  • the first constraint can be set by the store or set by the system by default.
  • the first constraint includes the maximum order quantity of the orders involved in the route collection order, the earliest delivery time, the degree of dispersion of the delivery address, the upper limit of the number of SKUs (stock keeping units), and whether the delivery address crosses regions. , weight limit, order distance limit, delivery sequence, expected delivery time window or whether it spans at least one of production waves. Therefore, the result of decision-making path planning, that is, the result of order collection, can be determined from multiple dimensions such as global optimality, delivery capabilities of delivery personnel, and relief of pressure during peak hours.
  • the degree of dispersion of delivery addresses can be measured by the angle between different delivery addresses and shipping addresses (such as store addresses). The larger the angle is, the more dispersed the delivery users are; the smaller the angle is, the more concentrated the users are.
  • the delivery scope of the store can be divided into multiple road areas according to residential areas, streets, etc. Whether the delivery address spans zones refers to whether multiple delivery addresses involved in the same route belong to the same road zone.
  • the delivery sequence is determined, for example, by the sequence of expected delivery time windows in the user's order. For example, if user A's expected delivery time is 10:00-10:30, user B's expected delivery time is 10:15-10:45, and user C's expected delivery time is 10:30-11:00, then the priority is User A, User B, and User C are delivered in sequence, which not only conforms to the chronological order, but also makes the delivery more coherent.
  • VRP Vehicle Routing Problem
  • step S106 one or more picking collection orders are generated according to the route collection order. Without splitting the route set order, one picking set order is generated; without splitting the route set order, multiple picking set orders are generated.
  • a data entry corresponding to the picking set order is generated, which includes information about the route set order, or is associated with a data entry corresponding to the route set order.
  • a picking set order includes one or more orders, and each picking set order corresponds to a picking task.
  • a picking task can be completed by one picking unit (such as a picker, an automatic picking machine), or by multiple picking units. After the picking task is generated based on the picking set order, the picking task information can be sent to the terminal corresponding to the picking unit.
  • Whether to split the route collection order into multiple picking collection orders can be determined based on the store's configuration.
  • a picking set order when a picking set order is generated, that is, the route set order is not split, the store adopts a scenario of zone picking and sorting while picking.
  • a route set order corresponds to a picking set order, and picking units in multiple partitions pick at the same time. Then, the goods are shipped out of the warehouse according to the picking collection order, and the goods shipped out of the warehouse are assigned to the same distribution unit for distribution.
  • the store when multiple picking collection orders are generated, that is, route collection orders are split, the store can adopt an integrated production mode of sorting and packaging. Since the delivery time of different orders may vary, the orders that have been delivered can be batch calculated and allocated to distribution units in real time. If after splitting, some orders have outbound exceptions, only the orders in the picking collection orders that are in normal outbound status will be assigned to the same distribution unit for delivery.
  • the above embodiment uses the delivery address in the order to perform path planning, and aggregates the orders through the path planning results to generate a path collection order, so that subsequent sorting and delivery operations can be performed based on the path collection order.
  • orders can be automatically collected, so that orders can be processed in a more timely manner as a whole, improving the operating efficiency and distribution efficiency of the data system.
  • the first algorithm is used to perform path planning on the delivery address of the order in the order pool to generate a path set order corresponding to the path planning result.
  • the first algorithm includes: randomly selecting an order from the order pool; in the case of existing path collection orders, if the matching strategy can be used to find a matching position in the existing path collection orders, then insert the randomly selected order into the matching position; If a matching position cannot be found in the existing route collection order, or there is currently no route collection order, a randomly selected order will be inserted into the new route collection order; an order will be randomly selected from the order pool repeatedly until there is no order in the order pool. Until order.
  • the order pool includes 3 orders, and the corresponding order numbers are ⁇ 11, 24, 33 ⁇ .
  • Collection Order One 1-3-14-26
  • Collection Order Two 5-2-7.
  • a second algorithm is used to perform path planning on the delivery address of the order in the order pool to generate a path set order corresponding to the path planning result.
  • the second algorithm includes: dividing orders in the order pool into seed orders and non-seed orders according to classification rules; randomly selecting a seed order from multiple seed orders as a base order; using a matching strategy to select a seed order that can be placed on the same path as the base order Collect the seed orders and non-seed orders in the order to generate the path collection order; repeatedly randomly select a seed order from multiple seed orders as the base order until multiple seed orders are processed.
  • a first optimization process is also performed on the multiple route set orders to obtain optimized set orders.
  • the first optimization process includes: first randomly selecting a predetermined number of path collection orders as the first collection orders to be processed, and then moving at least one order into the order pool in each first collection order to be processed, and then using the above The first algorithm processes all orders in the order pool.
  • the set order is selected.
  • the set order 21 includes 5 orders
  • the set order 22 includes 2 orders
  • the set order 23 includes 3 orders.
  • the orders included in the collective orders 21 and 22 are reorganized.
  • the set order 21 includes 4 orders
  • the set order 22 includes 3 orders
  • the set order 23 remains unchanged.
  • a second optimization process can also be performed on multiple route set orders, so that the route set orders can be randomly optimized.
  • the second optimization process includes: generating random numbers at a preset frequency, and if the random numbers are greater than the preset disturbance value, checking whether there is an independent seed order, where an independent seed order is a seed order that does not form a path set order with other orders.
  • the independent seed order is moved into the order pool, and a predetermined number of path collection orders that meet the preset conditions are randomly selected as the second pending collection order.
  • the preset conditions include: the total number of orders in the second pending collection order is less than the preset quantity threshold. That is, the collection order with a smaller order quantity is selected as the second pending collection order.
  • the collective order 31 includes 5 orders
  • the collective order 32 includes 2 orders
  • the collective order 33 includes 3 orders.
  • the seed order 30 forms a collective order 33 with an order originally included in the collective order 31 and an order originally included in the collective order 32 .
  • the overall order collection rate can be effectively improved.
  • Figure 4 shows a schematic flowchart of a method for issuing a route collection order according to some embodiments of the present disclosure. As shown in Figure 4, the route collection order issuing method in this embodiment includes steps S402 to S410.
  • step S402 it is determined whether the route set order satisfies the second constraint condition. If satisfied, execute step S404; if not satisfied, execute step S406.
  • the second constraint includes at least one of the following: the earliest production time of the route set order is greater than the sum of the current time and the preset parameters, where the earliest production time is the production time of each order in the route set order.
  • the earliest time, the production time is determined based on the user's expected delivery time, for example; the total number of orders in the route set order is not within the preset range; or, in the route set order, the delivery time of the target category order is greater than the non-target category order delivery time, for example, catering orders need priority delivery.
  • step S404 the path collection order is issued at the issuance time of the path collection order.
  • the issuance time of the route set order is determined based on the earliest issuance time of the orders in the route set order. Release refers to initiating the production process of an order.
  • the reserved time is, for example, 2 minutes.
  • step S406 it is determined whether the issuance time of the route collection order is currently reached. If yes, execute step S408; if not, execute step S410.
  • step S408 a route collection order is issued.
  • route collection orders are sent to the production system to generate pick collection orders.
  • step S410 the orders in the route set orders participate in the route planning of the next cycle. Thus, a better result is obtained.
  • the order is issued when the order's issuance time is currently reached.
  • the delivery time of such an order max [(start delivery time - delivery lead time - production time - transit time), current system time + processing time].
  • Figure 5 shows a schematic structural diagram of an order processing device according to some embodiments of the present disclosure.
  • the order processing device 500 of this embodiment includes: a route collection order generation module 5100, which is configured to perform route planning based on the delivery address of the order in the order pool to generate a route collection order corresponding to the route planning result. ;
  • the picking set order generation module 5200 is configured to assemble orders according to the path and generate one or more picking set orders. one.
  • the route collection order generation module 5100 is further configured to perform route planning according to the delivery address of the order in the order pool under the preset first constraint condition to generate a route collection order corresponding to the route planning result;
  • the first constraint includes the maximum order quantity of the orders involved in the route collection order, the earliest delivery time, the degree of dispersion of the delivery address, the upper limit of the number of inventory units, whether the delivery address crosses the area, the upper limit of weight, and the distance of the order. At least one of the upper limit, delivery sequence, desired delivery time window, or whether it spans production waves.
  • the route set order generation module 5100 is further configured to use a first algorithm to perform route planning on the delivery address of the order in the order pool to generate a route set order corresponding to the route planning result; wherein the first algorithm includes : Randomly select an order from the order pool and insert it into the route set order, including: in the case of an existing route set order, if a matching position can be found in the existing route set order using the matching strategy, the randomly selected order will be The order is inserted into the matching position; and, if the matching position cannot be found in the existing path collection order, or there is currently no path collection order, the randomly selected order is inserted into the new path collection order; wherein, repeating the above process from the order An order is randomly selected from the pool and inserted into the path collection order step until there is no order in the order pool.
  • the first algorithm includes : Randomly select an order from the order pool and insert it into the route set order, including: in the case of an existing route set order, if a matching position can be found in the existing route set order using the
  • the route set order generation module 5100 is further configured to use a second algorithm to perform route planning on the delivery address of the order in the order pool to generate a route set order corresponding to the route planning result; wherein the second algorithm includes : According to the classification rules, the orders in the order pool are divided into seed orders and non-seed orders; repeated execution: randomly select a seed order from multiple seed orders as the base order, and use the matching strategy to select a seed order that can be placed in the same place as the base order. Seed orders and non-seed orders in route set orders to generate route set orders until multiple seed orders are processed.
  • the order processing device 500 further includes a issuing module 5300, configured to issue the route set order at the issuing time of the route set order if the route set order satisfies the second constraint; or in If the route set order does not satisfy the second constraint and the issuance time of the route set order is currently reached, the route set order is issued; where, the issuance time of the route set order is based on the earliest issuance of the order in the route set order. Time determined.
  • a issuing module 5300 configured to issue the route set order at the issuing time of the route set order if the route set order satisfies the second constraint; or in If the route set order does not satisfy the second constraint and the issuance time of the route set order is currently reached, the route set order is issued; where, the issuance time of the route set order is based on the earliest issuance of the order in the route set order. Time determined.
  • the route collection order generation module 5100 is further configured to perform route planning based on the delivery addresses of the orders in the order pool at a preset cycle.
  • the issuance module 5300 is further configured to issue orders in the path collection order if the path collection order does not satisfy the second constraint and the issuance time of the path collection order has not yet arrived. Participate in path planning for the next cycle.
  • the second constraint includes at least one of the following: the earliest production time of the route collection order is greater than the sum of the current time and preset parameters, where the earliest production time is the production time of each order in the route collection order the earliest time in the route collection order; the total number of orders in the route collection order is not within the preset range; or in the route collection order, the delivery time of the target category order is greater than the delivery time of the non-target category order.
  • the issuing module 5300 is further configured to issue orders for orders in the order pool that are not added to the route set orders when the issuing time of the order currently arrives.
  • the order processing device 500 further includes an order pool generation module 5400, configured to determine the time to add the generated order to the order pool according to the expected delivery time of the generated order.
  • the order processing device 500 further includes: a delivery allocation module 5500, configured to allocate all orders in the picked collection order to the same order when a picking collection order is generated according to the route collection order.
  • a delivery allocation module 5500 configured to allocate all orders in the picked collection order to the same order when a picking collection order is generated according to the route collection order.
  • One distribution unit performs distribution; or, when multiple picking collection orders are generated based on route collection orders, the orders in the picking collection orders in the multiple picking collections that are in normal outbound status are assigned to the same distribution unit for delivery.
  • Figure 6 shows a schematic structural diagram of an order processing system according to some embodiments of the present disclosure.
  • the processing system 60 of this embodiment includes an order processing device 610 and an order pool 620 .
  • the order processing device 610 For the specific implementation of the order processing device 610, reference can be made to the order processing device 500, which will not be described again here.
  • the order pool 620 is configured in the database.
  • the processing system 60 further includes a production subsystem 630 configured to generate picking tasks according to the picking collection orders and send the picking tasks to the terminal equipment.
  • the delivery allocation module in the order processing device described above can also be deployed in the production subsystem.
  • Figure 7 shows a schematic structural diagram of an order processing device according to other embodiments of the present disclosure.
  • the order processing device 70 of this embodiment includes: a memory 710 and a processor 720 coupled to the memory 710.
  • the processor 720 is configured to execute any of the foregoing based on instructions stored in the memory 710. Order processing method in the embodiment.
  • the memory 710 may include, for example, system memory, fixed non-volatile storage media, etc.
  • System memory stores, for example, operating systems, applications, boot loaders, and other programs.
  • FIG. 8 shows a schematic structural diagram of an order processing device according to further embodiments of the present disclosure.
  • the order processing device 80 in this embodiment includes: a memory 810 and a processor 820, and may also include an input and output interface 830, a network interface 840, a storage interface 8500, etc.
  • These interfaces 830, 840, 8500, the memory 810 and the processor 820 may be connected through a bus 860, for example.
  • the input and output interface 830 provides a connection interface for input and output devices such as a monitor, mouse, keyboard, and touch screen.
  • Network interface 840 provides a connection interface for various networked devices.
  • the storage interface 8500 provides a connection interface for external storage devices such as SD cards and USB flash drives.
  • Embodiments of the present disclosure also provide a computer-readable storage medium on which a computer program is stored, which is characterized in that when the program is executed by a processor, any one of the aforementioned order processing methods is implemented.
  • embodiments of the present disclosure may be provided as methods, systems, or computer program products. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment that combines software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable non-transitory storage media (including, but not limited to, disk memory, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein. .
  • These computer program instructions may also be stored in a computer-readable memory that causes a computer or other programmable data processing apparatus to operate in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including the instruction means, the instructions
  • the device implements the functions specified in a process or processes of the flowchart and/or a block or blocks of the block diagram.
  • These computer program instructions may also be loaded onto a computer or other programmable data processing device, causing a series of operating steps to be performed on the computer or other programmable device to produce computer-implemented processing, thereby executing on the computer or other programmable device.
  • Instructions provide steps for implementing the functions specified in a process or processes of a flowchart diagram and/or a block or blocks of a block diagram.

Landscapes

  • Business, Economics & Management (AREA)
  • Economics (AREA)
  • Engineering & Computer Science (AREA)
  • General Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Marketing (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • Finance (AREA)
  • General Physics & Mathematics (AREA)
  • Development Economics (AREA)
  • Theoretical Computer Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Human Resources & Organizations (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

La présente divulgation relève du domaine du traitement de données. Sont divulgués un procédé et un appareil de traitement de commandes, ainsi qu'un support de stockage lisible par ordinateur. Le procédé de traitement de commandes comprend les étapes consistant à : effectuer une planification de trajet en fonction des adresses de réception des commandes dans un groupe de commandes de façon à générer des commandes d'agrégation de trajet correspondant à un résultat de planification de trajet ; et générer une ou plusieurs commandes d'agrégation de prélèvement de marchandises en fonction des commandes d'agrégation de trajet. Les modes de réalisation de la présente divulgation proposent une solution logistique intelligente. Une planification de trajet est effectuée en utilisant les adresses de réception dans les commandes. Les commandes sont agrégées au moyen d'un résultat de planification de trajet de façon à générer des commandes d'agrégation de trajet de telle sorte que des opérations de tri et de distribution ultérieures sont effectuées en fonction des commandes d'agrégation de trajet.
PCT/CN2023/086799 2022-07-11 2023-04-07 Procédé et appareil de traitement de commandes et support de stockage lisible par ordinateur WO2024011971A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210808960.5A CN115147185A (zh) 2022-07-11 2022-07-11 订单的处理方法、装置和计算机可读存储介质
CN202210808960.5 2022-07-11

Publications (1)

Publication Number Publication Date
WO2024011971A1 true WO2024011971A1 (fr) 2024-01-18

Family

ID=83411841

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/086799 WO2024011971A1 (fr) 2022-07-11 2023-04-07 Procédé et appareil de traitement de commandes et support de stockage lisible par ordinateur

Country Status (2)

Country Link
CN (1) CN115147185A (fr)
WO (1) WO2024011971A1 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115147185A (zh) * 2022-07-11 2022-10-04 北京沃东天骏信息技术有限公司 订单的处理方法、装置和计算机可读存储介质
CN116402430B (zh) * 2023-06-07 2023-09-19 成都运荔枝科技有限公司 一种基于冷链物流场景的干线订单匹配方法

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2827289A1 (fr) * 2013-07-17 2015-01-21 General Transports GmbH Procédé de retrait et de livraison de produits ou de réalisation de prestations de service au moyen de planification dynamique de routes et redistribution de marchandises
CN110390409A (zh) * 2018-04-17 2019-10-29 北京京东尚科信息技术有限公司 配送方案的确定方法、装置以及计算机可读存储介质
CN110956384A (zh) * 2019-11-26 2020-04-03 拉扎斯网络科技（上海）有限公司 配送任务的处理方法、装置、电子设备及可读存储介质
CN111080207A (zh) * 2019-12-26 2020-04-28 北京每日优鲜电子商务有限公司 订单处理方法、装置、设备及存储介质
CN113393020A (zh) * 2021-05-31 2021-09-14 上海东普信息科技有限公司 物流智能调度方法、装置、设备及存储介质
CN113420928A (zh) * 2021-06-30 2021-09-21 上海东普信息科技有限公司 订单调度方法、装置、设备及存储介质
CN115049342A (zh) * 2022-07-11 2022-09-13 北京沃东天骏信息技术有限公司 货物的出库控制方法、装置和计算机可读存储介质
CN115147185A (zh) * 2022-07-11 2022-10-04 北京沃东天骏信息技术有限公司 订单的处理方法、装置和计算机可读存储介质

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2827289A1 (fr) * 2013-07-17 2015-01-21 General Transports GmbH Procédé de retrait et de livraison de produits ou de réalisation de prestations de service au moyen de planification dynamique de routes et redistribution de marchandises
CN110390409A (zh) * 2018-04-17 2019-10-29 北京京东尚科信息技术有限公司 配送方案的确定方法、装置以及计算机可读存储介质
CN110956384A (zh) * 2019-11-26 2020-04-03 拉扎斯网络科技（上海）有限公司 配送任务的处理方法、装置、电子设备及可读存储介质
CN111080207A (zh) * 2019-12-26 2020-04-28 北京每日优鲜电子商务有限公司 订单处理方法、装置、设备及存储介质
CN113393020A (zh) * 2021-05-31 2021-09-14 上海东普信息科技有限公司 物流智能调度方法、装置、设备及存储介质
CN113420928A (zh) * 2021-06-30 2021-09-21 上海东普信息科技有限公司 订单调度方法、装置、设备及存储介质
CN115049342A (zh) * 2022-07-11 2022-09-13 北京沃东天骏信息技术有限公司 货物的出库控制方法、装置和计算机可读存储介质
CN115147185A (zh) * 2022-07-11 2022-10-04 北京沃东天骏信息技术有限公司 订单的处理方法、装置和计算机可读存储介质

Also Published As

Publication number Publication date
CN115147185A (zh) 2022-10-04

Similar Documents

Publication Publication Date Title
WO2024011971A1 (fr) Procédé et appareil de traitement de commandes et support de stockage lisible par ordinateur
JP7046090B2 (ja) 出庫方法及び装置
CN107103446B (zh) 库存调度方法以及装置
CN109978423A (zh) 库存调度方法、装置以及计算机可读存储介质
CN110322172B (zh) 库存调度方法、装置以及计算机可读存储介质
CN109772714B (zh) 货物拣选方法及装置、存储介质、电子设备
US7890389B2 (en) Methods and systems for grouping and managing stock requests
CN109902975B (zh) 调度方法、系统、装置以及计算机可读存储介质
JP6974558B1 (ja) 物流情報を管理する電子装置およびその制御方法
CN110210802A (zh) 一种快速越库的管理方法及其系统
CN111260270A (zh) 提升门店订单处理效率的方法和装置
CN111507651A (zh) 应用于人机混合仓库的订单数据处理方法和装置
CN109784791A (zh) 订单分配方法和装置
CN112700180A (zh) 一种拣货方法和拣货装置
CN115049342A (zh) 货物的出库控制方法、装置和计算机可读存储介质
CN111985862A (zh) 定位库存物品的方法和装置
CN112396322A (zh) 一种基于生产计划的制程工艺单产能评估方法及系统
US11681983B2 (en) Systems and methods for prioritizing pick jobs while optimizing efficiency
CN110414879A (zh) 分区处理订单的方法、装置和计算机可读存储介质
CN111703802B (zh) 出入库流程的控制方法和装置、仓储系统
CN113159467A (zh) 一种派车单处理方法和装置
Raggl et al. Solution approaches for the dynamic stacking problem
CN111260271A (zh) 用于缩短门店订单拣货时长的方法和装置
US20220405697A1 (en) Systems And Methods For Dynamic Management Of Consolidation Orders
CN110826752A (zh) 集合单分配方法和装置

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

Country of ref document: EP

Kind code of ref document: A1