Method for preparing a logistics load unit for packaging

Abstract

The invention relates to a method (1100; 1200; 1300) for preparing a logistics load unit for packaging, in which: products are stored (1101; 1201; 1301) in a product picking area (41; 61), the area including product locations, each product location being associated with an identifier; packages are stored (1102; 1202; 1302) in a package picking area (41; 71, 72, 73), the area including package locations, each package location being associated with an identifier; a selection of products is obtained (1103; 1203; 1303), the selected products forming a logistics load unit for packaging; a selection of a package is obtained (1104; 1204; 1304); a selection of a package is obtained (1105; 1205;1305) a collection route for the selected products and packaging in the picking areas, the route including the identifiers of the locations of the selected products and packaging to be collected; the selected products and packaging are collected (1106; 1206; 1306) from the picking areas in accordance with the route and the selections; in a preparation area (42; 62, 63, 64) for a logistics load unit to be packed, the selected products are arranged (1107; 1207; 1307) in the selected packaging, so as to form the packed logistics load unit. Figure for the abstract: no figure;

Description

Title of the invention: Method for preparing a logistics load unit for packaging

[0001] The invention relates to the field of parcel delivery, in particular order preparation in a warehouse.

[0002] In the prior art, in a warehouse, the order picker has an order preparation area, generally called a picking table, in which they arrange products in packaging to form a packaged logistics unit for shipment. This "logistics unit" is generally called a "package" when it is associated with a delivery in progress or completed.

[0003] Beforehand, to prepare this logistics unit, the order picker receives a picking slip, also called a picking slip, indicating the products that must make up the logistics unit they are to prepare. The slip specifies the locations of these products within a picking area. A product picking area is generally made up of racks or shelving units and includes locations with identifiers, so that each ordered product is linked in the database to its location within the picking area. These products are collected one by one by the picker or one of their colleagues from this picking area. They are then taken to the preparation area, where the picker selects a package from among several packages arranged beforehand around them in this preparation area.The choice of packaging for products is generally made visually by the order picker, based on their estimation of the product volume and the packaging available at the time in their preparation area. It can also be done in a standardized way on automated lines, where the logistics units are packaged in containers of similar or even identical dimensions. The order picker then arranges these products within this packaging, according to their experience and practice, under time constraints, to form the packaged logistics unit.

[0004] Prior art also includes automated means for automatically collecting products from the product picking area and transporting them to the preparation area, where the order picker arranges these products, again, into packaging chosen visually in their preparation area. Product collection is therefore even faster because it is automated; the picker simply selects the packaging they deem appropriate. from those at his disposal, then creates the arrangement.

[0005] However, within the framework of these two prior art methods, many logistics units are shipped in unsuitable packaging. Indeed, the order picker is constrained by the packaging available in the picking area, and the choice of packaging based on visual inspection is sometimes not the most optimal.

[0006] Furthermore, when fewer and fewer packages are available in the preparation area, it is necessary to retrieve bulk packages from a bulk packaging storage area and bring them back to the preparation area. This search for packages in bulk storage areas is also carried out visually and is time-consuming.

[0007] To remedy this, prior art provides an automated line located in the picking area that automatically packages the products forming a logistics unit into predetermined packaging that is identical for all logistics units. Thus, the order picker no longer needs to choose packaging, as all packages are identical. The preparation of the logistics unit is even faster. However, on average, logistics units are packaged in even less suitable packaging, since this packaging is identical regardless of the logistics unit being packed.

[0008] It follows from all these means and methods of the prior art that many shipped logistics units consist of products arranged in unsuitable packaging, and in particular exhibit a significant void ratio. This void ratio generates overconsumption of packaging and therefore a significant waste of material, associated greenhouse gas emissions, as well as major economic losses for stakeholders in the delivery sector. This average void ratio also generates overconsumption of storage space, particularly in collection points. This saturation of storage space can, in turn, lead to an increase in the distance between the recipient's home and the collection point if the package is reassigned to a distant location. Excessive void in packaging also generates risks of breakage and therefore additional transport.In addition, products packaged in oversized containers require extra padding, further increasing raw material waste. Finally, unsuitable packaging also makes handling these logistics units more difficult.

[0009] To allocate more suitable packaging to logistics load units, a prior art solution is the manufacturing, by robot, in the warehouse, of custom-made packaging adapted to the dimensions of each logistics load unit.

[0010] However, this solution is costly in terms of capital investment, complex to implement, potentially time-consuming, and, most importantly, cannot absorb peak activity when the robot's maximum capacity is reached. Furthermore, the packaging waste generated is two to three times greater than that generated by conventional packaging. In addition, this solution, by definition, systematically prohibits the use of reusable packaging and therefore also tends to increase greenhouse gas emissions related to the overconsumption of cardboard.

[0011] The invention aims in particular to allow for a more appropriate choice of packaging, in order to generate on average less empty space in the logistics load units to be packed and thus reduce the amount of material needed while improving the efficiency of the entire downstream logistics process.

[0012] To this end, the invention provides a method for preparing a logistics load unit for packaging, in which: • products are stored in a product picking area, the area including product locations, each product location being associated with an identifier; • packaging is stored in a packaging picking area, the area including packaging locations, each packaging location being associated with an identifier; • a selection of products is obtained, the selected products forming a logistical load unit to be packed; • a selection of packaging is obtained; • we obtain a collection route for the selected products and packaging in the collection areas, the route including the identifiers of the locations of the selected products and packaging to be collected; • the selected products and packaging are collected in the collection areas in accordance with the route and the selections; • in a preparation area for a logistics unit to be packed, the selected products are arranged in the selected packaging, so as to form the packed logistics unit.

[0013] Thus, the packaging is now considered a product. Indeed, the packaging is stored, like the products, in a picking area, which, as with a product, includes identified locations. Like the products, it is subject to a collection step. Therefore, it is no longer chosen from among the few packages available in the limited preparation area, but from among all the packages in the packaging picking area, the latter being as large as necessary, like the product picking area.

[0014] Thus, the order picker is no longer limited by the few packages available in their picking area; they have access to all the packages in a packaging picking area, just as they have access to all the products in the product picking area. Therefore, for each logistics unit, they have a large number of distinct packages, particularly of different types and sizes, and can thus pack each logistics unit with the most appropriate packaging from among this large number of packages. In this way, the average empty space rate of a logistics unit can be reduced.

[0015] Adding the step of collecting the packaging from a packaging picking area introduces a step that may initially lead to a loss of time and therefore reduced productivity. However, the productivity lost due to the packaging collection step is offset by choosing a route that allows the packaging to be picked at the same time as the product, so that the packaging is considered simply as an additional item in the order to be picked. It is also offset by the elimination of the need to regularly retrieve packaging from bulk packaging storage areas to bring it back to the picking area or to add extra packing material.

[0016] The route may include a product collection route on the one hand, and a separate packaging collection route on the other. This is particularly suitable where the product and packaging collection areas are far apart.

[0017] In the following, "computer" will also be referred to as "computer resources" and for convenience as "resources".

[0018] Other optional features taken alone or in combination are described below.

[0019] Advantageously, to obtain the route, an optimized route is determined by computer based on the locations of the products and the location of the packaging so that the collection of the products and the packaging is as fast as possible.

[0020] Thus, collection is as quick as possible, the packaging being only an additional item, in addition to the products, to be collected.

[0021] Preferably, the packaging selection is carried out in accordance with the following computer-implemented steps: • selection of packaging available in the packaging picking area; • For each selected package, a prioritization value is determined. of the packaging, the value depending on at least the volume of the packaging so that a package less voluminous than another package, is, all other things being equal, given priority over that other package; • sorting of packaging according to their respective prioritization values ​​in order to form a sorted list of packaging; • choosing one of the packages from the list according to the sorting; • verification of the suitability between the chosen packaging and the unit load logistics to be packed, the verification relating at least to the weight of the logistics unit of load in relation to a maximum weight supported by the packaging.

[0022] Thus, packaging adapted to the dimensions of the logistics unit load is assigned so that the void space in each packaged logistics unit load is as small as possible. This results in a much lower average void space.

[0023] Advantageously, each selected product corresponding to a content and the selected packaging corresponding to a container, the selected contents and container having respective rectangular prism shapes, the selected products are arranged in the selected packaging according to an arrangement plan, the arrangement plan being determined according to the following computer-implemented steps: • among the contents to be arranged in the container, virtual arrangement of a first piece of content at a predetermined position in the container; • to virtually arrange one of the remaining contents within the container: • determination of the dimensions and coordinates of several remaining empty spaces in the container, distinct from each other and having respective rectangular prism shapes; • determining possible positions for the remaining content in each empty space; • determination of respective distances between a predetermined vertex of the container and the respective vertices of the remaining content in each possible positioning; • based on the determined distances, selection of one of the possible positions as a virtual arrangement of the remaining content in the container; • Reiteration of the previous arrangement steps for successively each of the other remaining contents to be arranged virtually in the container, so as to determine an arrangement plan for all the contents in the container.

[0024] Thus, the container, as well as the virtual contents and empty spaces, are defined in the form of computer-manipulated data structures. Therefore, by arranging each piece of content, in turn, in the position furthest possible from a From the same point of the container, after identifying available empty spaces, it appears that on average the positioning of this content is significantly optimized so that the final arrangement of all this content occupies the least possible volume.

[0025] Preferably, selected packages are stored in the packaging picking area according to logistics load units, in accordance with the following computer-implemented steps: • obtaining a list of packaging; • for each of the packages in the list obtained, determination of a prioritization value for the package, the value depending on at least the volume of the package so that a package less voluminous than another package, is, all other things being equal, given priority over that other package; • sorting of packaging according to their respective prioritization values ​​in order to form a sorted list of packaging; • choosing one of the packages from the list according to the sorting; • obtaining a list of logistics load units, each load unit lo logistics of the list having dimensions smaller than those of the chosen packaging; • for each logistics unit of load in the list, verification of the suitability between the chosen packaging and the logistics unit of load, the verification relating at least to the weight of the logistics unit of load in relation to a maximum weight supported by the packaging; • if the number of logistics load units verified as suitable for the chosen packaging is greater than or equal to a predetermined threshold, selection of the packaging for storage in the packaging picking area, and removal, from the list of logistics load units, of the logistics load units verified as suitable for this selected packaging.

[0026] Thus, the packaging stored in the packaging picking area is pre-selected to ensure it is suitable for storage. It is appropriate for logistics load units shipped in the past or for logistics load units, or products, that have never been shipped but which are to be tested for potential future shipments. Therefore, it is likely that it will be suitable for logistics load units shipped in the future by the same logistics provider.

[0027] Advantageously, the logistics unit being a first logistics unit, to prepare a second logistics unit for packing: • a second selection of products is obtained, the selected products forming the second logistical load unit to be packed; • a selection of a second package is obtained; • In the collection route acquisition stage, the products include the selected products forming the first logistics load unit and the selected products forming the second logistics load unit, as well as the two respective selected packages, the route including the identifiers of the locations of the selected products and packages to be collected from the first and second logistics load units; • in the collection stage, the selected products and selected packaging are collected from the first and second logistics load units; • in the preparation area, or in this area and another preparation area, the two packaged logistics load units are formed.

[0028] Thus, the path is obtained for at least two orders, and an optimized collection step is carried out allowing the products and packaging corresponding to these orders to be collected optimally.

[0029] What is applied to two logistics load units can be applied to more. Thus, a number n of logistics load units can be prepared in this way, n being greater than 2, by obtaining n corresponding product selections, selecting n corresponding packages, obtaining an optimized picking route for the n products and n packages, collecting them, and preparing the n logistics load units in the picking area. In this way, the picking of n orders is optimized.

[0030] Selected products can be collected from these logistics load units on the one hand, according to an optimized product route, and selected packaging can be collected from the logistics load units on the other hand, according to an optimized packaging route. This depends in particular on the distance between the product picking area and the packaging picking area.

[0031] The invention also provides for a computer program comprising instructions which, when the program is executed by a computer, lead the computer to implement the steps of the process described above.

[0032] The invention also provides for a computer-readable recording medium comprising instructions which, when executed by a computer, lead the computer to carry out the steps of the process described above.

[0033] The invention also provides for an installation for preparing a logistics load unit for packaging, comprising: • a product picking area, the area including product locations, each product location being associated with an identifier; • a packaging retrieval area, the area including packaging locations, each packaging location being associated with a identifier; • a product selection module, the selected products forming a logistics load unit to be packed; • a packaging selection module; • a module for obtaining a collection route for the selected products and packaging in the collection areas, the route including the identifiers of the locations of the selected products and packaging; • means of collecting the selected products and packaging in the collection areas in accordance with the route and selections; • a preparation area for a logistics load unit to be packed, suitable for arranging the selected products in the selected packaging to form the packed logistics load unit.

[0034] This installation is therefore capable of implementing the process described above, generating all of its technical effects.

[0035] Advantageously, the picking areas are formed of shelving or racks.

[0036] Preferably, the product and packaging picking areas form a single picking area including both packaging locations and product locations.

[0037] Alternatively, the packaging picking area includes only packaging corresponding to a single predetermined type of packaging, a type of packaging corresponding to the structure, material and / or robustness of the packaging, and this packaging picking area is integrated into the preparation area, so that any logistics load unit whose products are arranged in this preparation area is packed using packaging corresponding to the predetermined packaging type.

[0038] Advantageously, the collection means are automated means capable of automatically collecting the selected products and packaging from the picking areas and automatically bringing them to the preparation area.

[0039] In general, some or all of the steps of the process described above can be automated. Brief description of the figures

[0040] The invention will be better understood upon reading the following description, given solely by way of example and made with reference to the accompanying drawings in which:

[0041] [Fig-1] is a diagram of computer means enabling the implementation of the processes of the invention;

[0042] [Fig.2] is a flowchart illustrating a method for determining a plan arrangement according to a first method of implementation;

[0043] [Fig.3] is a schematic view of a content arrangement plan according to this first mode;

[0044] [Fig.4] is a flowchart illustrating a method for determining a plan arrangement according to a second method of implementation;

[0045] [Fig.5] is a diagram illustrating the implementation method of [Fig.4];

[0046] [Fig.6] is another diagram illustrating the implementation method of [Fig.4];

[0047] [Fig.7] is another diagram illustrating the implementation method of [Fig.4];

[0048] [Fig.8] is a schematic view of a content arrangement plan according to this second mode;

[0049] [Fig.9] is a flowchart illustrating a plan determination method arrangement according to a third method of implementation;

[0050] [Fig. 10] is a flowchart illustrating a method for determining a layout plan according to a fourth method of implementation;

[0051] [Fig. 11] is a flowchart illustrating a method for determining a layout plan according to a fifth method of implementation;

[0052] [Fig. 12] is a flowchart illustrating a process of grouping products into logistics load units, implemented in the packaging allocation process described;

[0053] [Fig. 13] is a flowchart illustrating a method of assigning a package to a logistics load unit according to a first implementation method;

[0054] [Fig. 14] is a flowchart illustrating a method of assigning a package to a logistics load unit according to a second implementation method;

[0055] [Fig. 15] is a flowchart illustrating a process for selecting optimized packaging based on logistics load units according to a first implementation method;

[0056] [Fig. 16] is a flowchart illustrating a process for selecting optimized packaging based on logistics load units according to a second implementation method;

[0057] [Fig. 17] is a diagram of a logistics unit preparation installation according to a first embodiment;

[0058] [Fig. 18] is a drawing of part of the installation of [Fig. 17];

[0059] [Fig.19] is a drawing of another part of the installation of [Fig.17];

[0060] [Fig.20] is a flowchart illustrating a process for preparing a unit load logistics to be packed according to a first implementation method;

[0061] [Fig.21] is a diagram of an installation for preparing a load unit logistics according to a second embodiment;

[0062] [Fig.22] is a drawing of part of the installation of [Fig.21];

[0063] [Fig.23] is a flowchart illustrating a process for preparing a unit load logistics to be packaged according to a second implementation method; and

[0064] [Fig.24] is a flowchart illustrating a process for preparing a logistics load unit to be packed according to a third implementation method.

[0065] Figure 1 shows computer means 10 for implementing the processes that will be described later. These computer means 10, conventional for those skilled in the art, include a processing unit 1 of the processor type, a memory 2 of the data storage type, including a computer program 3 and a database 4, as well as interaction means 5 for a possible user, such as a keyboard and a mouse. All of these means 10 together form a conventional computer, but they can also be distributed across any remote hardware. The program 3 comprises instructions which, when executed by the unit 1 or any computer, cause them to carry out the steps of the processes that will be described later.Consequently, medium 2 is any recording medium readable by unit 1 or by any computer, comprising instructions which, when executed by the unit or a computer, cause them to carry out the steps of the processes that will be described later. The interaction means 5 allow a user to configure the processes, in particular by assigning chosen values ​​to certain thresholds or variables, or by selecting certain characteristics over others, in accordance with the thresholds, characteristics, and other configurable parameters that will be clearly apparent to those skilled in the art in the processes described later.Whether the steps are described indefinitely, particularly with the use of the pronoun "one", or whether computer means are explicitly mentioned, the steps of virtual arrangement, comparison, choice, arrangement and assignment and other computational steps described, as well as generally all steps which will be clear to a person skilled in the art as being of a computer nature, are entirely carried out by the means 10, unless human intervention, for example by a user of the processes, is explicitly mentioned.

[0066] We will first describe a method for determining an arrangement plan of several contents in a container, according to four modes of implementation.

[0067] We will then describe a method of assigning packaging to a logistics unit load, according to two modes of implementation.

[0068] We will then describe a method for selecting optimized packaging based on logistics load units.

[0069] Finally, we will describe a method for preparing a logistics load unit for packing.

[0070] In the following, "content" will mean any object, virtual or real, intended to be integrated into a "container," real or virtual. Unless explicitly stated otherwise, these two These types of objects are in the form of rectangular prisms. It will be clear to those skilled in the art that they are manipulated virtually, that is, solely through the lens of their data, by means 10, as described below. Thus, they are represented digitally by their three dimensions, and if necessary by their coordinates, particularly those of the contents within a container, in the form of structured data in databases. It is through this data that the computer means 10 process these elements in the procedures described below. Naturally, the "real" contents and containers corresponding to these virtual elements do not necessarily have the shape of rectangular prisms, much less perfect rectangular prisms, but their respective virtual counterparts are necessarily recorded digitally in the form of rectangular prisms to be processed in the procedures that will be described.The manner in which actual content or container of any shape is given virtual rectangular prism dimensions is not the subject of this request and will not be described.

[0071] The term "logistics load unit" refers to a set of contents, including one or more commercial products, intended to be grouped together and arranged in a common container for delivery. This expression differs from the term "package" in that a package is often associated with a state or status of the logistics load unit. In particular, a package is usually considered a logistics load unit when it has a delivery label, is in transit, or has arrived at its destination. The "logistics load unit" is distinct from any status related to a delivery. As with the other objects described, it will be clear to those skilled in the art that the expression "logistics load unit" regularly refers to a logistics load unit handled solely in computer form by means of 10.

[0072] In summary, "content", "container" and "logistics load unit" refer to entities manipulated by means 10, so that they could just as easily be referred to respectively by the expressions "virtual content", "virtual container" and "virtual logistics load unit", except in the few cases where it will be clear that their real counterparts are being referred to.

[0073] The term "user" refers to any human being seeking to obtain the results of the processes described below. This may include, in particular, individuals working in a delivery warehouse, such as an order picker, a buyer, or a logistics specialist.

[0074] As already mentioned, the implementation of the processes below presupposes the possession of virtual objects, in the form of data structures, some of which correspond to real objects. In particular, it will be assumed that for each real content to be integrated into a real container, for example for a product to be packaged In a real warehouse setting, the means 10 have access to the dimensions of these elements in order to manipulate corresponding virtual contents and containers using this data. The method by which these dimensions are obtained and the way in which this data is organized is not the subject of this request. Similarly, the means 10 have databases containing a multitude of variables relating to specific characteristics of packaging or other objects, such as weight, whether a product is "fragile" or not, the "type" of packaging, and all parameters as will be clearly identified in the description. The method by which this data is obtained beforehand and organized into databases will not be described here and is not the subject of this request.

[0075] I. Method for determining a layout plan

[0076] A "layout plan" shall be understood as a data report including, at a minimum, information on the result of arranging certain identified contents. The layout plan may thus include the minimum volume occupied by the arranged contents, that is to say, in particular, the minimum dimensions of a container for these contents. It may also include the coordinates of each of these arranged contents, possibly associated with their orientations. More specifically, it may present a guide, for example displayed on a screen, clearly illustrating how the contents should be arranged sequentially.

[0077] The input data for this method consists of three-dimensional content, all in the form of oriented rectangular prisms. This content is represented computationally by any data that allows the dimensions of this content to be established, such as the three respective dimension values ​​of each piece of content. The method aims to arrange this content with each other in the most optimal way possible within a three-dimensional empty space, in particular by minimizing as much as possible the volume of empty space resulting from the arrangement obtained when considering this content arranged in a rectangular prism with dimensions adjusted to the content thus arranged. The output data forms a plan for arranging this content in an empty space, the content of which varies according to the implementation methods and the options chosen by a user of the method. The output data includes the minimum dimensions of a container suitable for the content thus arranged.

[0078] This process is implemented automatically by the computer means 10 described above. The contents correspond to actual products belonging to the same logistics unit load, and which therefore need to be arranged together in the most optimal way possible in the same package, pallet, container, or truck. They may also correspond to different pallets that must be arranged together in the most optimal way possible in a same container or in the same truck, or even different containers to be arranged in the most optimal way possible in the same truck.

[0079] We will describe a first mode of implementation 100 of a method for determining arrangements of several contents in a container, with reference to figures 2 and 3.

[0080] Figure 3 illustrates three contents to be arranged, 21, 22 and 23, as well as the result of the arrangement plan. The steps below describe how this arrangement is obtained.

[0081] In step 101, the data corresponding to these contents 21, 22, and 23 is retrieved. This data specifically concerns the dimensions of the products to be arranged, these products being in the form of rectangular prisms. Each content, like each container, therefore has a first dimension, a second dimension orthogonal to the first, and a third dimension orthogonal to the first and second dimensions. Each content also has an orientation.

[0082] In a first variant of this step, the means 10 reorganize the dimensions of each of the contents, according to their values. Thus, the means 10 determine, for each of them, which of their three dimensions is their lowest dimension, and this lowest dimension is assigned to the "first dimension" of the content in the database. Their respective highest dimensions are also determined and assigned to the "third dimension" of the content. The remaining dimension is assigned to the "second dimension" of the content. In [Fig. 3], the dimensions mi, ma, and mo are represented, corresponding to the "first dimension," "second dimension," and "third dimension" of each content, respectively.

[0083] In a second, unillustrated variant, at least for some of the products to be arranged, their respective smallest, largest, and intermediate dimensions are not determined, and therefore these dimensions are not rearranged. Thus, for each of these products, the means 10 simply retrieve a first dimension, such as the one provided first in a list of product dimensions, a second dimension, and then a third dimension, and assign them respectively to the first, second, and third dimensions of each item. Therefore, the first dimension of the item is not necessarily the smallest, the third dimension the largest, and so on. This option is useful for products whose orientation a user wishes to fix, such as a bottle that must be oriented vertically.If, for example, the third dimension corresponds to a vertical z-axis, the user can fix the orientation of this product according to this orientation by indicating the height of the product as the third dimension and by not allowing the reorganization of the dimensions by the means.

[0084] In step 102, an arrangement is determined as follows: • - we sum the values ​​corresponding to their "first dimensions" res prospective mi, so as to obtain a first dimension of the space 24 encompassing them. On [Fig.3], this is the dimension “DIM1”; • - we identify the largest value corresponding to the "second dimension" mo among the second dimensions of the contents, so as to obtain a second dimension of the space encompassing them. On [Fig.3], this is the dimension “mo” of the content 22, renamed “DIM2”; • - we identify the largest value corresponding to the third dimension ma among the third dimensions of the contents, so as to obtain the third dimension of the space 24 encompassing them. On [Fig.3], this is the dimension ma of the content 23, renamed “DIM3”.

[0085] At step 103, we then have a bounded space 24, having the shape of a rectangular prism and encompassing an arrangement of the three contents as illustrated in [Fig.3], that is to say in particular with the three contents juxtaposed according to their respective first dimensions, oriented along the largest of their second dimensions and along the largest of their third dimensions so that the largest of the second and third dimensions border the whole.

[0086] This space contains the content arranged in the manner described, which can be provided to a user through interactive means, via displaying the arrangement on a screen, and / or by transmitting the coordinates of the arranged content. The resulting dimensions of the space, which correspond to the respective sums of the first dimensions, the largest of the second dimensions, and the largest of the third dimensions of the content, can also be provided to the user.

[0087] It also follows that, in the case where, in accordance with the first variant, the first dimensions correspond to the minimum dimensions of each product, it is particularly advantageous to have juxtaposed the contents along these minimum dimensions.

[0088] As will be described below in the context of the method for assigning packaging to a logistics unit, a user can then choose an actual container, such as packaging, a pallet, a container, or a truck, that corresponds as optimally as possible to these dimensions, in which the actual contents can be arranged according to the determined plan. In particular, the means determine the "minimum dimensions" of the container encompassing these contents; these three "minimum dimensions" simply correspond to the sum of the first dimensions of the contents, the largest of the second dimensions of the contents, and the largest of the third dimensions of the contents. The resulting plan provides the user with the arrangement of the contents to be respected for the container.

[0089] We will now describe, with reference to figures 4 to 7, a second method of implementing 200 a plan for determining the arrangement of contents in a container.

[0090] In step 201, the data for the contents to be arranged is retrieved, as in step 101. Step 202 corresponds to the formation of an initial bounded space that will constrain the search for the optimal arrangement in the following steps. The dimensions of this bounded space are therefore the "maximum dimensions" of the container, which cannot be larger. To do this, the means 10 identify the largest content among those to be arranged in the container. Then they determine a value, called the "value to add," corresponding to the sum of the maximum dimensions of each content except the largest. In other words, for each of the contents except the largest, they identify which of the three dimensions of the content is the largest, and then they sum these dimensions.Next, the means assign to the first dimension of the bounded space, that is, to the "first maximum dimension of the container," the sum of the first dimension of the largest content and the "value to be added." They assign to the "second maximum dimension of the container" the sum of the second dimension of the largest content and the "value to be added." Similarly, they assign to the "third maximum dimension of the container" the sum of the third dimension of the largest content and the "value to be added." In other words, this bounded space is formed, in all three dimensions, by the largest possible juxtaposition of the three contents. It is therefore certain that the contents cannot be arranged in a larger space if they are simply juxtaposed with one another.

[0091] It is now considered that this first bounded space or first empty space forms the container in which the contents are to be arranged. This is space 31 on [Fig.5].

[0092] Thus, in step 203, one of the first contents, here a content 32, is virtually placed in the empty space 31, at a predetermined position within this container 31. By "virtual" placement or arrangement, we mean that the computer means 10 consider the arrangement for the purpose of intermediate calculations, without this generating a real effect or a final result. A "virtual" placement or arrangement does not necessarily mean that the arrangement is virtually displayed on a screen. It differs from a real arrangement or real placement, which would involve an arrangement actually performed using real contents and containers.

[0093] This predetermined virtual placement position corresponds for convenience to the placement of a vertex of the content 32 at the coordinates (0, 0, 0) of the container 31, that is to say in a corner of the container 31, in a manner juxtaposed to at least three of the four virtual “walls” of the container.

[0094] Alternatively, the process can be configured beforehand so that this first content The item with the largest volume among the items to be arranged is placed first.

[0095] In another variant, the volume is replaced by one or more other characteristics specific to the content, or it is combined with this or these other characteristics. These additional characteristics correspond to the weight of the content, its fragility, its perishability, its radioactivity level, or another characteristic chosen by the user and available to the means 10, i.e., recorded in a database. For example, the heaviest or least fragile item is placed first, and so on. In the case of a combination, the means 10 determines a value combining these characteristics to perform the sorting. This variant can be chosen by a user wishing to take into account the characteristic(s) of their choice. They therefore configure the process accordingly.

[0096] In step 204, the resulting empty spaces in this container are determined in accordance with the document "GONÇALVES, José Fernando and RESENDE, Mauricio GC. A biased random key genetic algorithm for 2D and 3D bin packing problems. International Journal of Production Economies, 2013, vol. 145, no. 2, p. 500-510", which will be referred to hereafter as "reference 1", itself referring to the document "LAI, KK and CHAN, Jimmy WM. Developing a simulated annealing algorithm for the cutting stockproblem. Computers & industrial engineering, 1997, vol. 32, no. 1, p. 115-127", which will be referred to hereafter as "reference 2". Thus, the computer means 10 determine in the container the largest possible rectangular prism-shaped empty spaces, illustrated in [Fig.6] by spaces 33, 34 and 35, taking into account the positioning of the first content 32 placed virtually in the container 31.The coordinates and / or dimensions of each of the empty spaces 33, 34 and 35 are thus known by means 10.

[0097] In step 205, some of the determined empty spaces are excluded. In particular, these are empty spaces whose dimensions are too small to include any of the remaining contents to be arranged, or spaces included within other, larger empty spaces. This step does not exclude any space in [Fig. 6].

[0098] In step 206, one of the remaining contents to be arranged is selected. Optionally, the remaining contents to be arranged may have been pre-sorted by descending volume, or according to one or more other characteristics, so that the choice of the content to be arranged is determined by this sorting. This sorting may have been configured in this way beforehand by a user.

[0099] In step 207, the selected content is placed according to the principle of the heuristic called DFTRC2 of "reference 1", as illustrated in [Fig. 7]. This figure illustrates, in two dimensions, two possible positionings of content remaining to be arranged in the container 31, either above or beside the content 32. The distances between these possible positionings and the corner 38 of the container are calculated and compared, before the positioning corresponding to the longest distance is chosen. Of course, [Fig. 7] illustrates this principle in two dimensions for simplicity, but the means 10 consider all objects and therefore distances in three dimensions. In other words, the means 10 virtually place the chosen content in each of the empty spaces selected in step 205, with a content vertex as close as possible to the origin (0, 0, 0) of the container, and they calculate, in each of these positions, the distance between another predetermined point of the container and the content vertex closest to that point. As already mentioned, by "place," we mean that the computer means 10 "consider" a positioning, without it being constructed virtually, but solely for calculation purposes.The predetermined point 38 of the container used to calculate these distances corresponds to the furthest possible coordinates from the origin (0, 0, 0); it is therefore the vertex of the container opposite this origin in three dimensions. The chosen positioning, among the tested positionings, is the one corresponding to the greatest calculated distance.

[0100] It should be noted that "reference 1" refers to a Euclidean distance of type

[0101] [Math.sl] Dist 2 =(Dx- dBO ) 2 + ( W - y - wBO ) 2 + (H -z-hBO) 2

[0102] With D, W and H the dimensions of the container 31, x, y and z the coordinates of the maximum empty space considered, and dBO, wBO and hBO the dimensions of the contents 32 in a given BO (for “Box orientation”) orientation.

[0103] In the context of the invention, the following distance will be preferred:

[0104] [Math.s2] DDist = ^-x-dBO\ + ^Wy-wBC\ + ^Hz-hBO\

[0105] Indeed, this distance proves to give results of more optimized arrangements on average.

[0106] In step 208, the step of determining the empty spaces resulting from step 204 is repeated, this time on the basis of the container including the first and second arranged contents.

[0107] In step 209, the exclusion step 205 of certain resulting empty spaces is repeated.

[0108] In step 210, one of the other remaining contents to be arranged is selected.

[0109] This content is selected according to a prior content sorting process, particularly if, as mentioned in step 206, the content has been sorted by descending volume or according to one or more other characteristics. However, it can also be selected according to an order predetermined by a user, or randomly. It is this latter case that is applied, in particular, with reference to implementation method 300 described below.

[0110] In step 211, step 207 is repeated with this content.

[0111] These steps are repeated until all the contents to be arranged are virtually arranged by means 10 in the container determined in step 202.

[0112] In step 212, a minimal space, in the form of a rectangular prism, is then defined, encompassing the virtually arranged content. The means thus determine, on the one hand, its dimensions and volume, and on the other hand, form the layout plan to be provided to the user, who can then apply it to their actual content. An example of a virtual layout with multiple contents, obtained by this process 200, is illustrated in [Fig. 8].

[0113] In many cases, thanks to the virtual placement steps conforming to the maximum empty spaces determined, this minimum space will be less voluminous than the bounded space 31 determined in step 202 and less voluminous than the space determined by the process 100.

[0114] Here again, as at the end of process 100, it is then possible to provide a user with the way in which the contents have been arranged virtually, by means of a screen and coordinates, and the arrangement plan can also contain, in addition to these elements, the minimum dimensions determined in order to choose an optimized packaging, pallet, container or truck.

[0115] In optional, unillustrated steps, the possible positioning of each piece of content, both the first and the remaining content to be arranged, includes the possible orientations of the content. Thus, in step 207, not only are the different possible locations of content oriented in the same way tested, but also the different possible orientations of the content for each possible location. Therefore, the different possible "BO" (for "Box Orientation") in the equation described above are tested.

[0116] Similarly, at the time of placing the first content in step 203, the distances from step 207 can be compared for each possible orientation of this content in the predetermined location, at position (0, 0, 0), so as to choose the orientation for which the distance is the greatest.

[0117] The number of orientations tested for each piece of content, or even the choice of orientations tested, can be configured beforehand by a user of this process. This configuration can be applied to all content indiscriminately, but it can also be specific to each piece of content. Thus, certain orientations can be authorized for one piece of content but not for another.

[0118] We will now describe, with reference to [Fig.9], a third implementation mode 300 for determining an arrangement plan, implementing a biased genetic algorithm with random keys, part of which is described in "reference 1".

[0119] In step 301, the corresponding data is retrieved, as in steps 101 and 201. to the content to be arranged.

[0120] At step 302, the contents are sorted according to their decreasing volume.

[0121] At step 303, the computer means 10 determine a sequence of random digits between 0 and 1, these are the random keys, or numerical scores.

[0122] In step 304, and in a manner not described in reference 1, the means 10 reorder the contents according to this sequence and their initial position in the list sorted by decreasing volume. For example, for a list of three contents, if the random sequence consists, in this order, of the scores 0.3, 0.7, and 0.4, the means reorder the contents by placing the smallest of these contents in the first position because 0.3 is the smallest score, the largest of the contents in the second position because 0.7 is the largest score, and the one with an intermediate volume last because 0.4 is the intermediate score. Thus, the random sequence defines an order, or a sequence, of the contents to be arranged according to a first arrangement plan. This principle will be used again later.

[0123] In step 305, the means 10 determine this first arrangement plan in accordance with the process 200 described above, that is, by searching for the maximum available spaces. The order of the contents to be arranged is defined by the sorting in step 304. It should be noted that where "reference 1" encourages assigning numerical scores equally to the different orientations of the contents, which are thus treated as separate contents, the invention alternatively provides for carrying out the process 200 by testing all or several of the possible orientations, taking into account the parameter constraints or the characteristics of each of the contents to be arranged, at the time of choosing the positioning of the contents in the empty spaces, the number of orientations tested being parameterizable. Thus, the choice of orientations is carried out internally within the process 200.

[0124] Next, steps 303 to 305 are repeated, thus generating new numerical scores for the same content, in order to obtain several layout plans for several different orderings of the same content, until all the content to be arranged has been chosen first. Alternatively, a limited number of iterations can be set beforehand.

[0125] The set of determined arrangements forms an initial population, or initial generation, of arrangement plans.

[0126] In step 306, the means 10 determine the void ratio of each minimum container determined in the arrangement plans of this initial population. To calculate the void ratio, the means relate the volume of a container with minimum dimensions, determined by the arrangement determination process 200, to the sum of the volumes of the contents. The means 10 then store the results of the processes 200 implemented in step 305 and therefore the different arrangement plans, associated with their emptiness rate.

[0127] The means then proceed in the following steps to create a next generation of layout plans for the same content.

[0128] Thus, in step 307, means 10 implement a selection step, according to the genetic algorithm, of some of the designs from the initial population. This selection is carried out on the basis of the calculated emptiness rate. Thus, the means rank the designs by emptiness rate and select only a predetermined number of these arrangement designs, for example, the designs corresponding to the 20% of designs with the lowest emptiness rate.

[0129] In step 308, the selected designs, forming the "elites," are crossed with each other and / or with the remaining designs from the initial population, according to the genetic algorithm. Thus, to perform this crossover, it is important to remember that each of these designs is associated with a series, or sequence, of scores between 0 and 1, and a gap percentage in this sequence. Within this framework, the means 10 randomly determine the position of the score from which the means 10 swap, two by two, the scores of these two selected sequences, called "parents," so as to generate "child" sequences comprising initial scores identical to those of one of the parent sequences and subsequent scores identical to those of the other parent sequence. By repeating these crossovers on several parent sequences derived from the "elites," the means produce several child sequences.These "child" sequences are therefore each made up of a score sequence between 0 and 1, each forming a new order of contents to be arranged.

[0130] Thus, in step 308, the resulting plans from the crossover, which form the generation following the initial population, are subjected to the steps of process 200 for each of the "child" sequences, determining their arrangement plan. Then, their respective emptiness levels are in turn determined.

[0131] Again, the selection steps 307 and crossover steps 308 are carried out according to these vacancy rates, to form subsequent generations of arrangement sequences. The population that followed the initial population therefore replaces the latter for the reiteration of the selection and crossover steps, to form a new generation, which is in turn subjected to the selection and crossover steps, and so on.

[0132] During these steps, each arrangement plan determined on the basis of these arrangement sequences, and each emptiness rate of these plans, are saved by means 10.

[0133] Steps 307 and 308 are no longer repeated when a predetermined number of iterations, in particular configured by a user, is reached, or when it is determined by means that the empty rates of successive plans no longer decrease sufficiently fissally, or even go back, after the crossing stages 307 and 308 of the last generation gives birth.

[0134] Alternatively, the stopping condition can also be provided for when a given plane has reached a predetermined emptiness rate.

[0135] At step 309, the means 10 select the arrangement plan which, among all the arrangement plans determined at all stages, i.e., from all populations, has the lowest vacancy rate. Thus, this arrangement plan is the result of this process 300.

[0136] In one variant, among all the arrangement plans determined at all stages, i.e., for all populations, the means 10 identify the arrangement plans that meet one or more criteria previously selected by the user. These criteria relate to the weight, fragility, radioactivity level, or perishability of the arranged contents. For example, if the user has configured the means 10 to require an arrangement organized according to the weight of the contents, then the means 10 identify only the arrangement plans in which the heaviest contents are located below the lighter contents. If the criterion refers only to a radioactivity level, the means identify the plans in which highly radioactive contents are surrounded by contents that limit the emission of radioactive substances outside the container, for example.It is then, among all the plans identified as corresponding to one or a selected criterion or set of criteria, that the means 10 determine the layout plan with the lowest void rate, plan which then forms the result of this process 300. .

[0137] Optionally, in addition to the crossover step, the means 10 also perform a mutation step between two successive generations. In this way, they randomly modify one or more of the numerical scores of one or more parent or child sequences. This mutation step increases the element of chance in the order of the contents to be arranged in order to explore arrangements that would not have been explored otherwise through the parent lineage.

[0138] This 300 implementation is more optimized than the 200 method because it compares the results of several 200 methods based on different content arrangement sequences, i.e., different orders of content arrangement. In particular, for a large number of contents to be explored, this 300 method generally optimizes the empty rate on average compared to a 200 method based on a random or arbitrarily fixed arrangement order, for example, with contents arranged in descending order based on their volume. Furthermore, the 300 method avoids the exhaustive traversal of possible arrangements compared to a classic algorithmic approach where all possibilities would be explored. It therefore allows for finding an exact solution. or approaching an exact solution more quickly.

[0139] We will now describe, with reference to [Fig. 10], a fourth implementation method 400 for determining a layout plan. This involves implementing at least two of the three implementation methods 100, 200 and 300 described previously, comparing the layout plans determined by each of them, and selecting the most appropriate one.

[0140] Thus, in step 401, means 10 implement process 100 to determine a first arrangement plan of contents in a container.

[0141] In step 402, these means determine the volume of the container resulting from this arrangement plan, that is to say resulting from the determined arrangement of the contents in the container corresponding to the minimum dimensions determined in step 103.

[0142] At step 403, the means implement the steps of process 200 to determine a second arrangement plan of the contents in a container.

[0143] At step 404, these means 10 determine the volume of the container resulting from this second arrangement plan, that is to say resulting from the determined arrangement of the contents in the container corresponding to the minimum dimensions determined in step 212.

[0144] In step 405, the means select, from the two plans, the one whose resulting container has the smallest volume.

[0145] Alternatively, rather than comparing volumes, the means compare the void ratios generated by the containers determined for these contents.

[0146] Alternatively, in step 403, the steps of process 300 are not implemented, but rather the steps of process 200. In this case, naturally, the means determine in step 404 the volume of the container resulting from the plan determined by process 300, and it is this volume that is compared in step 405. The choice between process 200 and process 300 may depend on a level of service chosen by a user. Thus, if the required level of service is simple, the layout plan of process 100 is compared to that of process 200. If the required level of service is more comprehensive, the layout plan of process 100 is compared to that of process 300.

[0147] Of course, in this mode 400, the steps of processes 100 and 200 or 100 and 300 can be executed in a different order or in parallel.

[0148] This implementation method 400, based on two approaches and the comparison of their results, makes it possible to optimize the layout plan for each set of contents to be arranged. Indeed, while, on average, method 200, and even more so method 300, provide more optimized layouts than those of method 100, i.e., with smaller final container dimensions and therefore lower empty space ratios, in some cases the container volume determined by the method 100 is lower than that resulting from the other implementation methods, for the same content to be arranged. Comparing the results of processes 200 or 300 to that of process 100 therefore always allows the most optimal arrangement to be chosen. Furthermore, the computing effort required by process 100 is relatively low compared to that of process 200, and especially process 300, so the additional time allocated to process 100 and to comparing volumes or void ratios is negligible.

[0149] Alternatively, it can of course be envisaged that the results of processes 200 and 300 are compared. It can also be envisaged that the three processes 100, 200 and 300 are implemented and their results compared.

[0150] We will now describe, with reference to [Fig.1 1], a fifth implementation method 500 for determining a layout plan.

[0151] In step 501, the means 10 retrieve the data corresponding to the contents to be arranged, but also, and this is the difference with the previous implementations, the data corresponding to a container. This container can be obtained by these means 10 from a list of containers, possibly sorted. The container can, for example, correspond to packaging in which the arrangement of the contents is to be virtually tested. Thus, in this implementation, step 202 of the implementations 200 to 400 described previously is not performed to generate a first empty bounded space, because this first empty bounded space in which the contents are to be arranged is, in this implementation 500, that of the chosen container.

[0152] In step 502, all the steps of process 300 are carried out for these contents and this container, the only difference being the absence of step 202, as explained above, which is replaced by the step of providing the dimensions of the container. A plan for arranging the contents in the chosen container is then determined using the random-key genetic algorithm.

[0153] In other words, this fifth embodiment 500 is the application of the genetic algorithm of process 300 described above to contents for a container defined upstream. The objective is therefore no longer to determine the minimum dimensions of a container encompassing the contents, but solely the arrangement of these contents within this container provided upstream.

[0154] This embodiment 500 is particularly useful for testing several containers corresponding to real containers, for example, packaging available in a warehouse, in order to choose the one in which the arrangement of the contents is most appropriate. This embodiment will therefore be mentioned below in the context of an embodiment 800 of a method for assigning packaging to a logistics unit load.

[0155] We have thus described five modes of implementation of a method for determining an arrangement plan of several contents in a container. They are all implemented automatically by computer means 10, such as a computer, from the data corresponding to contents, and possibly, for the fifth mode 500, from the data corresponding to a container.

[0156] The user implementing this process through a method 10 can therefore obtain one or more layout plans for contents within a container. This is particularly useful in the case of a warehouse of logistics load units to be shipped. Thus, the order picker no longer chooses the packaging visually, but selects it based on the dimensions of the virtual container generated by the layout process. Furthermore, these means also provide the order picker with the positions of the contents, i.e., the products, to be arranged in the manner determined by the process, within the container. Therefore, the order picker does not have to worry about optimizing the layout; they can simply follow the instructions provided by the means 10 through the determined layout plan.These instructions can, for example, be provided to the order picker via a screen displaying the positions and orientations of the various contents corresponding to the logistics unit that the order picker must prepare. Alternatively, these positions can be provided to other automated means, which then automatically arrange the products in the packaging according to the plan determined by the means 10.

[0157] By optimizing the arrangement of contents within a container, and in particular by optimizing the arrangement of products within a logistics unit of measure (LUM) in its packaging, this process makes it possible to select more suitable packaging, especially with dimensions as close as possible to the optimized arrangements, and thus to reduce the empty space in the packaging. By automatically providing the appropriate arrangement and container, it allows for the availability and therefore the operational use of a wider variety of packaging types in the warehouse. It enables the selection of the optimum packaging and the optimized arrangement without delaying the preparation of the packaged LUM for shipment.

[0158] In addition to allowing the arrangement of products in packaging, this method is also suitable for arranging several logistical load units, particularly packaged ones, which form contents, in a pallet, container, or truck, which form a container. It is also suitable for arranging several pallets or containers, which form contents, in a truck, which form a container.

[0159] II. Method for assigning a package to a logistics load unit

[0160] The inputs of this process, implemented by computer means 10, are data structures corresponding to products intended to be grouped together to form a logistics unit to be packaged. The output of this process is the selection of a package, from among several possible packages, to pack each logistics unit before shipment. The order picker can then choose the appropriate package for the corresponding logistics unit. Alternatively, the output of the process consists of ideal packaging dimensions for the logistics unit, the packaging then being custom-made, either manually or by robot. Management of variable-sized packaging

[0161] Precise packaging dimensions are necessary in the processes described in this application. Therefore, in unillustrated steps carried out before or during the processes described in full in this application, means 10 identify, among the packaging used in the processes, packaging known as "variable-sized" packaging. This refers to packaging whose dimensions in use can vary depending on how the user handles it. This applies to plastic bags, but also to gusseted packaging, or "variable-sized" cartons. Means 10 then implement calculation methods known to those skilled in the art and specific to each type of variable-sized packaging to determine their dimensions. This may involve, in particular, taking into account the dimensions of the packaging in its most extended configuration.Once these dimensions are known, these are the dimensions that are recorded for the respective packaging and taken into account in the processes described in this application.

[0162] Grouping of products into a logistics unit load

[0163] With reference to [Fig. 12], a process 600 for grouping products into a single logistics unit will be described, carried out prior to the process of assigning packaging to a logistics unit described below. It is implemented automatically by computer means 10. These receive a list of shipments, each shipment consisting of products to be sent to the same location, and therefore potentially grouped together.

[0164] In step 601, the means consider one of the shipping lists and determine whether it contains a single product. If so, they create a logistics load unit, that is, a data structure associated with that logistics load unit, and include only the product in it. The logistics load unit then proceeds to step 604. If not, and therefore the shipment contains multiple products, it proceeds to step 602.

[0165] In step 602, the means check whether, in the shipment, certain products are associated with a requirement for exclusive packaging. For each of these products, the means create their own logistics load units, which are therefore only intended to contain this product, and the logistics load units proceed to step 604. For the other products in the shipment, the means create a single logistics load unit which will group these other products not requiring exclusive packaging, and the means proceed to step 603 for this logistics load unit.

[0166] In step 603, means 10 identify, among the products comprising the logistics unit load, whether any of them are associated with specific characteristics implying particular packaging requirements, i.e., with packaging "types". Throughout the application, "packaging type" refers to packaging associated with a specific kind of packaging, packaging of this kind, or type, being similar in structure or material. For example, "double-wall corrugated cardboard packaging" corresponds to a particular packaging type, distinct from "single-wall corrugated cardboard" packaging. "Cardboard" packaging is a distinct type from "plastic" packaging, "paper" packaging, or packaging made of "composite material". Packaging may alternatively or additionally be classified by "robustness" type, for example by a score, since generally one packaging type is more or less "robust" than another packaging type.The possible packaging types are known to those skilled in the art and will not be listed exhaustively. This type of data is recorded upstream in an undescribed manner. Here, at step 603, the system then associates the most robust packaging among those required by the products with the logistics unit of load, if some of these products require packaging of particular robustness.

[0167] The logistics load unit is ready to proceed to the packaging assignment process, which will be described below according to two main modes of implementation 700 and 800 illustrated in figures 13 and 14. In the case where a packaging type has been selected in step 603 for this logistics load unit, the packaging assignment process will only be implemented for a list of available packages corresponding to the selected type.

[0168] Step 604 is implemented only for logistics load units containing a single product. Means 10 check whether this product is associated with a required or pre-calculated package. If actual packaging is available at the user's location, particularly at the order picker's, the packaging assignment process of methods 700 and 800 does not need to be implemented. Otherwise, this logistics load unit, containing only one product, is subject to the following process like the others. "Pre-calculated" or "required" refers to specific packages that are directly associated with the logistics load units beforehand, via database entries, so that the process described below, which aims to select a package from among the available packages, This is not applicable to these logistics load units. In particular, "imposed" packaging is generally imposed on the product by the logistics provider. "Pre-calculated" packaging is determined by means 10, in an undescribed manner, based on the logistics provider's order history.

[0169] Finally, it should be noted that, for certain logistics load units comprising only one product, the product is "pre-packaged," that is, it already consists of packaging. These products, and therefore the corresponding single-product logistics load units, are naturally excluded by means 10 of this grouping process and are not subject to the packaging allocation process that follows, since by definition these logistics load units already consist of packaging. Packaging allocation

[0170] With reference to [Fig. 13], we will first describe a first implementation method 700 of a packaging assignment process to a logistics unit load. Like all the processes described, it is implemented by computer means 10.

[0171] The means traverse the list of logistics load units and consider them one after the other. The following procedure thus concerns only one of these logistics load units to be packed, the same process being repeated on the others.

[0172] If the logistics unit of load comprises a single product, it goes directly to step 702, and is assigned the dimensions of its product.

[0173] In step 701, logistics load units comprising several products are subjected to the arrangement determination process described above, according to implementation mode 100, 200, 300, or 400. In other words, the means 10, which store the data—that is, dimensions and other coordinates—of the contents in the form of rectangular prisms corresponding to actual products, determine the arrangement plan of these contents, as well as the minimum dimensions of the container intended to encompass these contents. The choice between implementation modes 100, 200, 300, or 400 of the arrangement determination process depends on a level of service required by a user, by a predetermined upstream parameter. It can also be a one-off choice made by the user of the process for a particular logistics load unit or group of logistics load units.At the end of this step, the minimum dimensions determined by the layout process, regardless of its implementation method, are assigned to this logistics unit.

[0174] Alternatively, the arrangement of the products in the container, and therefore the minimum container dimensions, could be determined separately, without hindering the steps carried out upstream or downstream in this packaging allocation process for a logistics unit. Indeed, all the steps of the packaging allocation process are independent of the steps of the plan determination process layout. However, in order to reduce the empty rate of logistics load units, it is advantageous to proceed with the layout determination process as described above according to its different modes of implementation.

[0175] In step 702, means 10 obtain the list of available packages for this logistics load unit. These are the package references available in the warehouse. Alternatively, only packages corresponding to a packaging type identified in step 603 are placed in the list of available packages for this logistics load unit.

[0176] In step 703, from the list of packages, means 10 select only those that are physically capable of containing the logistics unit of load, that is, whose first dimension is greater than the first dimension of the logistics unit of load, whose second dimension is greater than the second dimension of the logistics unit of load, and whose third dimension is greater than the third dimension of the logistics unit of load. Alternatively, the selection is more reliably provided for packages whose smallest dimension is greater than the smallest dimension of the logistics unit of load, whose intermediate dimension is greater than the intermediate dimension of the logistics unit of load, and whose largest dimension is greater than the largest dimension of the logistics unit of load.In this way, it is certain that the selected packaging is spatially suitable for containing the logistics unit load. In another variant, this verification / selection can be carried out later, at the time of step 707 described below.

[0177] In step 704, the means perform a prioritization step based on criteria parameterized by the upstream use, and a sorting step based on this prioritization, on the packages selected in step 703. According to a first option 704-A, this prioritization is performed solely based on the volume of the packages. Thus, the packages are sorted by increasing volume. Hereafter, we will refer interchangeably to "criteria" and "characteristics." This is a variable specific to an entity and known as such by the means 10.

[0178] Alternatively, according to option 704-B, a packaging durability criterion, or characteristic, is added to the packaging volume. Thus, packaging is first assigned a durability score based on its type, specifically a number between 1 and 2, but which could, of course, fall within a different range. Reusable packaging, in particular, is associated with a lower durability score than new packaging. Packaging that has been used many times has an even lower score. The materials used in the packaging also play a role in the score assigned to the packaging. These scores are defined beforehand by a logistics expert or another user. To take them into account in addition to the volume in the Within the framework of this step 704-B, the means 10 multiply the actual volume of the packaging by the associated sustainability coefficient. The resulting data can be called "fictitious volume," as it associates the actual volume of the packaging with a coefficient. The packages are thus sorted by increasing fictitious volume. Therefore, for packages of equal actual volume, one recorded as more sustainable than another will have a smaller fictitious volume, its sustainability score being lower, and will thus be given priority.

[0179] Alternatively, according to option 704-C, at least one other characteristic can be taken into account, in addition to the actual or fictitious volume, to perform this packaging sorting step. This is, in particular, the price of the packaging. To associate it with the actual or fictitious volume of the packaging, means 10 perform a normalization of all the variables to be taken into account. Thus, they consider all the criteria of all the packaging to be sorted and normalize them according to the following formula:

[0180] [Math.s3] / (max(x) -min(x)) , where x is the type of variable to be normalized (either the actual or fictitious volume, or the price), max(x) and min(x) are the maximum variables of the same type among all packages, and x is the value of the variable to be normalized before normalization. Xn^w is necessarily a value between 0 and 1.

[0181] After normalizing the variables of the packages to be sorted, the means 10 sum these variables for each package according to predetermined weighting factors. For example, it may be predetermined that the fictitious volume has twice the priority of the price, so that the factor associated with the fictitious volume is 1 versus 2 for the price, thus resulting in a high price and a high sum. The packages to be compared are then sorted according to the result of their respective associated sums, in ascending order. Alternatively, the factors can be assigned differently, by reversing 1 and 2 in the example, and the sums can be sorted in descending order.

[0182] According to a variant 704-C, other criteria, or characteristics, may be taken into account, such as the greenhouse gas emission rate associated with the packaging. The means normalize the variables as indicated above in order to obtain, in the same way, comparable data and sums forming a prioritization value, so that the packaging can be sorted.

[0183] At the end of step 704, and regardless of the variant implemented, the packages are now sorted, at least according to their actual volume, or even by combining it with other criteria. The result is that they are sorted in such a way that, all other things being equal, a package with a smaller volume has priority over a package with a larger volume. By "all other things being equal," we mean means that all other variables are identical.

[0184] At step 705, the means 10 consider the first package on the list to be sorted, so as to subject it to the subsequent steps. Since this package has priority over the others, it would indeed be the most appropriate for the logistics unit of load if its allocation is confirmed. The means 10 determine whether margins are computer-associated with products forming the logistics unit of load, and if so, assign the highest margin to the package dimensions for the following steps. Otherwise, the package itself may have been previously associated with a margin to be respected, which is then selected by the means 10 in the same way. Finally, as a last resort, an overall margin may have been previously configured by a user, which is then selected by the means 10 at this step.The result is that the "reference dimensions" of the packaging chosen at the beginning of the step can, at the end of this step 705, be slightly modified by the means 10 to maintain a margin, resulting in the "usable dimensions" of the packaging. "Useful dimensions" refers to the dimensions used in the rest of the process, except for void ratio calculations, and also to the actual usable dimensions of the packaging. In particular, without a margin, it can be difficult to arrange the intended products in the packaging. Thus, in the following sections, when using packaging dimensions, unless otherwise specified for void ratio calculations, reference will be made to the useful dimensions calculated in this step 705, and by default to the dimensions as referenced and known by the means 10. For void ratio calculations, however, reference will be made to the "actual dimensions," as explained below.

[0185] In step 706, the means 10 perform a check to verify the suitability of the selected packaging's usable dimensions to the logistics unit load. In a variant 706-A, the means 10 only check whether the weight of the logistics unit load is less than or equal to the maximum theoretical weight the packaging can support. The weight of the logistics unit load is determined at this stage by summing the weights of the products, which are known beforehand by the means 10. If the suitability is confirmed, the selected packaging is assigned to the logistics unit load by the means 10. Otherwise, the suitability is rejected.

[0186] In a variant 706-B, after confirming the weight, the means check the void ratio generated by this packaging for this logistics unit load. This involves calculating the volume of the packaging and relating it to the summed volumes of the products in the logistics unit load. The means 10 use the "actual" dimensions and not the "usable dimensions" of the packaging for this purpose. Indeed, if there is a margin, it increases the void ratio and must therefore be accounted for as such. If the void ratio is less than a predetermined threshold, called the "individual void ratio threshold," for example 60%, the suitability is confirmed; otherwise, it is not. This threshold can be predefined by a user, for example a logistics provider, or chosen by a customer, for example a recipient or sender of the logistics unit load.

[0187] In an unillustrated variant of this step 706-B, a comparison of void ratios is implemented not on a single logistics load unit but for a plurality of logistics load units. Thus, if the user has previously configured the process in this way, to confirm or not the suitability of a logistics load unit to an assigned package, the means 10 calculate the average void ratio of the logistics load units, whose suitability has been previously confirmed, for the same predetermined period (the same day, the same week, the same month) preceding the processing of this logistics load unit. If this average void ratio is less than a void threshold called the "overall void threshold" defined by the logistics provider, then the suitability of the logistics load unit to the assigned package is confirmed.Thus, even if this logistics load unit has an individual void ratio associated with its packaging that exceeds the expected individual threshold, its suitability is still confirmed because it follows a series of logistics load units associated with packaging that resulted in a sufficiently low average void ratio. This serves the objective of reducing the average void ratio of shipped logistics load units by allowing some of them to retain void ratios higher than a set individual threshold. Furthermore, according to this variant, if the average void ratio exceeds the overall void threshold, rather than rejecting the suitability of the current logistics load unit, the variant of this step 706-B as described above is implemented; that is, its individual void ratio is compared to the expected individual void threshold.

[0188] It can be foreseen, by configuration, that some of the characteristics of the logistics load units as known by means 10 make them exempt from the calculation of the empty rate and therefore from this step 706-B and its variants.

[0189] In a 706-C variant, the means also check, or alternatively the void ratio, whether the chosen packaging has a price exceeding a predetermined threshold, which may again have been chosen beforehand by a user. This threshold is generally specific to each product. Thus, if the chosen packaging corresponds to a logistics unit load including several products, the means determine the sum of the thresholds associated with each product to identify the desired maximum cost of the packaging.

[0190] If the packaging assigned to the logistics unit load has passed this step 706 according to at least one of its variants, in step 707 the means check several other suitability criteria. Thus, the means identify in their databases whether among the products forming the logistics unit there is one or more products considered "fragile". If so, the means 10 check that the packaging itself is registered as being "suitable" to contain a fragile product, or even to contain a product exhibiting the type of fragility in question. Finally, where applicable, means 10 verify whether the arrangement, determined by the arrangement process in step 701, respects the fragility of one or more of these products. In particular, it may be recorded that a product has specific characteristics involving packaging or placement requirements. For example, a fragile product must not be placed under another product, or under another product with a weight exceeding a predetermined value. Means 10 therefore verify at this step whether these potential constraints, known as pre-recorded characteristics in the databases, are met by the arrangement plan. If so, the allocation is confirmed; otherwise, it is rejected.

[0191] Alternatively, the suitability check may also cover the packaging dimensions, with the means verifying that each packaging dimension is equal to or greater than each dimension of the logistics unit load. This step is not necessary if the packaging selection in step 703 has already been verified.

[0192] At step 708, if the packaging is confirmed, it is assigned to the logistics load unit. The packaging assignment process to the logistics load unit then ends successfully.

[0193] In step 709, if the suitability check was rejected in any of the preceding steps and variants, the means select the next package from the sorted list from step 704 and repeat steps 705 to 707 until a package is considered suitable, or until the end of the list of sorted packages. Alternatively, the step may not be repeated when a predetermined number of packages that have undergone steps 705 to 707 has been reached.

[0194] In step 710, if no packaging from the list was deemed suitable in steps 706 and 707, means 10 can identify, via their database, that packaging not selected in step 702 is available in the warehouse. This applies in particular to the variant where only packaging with a certain type of robustness was selected in step 702. Thus, in step 710, packaging of a different type can be selected. This is especially the case if the selected packaging type criterion is robustness, and there are more robust packaging types in the database. Therefore, steps 704 and subsequent steps are repeated for packaging of this type. This step 710 can only be performed if the user has given prior authorization.

[0195] Step 711 takes place if no packaging from the list, or lists if step 710 has been implemented, has been deemed suitable during steps 706 and 707 of verifying the suitability between the packaging and the logistics unit load. The means 10 then offer the user, the logistics professional or order picker for example, The creation of custom packaging. In this case, the means 10 assign to this future packaging the minimum dimensions calculated for the logistics unit in step 701, that is, through the process of determining a layout plan according to implementation methods 100, 200, 300, or 400. In one possible variant, these dimensions are then displayed on a screen or provided by any means to a third party which produces the packaging manually. In a second variant, these dimensions are provided to a robot or other means not described here, which can then autonomously and automatically create the packaging. Like other packaging, this packaging contains a data structure available to the means 10, which then assign this packaging to the logistics unit.

[0196] As mentioned at the beginning of the description of this mode 700, the description concerned a single logistics load unit. Naturally, means 10 then repeat the steps for the next logistics load unit in the list of logistics load units.

[0197] We will now describe a second implementation 800 of the packaging assignment process to a logistics load unit. As with implementation 700, it is implemented after the grouping process into a logistics load unit has been carried out. Therefore, as with implementation 700, it only concerns load units which, after the grouping process 600, are without assigned packaging.

[0198] As with implementation method 700, the means consider each of the logistics load units one by one. The subsequent steps therefore concern the allocation of a package to a specific logistics load unit.

[0199] Unlike implementation method 700, in this implementation method 800 the process does not begin with the determination of the arrangement plan of the products of the logistics unit load, stated in step 701.

[0200] Thus, in step 801, means 10 retrieve the types of packaging corresponding to the logistics load unit, as in step 702.

[0201] In step 802, the means select only the packaging suitable for containing the logistics unit load, as in step 703.

[0202] In step 804, the means sort the selected packages, in the same way as in step 704, based on any identical variants. At the end of step 804, the selected packages are therefore sorted into a list, as at the end of step 704.

[0203] At step 805, a process begins for each of the packages on the list using the means 10. Unlike implementation method 700, this process does not stop as soon as a package is deemed suitable. Thus, a list containing at least one package is the subject of the following steps. The means first choose the highest priority packaging from the list sorted in step 804, and associate it with a margin determined in the same way as in step 705.

[0204] In step 806, the means 10 implement, for the logistics load unit and for the packaging selected in step 805, the arrangement determination process according to implementation method 500 described above. Indeed, as indicated in the description of this implementation method, it differs from other implementation methods of the arrangement determination process in that it provides the dimensions of an actual container as input. Thus, during the implementation of this step 806, the means 10 provide the "actual" and possibly "useful" dimensions of the packaging selected in step 805, and determine, via the genetic algorithm as described above in the context of method 300, the arrangement plan of the products of the logistics load unit in this packaging.

[0205] At step 807, means 10 perform a check of the suitability between the logistics unit load and the packaging in the same way as in steps 706 and 707. The result of this check is stored by means 10.

[0206] As mentioned above, the process does not stop here if the suitability is validated. Indeed, steps 805 to 807, and therefore in particular the method for determining the arrangement of mode 500, are repeated for the subsequent packages in the sorted list from step 804, and always for the logistics unit considered at the beginning of the process. The results of step 807 are therefore stored for each of these packages.

[0207] The repetition of steps 805 to 807 is interrupted after these steps have been implemented for a predetermined number of packages from the sorted list of packages, this number being previously set by a user of the process. The higher this number, the greater the number of packages "tested" via the arrangement process. These steps can also be interrupted if the list of packages has been completely processed.

[0208] Once these steps have been performed a predetermined number of times, the means 10 calculate, in step 808, for each of the packages whose suitability was verified in step 807, a void ratio. As in the rest of this document, this involves comparing the volume of the container, here the package chosen in step 805, to the total volume of the products forming the logistics unit load. Thus, at the end of this step 808, the means associate their respective rate with each logistics unit-package pair, the logistics unit load always being the same, if suitability has been verified, and, if applicable, what the associated void ratio is.

[0209] At step 809, if several packages have been deemed suitable, the means allocate to the logistics load unit the one for which the determined void ratio is the lowest.

[0210] Step 810 corresponds to step 710: if none of the packages can be assigned to the logistics load unit, the means seek to identify a selection of other packages of a possibly distinct type, to resume steps 802 and following.

[0211] At the end of this implementation mode, the process therefore identifies a suitable package for the logistics unit load, or does not identify any package.

[0212] As mentioned, the description concerned a single logistics load unit. Naturally, means 10 then repeat the steps for the next logistics load unit in the list of logistics load units.

[0213] Optionally, at the end of this second implementation method 800, if no packaging has been deemed suitable, the means 10 provide for the implementation method 700. Thus, depending on the level of service requested by a user, it may be provided that the method 800 is implemented as a priority, and that the method 700 is implemented each time that no packaging is assigned to the logistics unit of load by the implementation method 800.

[0214] III. Method for selecting optimized packaging based on logistics load units

[0215] The packaging selection process aims to identify, for a logistics provider, either based on previous orders that resulted in logistics units shipped by the provider or based on new products never shipped, which packaging references are most appropriate for products likely to be shipped in the future by the provider. This allows the logistics provider to anticipate future shipments by having packaging of the most suitable types and dimensions in stock, thereby reducing the empty space generated by packaged and shipped logistics units and avoiding unnecessary storage of packaging in the warehouse or excessively high empty space in the "packages." This can be described as a "process for enriching a catalog of packaging references." This process can be implemented independently of the two processes described above.Indeed, without implementing the allocation and arrangement processes described above, a logistics provider with appropriate packaging in their warehouse will generate, on average, less empty space than with inappropriate packaging. However, it is advantageous to implement all of the described processes. An order will be understood as comprising a list of at least one product ordered, most often several products ordered.

[0216] This packaging selection method based on logistics load units, implemented by means 10, therefore receives as input at least one list of orders, considered as based on products that will be shipped in the future by the same logistics provider. In a first implementation described below, the method In addition, it receives a list of specific packaging options to test on these products, selecting only the most suitable ones. It is possible to receive several lists of packaging options. In a second implementation method described below, it receives only the products and / or orders and deduces ideal packaging options to purchase, or even have custom-made.

[0217] It is the logistics provider's responsibility to configure which orders are supplied to the input means 10. These may be orders, consisting of products, shipped in the past. Indeed, it is common for the type of orders shipped in the past to be similar to those shipped in the future. It is therefore relevant to select packaging based on a history of previously shipped orders. This could, for example, be all the orders that the logistics provider has shipped over a predetermined period, such as a whole year, a season, or a shorter period, such as around Christmas. It could also be only a certain type of order that the provider has shipped. This process is implemented either on an ad hoc basis or at predetermined intervals by the logistics provider, for example, once a week or once a month, in order to update the identified packaging references.But the logistics provider can also, or alternatively, supply orders for products never shipped, for example, new products that it expects to deliver in the future. It then wants to anticipate the packaging to be held in stock for these orders.

[0218] We will first describe, with reference to [Fig. 15], a first mode 900 of implementation of a packaging selection process based on logistics load units.

[0219] In step 901, the means 10 obtain a list of products comprising orders previously shipped by the logistics provider, recorded as a shipping list, each shipment including products to be shipped. These are the orders corresponding to those the logistics provider wishes to test, to determine which packaging would be most appropriate in the future for similar orders. Alternatively, the means 10 obtain a list of products comprising orders never previously shipped by the logistics provider. These are, for example, new batches of products planned for Christmas. Alternatively, the list obtained contains both previously shipped and never-shipped orders. In all cases, the means have the necessary product characteristics, such as their dimensions, any additional characteristics: fragile, pre-imposed or not, margin, etc.

[0220] At step 902, the means obtain a list of packages. These packages, distinct from one another, are also provided by the logistics provider. They correspond to the package references already recorded in the database, that is to say, those of which The logistics specialist has available storage space in the warehouse or is already familiar with the logistics specialist. The logistics specialist then wants to identify which of these already known packaging options are the most appropriate, in terms of dimensions or type, for the products in step 901.

[0221] Alternatively, at this stage 902, other packaging options may be provided that the logistics provider has not already tested or for which it does not have actual packaging in stock. These "to be tested" packages may, for example, come from packaging suppliers other than the logistics provider's usual supplier. In this case, the logistics provider's objective is to test these new packaging options on its orders in order to identify whether any are more suitable than the packaging it currently uses.

[0222] Alternatively, it can of course provide a list including both packaging references which it uses and new packaging references to be tested, so as to identify the references with which it can improve the packaging catalogue at its disposal and those which it can ignore.

[0223] Means 10 process these products from step 901 and exclude shipments containing at least one product that no longer exists. Indeed, if a product shipped in the past no longer exists, it is not necessary to proceed with the subsequent steps for that product.

[0224] In step 903, means 10 group the products from step 901 into logistics load units, so as to create a list of logistics load units, and optionally determine the types of packaging associated with them, using steps similar to those of process 600 described above. The only difference is in step 604: for the implementation of process 900, for logistics load units including "pre-imposed" packaging, that is, packaging required in a predefined manner by a logistics load unit and thus associated with it in the database, means 10 checks whether this packaging exists among the packagings of step 902, and, if so, excludes the logistics load unit from the list of logistics load units created.Indeed, if a logistics unit requires specific packaging that is already known, it is not necessary to proceed with the following steps for that logistics unit since it is not necessary to search for better packaging for that logistics unit.

[0225] In step 904, the means iterate through each of the logistics load units in the list of logistics load units from step 903 and determine their dimensions for each of them. To do this, the means apply to each of these logistics load units the layout plan determination process according to one of the approaches 100, 200, 300 or 400, and assign to each logistics load unit the minimum dimensions of the container determined at the end of one of these approaches.

[0226] Alternatively, the means could determine the dimensions of each unit of The logistics load is handled separately within this packaging selection process based on logistics load units. However, it is advantageous for these logistics load units to be as compact as possible, so that the smallest possible packaging can be selected, making the arrangement process described above particularly relevant.

[0227] In step 905, the means 10 perform, for the list of packages obtained in step 902, the prioritization and sorting steps in the same way as in step 704 described above, including any variants described according to the user's choice. Thus, the packages are sorted at least by increasing volume in accordance with variant 704-A, but they can alternatively be sorted by fictitious volume in accordance with variant 704-B, or according to other criteria, in addition to the actual or fictitious volume, according to variant 704-C.

[0228] The following steps are carried out for each of the packages in this sorted list from step 905. In other words, means 10 considers in step 906 the highest priority package from the sorted list of packages to be tested before proceeding to the following steps, and the following steps will be repeated for each of these packages, in the order of the sorted list.

[0229] In step 907, the means create a local list of logistics load units, from the list obtained at the end of step 903, specific to the packaging chosen in step 906. In particular, if the means 10 have identified, during step 603 of process 600 implemented in step 903, a particular type of packaging associated with the logistics load units, only the logistics load units requiring the same type of packaging as that corresponding to the chosen packaging, or those not requiring any particular type, are selected to form this local list of logistics load units specific to the chosen packaging.

[0230] In step 908, the means 10 select from this local list of logistics load units from step 907 only those whose dimensions are less than or equal to those of the chosen packaging. Optionally, the means 10 can assign margins to both the logistics load unit and the packaging to perform this step, the margins being preconfigured by default or defined, possibly beforehand, by the user.

[0231] In step 909, the means scan the local list of logistics load units, generated in step 908, specific to the packaging selected in step 906, and perform, for each of these logistics load units, with respect to this packaging, the suitability verification steps of step 706, according to its variants 706-A, 706-B, or 706-C described above. When a logistics load unit successfully passes this verification step, that is, when it is deemed suitable for the packaging, the means 10 assign this logistics load unit to the packaging and increment a counter. of logistics load units allocated to packaging.

[0232] This step 909 is repeated for each of the logistics load units in the local list of logistics load units specific to the packaging chosen in step 906.

[0233] In step 910, when each logistics load unit in the local list has been checked for suitability with the packaging, the system determines, via a counter, how many units were deemed suitable for that packaging. If this number reaches a predetermined threshold, then the packaging is selected as one of the packages to be kept in the warehouse for future shipments. This predetermined threshold can be set by the user or by default. It can be configured to depend on the number of packages tested, the number of logistics load units, or more generally, the number of orders tested. It is considered that if the packaging reaches this number, this proves that it has been deemed suitable for many logistics load units, and therefore that it is likely to be suitable for future logistics load units from future orders.Furthermore, if this packaging is selected in this way, and only if this is the case, means 10 removes, from the list of logistics load units resulting from step 903, the logistics load units that were assigned to the packaging selected in step 909. Thus, the other packagings cannot be subject to the suitability check for these logistics load units, so as not to select redundant packaging references. By having pre-sorted the packaging references, it is ensured that only the highest priority packaging is selected, therefore in particular those generating the lowest void ratio or, moreover, for example, depending on the variant of step 704 chosen, those associated with particularly relevant durability.

[0234] The means thus repeat steps 906 to 910 for each of the packages in the list sorted in step 905, and as long as there are logistics work units remaining to be processed. In this way, the further down a package is in the sorted list—that is, the lower its priority—the fewer logistics work units remain to be tested, and therefore the less likely it is that the package will be selected. This, as mentioned, favors the selection of priority packages and the exclusion of others. Conversely, a lower-priority package being selected means that there were still many logistics work units unsuitable for the previous, higher-priority packages, so that this selected package is relevant in light of the incoming orders.

[0235] At the end of this implementation method, the logistics provider therefore has a list of selected packages, which are part of the packages provided in step 902. This list is the subject of a step 911 of sending the list to the logistics provider.

[0236] This allows it to acquire and store selected packaging for future shipments. By selected packaging, we naturally mean Reference to "packaging references" refers to a specific type and dimensions of packaging. The quantity of these packages, for each selected reference, is also data that can be provided by this process, since the process has determined the number of appropriate logistics load units for each package. By extrapolating based on the number and possibly the period covered by the input orders, the means 10 determine the number of packages to be acquired over a given period associated with each selected reference, and provide this data as well during this step 911.

[0237] Alternatively, this list is associated with a calculation report including other information relevant to the logistics provider or any other user of the process. In particular, means 10 can associate with each selected packaging reference the number of logistics load unit assignments, the packaging price if it is recorded in databases, and also the average void ratio of each package. For this last data point, this is particularly relevant if variant 706-B was implemented when verifying the suitability of the logistics load unit to the packaging.Alternatively, this void ratio can be determined downstream, for example when creating the calculation report, the means 10 calculating the ratio between the volume of the packaging and the volume of each logistics load unit deemed suitable for the packaging, regardless of the variant implemented in the previous steps, so as to determine the average void ratio between the packaging and the logistics load units allocated to this packaging.

[0238] Sending this list or calculation report to step 911 can be done by automated means, for example by email. Alternatively, it can involve displaying these results on a screen available to the user.

[0239] Alternatively or in addition, means 10 can automatically order the acquisition of the selected packaging references, or some of these references based on predetermined criteria, such as the void ratio, to store these packages and their appropriate number in the logistics provider's warehouse for future shipments.

[0240] We will now describe a second method 1000 for implementing a packaging selection process based on products and / or orders. It can be implemented as an alternative to method 900, or in addition to it. Unlike implementation method 900, it does not aim to select packaging references from a list provided by means 10, but rather to directly generate the most suitable packaging based on the input products and / or orders.

[0241] Thus, in step 1001, means 10 implement steps 901, 903 and 904 in such a way as to obtain a list of logistics load units based on input products, whether or not from orders shipped in the past, to be determined their types of packaging, possibly associated with them, and to determine their dimensions. Again, it is the user who chooses which commands to provide to the means 10. For step 903, contrary to what was indicated above, here the means do not compare the packaging types of the logistics load units provided with the types of packaging supplied, since no packaging reference is provided here. Thus, no logistics load unit is excluded here, unlike what is implemented in step 903 of process 900.

[0242] At step 1002, means 10 group the logistics load units from the list by packaging type, i.e. according to the packaging types associated in the database with these logistics load units during step 1001, so as to form a list of logistics load units by packaging type.

[0243] Alternatively, this step is not performed. Thus, the packaging, with or without an associated type, is not grouped by type. This is an option left to the user. In this case, the subsequent steps only concern a list: the list of all packaging.

[0244] In step 1003, the means consider one of these lists by type, or the single list if step 1002 is not performed. The following steps will therefore be repeated for each of the lists by type resulting from step 1002, that is to say, lists of logistics load units distributed by packaging type, or for the single list of packages if no grouping by type has taken place.

[0245] In steps 1004 to 1006, for the considered list of logistics load units, the means 10 implement a hierarchical clustering algorithm to select different combinations of dummy packaging dimensions appropriate to these logistics load units. This is described in detail below.

[0246] Different hierarchical clustering algorithms are known to those skilled in the art. They allow values ​​to be grouped into clusters, each cluster including values ​​close to one another, the number of clusters being predetermined and set by a user. In this step 1004, an algorithm of this type, which will not be described here, is implemented for each of the dimensions of the logistics work units in the list under consideration. Thus, the means identify the first, second, and third dimensions of each of these logistics work units, these dimensions having been determined previously in step 1001.To this end, in a first variant of this step, if the process user allows the orientation of the logistics load unit to be changed, then the means 10 assign the minimum dimension of the logistics load unit to the first dimension, the intermediate dimension to the second dimension, and the maximum dimension of the logistics load unit to the third dimension. In a second variant, if the orientation... The orientation of the logistics unit is fixed. By default, the first dimension received in a list of dimensions is assigned to the first dimension, the second to the second, and the third to the third. Thus, just as with products, the orientation of the logistics unit can be fixed, for example, if one of the products it contains must be kept vertical. As with products, it can be agreed that the third dimension corresponds to the vertical axis, and the first, second, and third dimensions are organized accordingly. Any other choice is, of course, possible. This ability to fix or not the orientations is configurable by the user beforehand, either globally or for each logistics unit.

[0247] Next, for all the logistics load units in the list under consideration, the means 10 group each of the values ​​of these dimensions into clusters in each of the dimensions in accordance with the "hierarchical grouping" algorithm, that is to say that the means group the values ​​into a predetermined number of value groups, each group containing the values ​​close to each other.

[0248] In other words, for the first dimension, the means 10 group the values ​​of each first dimension of each logistics load unit into clusters of that first dimension, the values ​​grouping around the provided values ​​according to a predetermined number of clusters. The means repeat this clustering step for the second and third dimensions.

[0249] For each of these dimensions, the predetermined number of clusters is set beforehand by default or by the user. Thus, it can differ depending on the dimension. For example, the values ​​of the first dimensions can be grouped into two clusters, meaning that the values ​​of the first dimensions of all logistics load units are grouped around two labels, while for the same logistics load units, the values ​​of the second dimensions can be distributed across five clusters, meaning that the values ​​of the second dimensions of all these logistics load units are grouped around five labels.

[0250] In step 1005, once this is implemented, the means assign to each cluster of each dimension the highest value of the dimension considered among the logistics load units grouped in that cluster. Thus, each cluster of each dimension is associated with a dimension value.

[0251] In step 1006, the means perform all possible combinations between these maximum values ​​of the first, second, and third-dimensional clusters, so as to determine, virtually, packages resulting from all these possible combinations. In other words, for each of the values ​​representing the first-dimensional clusters, the means associate them with values ​​representing the clusters second dimensions and values ​​representing the clusters of the third dimensions, to generate as many fictitious packages as possible combinations.

[0252] Steps 1004 to 1006 are repeated for each of the lists of logistics load units from step 1002 if there are several lists, i.e. for all possible types of packaging as they are associated with the logistics load units, if there has been grouping by type in step 1002.

[0253] In step 1007, means 10 perform a selection on these generated fictitious packages in order to highlight only the most relevant ones. Thus, in a first variant 1007-A, this selection is based on sufficiently large dimensions of the package so that a label can be affixed to it. Packages generated too small are therefore excluded. In variant 1007-B, any other selection criterion based on identified characteristics can be implemented.

[0254] In a variant 1007-C, the means 10 consider all, or some, of the logistics load units supplied as input, in step 1001, and they implement a step of verifying the suitability between a package and a logistics load unit, relating to the suitability between the dimensions of the package and the dimensions of the logistics load unit, for each of these fictitious packages, so as to select only the fictitious packages deemed suitable for a predetermined number of logistics load units.

[0255] In a variant 1007-D, prior to and in addition to this variant 1007-C, means 10 sort these dummy packages in accordance with step 704-A, or even 704-B or 704-C if they have corresponding characteristics of durability, price or other for these dummy packages.

[0256] Finally, in another variant 1007-E, the entire implementation method 900 is applied to these dummy packages, selecting only certain ones. These packages, resulting from this implementation method 1000, or a portion of these dummy packages, can thus be tested simultaneously with actual packaging references, within the framework of implementation method 900.

[0257] The list of generated packages is then sent to the logistics provider at step 1008, identical to step 911, i.e. by email or displayed on a screen.

[0258] The logistics provider then has a list of dummy packages suitable for its orders because the calculated dimensions come from the dimensions of the logistics load units calculated based on orders previously shipped or that it has identified as likely to be shipped in the future. The logistics provider can then seek to acquire packages corresponding to these determined dummy packages. This implementation method thus makes it possible to generate ideal packaging references for the incoming orders. Alternatively, means 10 can attempt to automatically acquire the generated packages.

[0259] In another, unillustrated variant, this implementation method 1000 is activated only in addition to implementation method 900. In this case, the list of logistics load units supplied in step 1001 contains only those logistics load units for which none of the packages tested in step 909 of process 900 were deemed suitable. In other words, these logistics load units lack suitable packaging among the tested packaging references; therefore, it is highly relevant to apply implementation method 1000 to these specific logistics load units in order to generate new, specific packages for them.In addition to the suitability as provided for in step 909 of process 900, this variant may provide for other criteria, such as an individual void ratio independent of the void ratios previously described, activating for the packages concerned this implementation method 1000 in addition to implementation method 900.

[0260] These implementation modes 900 and 1000 can alternatively be implemented together in a different way, depending on a choice of the user for example.

[0261] IV. Method for preparing a logistics load unit for packaging

[0262] We will now describe, with reference to Figures 17 to 24, a process for preparing a logistics unit for packaging, carried out in a warehouse, according to three implementation methods. The inputs supplied to the process are at least the products forming the logistics unit. The output of the process is the packaged logistics unit. Unlike most of the steps in the previous processes, which were implemented by computer, some steps in some of the implementation methods described below are carried out wholly or partly by a human, in particular by the order picker. The computer-automated steps are still implemented by the same means as before, while some steps are carried out by other automated means, which will be discussed where applicable.

[0263] The first embodiment 1100 is carried out in an installation 40 according to a first embodiment, the top view of which is schematically shown in [Fig. 17]. Part of it is illustrated in [Fig. 18] and another part in [Fig. 19]. We will first describe this installation.

[0264] This installation includes a product and packaging picking area 41, also known as a "picking area," and an order preparation area 42. A "picking area" is defined as an area identified as allowing the retrieval of items stored within it, for shipment, from known locations, i.e., locations whose positions within the picking area are known. Thus, each item location, whether the item is a product from an order or packaging, is designated by a unique identifier. The picking area 41 allows the product or packaging to be retrieved using this identifier. The same location may contain identical products or identical packaging. This identified location characteristic distinguishes a picking area from a mass storage area, in which items are stored by reference without the possibility of individual picking. Another characteristic that distinguishes a picking area from a mass storage area is generally the proximity of the picking area 41 to the preparation area 42.Since a collection step, described below, aims to collect the products and packaging from the collection area 41 in order to bring them to the preparation area 42, it is indeed advantageous for these areas 41 and 42 to be as close as possible to each other, without hindering either the collection of products and packaging in the collection area 41 or the preparation of the order in the preparation area 42.

[0265] The product and packaging picking area 41 includes rows 43 of shelving or racks 44 or 45, illustrated in [Fig. 18].

[0266] The shelving unit 44 is an open shelving unit, so that the presence of products and packaging in its locations can be observed. This rack 44 includes, in particular, a stack 46 of identical unfolded packages, products 47, 48, and 49 represented as rectangular prisms, and, on the lower shelf, in plastic containers, identical products 50, any product 51, and another product 52. Each location is associated with a unique identifier, such as identifiers 53 and 54. This identifier includes a sequence of alphanumeric characters allowing the retrieval, for each of these products, of the corresponding row 43 in space 41, the rack 44 of this row 43, the shelf of this rack 44, and finally the location on this shelf where the product or packaging sought is located.

[0267] The shelving unit 45 is another type of shelving unit, closed. It includes drawers 55 which can be opened, each drawer corresponding to a location, again equipped with a unique identifier, and therefore containing products or packaging to be collected.

[0268] Rows 43 thus contain a succession of racks 44 and 45. Alternatively, they could consist solely of racks 44 or solely of racks 45. Alternatively, other types of picking locations are possible and are well known to those skilled in the art. These can range from ordinary shelving to automated booths providing computer-controlled access to the contents of the locations.

[0269] The preparation area 42 is illustrated in [Fig. 19]. It includes an order preparation table 56, [Fig. 19] showing products 50, 51, and 52 from rack 44, and a packaging carton 46 from the same rack 44. The area also includes a screen 5 corresponding to the interaction means already described. This screen is naturally connected to the computer means 10 not shown here.

[0270] While a single preparation space has been illustrated for a sampling space, it is generally preferable to have several preparation spaces for a sampling space. Of course, the number of preparation spaces can vary.

[0271] The installation 40 also provides means for collecting products and packaging, via the trolley 7, and, via the computer means 10, modules, or "computer modules", for selecting products, the means 10 providing the products forming a logistics unit load, for selecting packaging, the means 10 allowing the user to select packaging from among the packaging in space 41, or automatically providing the user with the appropriate packaging, as described below, and a module for obtaining a collection route for products and packaging, the means 10 providing an optimized route of the locations in space 41.

[0272] The term "module" or "computer module" refers to a part of a computer program to which one or more predefined functions are assigned. Thus, this installation 40 comprises, but is not illustrated, the support 2 and the program 3 including these modules, that is to say, generally speaking, the means 10.

[0273] We will now describe the implementation method 1100 carried out using this installation 40, with reference to these figures 17 to 19 and to [Fig.20].

[0274] In step 1101, products are stored in the picking area 40, i.e., in racks 44 or 45 of rows 43. These products are intended to form the logistics load units. The products are brought into storage and placed in their locations by human means or by users with robotic tools. During this step 1101, the means 10 associate, in a database, each product in stock with its location identifier in racks 44 and 45. Thus, each product has a corresponding identifier that allows the product to be easily retrieved in space 4L. The method by which the products are chosen to form the stock is not the subject of this application.

[0275] In step 1102, the packages are stored in the picking area 41, that is, again in racks 44 or 45 of rows 43. During this step 1102, the means 10 associate, in the database, each package in stock with its location identifier in racks 44 and 45. Thus, each package has a corresponding identifier that allows the product to be easily located in space 4L

[0276] Thus, each product and each package corresponds to an identifier that allows the product or package to be easily located in space 4L. Not shown in the illustration, space 41 is divided into two sub-spaces, including racks 44 and 45 containing either only products or only packages. This results in a product picking area, including product locations, and a packaging picking area, including locations packaging. In the variant not shown, racks 44 and 45 can contain both products and packaging. Space 41 is therefore both a product picking area and a packaging picking area, including both product and packaging locations.

[0277] Regarding the method of selecting packaging for stockpiling, in a first variant 1102-A, the choices are based on the logistics provider's practical experience, which is known to those skilled in the art. In particular, the logistics provider uses their usual cardboard supplier and the latter's catalog of packaging references. In a second variant 1102-B, the user 6 first implements process 900 or 1000 for selecting optimized packaging based on logistics load units already shipped in the past or to be tested, as described above, in accordance with one of its implementation methods 900 and 1000. The means 10 then select the packaging to be stored in the picking area 41, based on this process 900 or 1000.It is therefore particularly advantageous that only packaging suitable for logistics load units packed in the past in this facility 40 be stored in the picking area 41 for logistics load units to be shipped in the future, since it is likely that this packaging will be suitable for these future logistics load units to be packed, in particular with regard to the dimensions and therefore the void ratio of the packed logistics load units.

[0278] At step 1103, the user 6, positioned at their preparation table and therefore in front of their screen 5, as illustrated in [Fig. 19], receives a selection of products from the means 10. The selected products form a logistics unit to be packaged. These are products corresponding to an order and grouped together to form a logistics unit. In a first variant 1103-A, this grouping is carried out beforehand by any means available to a person skilled in the art, in particular by simply grouping all the products of the same order, or by automated selections not described here. In a second variant 1103-B, the grouping is carried out beforehand by the means 10 in accordance with the process 600 for grouping products into a logistics unit described above. It is indeed advantageous for the products to be grouped according to appropriate requirements in accordance with process 600.The user receives the product selection via screen 5, or via a "picking slip" or "picking slip".

[0279] At step 1104, the user receives, either concurrently with or immediately following step 1103, a selection of packaging, the packaging being intended to pack the logistics unit load formed by the products of step 1103. In a first variant 1104-A, the user 6 himself chooses the packaging that seems appropriate from among all the available packaging in the picking area 41, for this logistics unit load. He can, in particular, rely on the dimensions of the unit load lo Logistics, if known, to select packaging with slightly larger dimensions, by searching, through means 10, particularly through interaction means such as screen 5, for the appropriate packaging. In a second variant 1104-B, this step 1104 is carried out by means 10 according to the process of assigning packaging to a logistics load unit, according to one of the implementation modes 700 or 800. In this case, the packaging supplied as input to these modes 700 and 800 is that available in the picking space 41. It is indeed particularly advantageous for means 10 to select the appropriate packaging in this way since it generates less empty space by choosing the most suitable packaging for the logistics load unit. Furthermore, by automating this selection, the order picker is spared the need to choose packaging.The time taken by the subsequent step of collecting the packaging from the picking area is therefore compensated for by a rapid and automatic selection of that packaging. More precisely, as described in the context of these processes, the equipment selects the packaging best suited to the logistics load units. The selected packaging is indicated to the user 6 on the screen 5, or as an indication on the picking slip. In a third variant 1104-C, if no packaging has been selected, for example, if no suitable packaging is available after process 700, and as described in step 711, the equipment 10 displays to the order picker the ideal dimensions of the packaging suitable for the logistics load unit, so that the picker can retrieve an available but unregistered package, or order the appropriate packaging.Alternatively, means 10 transmit the ideal dimensions to a robot which automatically manufactures the packaging. The received or manufactured packaging can be placed in the picking area, so that the following steps are implemented in the same way, or brought by other means to the preparation table without undergoing the path acquisition and collection steps.

[0280] At step 1105, user 6 obtains a collection route for the selected products and packaging in the picking area 41, i.e., in the packaging picking area and the product picking area. The route includes the identifiers of the locations of the selected products and packaging to be collected. Thus, the means 10 provide the user, via the screen 5 or on the "picking slip," with the identifiers of the locations of the selected products and the identifier of the location of the selected packaging, and they also determine a collection route for the products and packaging. The route is optimized so that user 6's collection in area 41, in particular their path along the rows 43, is as fast as possible. Thus, the path from the preparation table 56 to the correct locations on racks 44 and 45, and then back to the table... Preparation 56 must be as short as possible. Therefore, the order in which the products and packaging are picked is crucial and is optimized. The various ways in which this route is optimized, depending on the positions of the locations within picking area 41, are known to those skilled in the art and are not the subject of this request. These techniques rely on the positions of the product locations. In this case, packaging is also included, which does not alter these techniques since the packaging is stored, in the same way as a product, within a picking area, with a unique identifier.

[0281] At step 1106, user 6 collects the selected products and packaging from the picking area 41, in the order provided by the optimized route determined by the means 10. To collect the products and packaging, user 6 uses the cart 7, called the "picking cart" or "collection cart". Alternatively, instead of the order picker, another person collects the products and packaging, whose role is to collect the products and packaging and bring them to the preparation area 42 where the order picker remains.

[0282] Other means of collection besides a trolley are naturally conceivable as alternatives. These may include, for example, warehouse transport vehicles, forklifts, exoskeletons, robots, etc.

[0283] At step 1107, in the preparation area 42, i.e., at table 56, user 6 arranges the selected products in the selected packaging to form the packaged logistics unit. In the example illustrated in [Fig. 19], user 6 has products 50, 51, and 52 from rack 44 in [Fig. 18], and packaging 46 from the same rack. These were collected at step 1106. In a first variant 1107-A, user 6 arranges the products in the packaging according to their own experience and practice, within a given time constraint. A second variant 1107-B corresponds to the case where variant 1104-B has been implemented at step 1104, i.e. when the process of assigning a package to a logistics load unit according to one of the modes 700 and 800 has been implemented to select the package.If method 700 was implemented, and on that occasion a layout plan was determined using one of the implementation methods of layout plans 100 to 400, then this plan is taken up again at step 1107-B to be provided to the order picker when arranging the products in the packaging. If method 800 was implemented for the packaging assignment process, then implementation method 500 was implemented for the layout plan, and the plan corresponding to the chosen packaging is made available to the order picker.

[0284] According to a third variant 1107-C, no arrangement plan according to any of the modes 100 to 500 has been implemented previously. The means 10 then implement the method of determining a layout plan according to method 500, by providing as input the dimensions of the packaging selected in step 1104, so as to determine the appropriate arrangement of the products for this packaging.

[0285] Following this step 1107, the products forming the logistics unit load are packed in the chosen packaging. This packaged logistics unit load can then be subjected to the subsequent delivery steps known to those skilled in the art, including affixing a delivery label, loading, and dispatch.

[0286] In an alternative (not shown) configuration, the installation includes a product-only picking area and a packaging-only picking area. Thus, the route obtained by means 10 includes two sub-routes: a route optimized solely for collecting products in the product picking area, which does not include packaging collection, and the route to the selected packaging, which includes only the packaging location. This alternative configuration is suitable for situations where the product picking area is particularly far from the packaging picking area. The user completes both routes and then goes to the order preparation table to prepare the logistics unit for packaging.

[0287] In another variant not shown, the collection involves not only the products and packaging of a single logistics unit to be packed, but also the simultaneous collection of products forming several logistics units and the packaging selected for these units. Thus, the user is provided with a route for the optimized collection of all the selected products forming the logistics units to be packed, and for the optimized collection of all the corresponding packaging. The route is either a single route optimized for collecting both products and packaging from the same product and packaging picking area, or a first route optimized for collecting products from a product picking area and a second route optimized for collecting packaging from a packaging picking area.Then, once all the products and packaging have been collected, the user can prepare the different logistics load units for packing in the same preparation area, or the collection vehicles can travel through several preparation areas to deposit the products and packaging that make up each logistics load unit to be prepared. This variant therefore saves significant time by optimizing the collection of products and packaging destined for separate logistics load units.

[0288] We will now describe a second embodiment 1200 of the process for preparing a logistics load unit for packaging, with reference to Figures 21 to 23. This embodiment is implemented in an installation 60, according to a second embodiment, illustrated in [Fig. 21]. It differs from the installation 40 of [Fig. 17] in that The product picking area 61 is separate from the packaging picking areas 71, 72, and 73. These latter areas are in fact integrated into the order preparation areas 62, 63, and 64, which are distinct from each other. Thus, the packaging stored in picking area 41 of [Fig. 19] is stored here in picking areas 71, 72, and 73, respectively within the order preparation areas 62, 63, and 64.

[0289] Space 71 is illustrated in [Fig. 22]. The preparation table is identical to preparation table 56 in [Fig. 19], but it is associated with a shelving unit or rack 45 comprising two locations, each with its respective identifier, in which unfolded packages can be observed through the transparent shelving, ready for use. Unlike racks 44 and 45 of installation 40, packaging picking areas, such as the shelving unit or rack 45 in [Fig. 19] of installation 60, contain only packages, and, more importantly, only packages of the same type. Thus, space 71, equipped with racks or shelving, contains only packages of one type. Space 72 contains only packages of another type, and space 73 contains packages of a third type. It is worth remembering that a type corresponds to the same structure, the same material or the same level of robustness of a package.For example, space 71 can be dedicated to plastic bags, space 72 to single-wall corrugated cardboard, and space 73 to double-wall corrugated cardboard. Of course, the number of preparation spaces in this installation 60 can vary.

[0290] We will now describe, with reference to these figures 21 and 22 and to [Fig.23], the stages of mode 1200, emphasizing their differences with the stages of mode 1100.

[0291] Step 1201 is the same as step 1101, with the products being stored in product picking space 61.

[0292] Step 1202 is identical to step 1102, except that the packages are not stored in space 61, but in spaces 71, 72, and 73, integrated into the respective preparation spaces 62, 63, and 64, by packaging type. Thus, in a manner not described, the packages are to be distributed by packaging type in spaces 71, 72, and 73, with means 10 associating, as in step 1102, the location identifiers with each package.

[0293] Steps 1203 and 1204 are identical to the respective steps 1103 and 1104.

[0294] At step 1205, the user obtains a collection route for the selected products, However, the route does not include collecting the packaging in this area, as the packaging is already available in the packaging picking area integrated into the preparation area, as illustrated in [Fig. 22]. On the other hand, it does receive the identifier of the packaging's location within rack 45 of this packaging picking area, so that the packaging can be collected.

[0295] At step 1206, user 6 only collects the products in the collection area of product 61, to bring them to the preparation table in space 62, 63, or 64, and it collects the packaging beforehand or afterward, very simply since it has it readily available in its preparation space, in its rack 45. This method of implementation therefore eliminates the need to collect packaging from a separate area from the preparation space. It thus saves time compared to the previous method.

[0296] Arrangement step 1207 is identical to step 1107.

[0297] By having, for a product picking area, several order preparation areas, each associated with a type of packaging, the productivity of order preparation is increased while maintaining the gains on the empty rate.

[0298] Alternatively, in addition to grouping packages by packaging type within the picking areas integrated into the preparation areas, these areas can be configured to store certain packaging references rather than others. For example, such an integrated picking area can be configured to store the five most frequently used packaging references of a predetermined packaging type.

[0299] This implementation 1200 can be combined with implementation 1100, i.e., by providing for packages stored both in a separate packaging picking area within the picking area and other packages stored in the picking area integrated into the picking area. Thus, for multiple orders, a single route can include collecting packages from a separate picking area and picking packages from an area integrated into the picking area. This is particularly relevant if the most frequently used packages are stored in the picking area integrated into the picking area, while the least frequently used packages remain stored in a separate picking area.

[0300] In a third embodiment 1300, illustrated in [Fig.24], the steps are similar to those of process 1100 or process 1200, but they are fully automated.

[0301] Thus, storage steps 1301 and 1302, in the product picking and packaging picking areas, are carried out by autonomous vehicles, featuring automated means of placement in the locations.

[0302] Steps 1304 and 1305 are automatically implemented by the modules of means 10, as described in modes 1100 and 1200.

[0303] The collection step 1306 is also automated, with an autonomous vehicle automatically collecting the products and, in the case of mode 1100, the packaging. Alternatively, the racks or shelving forming these picking areas are automated so that they move autonomously.

[0304] The arrangement step 1307 is carried out automatically by robotic arms, in accordance with a layout plan determined according to one of the implementation methods described above.

[0305] Thus, the entire process of preparing a logistics load unit for packing can be automated.

[0306] Alternatively, only some of the steps of process 1300 are automated, others remaining the responsibility of the user.

[0307] The invention is not limited to the embodiments and implementations presented and other means will be obvious to a person skilled in the art.

[0308] In particular, the embodiments are combinable, whether this is explicitly written or whether it is clear to a person skilled in the art.

[0309] In all dimension comparison steps, in particular between one or more contents on the one hand and a container on the other hand, the means can affect predetermined margins or margins chosen by a user.

Claims

Claims

1. Method (1100; 1200; 1300) for preparing a logistics load unit to be packaged, characterized in that: • products are stored (1101; 1201; 1301) in a product picking space (41; 61), the space including product locations, each product location being associated with an identifier; • packages are stored (1102; 1202; 1302) in a packaging picking space (41; 71, 72, 73), the space including packaging locations, each packaging location being associated with an identifier; • a selection of products is obtained (1103; 1203; 1303), the selected products forming a logistics load unit to be packaged; • a selection of a package is obtained (1104; 1204; 1304); • we obtain (1105; 1205;1305) a collection route for the selected products and the selected packaging in the picking spaces, the route comprising the identifiers of the locations of the selected products and packaging to be collected; • the selected products and the selected packaging are collected (1106; 1206; 1306) in the picking spaces in accordance with the route and the selections; • in a preparation space (42; 62, 63, 64) of a logistics load unit to be packed, the selected products are arranged (1107; 1207; 1307) in the selected packaging, so as to form the packed logistics load unit.;

2. Method (1100; 1200; 1300) according to the preceding claim, in which, to obtain the route, a route is determined by computer (10) which is optimized according to the locations of the products and the location of the packaging so that the collection of the products and the packaging is as quick as possible.

3. Method (1100; 1200; 1300) according to any one of the preceding claims, wherein the selection (1104-B) of the package is carried out in accordance with the following steps, implemented by or-

4. diner (10): • selection (703) of packaging available in the packaging picking area; • for each selected package, determination (704) of a prioritization value of the package, the value depending on at least the volume of the package so that a package less voluminous than another package, is, all things being equal, a priority with respect to this other package; • sorting of the packaging according to their respective prioritization values in order to form a sorted list of the packaging; • choice (705) of one of the packages from the list according to the sorting; • verification (706) of the suitability between the chosen packaging and the logistics load unit to be packaged, the verification relating at least to the weight of the logistics load unit in relation to a maximum weight supported by the packaging. Method (1100; 1200; 1300) according to any one of the preceding claims, in which, each selected product corresponding to a content and the selected packaging corresponding to a container, the selected contents and container having respective right-angled block shapes, the selected products are arranged (1107-B; 1107-C) in the selected packaging in accordance with an arrangement plan, the arrangement plan being determined in accordance with the following computer-implemented steps (10): • among the contents to be arranged in the container, virtual arrangement (203) of a first content at a predetermined position of the container; • to virtually arrange one of the remaining contents in the container: • determination (204) of the dimensions and coordinates of several remaining empty spaces of the container, distinct from each other and having respective right-angled block shapes; • determination of possible positions of the remaining content in each empty space; • determination (207) of respective distances between a

5. predetermined vertex of the container and the respective vertices of the remaining contents in each possible positioning; • depending on the determined distances, selection of one of the possible positions as a virtual arrangement of the remaining contents in the container; • reiteration (208, 209) of the previous arrangement steps for successively each of the other remaining contents to be virtually arranged in the container, so as to determine an arrangement plan for all the contents in the container. Method (1100; 1200; 1300) according to any one of the preceding claims, in which packages selected according to logistic load units are stored (1102-B) in the packaging picking space, in accordance with the following computer-implemented steps (10): • obtaining (902) a packaging list; • for each of the packages in the list obtained, determination (905) of a prioritization value for the package, the value depending on at least the volume of the package so that a package that is less voluminous than another package is, all things being equal, a priority over this other package; • sorting of the packaging according to their respective prioritization values in order to form a sorted list of the packaging; • choice (906) of one of the packages from the list according to the sorting; • obtaining (901, 903) a list of logistics load units, each logistics load unit in the list having dimensions smaller than those of the chosen packaging; • for each logistics load unit on the list, verification (909) of the suitability between the chosen packaging and the logistics load unit, the verification relating at least to the weight of the logistics load unit with respect to a maximum weight supported by the packaging; • if the number of logistics load units verified as being suitable for the selected packaging is greater than or equal to a predetermined threshold, selection (910) of the packaging for storage in the packaging picking space, and removal, from the list of logistics load units, of the logistics load units verified as being suitable for this selected packaging.

6. A method (1100; 1200, 1300) according to any one of the preceding claims, wherein, the logistics load unit being a first logistics load unit, for preparing a second logistics load unit to be packaged: • a second selection of products is obtained, the selected products forming the second logistics load unit to be packaged; • a selection of a second package is obtained; • in the step of obtaining the collection route, the products include the selected products forming the first logistics load unit and the selected products forming the second logistics load unit, as well as the two respective selected packages, the route comprising the identifiers of the locations of the selected products and packages to be collected from the first and second logistics load units;• in the collection stage, the selected products and the selected packaging of the first and second logistics load units are collected; • in the preparation space, or in this space and another preparation space, the two packaged logistics load units are formed.;

7. Computer program (3) comprising instructions which, when the program is executed by a computer, cause the latter to implement the steps of the method (1100; 1200; 1300) according to any one of the preceding claims.

8. A computer-readable recording medium (2) (10) comprising instructions which, when executed by a computer, lead the latter to implement the steps of the method (1100; 1200; 1300) according to any one of claims 1 to 6.

9. Installation (40; 60) for preparing a logistics load unit to be packaged, comprising: • a space (41, 61) for picking products, the space including product locations, each product location being associated with an identifier; • a space (41; 71, 72, 73) for picking packages, the space including packaging locations, each packaging location being associated with an identifier; • a module (10) for selecting products, the selected products forming a logistics load unit to be packaged; • a module for selecting a package; • a module (10) for obtaining a collection route for the selected products and the selected packaging in the picking spaces, the route comprising the identifiers of the locations of the selected products and the selected packaging;• means (7) for collecting the selected products and packaging in the picking spaces in accordance with the route and the selections; • a space (42; 62, 63, 64) for preparing a logistics load unit to be packaged, capable of allowing an arrangement of the selected products in the selected packaging so as to form the packaged logistics load unit.;

10. Installation (40; 60) according to the preceding claim, in which the sampling spaces (41; 61, 71, 72, 73) are formed of shelves or racks (44, 45).

11. Installation (40) according to one of claims 9 or 10, in which the product and packaging picking spaces (41) form a single picking space including both packaging locations and product locations.

12. Installation (60) according to one of claims 9 or 10, in which: • the packaging picking space (71, 72, 73) includes only packaging corresponding to a single predetermined type of packaging, a type of a corresponding packaging to the structure, material and / or robustness of the packaging, and • this packaging picking space is integrated into the preparation space (62, 63, 64), so that any logistics load unit whose products are arranged in this preparation space is packed using packaging corresponding to the predetermined packaging type.

13. Installation (40; 60) according to any one of claims 9 to 12, in which the collection means are automated means capable of automatically collecting the products and packaging selected in the picking spaces and automatically bringing them to the preparation space.

Images