CN117314026A - Shipment task distribution method and system and related products - Google Patents

Shipment task distribution method and system and related products Download PDF

Info

Publication number
CN117314026A
CN117314026A CN202210681481.1A CN202210681481A CN117314026A CN 117314026 A CN117314026 A CN 117314026A CN 202210681481 A CN202210681481 A CN 202210681481A CN 117314026 A CN117314026 A CN 117314026A
Authority
CN
China
Prior art keywords
shipment
scheme
container
demand
time
Prior art date
Legal status (The legal status 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 status listed.)
Pending
Application number
CN202210681481.1A
Other languages
Chinese (zh)
Inventor
胡显琦
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai Yogo Robot Co Ltd
Original Assignee
Shanghai Yogo Robot Co Ltd
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 Shanghai Yogo Robot Co Ltd filed Critical Shanghai Yogo Robot Co Ltd
Priority to CN202210681481.1A priority Critical patent/CN117314026A/en
Publication of CN117314026A publication Critical patent/CN117314026A/en
Pending legal-status Critical Current

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
    • 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/06315—Needs-based resource requirements planning or 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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
    • G06Q10/0875—Itemisation or classification of parts, supplies or services, e.g. bill of materials

Landscapes

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

Abstract

The embodiment of the application discloses a shipment task distribution method, a shipment task distribution system and related products, wherein the method comprises the following steps: the method comprises the steps of obtaining real-time demand amounts to be distributed corresponding to objects to be distributed, generating shipment schemes of each container for all objects to be distributed, judging whether the shipment scheme of the current container can be used as a feasible scheme according to the shipment amounts in the shipment schemes, and equivalently judging whether participation of the current container can meet all the demand amounts of all the objects to be distributed, and selecting a feasible scheme set from a plurality of feasible scheme sets as a target shipment scheme set. Therefore, the embodiment of the application can efficiently and clearly determine which containers participate in shipment through the specific detachable order requirements, and further improve the cargo distribution efficiency and the user experience.

Description

