# US 2019/0378232 A1 · Method and system for using multiple packing stations in delivery of goods > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2019/0378232 A1 - Document ID: US20190378232A1 - Status: Published application - Kind: A1 - Application number: 16/485,324 - Filed: 2018-02-11 - Published: 2019-12-12 - Earliest claimed: 2017-02-12 - Assignees: Commonsense Robotics Ltd. - Applicants: Commonsense Robotics Ltd. - Inventors: Eyal Goren; Elram Goren; Shmuel Ur - Web page: https://patentgrep.com/patent/US20190378232A1 ## CPC - G06Q 10/08: Logistics, e.g. warehousing, loading or distribution; Inventory or stock management - G06Q 10/04: Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" (market predictions or forecasting for commercial activities G06Q30/0202) - G06Q 10/06315: {Needs-based resource requirements planning or analysis} - G06Q 10/06316: {Sequencing of tasks or work} - G06Q 10/083: Shipping - G06Q 10/0843: {using forecasting or optimisation} - 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 ## Abstract A method, system and product for using multiple packing stations in delivery of goods. A packing scheme is determined for an order based on an optimality criteria, the scheme comprising a division of a set of items between packing stations, whereby defining one or more subsets of the set of items. The packing scheme further comprising an ordering of the one or more subsets and packing stations paired therewith, by which ordering the paired packing stations are to be utilized for packing the set of items and transporting thereof to the destination, wherein in each packing station, a respective portion of the set of items is to be packed and transported therefrom. Responsive to the optimality criteria being met, instructions for executing the order are issued, whereby the set of items are packed and transported according to the packing scheme. ## Claims ### Claim 1 A computer-implemented method comprising: receiving an order indicating a set of items for delivery to a destination; determining a packing scheme based on one or more optimality criteria, the packing scheme comprising a division of the set of items between two or more packing stations situated in one or more operation locations of one or more suppliers, the division defining one or more subsets of the set of items, each of which subsets being paired with a packing station, the subsets being mutually disjoint, the packing scheme further comprising an ordering of the one or more subsets and packing stations paired therewith, by which ordering the one or more paired packing stations are to be utilized for packing the set of items and transporting thereof to the destination, wherein in each packing station paired with a subset, a respective portion of the set of items in the subset is to be packed and transported therefrom to the destination or a subsequent packing station; and, responsive to determining the one or more optimality criteria being met by the packing scheme, issuing instructions for executing the order by packing and transporting the set of items according to the packing scheme. ### Claim 2 (depends on 1) The method of claim 1, wherein the one or more optimality criteria comprise criteria selected from the group consisting of: criteria related to a supplier or an operation location thereof; criteria related to a packing station; criteria related to an item; criteria related to a measure of transportation costs; and, any combination thereof. ### Claim 3 (depends on 1) The method of claim 1, wherein said determining comprises: for each packing station of the two or more packing stations, assigning to each item of the plurality of items a cost for packing the item at the packing station in accordance with a predetermined ordering; and, applying an optimization problem solving process to obtain a packing scheme whereby a total cost of executing the order is minimized. ### Claim 4 (depends on 1) The method of claim 1, wherein said determining comprises: assigning a cost for each route section from a packing station to the destination and from the packing station to another packing station; and, determining the ordering of the packing stations such that a total cost of an overall route corresponding thereto is minimized. ### Claim 5 (depends on 1) The method of claim 1, wherein at least one packing station of the two or more packing stations is robotic, and wherein the one or more optimality criteria comprising an optimality criterion whereby utilization of robotic packing stations is prioritized. ### Claim 6 (depends on 1) The method of claim 1, wherein the packing scheme further comprising for at least one subset an ordering by which items of the subset are to be packed in the packing station paired therewith. ### Claim 7 (depends on 1) The method of claim 1, wherein the ordering is selected from the group consisting of: an order whereby a single sequence in which all of the subsets are to be packed one after another is defined; and, an order whereby a plurality of sequences each of which containing a different portion of the subsets is defined, wherein in each of the plurality of sequences the respective subsets of the portion are to be packed one after another, and wherein subsets in different sequences of the plurality of sequences are to be packed either concurrently or in an arbitrary order. ### Claim 8 (depends on 1) The method of claim 1, wherein one or more containers are used for transporting the set of items, wherein the packing scheme comprises for each of the one or more subsets an assigned container of the one or more containers and a transportation route of the assigned container. ### Claim 9 (depends on 1) The method of claim 1, wherein the set of items are packed and transported within containers of a limited dimension, wherein the one or more optimality criteria comprise a criterion of a number of containers required for packing a respective portion of the set of items in a subset. ### Claim 10 An apparatus comprising a processor and coupled memory, the processor being adapted to perform the steps of: receiving an order indicating a set of items for delivery to a destination; determining a packing scheme based on one or more optimality criteria, the packing scheme comprising a division of the set of items between two or more packing stations situated in one or more operation locations of one or more suppliers, the division defining one or more subsets of the set of items, each of which subsets being paired with a packing station, the subsets being mutually disjoint, the packing scheme further comprising an ordering of the one or more subsets and packing stations paired therewith, by which ordering the one or more paired packing stations are to be utilized for packing the set of items and transporting thereof to the destination, wherein in each packing station paired with a subset, a respective portion of the set of items in the subset is to be packed and transported therefrom to the destination or a subsequent packing station; and, responsive to determining the one or more optimality criteria being met by the packing scheme, issuing instructions for executing the order by packing and transporting the set of items according to the packing scheme. ### Claim 11 (depends on 10) The apparatus of claim 10, wherein the one or more optimality criteria comprise criteria selected from the group consisting of: criteria related to a supplier or an operation location thereof; criteria related to a packing station; criteria related to an item; criteria related to a measure of transportation costs; and, any combination thereof. ### Claim 12 (depends on 10) The apparatus of claim 10, wherein said determining comprises: for each packing station of the two or more packing stations, assigning to each item of the plurality of items a cost for packing the item at the packing station in accordance with a predetermined ordering; and, applying an optimization problem solving process to obtain a packing scheme whereby a total cost of executing the order is minimized. ### Claim 13 (depends on 10) The apparatus of claim 10, said determining comprises: assigning a cost for each route section from a packing station to the destination and from the packing station to another packing station; and, determining the ordering of the packing stations such that a total cost of an overall route corresponding thereto is minimized. ### Claim 14 (depends on 10) The apparatus of claim 10, wherein at least one packing station of the two or more packing stations is robotic, and wherein the one or more optimality criteria comprising an optimality criterion whereby utilization of robotic packing stations is prioritized. ### Claim 15 (depends on 10) The apparatus of claim 10, wherein the packing scheme further comprising for at least one subset an ordering by which items of the subset are to be packed in the packing station paired therewith. ### Claim 16 (depends on 10) The apparatus of claim 10, wherein the ordering is selected from the group consisting of: an order whereby a single sequence in which all of the subsets are to be packed one after another is defined; and, an order whereby a plurality of sequences each of which containing a different portion of the subsets is defined, wherein in each of the plurality of sequences the respective subsets of the portion are to be packed one after another, and wherein subsets in different sequences of the plurality of sequences are to be packed either concurrently or in an arbitrary order. ### Claim 17 (depends on 10) The apparatus of claim 10, wherein one or more containers are used for transporting the set of items, wherein the packing scheme comprises for each of the one or more subsets an assigned container of the one or more containers and a transportation route of the assigned container. ### Claim 18 (depends on 10) The apparatus of claim 10, wherein the set of items are packed and transported within containers of a limited dimension, wherein the one or more optimality criteria comprise a criterion of a number of containers required for packing a respective portion of the set of items in a subset. ### Claim 19 A non-transitory computer readable storage medium retaining program instructions, which program instructions when read by a processor, cause the processor to perform a method comprising: receiving an order indicating a set of items for delivery to a destination; determining a packing scheme based on one or more optimality criteria, the packing scheme comprising a division of the set of items between two or more packing stations situated in one or more operation locations of one or more suppliers, the division defining one or more subsets of the set of items, each of which subsets being paired with a packing station, the subsets being mutually disjoint, the packing scheme further comprising an ordering of the one or more subsets and packing stations paired therewith, by which ordering the one or more paired packing stations are to be utilized for packing the set of items and transporting thereof to the destination, wherein in each packing station paired with a subset, a respective portion of the set of items in the subset is to be packed and transported therefrom to the destination or a subsequent packing station; and, responsive to determining the one or more optimality criteria being met by the packing scheme, issuing instructions for executing the order by packing and transporting the set of items according to the packing scheme. ### Claim 20 (depends on 19) The non-transitory computer readable storage medium of claim 19, wherein said determining comprises: for each packing station of the two or more packing stations, assigning to each item of the plurality of items a cost for packing the item at the packing station in accordance with a predetermined ordering; and, applying an optimization problem solving process to obtain a packing scheme whereby a total cost of executing the order is minimized.