Shipment task distribution method and system and related products
Technical Field
The embodiment of the application relates to the technical field of Internet, in particular to a shipment task distribution method, a shipment task distribution system and related products.
Background
In an unmanned retail scene, a user performs commodity purchase and ordering through equipment such as a mobile phone or a computer, the robot goes to a retail cabinet (container) to take the commodity, and then the commodity is distributed to the ordering user, so that the user does not need to go to the retail cabinet in person, and the time of the user is saved, and the daily transaction process of the user is prevented from being interrupted.
To meet the needs of various living things, there may be multiple retail cabinets distributed at different locations in the same campus or even building to be equipped with different goods; in this case, when an order involves a plurality of retail cabinets, it is difficult for the robot to determine which retail cabinets to go to and to complete what pick-up tasks, such as which cabinet to pick up a certain brand of goods, respectively, which is equivalent to knowing how many goods each cabinet designates. In view of this, an effective solution needs to be provided to solve the aforementioned problems.
Disclosure of Invention
The embodiment of the application provides a shipment task distribution method, a shipment task distribution system and related products, which are used for defining shipment schemes of different containers on ordered commodities.
An embodiment of the present application provides a shipment task allocation method, including:
acquiring real-time to-be-distributed demand corresponding to the to-be-distributed objects, wherein the initial value of the real-time to-be-distributed demand is all the total demand of all the to-be-distributed objects in the goods order;
generating a delivery scheme of each container to all the objects to be distributed according to the stock quantity of each object to be distributed in each container and the corresponding real-time demand quantity to be distributed;
judging whether the shipment volume of the current container shipment scheme reaches the real-time to-be-allocated demand volume or not;
If so, determining the current container shipment scheme as a feasible scheme of the current group of feasible scheme sets;
if the current container shipment scheme is not achieved, updating the real-time to-be-allocated demand according to the shipment amount of the current container shipment scheme, and returning to execute to generate the shipment scheme of each container to all to-be-allocated objects according to the updated real-time to-be-allocated demand and the respective stock amounts of other non-participating containers except the current container so as to obtain a current group of feasible scheme sets generated by a plurality of containers including the current container for jointly achieving the total demand;
a set of viable solution sets is selected from the plurality of viable solution sets as a target shipment solution set.
A second aspect of an embodiment of the present application provides a shipment task distribution system, comprising:
the system comprises an acquisition unit, a storage unit and a storage unit, wherein the acquisition unit is used for acquiring real-time to-be-allocated demand corresponding to-be-allocated objects, and the initial value of the real-time to-be-allocated demand is the total demand of all to-be-allocated objects in a goods order;
the processing unit is used for generating a delivery scheme of each container to all the objects to be distributed according to the stock quantity of each object to be distributed in each container and the corresponding real-time demand quantity to be distributed;
the processing unit is further used for judging whether the shipment volume of the current container shipment scheme reaches the real-time to-be-allocated demand volume;
The processing unit is further used for determining the current container shipment scheme as a feasible scheme of the current group of feasible scheme set if the shipment amount of the current container shipment scheme reaches the real-time to-be-allocated demand amount;
the processing unit is further configured to update the real-time demand to be allocated according to the shipment volume of the current container shipment plan if the shipment volume of the current container shipment plan does not reach the real-time demand to be allocated, and execute the shipment plan of each container for all the objects to be allocated in a return mode according to the updated real-time demand to be allocated and the respective stock volumes of other non-participating containers except the current container, so as to obtain a current set of feasible plan sets generated by a plurality of containers including the current container for jointly reaching all the demands;
the processing unit is further configured to select a set of viable solutions from the plurality of sets of viable solutions as a target shipment solution set.
Optionally, the shipment scheme of the container comprises shipment amounts of all objects to be distributed and shipment parcel amounts to be correspondingly used; the processing unit is specifically configured to:
determining that the objects to be distributed, which are stored in the current container and have real-time requirements for the distribution of which the real-time requirements are greater than zero, are target cargoes;
Traversing a receiving package for storing the same goods from the current container;
calculating the delivery q of the current container to each target cargo, wherein the delivery q=q 0 -q' wherein the initial cargo quantity q 0 Min (real-time demand for target cargo to be dispensed, stock of target cargo by current container),
if the shipment q is greater than zero and a residual package exists, putting the q target cargos distributed by the current container into the residual package, wherein the residual package is a residual package meeting the condition that the q multiplied by the unit volume of the article and the used volume of the package are less than or equal to the empty package volume;
if the shipment q is greater than zero and no remaining package exists, then addingAnd the packages are used for storing the q target cargoes.
Optionally, the processing unit is specifically configured to:
taking other objects to be distributed which are in stock except the target objects and have non-zero real-time demand to be distributed as the next target objects of the current container, and determining the delivery quantity of the current container to the next target objects so as to obtain the delivery scheme of the current container to all the objects to be distributed.
Optionally, if the shipment volume of the current container shipment scenario reaches the real-time demand volume to be allocated, the processing unit is further configured to:
Adding the current container shipment scheme into a feasible distribution list for storage;
updating the parcel volume threshold by comparing the parcel volume to be used in the current container shipment scheme with the parcel volume threshold, wherein the initial value of the parcel volume threshold is zero;
and eliminating the existing shipment scheme that the required parcel volume is greater than or equal to the updated parcel volume threshold.
Optionally, each of the existing shipment schemes is stored in a potential distribution list and corresponding real-time demand to be distributed, wherein when the potential distribution list is in an initial state, the processing unit is further configured to:
judging whether the potential allocation list is empty or not;
if the set is empty, selecting a set of feasible schemes from the plurality of sets of feasible schemes as a target shipment scheme set;
if not, screening the non-participating containers of the existing shipment scheme with the least required package quantity in the potential allocation list as containers to be processed, and returning to execute the shipment scheme for generating each container to all the objects to be allocated, wherein the screened existing shipment scheme is not reserved in the potential allocation list.
Optionally, the target shipment scenario set is an optimal feasible scenario set, and the processing unit is specifically configured to:
calculating container participation amounts respectively corresponding to each feasible scheme set;
and determining the feasible scheme set with the least container participation as the optimal feasible scheme set.
Optionally, the target shipment scenario set is an optimal feasible scenario set, and the processing unit is specifically configured to:
calculating the docking time between the goods taking object at the current position and the containers participated in the set of feasible schemes, wherein the docking time comprises the time consumption of the journey and the time consumption of goods collection and release; and determining the set of feasible scheme sets with the least docking time length as the optimal feasible scheme set.
The delivery task allocation method described in the first aspect of the present application may be implemented in a specific manner by using the content described in the second aspect of the present application to implement allocation of delivery tasks.
As an example, the target shipment scenario set employs an optimal viable scenario set, which is determined by any of the following means.
One of the determining modes of the optimal feasible scheme set comprises the following steps:
calculating container participation amounts respectively corresponding to each feasible scheme set;
and determining the feasible scheme set with the least container participation as the optimal feasible scheme set.
And the second determining mode of the optimal feasible scheme set comprises the following steps:
calculating the docking time between the goods taking object at the current position and the containers participated in the set of feasible schemes, wherein the docking time comprises the time consumption of the journey and the time consumption of goods collection and release;
and determining the set of feasible scheme sets with the least docking time length as the optimal feasible scheme set.
A third aspect of the embodiments of the present application provides a shipment task allocation device, including:
a central processing unit, a memory and an input/output interface;
the memory is a short-term memory or a persistent memory;
the central processor is configured to communicate with the memory and to execute instruction operations in the memory to perform the method described in any particular implementation of the first aspect of the embodiments of the present application.
A fourth aspect of the embodiments provides a computer readable storage medium comprising instructions which, when run on a computer, cause the computer to perform a method as described in any particular implementation of the first aspect of the embodiments of the application.
A fifth aspect of the embodiments of the present application provides a computer program product comprising a computer program or instructions which, when executed by a processor, implement a method as described in any particular implementation of the first aspect of the embodiments of the present application.
From the above technical solutions, the embodiments of the present application have the following advantages:
after the shipment scheme of each container to all the objects to be distributed is generated, whether the shipment scheme of the current container can be used as a feasible scheme or not can be judged according to the middle shipment amount, which is equivalent to judging whether the participation of the current container can meet the total demand of all the objects to be distributed, further, the specific split of the order demand can be effectively realized, the containers participate in shipment, and the cargo distribution efficiency and the user experience are improved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings that are needed in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments described in the present application, and other drawings may be obtained according to these drawings for a person having ordinary skill in the art.
FIG. 1 is a schematic flow chart of a delivery task allocation method according to an embodiment of the present application;
FIG. 2 is a schematic diagram of a method for distributing shipping tasks according to an embodiment of the present application;
FIG. 3 is another flow chart of a delivery task allocation method according to an embodiment of the present disclosure;
FIG. 4 is a schematic diagram of a shipping task distribution system according to an embodiment of the present application;
Fig. 5 is a schematic structural view of a shipment task distribution device according to an embodiment of the present application.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the present application more apparent, the present application will be described in further detail with reference to the accompanying drawings, and the described embodiments should not be construed as limiting the present application, and all other embodiments obtained by those skilled in the art without making any inventive effort are within the scope of the present application.
In the following description, reference is made to "one embodiment" or "one embodiment" and the like, which describe a subset of all possible embodiments, but it is to be understood that "one embodiment" or "one embodiment" may be the same subset or a different subset of all possible embodiments and may be combined with each other without conflict. In the following description, the term plurality refers to at least two.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used herein is for the purpose of describing embodiments of the present application only and is not intended to be limiting of the present application.
For ease of understanding and description, the terms and expressions referred to in the embodiments of the present application are applicable to the following explanations.
1. Retail cabinets or container equipment: a vending machine supporting robotic pick-up.
2. And (3) a robot: the whole goods taking process of the goods taking object with the goods taking and assembling capacity of the retail cabinet can be that after the robot opens a storage space, goods are put into the storage space by the container, or the robot takes out the goods from the container and puts the goods into the storage space by itself; in this embodiment of the present application, the storage space of the robot is formed by unit boxes, each unit box has the same volume, and the upper limit of the storage capacity of the robot is determined by the number of unit boxes.
3. Description of the article: the storage capacity or the demand for describing single-class articles is often composed of article numbers, article unit volumes and article numbers; in general, the similar objects only need one object description, but there may be a case that the interactive operation causes one object to be divided into a plurality of descriptions, but the output result of the application is not affected by the description (such as the optimal solution, i.e. the optimal feasible scheme set is not changed). Considering the complexity of the whole flow and the executable performance of the equipment, the embodiment of the application only takes the volume of the articles (which can be understood as the volume determined by three dimensions of length, width and height) as a single index for describing the bin energy storage capacity and the space occupation of the articles, and the embodiment does not relate to the rotation, placement and stacking of the articles, is simple and easy to realize and has flexibility.
4. And (3) wrapping: the shipment used to store a retail cabinet is understood to be a collection of multiple descriptions of the items. For ease of illustration and understanding, in embodiments of the present application, a package corresponds to the occupancy of a single unit cell.
5. Set of possible schemes: a set of corresponding viable shipping plans (or viable allocation plans) is created from the at least one container's participation in shipping, and the set meets all of the cargo volume requirements specified by the order due to the at least one container's participation.
Referring to fig. 1 to 3, a first aspect of the present application provides an embodiment of a shipment task allocation method, which includes:
11. and acquiring the real-time demand quantity to be distributed corresponding to the object to be distributed.
In practical application, the to-be-dispensed object is an ordered object specified by a user, the corresponding real-time to-be-dispensed demand is the demand of the to-be-dispensed object facing the current container, and it is understood that the initial value of the real-time to-be-dispensed demand is the total demand (1 bottle, 10 bags) of all to-be-dispensed objects (mineral water, paper towels) in the goods order (such as 1 bottle of mineral water and 10 bags of paper towels), i.e. the total demand of the order before the user order is temporarily not used for generating a shipment scheme (at the beginning). The to-be-distributed objects and the corresponding real-time to-be-distributed demand amounts thereof can be generated according to the order of the goods; in one specific example, these two types of information can be stored in a demand list to be distributed, which can be described as a basic element by the items, and can be changed in real time due to the existence of the processed, i.e. participated containers, so as to provide data support for the container to generate a shipment scheme (or referred to as a distribution scheme).
It should be noted that, the real-time demand to be distributed (which may be zero) exists because the other containers already have already assumed the shipment of a part of the ordered objects before the current container has the shipment scheme, so that the current container is faced by only the remaining part of the ordered objects and their corresponding shipment with respect to the total demand of the order total.
12. And generating a shipment scheme of each container for all objects to be distributed.
After the real-time to-be-distributed demand corresponding to the to-be-distributed objects is obtained, a delivery scheme of each container to all to-be-distributed objects can be generated according to the stock quantity of each to-be-distributed object in each container and the corresponding real-time to-be-distributed demand. For example, when containers 1 to 3 face the total demand of 10 bottles of mineral water and 10 bags of tissues (the total demand of the order can be understood as the initial demand list to be dispensed), the shipment schemes generated by the three containers can be processed respectively first, and of course, the shipment schemes cannot meet the total demand of the order at one time, for example, container 1 can only sell 5 bottles of mineral water and 10 bags of tissues, and thus the subsequent processing including step 13 is needed.
13. And judging whether the shipment volume of the current container shipment scheme reaches the real-time to-be-allocated demand volume.
In the face of the shipment schemes generated before, whether the shipment schemes can be used as feasible schemes is judged, which is equivalent to judging whether a container chain (the container chain can be understood as a certain feasible scheme set) consisting of at least the current container participates in, and finally, whether the shipment schemes can be successfully used as a feasible scheme set capable of meeting all the demands of orders; it can be seen that a set of possible solutions consists of at least one shipment solution from a container. Therefore, in the embodiment of the application, whether the current container shipment scheme reaches the real-time demand to be allocated or not can be judged according to the shipment amount of the current container shipment scheme, which is equivalent to judging whether the demand to be allocated still exists or not, so as to determine whether the current container shipment scheme can be used as a feasible scheme.
14. The current container shipment plan is determined to be one of the set of current set of possible plans.
If the shipment volume of the current container shipment plan reaches the real-time to-be-allocated demand volume (i.e., there is no unallocated demand), then determining the current container shipment plan as a viable plan in the current set of viable plans is equivalent to determining the current container shipment plan as being practically desirable. In one particular example, each set of viable schemes and viable schemes therein may be added to a viable allocation list store.
15. Updating the real-time demand quantity to be distributed, and returning to execute and generating the shipment scheme of each container to all objects to be distributed so as to obtain the current group of feasible scheme sets.
Otherwise, if the shipment volume of the current container shipment plan does not reach the real-time to-be-allocated demand volume (i.e. there is still an unallocated demand), updating the real-time to-be-allocated demand volume according to the shipment volume of the current container shipment plan, and returning to execute to generate the shipment plan of each container for all to-be-allocated objects according to the updated real-time to-be-allocated demand volume and the respective stock volumes of other non-participating containers except the current container, so as to obtain a current set of feasible plan sets generated by a plurality of containers including the current container for jointly reaching all the demand volumes.
For example, the whole demand of the order is that the mineral water 10 bottles and the paper towel 10 bags, a container chain can specifically start to draw the head to take part in the shipment of the No. 1 container as the group mark, if the shipment scheme A of the No. 1 container can only give out part of the ordered objects (objects to be distributed), for example, only 5 bottles of mineral water (the reason may be that the stock is insufficient) and 10 bags of paper towels can be sold, then the shipment scheme of the No. 2 container or other containers not participating in the container obtained for making up the scheme A can be continuously generated on the basis, and the No. 2 container faces only the mineral water which is the object to be distributed and the real-time corresponding 5 bottles of the demand to be distributed; if the number 2 container still fails to meet all the demand of the order of all the ordered objects, continuing to control other containers which do not participate in the order on the basis of the shipment of the two previous containers until all the demand of the order is met, namely, until the container chain is successful to be a group of feasible scheme sets capable of meeting all the demand of the order; it can be seen that the resulting set of possible solutions comprises at least two container shipment solutions, i.e. it is at least two containers involved in shipment. Furthermore, in one specific example, a current container shipment scenario that does not meet the real-time demand to be allocated may be staged in the potential allocation list for the next dispatch exercise, such as to confirm and begin processing what are other non-participating containers outside the current container; the non-participating containers are regarded as the containers to be processed due to different container chains where the current container is located, namely, the non-participating containers are not combined with the current container to jointly bear the order delivery task.
In other words, assuming that three container devices are available, initially, containers 1 to 3 are faced with all demands of the order, first, respective corresponding shipment schemes can be processed and generated, and then, when there is still an unassigned demand, each shipment scheme can be iterated separately for the next stage, and then, the required demand to be assigned can be updated by multiplexing each shipment scheme, and the other two unassigned containers in the container chain can be determined and processed (e.g. the operation of step 15 is performed), so as to generate further shipment schemes, thereby completing the feasible scheme set.
16. A set of target shipment scenarios is determined.
It can be seen that the entire demand of an order can be fulfilled solely by one container or at least two containers, side by side with a set of viable solutions; in practical application, an order only needs a set of feasible scheme sets to pay for use, so that screening treatment is needed to be carried out on all generated feasible scheme sets to determine a set of feasible scheme sets which are actually pre-implemented in the middle, namely a target shipment scheme set, and of course, the selected feasible scheme set which can be the best in the middle (the optimal feasible scheme set for short) can meet all requirements on all ordered cargoes, and the picking timeliness and user experience are improved.
In some embodiments, after the multiple sets of feasible schemes are obtained after step 15 is performed, the optimal feasible scheme set may not be determined any more, and any one of the multiple sets of feasible schemes is selected as the target shipment scheme set according to a certain rule. When picking up goods, the robot receives the tasks and selects or receives all the goods delivery schemes in the target goods delivery scheme set to distribute the tasks and execute corresponding picking operation.
It should be noted that, each set of feasible schemes in the application is formed continuously and perfectly until the container equipment participating in the scheme can really meet a set of shipment schemes required by all orders, and in an ideal state, a single container can bear all shipment tasks, for example, the first set of feasible schemes is that the number 1 and the number 2 containers respectively bear part (such as half-average bearing) of shipment so that all the demands of the orders are met, and the second set of feasible schemes is that the number 3 container can bear all shipment responsibilities; thus, each set of possible solutions and the final selected target shipment solution set of the present application, the members of which are shipment details specifically oriented to a container (i.e., a container shipment solution), rather than multiple sets of shipment solutions; in short, each set of feasible schemes in the application is a complete scheme capable of meeting all order demands, so it can be understood that the target shipment scheme set finally selected and directionally executed by the robot is one of multiple sets of feasible schemes, such as the first set of feasible schemes, and of course, some other set of feasible schemes except the first set of feasible schemes can be selected as the target shipment scheme set to be applied to the robot according to actual scene demands.
With continued reference to fig. 1 to 3, based on the foregoing exemplary description, another embodiment of a shipment task allocation method is provided, including:
31. and acquiring the real-time demand quantity to be distributed corresponding to the object to be distributed.
Initially, an (initial) to-be-allocated demand list of all ordered objects and all corresponding to the to-be-allocated demand is recorded, and the to-be-allocated demand list can be used for generating an initial allocation scheme (or referred to as an initial shipment scheme), as shown in fig. 2 and fig. 3, where the to-be-allocated demand list in the initial allocation scheme is all the demands of an order, and a processed equipment set, a feasible allocation list and a parcel list in the initial allocation scheme are initialized to be empty because the allocation process of a shipment task is not started temporarily, and the to-be-allocated demand list can also include a parcel usage threshold (which can be referred to as a least-used parcel size package_limit) with an initial value of zero; further illustratively, the initial allocation plan may be saved into a potential allocation list for performing the shipping task allocation method as herein described, i.e., for generating a container shipping plan; the potential dispense list herein may be considered to be in an initial state, i.e., a list that includes only initial dispense schemes to record all demand for all items to be dispensed (all demand for orders). For example, a retail bin list may also be generated from the current inventory of individual retail bins, each described by a device number and a list of items, with the remaining inventory represented by the number of items.
32. And generating a shipment scheme of each container for all objects to be distributed.
In a specific example, the shipment scheme of the container includes shipment amounts of all the objects to be distributed and corresponding shipment parcel amounts to be used, it is understood that the shipment amount of the container may be zero due to zero inventory amount or real-time corresponding demand amount to be distributed, and the specific implementation process of step 32 may include:
321. determining that an object to be distributed, which has an inventory in the current container and has a real-time demand to be distributed greater than zero, is a target object, wherein the determination of the target object can be realized by traversing a demand list to be distributed and the inventory of a retail cabinet in a distribution scheme, and the sequence of executing the two traversing processes can be unlimited, so long as the target object can be determined;
322. traversing a receiving package for storing the same goods from the current container;
323. calculating the discharge q of the current container for each target cargo, wherein the discharge q=q 0 -q' wherein the initial cargo quantity q 0 =min (real-time waiting of target cargoDispensing demand, current container stock for target cargo),the used volume of a package is herein understood to be the volume of the package occupied by the target cargo previously also originating from the current container's to-be-dispensed cargo;
a. If the shipment q is greater than zero and there is a residual package, putting the q target cargos distributed by the current container into the residual package, which is equivalent to maintaining the used package quantity of the current container unchanged, wherein the residual package is a residual package meeting the condition that q is multiplied by the unit volume of the article and the used volume of the package is less than or equal to the empty package volume;
b. if the shipment q is greater than zero and no remaining package exists, then newly addingThe parcels are used for storing q target cargoes which are preadding, so that the fact that the current container has processed the shipment arrangement of the target cargoes is indicated, and further similar shipment treatment is needed to be carried out on the next target cargoes, so that the shipment arrangement of the current container on each object to be distributed is completed; therefore, the target cargo and the next target cargo are actually the second target cargo after the matching of the first target cargo is completed by the current container.
Thus, in one particular embodiment, q=q according to the formula 0 After calculating the shipment q of the current container for each target cargo, the method of the present application may further comprise the following implementation:
324. taking other objects to be distributed which are stored except the target objects and have non-zero real-time to-be-distributed demand as the next target object of the current container (whether the cargo output q is larger than zero or not), and determining the cargo output of the current container to the next target object so as to obtain the cargo output scheme of the current container to all the objects to be distributed; in general, containers complete the shipment arrangement for all ordered items (items to be dispensed) to actually have a complete shipment scheme for the order, even though some containers may have zero or less than their actual total demand for some ordered items. It will be appreciated that other containers are required to engage in the shipment in a relay manner, given that handling of non-inventory and/or non-real time demand for the shipment is not significant to the current container, i.e. the shipment would be zero.
33. And judging whether the shipment volume of the current container shipment scheme reaches the real-time to-be-allocated demand volume.
34. The current container shipment plan is determined to be one of the set of current set of possible plans.
In one particular embodiment, the particular implementation following step 34 may include:
341. adding the current container shipment scheme into a feasible distribution list for storage;
342. updating the parcel volume threshold by comparing the parcel volume to be used by the current container shipment plan (or referred to as the least used parcel volume package_limit); where the initial value of the parcel usage threshold is zero because no new shipment scenario other than the initial allocation scenario (containing all of the order needs) has been created initially. Specifically and exemplarily, after the current container shipment scheme is generated (a new shipment scheme occurs), the package usage threshold value that is initially zero is updated to cover the package usage used by the current container shipment scheme, and then, if the new shipment scheme occurs again, the current package usage threshold value is updated to be a smaller value of the two;
343. and eliminating the existing shipment scheme that the required parcel volume is greater than or equal to the updated parcel volume threshold.
The application of the parcel usage threshold facilitates the rejection of portions of existing shipment scenarios (e.g., shipment scenarios subsequently stored in the potential allocation list) in order to reduce the number of shipment scenarios and speed up the termination of the cycle.
As can be seen from the above description, each existing shipment scenario can be added to a potential allocation list to save and record real-time demand to be allocated correspondingly, wherein the initial state of the potential allocation list is a list only including the initial allocation scenario for recording all demand (all demand of order) of all objects to be allocated. In one specific example, the shipment schemes in the potential distribution list are sorted from small to large by the respective parcel usage, so that each shipment scheme newly added to the potential distribution list must go through at least as many retail cabinets as its previous sorting scheme, while shipment schemes that would produce more parcel usage are rejected by the foregoing step 343, thus ensuring that an existing distribution scheme, such as the first shipment scheme, can be screened out faster for subsequent determination and processing of the unprocessed containers of the selected scheme, such as performing step 32 and subsequent operations, thereby generating more new shipment schemes. It should be noted that the specific execution sequence of the step 34 and any one of the steps 341 to 343 is not limited.
Accordingly, in a specific embodiment, the following implementation procedure may be specifically further included after step 343:
3431. judging whether the potential allocation list is empty or not;
3432. If the target shipment plan set is empty, a set of feasible plan sets is selected from the plurality of feasible plan sets to serve as the target shipment plan set, which is equivalent to jumping to the subsequent step 36;
3433. if not empty, the non-participating containers of the existing shipment scheme with the least required package in the potential allocation list are screened as containers to be processed, so as to return to execute the shipment scheme for generating each container to all the objects to be allocated, which is equivalent to executing the subsequent step 35, wherein the screened existing shipment scheme is not retained in the potential allocation list any more, so that the process of outputting the optimal feasible scheme set finally can be advanced.
35. Updating the real-time demand quantity to be distributed, and returning to execute and generating the shipment scheme of each container to all objects to be distributed so as to obtain the current group of feasible scheme sets.
36. A set of target shipment scenarios is determined.
In one embodiment, step 36 may include any of the following specific operational procedures:
A. minimum container experience volume strategy (a measure): and calculating the container participation amount corresponding to each feasible scheme set, and determining the feasible scheme set with the lowest container participation amount as the optimal feasible scheme set.
Traversing and calculating the container participation amount corresponding to each feasible scheme set stored in the feasible allocation list, and determining the feasible scheme set with the least container participation amount (which can be called as the minimum container experience amount unit_limit) as the optimal feasible scheme set; in practical application, the feasible scheme set with the number of containers larger than the unit_limit value can be removed, so that the feasible scheme set with the least containers can be obtained finally, namely the optimal feasible scheme set.
It should be noted that, the measure of reducing the set of possible schemes according to the "minimum container experience" may result in a loss of the best efficiency scheme, for example: the time-consuming superposition of 2 closer retail cabinets to take less than 1 remote pick, so the following B measure may be used to determine the target shipment scenario set. However, in most cases, the total distance corresponding to the scheme set with a smaller number of retail cabinets is shorter, and meanwhile, taking into account that the docking of the goods taking robot (goods taking object) with the retail cabinets also needs a certain time consumption, in practical application, the A-th branch reduction strategy can also generally effectively reduce branches and reduce subsequent calculation amount.
B. Least time consuming strategy (B action): and calculating the docking time between the goods taking object at the current position and the containers participated in the sets of feasible schemes, wherein the docking time comprises the time consuming for the journey and the time consuming for receiving and releasing goods, and determining a set of feasible schemes with the minimum docking time as the optimal feasible scheme set.
Of course, as for the a measure, the minimum time-consuming goal (feasible scheme set) is not necessarily suitable for all practical situations, and the developer can adaptively choose the measurement mode of each feasible scheme set according to the practical situation requirement. In a specific example, the time consumption comparison can be performed on the optimal feasible scheme sets determined by the actions A and B respectively, and of course, additional time consumption caused by each feasible scheme set can be considered here, for example, the speed of the goods taking robot is different due to different load experiences, so that the scheme set which is finally and truly thrown for goods distribution is chosen, and therefore the goods taking robot is reasonably arranged to take goods from a specified container, and the task efficiency and the user experience are improved.
Steps 31 to 36 are similar to steps 11 to 16, and detailed description thereof will be omitted.
As an example, during the task allocation, if the goods in the container are allocated, the stock of the target item can be locked.
In some embodiments, after the time consumption of a task allocation exceeds a threshold, the path corresponding to the task allocation is abandoned.
Referring to fig. 4, a second aspect of the present application provides an embodiment of a shipment task distribution system, comprising:
the acquiring unit 401 is configured to acquire a real-time to-be-allocated demand corresponding to the to-be-allocated object, where an initial value of the real-time to-be-allocated demand is an overall demand of all to-be-allocated objects in the order of the goods;
a processing unit 402, configured to generate a shipment scheme of each container for all the objects to be distributed according to the stock quantity of each object to be distributed in each container and the corresponding real-time demand quantity to be distributed;
the processing unit 402 is further configured to determine whether the shipment volume of the current container shipment scheme reaches a real-time to-be-allocated demand volume;
the processing unit 402 is further configured to determine the current container shipment scenario as a viable scenario of the current set of viable scenarios if the shipment volume of the current container shipment scenario reaches the real-time demand to be allocated;
The processing unit 402 is further configured to update the real-time demand to be allocated according to the shipment volume of the current container shipment plan if the shipment volume of the current container shipment plan does not reach the real-time demand to be allocated, and return to execute the shipment plan of each container for all the to-be-allocated objects according to the updated real-time demand to be allocated and the respective inventory volumes of other non-participating containers except the current container, so as to obtain a current set of possible plan sets generated by a plurality of containers including the current container for jointly reaching all the demands;
the processing unit 402 is further configured to select a set of viable solutions from the plurality of sets of viable solutions as the target shipment solution set.
The target shipment scheme set is an optimal feasible scheme set, and the optimal feasible scheme set may be determined by using the least container experience amount strategy, i.e. the a measure, or the least time-consuming strategy, i.e. the B measure, in the above embodiment.
In this embodiment, the operations performed by each unit of the shipment task distribution system are similar to those described in any one of the specific method embodiments of the first aspect, and are not described herein in detail.
Referring to fig. 5, the shipment task distribution device 500 according to the embodiment of the present application may include one or more central processing units (CPUs, central processing units) 501 and a memory 505, where one or more application programs or data are stored in the memory 505.
Wherein the memory 505 may be volatile storage or persistent storage. The program stored in the memory 505 may include one or more modules, each of which may include a series of instruction operations in the shipment task distribution device. Still further, the central processor 501 may be configured to communicate with the memory 505 to execute a series of instruction operations in the memory 505 on the shipment task distribution device 500.
The shipment task distribution device 500 may also include one or more power supplies 502, one or more wired or wireless network interfaces 503, one or more input/output interfaces 504, and/or one or more operating systems, such as Windows ServerTM, mac OS XTM, unixTM, linuxTM, freeBSDTM, etc.
The cpu 501 may perform the operations performed by the foregoing first aspect or any specific method embodiment of the first aspect, which are not described herein.
A computer readable storage medium is provided that includes instructions that, when executed on a computer, cause the computer to perform a method as described in any of the specific implementations of the shipment task allocation methods described above.
A computer program product is provided herein that includes a computer program or instructions that, when executed by a processor, implement a method described in any particular implementation of the shipment task allocation method described in embodiments of the present application.
It should be understood that, in various embodiments of the present application, the sequence number of each step does not mean that the execution sequence of each step should be determined by the function and the internal logic, and should not limit the implementation process of the embodiments of the present application.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, and are not repeated herein.
In the several embodiments provided in this application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the elements is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple elements or components may be combined or integrated into another system or apparatus, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be embodied essentially or in part or all or part of the technical solution contributing to the prior art, or in the form of a software product, which is stored in a storage medium (computer program product) and includes several instructions for causing a computer device (which may be a personal computer, a service server, or a network device, etc.) to perform all or part of the steps of the method described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a read-only memory (ROM), a random access memory (RAM, random access memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.

Claims (10)

1. A shipment task allocation method, comprising:
acquiring real-time to-be-distributed demand corresponding to the to-be-distributed objects, wherein the initial value of the real-time to-be-distributed demand is all the total demand of all the to-be-distributed objects in the goods order;
generating a delivery scheme of each container to all the objects to be distributed according to the stock quantity of each object to be distributed in each container and the corresponding real-time demand quantity to be distributed;
judging whether the shipment volume of the current container shipment scheme reaches the real-time to-be-allocated demand volume or not;
if so, determining the current container shipment scheme as a feasible scheme of the current group of feasible scheme sets;
if the current container shipment scheme is not achieved, updating the real-time to-be-allocated demand according to the shipment amount of the current container shipment scheme, and returning to execute to generate the shipment scheme of each container to all to-be-allocated objects according to the updated real-time to-be-allocated demand and the respective stock amounts of other non-participating containers except the current container so as to obtain a current group of feasible scheme sets generated by a plurality of containers including the current container for jointly achieving the total demand;
a set of viable solution sets is selected from the plurality of viable solution sets as a target shipment solution set.
2. The shipment task allocation method according to claim 1, wherein the shipment scheme of the container includes shipment amounts for all the objects to be allocated and shipment parcel amounts to be used correspondingly; the generating the shipment scheme of each container to all objects to be distributed comprises the following steps:
determining that the objects to be distributed, which are stored in the current container and have real-time requirements for the distribution of which the real-time requirements are greater than zero, are target cargoes;
traversing a receiving package for storing the same goods from the current container;
calculating the delivery q of the current container to each target cargo, wherein the delivery q=q 0 -q' wherein the initial cargo quantity q 0 Min (real-time demand for target cargo to be dispensed, stock of target cargo by current container),
if the shipment q is greater than zero and a residual package exists, putting the q target cargos distributed by the current container into the residual package, wherein the residual package is a residual package meeting the condition that the q multiplied by the unit volume of the article and the used volume of the package are less than or equal to the empty package volume;
if the shipment q is greater than zero and no remaining package exists, then addingAnd the packages are used for storing the q target cargoes.
3. The shipment task allocation method according to claim 2, further comprising, after calculating the shipment q of the current container for each target shipment:
Taking other objects to be distributed which are in stock except the target objects and have non-zero real-time demand to be distributed as the next target objects of the current container, and determining the delivery quantity of the current container to the next target objects so as to obtain the delivery scheme of the current container to all the objects to be distributed.
4. A method of dispensing a shipping task according to any one of claims 1 to 3, wherein if the shipping volume of the current container shipping plan reaches the real-time demand to be dispensed, the method further comprises:
adding the current container shipment scheme into a feasible distribution list for storage;
updating the parcel volume threshold by comparing the parcel volume to be used in the current container shipment scheme with the parcel volume threshold, wherein the initial value of the parcel volume threshold is zero;
and eliminating the existing shipment scheme that the required parcel volume is greater than or equal to the updated parcel volume threshold.
5. The delivery job allocation method as claimed in claim 4, wherein each of the existing delivery schemes is stored in a potential allocation list and is correspondingly recorded with real-time demand to be allocated, wherein the potential allocation list is a list only including initial allocation schemes for recording all demands of all objects to be allocated when in an initial state;
After the existing shipment scheme that the required parcel volume is greater than or equal to the updated parcel volume threshold is removed, the method further comprises:
judging whether the potential allocation list is empty or not;
if the set is empty, selecting a set of feasible schemes from the plurality of sets of feasible schemes as a target shipment scheme set;
if not, screening the non-participating containers of the existing shipment scheme with the least required package quantity in the potential allocation list as containers to be processed, and returning to execute the shipment scheme for generating each container to all the objects to be allocated, wherein the screened existing shipment scheme is not reserved in the potential allocation list.
6. The shipment task allocation method according to claim 1, wherein the target shipment plan set is an optimal feasible plan set, and the determining manner of the optimal feasible plan set specifically includes:
calculating container participation amounts respectively corresponding to each feasible scheme set;
and determining the feasible scheme set with the least container participation as the optimal feasible scheme set.
7. The shipment task allocation method according to claim 1, wherein the target shipment plan set is an optimal feasible plan set, and the determining manner of the optimal feasible plan set specifically includes:
Calculating the docking time between the goods taking object at the current position and the containers participated in the set of feasible schemes, wherein the docking time comprises the time consumption of the journey and the time consumption of goods collection and release;
and determining the set of feasible scheme sets with the least docking time length as the optimal feasible scheme set.
8. A shipment task distribution system, comprising:
the system comprises an acquisition unit, a storage unit and a storage unit, wherein the acquisition unit is used for acquiring real-time to-be-allocated demand corresponding to-be-allocated objects, and the initial value of the real-time to-be-allocated demand is the total demand of all to-be-allocated objects in a goods order;
the processing unit is used for generating a delivery scheme of each container to all the objects to be distributed according to the stock quantity of each object to be distributed in each container and the corresponding real-time demand quantity to be distributed;
the processing unit is also used for judging whether the shipment volume of the current container shipment scheme reaches the real-time to-be-allocated demand volume;
the processing unit is further used for determining the current container shipment scheme as a feasible scheme of the current group of feasible scheme set if the shipment amount of the current container shipment scheme reaches the real-time to-be-allocated demand amount;
the processing unit is further configured to update the real-time demand to be allocated according to the shipment volume of the current container shipment plan if the shipment volume of the current container shipment plan does not reach the real-time demand to be allocated, and execute the shipment plan of each container for all the objects to be allocated in a return mode according to the updated real-time demand to be allocated and the respective stock volumes of other non-participating containers except the current container, so as to obtain a current set of feasible plan sets generated by a plurality of containers including the current container for jointly reaching all the demands;
The processing unit is further configured to select a set of viable solutions from the plurality of sets of viable solutions as a target shipment solution set.
9. A shipment task distribution device, comprising:
a central processing unit, a memory and an input/output interface;
the memory is a short-term memory or a persistent memory;
the central processor is configured to communicate with the memory and execute instruction operations in the memory to perform the shipment task allocation method of any one of claims 1 to 7.
10. A computer readable storage medium comprising instructions which, when run on a computer, cause the computer to perform the shipment task allocation method of any one of claims 1 to 7.
CN202210681481.1A 2022-06-16 2022-06-16 Shipment task distribution method and system and related products Pending CN117314026A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210681481.1A CN117314026A (en) 2022-06-16 2022-06-16 Shipment task distribution method and system and related products

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210681481.1A CN117314026A (en) 2022-06-16 2022-06-16 Shipment task distribution method and system and related products

Publications (1)

Publication Number Publication Date
CN117314026A true CN117314026A (en) 2023-12-29

Family

ID=89260853

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210681481.1A Pending CN117314026A (en) 2022-06-16 2022-06-16 Shipment task distribution method and system and related products

Country Status (1)

Country Link
CN (1) CN117314026A (en)

Similar Documents

Publication Publication Date Title
Boysen et al. Scheduling inbound and outbound trucks at cross docking terminals
Vahdani Assignment and scheduling trucks in cross-docking system with energy consumption consideration and trucks queuing
US8805573B2 (en) System and method for order fulfillment
CN109658027A (en) A kind of processing method of order taking responsibility, device, server and medium
CN106960301B (en) Medicine e-commerce mirror image sorting method and system
US8352382B1 (en) Heuristic methods for customer order fulfillment planning
Zäpfel et al. Warehouse sequencing in the steel supply chain as a generalized job shop model
Shahabi-Shahmiri et al. A routing and scheduling problem for cross-docking networks with perishable products, heterogeneous vehicles and split delivery
CN114981827A (en) Method for distributing objects into one or more containers and related electronic device
Schubert et al. Integrated order picking and vehicle routing with due dates
CN113177827B (en) Order dispatching method, device, electronic equipment and storage medium
CN110245851A (en) A kind of order shipment dispatching method in order shipment scheduling system and preposition storehouse
CN116402445B (en) Goods delivery scheduling method, device and computer equipment
CN116002257A (en) Warehouse system, warehouse system scheduling method, warehouse system scheduling device and electronic equipment
Lu et al. Slot allocation planning for an alliance service with ship fleet sharing
Yücel et al. Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics
Castellucci et al. Output maximization container loading problem with time availability constraints
CN117314026A (en) Shipment task distribution method and system and related products
Cen et al. Modelling and heuristically solving three-dimensional loading constrained vehicle routing problem with cross-docking
CN110298618B (en) Wave order off-shelf task generation method and device, storage medium and electronic equipment
Grunewald et al. Multi-item single-source ordering with detailed consideration of transportation capacities
Albán et al. A new policy for scattered storage assignment to minimize picking travel distances
JP2003034440A (en) Planning system for allocating vehicles and its method
CN117066147B (en) Intelligent distribution method, system and medium for return package management
Liu et al. Efficient order-based scheduling algorithms for automated retrieval system (ARS) in smart warehouses

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination