FR3141546A1 - Optimized packaging selection process based on logistics load units - Google Patents

Abstract

The invention relates to a computer-implemented (10) method (900) for selecting optimized packages based on logistics load units, comprising the following steps: obtaining (902) a list of packages ;for each of the packages in the list obtained, determination (905) 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 packaging, or, all things being equal, priority over this other packaging; sorting of the packaging according to their respective prioritization values so as to form a sorted list of packaging; choice (906) of one of the packages in the list based on sorting; obtaining (901,903) a list of logistics load units, each unit in the list having dimensions smaller than those of the chosen package; for each logistics load unit of the list, verification (909) of the adequacy 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 adequate for the chosen packaging is greater than or equal to a predetermined threshold, selection (910) of the packaging and removal from the list of load units logistics, logistics load units verified as being adequate for this selected packaging. Figure for abstract: no figure

Description

Optimized packaging selection process based on logistics load units

The invention relates to the field of parcel delivery, in particular the preparation of orders in warehouses.

In the state of the art, in a warehouse, the order picker has a portion of contents, the products, intended to be grouped together within a container forming a logistics load unit. This “ logistics load unit ” is generally called “ parcel ” when it is associated with a delivery in progress or completed. The order picker also has the packaging intended to pack these logistics load units to be shipped. The choice of packaging for each logistics load unit is generally made visually by the order picker based on his estimate of the volume of the products forming the logistics load unit and his estimate of the volume of the packaging. .

The result is that many logistics load units shipped are made up of products arranged in unsuitable packaging, and in particular have a high void ratio. This empty rate generates overconsumption of packaging and therefore a significant waste of quantity of material, associated greenhouse gas emissions, as well as major economic losses for players in the delivery field. This average empty rate also generates an overconsumption of storage space, particularly in relay points, this saturation of storage space can in turn lead to an increase in the distance between the home of the recipient of the package and the relay point in the event of reassignment of the package to a remote relay point. Excessive empty space in packaging also creates a risk of breakage and therefore additional deliveries. In addition, products arranged in packaging that is too large require additional cushioning which further increases the waste of raw materials. Finally, unsuitable packaging is also a source of more difficult handling of these logistics load units.

To remedy this problem of packaging not suitable for logistics load units, a state-of-the-art solution is the manufacturing, by robot, in a warehouse, of tailor-made packaging, adapted to the dimensions and type of fragility of each logistics load unit to be packed.

However, this solution is expensive in invested capital, complex to implement, potentially time-consuming, and above all is not able to absorb peaks of activity when the maximum capacity of the robot is reached. On the other hand, the packaging waste that is generated is two to three times greater than that generated by conventional packaging.

In addition, by definition it systematically prohibits the use of reusable packaging and therefore tends to also increase greenhouse gas emissions linked to overconsumption of cardboard. Finally, it is limited in terms of processing capacity per hour, and therefore unsuitable for managing seasonal volume variations.

Another solution of the state of the art is an automated chain placed in the preparation space and making it possible to automatically package the products forming a logistics load unit in packaging defined in a predetermined manner and identical for all load units logistics. Thus, it is no longer necessary for the order picker to choose a packaging, all packaging being identical. The preparation of the logistics load unit is even faster. On the other hand, the logistics load units are packaged on average in even less appropriate packaging, since this packaging is all identical regardless of the logistics load unit to be packaged.

The invention aims in particular to make it possible to reduce the average void rate generated in the packaging without wasting time in preparing the order and without having to have a large number of different packaging references.

• obtention d’une liste d’emballages ;
• pour chacun des emballages de la liste obtenue, détermination d’une valeur de priorisation de l’emballage, la valeur dépendant d’au moins le volume de l’emballage de façon à ce qu’un emballage moins volumineux qu’un autre emballage, soit, toutes choses égales par ailleurs, prioritaire vis-à-vis de cet autre emballage ;
• tri des emballages en fonction de leurs valeurs respectives de priorisation de façon à former une liste triée des emballages ;
• choix d’un des emballages de la liste en fonction du tri ;
• obtention d’une liste d’unités de charge logistique, chaque unité de charge logistique de la liste ayant des dimensions inférieures à celles de l’emballage choisi ;
• pour chaque unité de charge logistique de la liste, vérification de l’adéquation entre l’emballage choisi et l’unité de charge logistique, la vérification portant au moins sur le poids de l’unité de charge logistique vis-à-vis d’un poids maximal supporté par l’emballage ;
• si le nombre d’unités de charge logistique vérifiées comme étant adéquates à l’emballage choisi est supérieur ou égal à un seuil prédéterminé, sélection de l’emballage et retrait, de la liste des unités de charge logistique, des unités de charge logistique vérifiées comme étant adéquates à cet emballage sélectionné.

To this end, the subject of the invention is a method for selecting packaging optimized as a function of logistics load units, implemented by computer, and comprising the following steps:

• obtaining a packaging list;
• 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 is less bulky than another package, or, all things being equal, priority over this other packaging;
• sorting the packaging according to their respective prioritization values so as to form a sorted list of packaging;
• choice of one of the packaging from the list depending on sorting;
• obtaining 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 in the list, verification of the adequacy between the chosen packaging and the logistics load unit, the verification covering at least 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 adequate for the chosen packaging is greater than or equal to a predetermined threshold, selection of the packaging and removal, from the list of logistics load units, of the verified logistics load units as being suitable for this selected packaging.

Thus, while the instinctive approach would be to search, for each logistics load unit, which packaging could be most suitable for this logistics load unit, the process aims conversely to search, for each packaging , what is the number of logistics load units that could be packed within it. This process makes it possible to test packaging and to select among them only those which, most often, could be adequate for the selected logistics load units. It therefore allows you not to have to have a multitude of packaging references, but to only select the most appropriate packaging in view of the logistics load units, and therefore to save storage space. warehouse packaging.

Above all, by sorting the packaging beforehand according to a prioritization criterion taking into account at least the volume of each packaging, we ensure that checks of the suitability of each packaging for the logistics load units begin with the packaging. the highest priority, at least in terms of volume, compared to other packaging. However, if the packaging is selected, by removing them from the list of logistics load units, the logistics load units having been verified as being adequate for this packaging, we ensure that the following packaging from the sorted list, therefore less priority at least in terms of volume, can only be compared to other logistics load units. Since only packaging suitable for a predetermined number of logistics load units is selected, we therefore favor the selection of the first packaging in the sorted list, that is to say the smallest. In this way, we ensure that the packaging is selected as small as possible in relation to the logistics load units, and we therefore make it possible to reduce as much as possible the empty rates of future logistics load units packaged by these packages. selected.

It should be noted that obtaining the packaging list may relate to packaging references previously used by the logistician, in order to determine the packaging references to keep in the future and those which the logistician can use. pass because they are not used often enough or they are too bulky. But the obtaining can also relate to packaging other than that used in the past, for example to packaging reference catalogs belonging to packaging suppliers distinct from the usual supplier, or to suppliers who act as collection organization and which allow the logistician to include packaging from the circular economy, so as to determine whether, among these packaging that have never been used before, some could be adequate in view of the logistics load units selected. Finally, the obtaining can involve a mixture of packaging already used and new packaging to be tested, so as to compare them and retain only the most appropriate for the selected logistics load units.

Likewise, obtaining the list of logistics load units can relate to previously shipped logistics load units, but it can also relate to logistics load units never before shipped, which the logistician wishes to test, in particular because that he estimates that he will have to ship them in the future, such as a new item reference, in order to anticipate the packaging that he will need to have available when the time comes to pack these logistics load units.

By “ computer ”, we will also speak of “ computing means ” and for convenience of “ means ”.

Other optional features, taken alone or in combination, are described below.

Preferably, the resulting list of logistics load units includes logistics load units that have been shipped previously.

Thus, the means identify the packaging appropriate to the logistics load units previously shipped in the past by the logistician. However, a logistician often works on the same types of logistics load units, so that their packaging is most likely appropriate for the future logistics load units to be packaged. In other words, the process is therefore based on a history specific to a logistician, and allows the latter to select packaging specific to its activity. For different histories, the process therefore provides different packaging selections.

• des emballages issus d’au moins deux fournisseurs distincts d’emballages ; et/ou
• au moins un emballage issu d’un organisme de collecte ; et/ou
• au moins un emballage fabriqué sur-mesure pour une unité de charge logistiques propre ; et/ou
• au moins un emballage réutilisable.

Advantageously, the list of packaging obtained includes:

• packaging from at least two separate packaging suppliers; and or
• at least one packaging from a collection organization; and or
• at least one custom-made packaging for its own logistics load unit; and or
• at least one reusable packaging.

Thus, the identification process concerns packaging from all sources. It therefore makes it possible to identify suitable packaging from the widest possible choice, and it also makes it possible to take into consideration a large number of criteria.

Advantageously, the method comprises, for each packaging in the list obtained from packaging, the reiteration of the steps of choosing packaging from the list according to sorting, obtaining the list of logistic load units, verifying the adequacy and removal of logistics load units from the list if the packaging is selected, so as to obtain a list of selected packaging.

Thus, other, or even all, packaging from the packaging list are tested, but given that the logistics load units deemed adequate for the previously tested packaging are removed, the lower priority the packaging is, the less likely it is to be selected , unless, despite their non-priority nature, they are adapted to a sufficient number of logistics load units not adequate with respect to the packaging previously tested. The process therefore creates a good balance by favoring priority packaging but allowing the selection of less priority packaging if it is particularly suited to the dimensions or types of logistics load units often shipped.

Preferably, packaging corresponding to the selected packaging is then obtained, and logistics load units are packaged in these packaging.

Thus, we obtain the actual packaging corresponding to the packaging references selected using the process.

Advantageously, the verification of adequacy also relates to an empty rate of the chosen packaging in which the logistics load unit would be packaged, with respect to a predetermined threshold.

Thus, a selected packaging is a packaging that has been judged not only suitable for a sufficiently high number of logistics load units, but also on the basis of the void rate that it generates with these logistics load units. We therefore ensure that we only select packaging that generates void rates lower than a predetermined threshold, possibly chosen by a user.

Preferably, the verification also concerns at least the presence of a part of the logistics load unit classified as fragile with respect to the chosen packaging, and/or the arrangement of the contents, forming the the logistics load unit, within the packaging, with respect to an arrangement to be respected with regard to the fragility of the logistics load unit.

Advantageously, obtaining the list of logistics load units also relates only to logistics load units associated with the same type of packaging as a type of the chosen packaging, the types of packaging corresponding to a material, structure and/or robustness of the packaging.

Thus, we test the packaging by similar types of packaging.

• parmi la liste des unités de charge logistique, identification d’unités de charge logistique pour lesquelles aucun emballage n’a été jugé adéquat à l’issue de l’étape de vérification, de façon à obtenir une liste d’unités de charge logistique identifiées comme étant sans emballage adéquat ;
• chaque unité de charge logistique de cette liste ayant, sous une forme virtuelle de pavé droit, une première dimension, une deuxième dimension orthogonale à la première dimension et une troisième dimension orthogonale aux première et deuxième dimensions, répartitions des valeurs des premières dimensions, des valeurs des deuxièmes dimensions et des valeurs des troisièmes dimensions des unités de charge logistique, en des clusters respectifs de premières dimensions, de deuxièmes dimensions et de troisièmes dimensions ;
• identification, pour chaque cluster, d’une valeur de dimension propre au cluster, en particulier d’une valeur maximale de chaque cluster ;
• combinaison des valeurs identifiées des clusters de premières dimensions avec les valeurs identifiées des clusters de deuxièmes dimensions et avec les valeurs identifiées des clusters de troisièmes dimensions, de manière à déterminer de nouveaux emballages présentant les dimensions combinées.

Preferably, the method further comprises, to select other packaging, the implementation of the following steps:

• among the list of logistics load units, identification of logistics load units for which no packaging has been deemed adequate at the end of the verification step, so as to obtain a list of identified logistics load units as being without adequate packaging;
• each logistic load unit of this list having, in a virtual form of a straight block, a first dimension, a second dimension orthogonal to the first dimension and a third dimension orthogonal to the first and second dimensions, distributions of the values of the first dimensions, of the values second dimensions and values of the third dimensions of the logistics load units, into respective clusters of first dimensions, second dimensions and third dimensions;
• identification, for each cluster, of a dimension value specific to the cluster, in particular of a maximum value of each cluster;
• combining the identified values of the first dimension clusters with the identified values of the second dimension clusters and with the identified values of the third dimension clusters, so as to determine new packages having the combined dimensions.

Thus, the means carry out a hierarchical “ clustering ” or “ grouping ” algorithm, so as to group the values of the first, second and third dimensions of the logistics load units around clusters specific to each of these three dimensions, according to predetermined numbers of clusters for each dimension. Then these means assign values to each of these clusters, in particular the maximum values of each of these clusters, and combine these values so as to generate dimensions of fictitious packaging. Since these dimensions come from values identified on the basis of the logistics load units obtained as input, they are appropriate for the greatest number of these logistics load units.

• pour chaque nouvel emballage déterminé, vérification de l’adéquation entre le nouvel emballage et au moins certaines des unités de charge logistique identifiées au préalable comme étant sans emballage adéquat, la vérification portant au moins sur les dimensions de ces unités de charge logistique vis-à-vis des dimensions de l’emballage ;
• si le nombre de ces unités de charge logistique vérifiées comme étant adéquat à ce nouvel emballage est supérieur ou égal à un seuil prédéterminé, sélection de ce nouvel emballage.

Advantageously, the process comprises the following steps:

• for each new packaging determined, verification of the adequacy between the new packaging and at least some of the logistics load units previously identified as being without adequate packaging, the verification covering at least the dimensions of these logistics load units with respect to -screw the dimensions of the packaging;
• if the number of these logistic load units verified as being adequate for this new packaging is greater than or equal to a predetermined threshold, selection of this new packaging.

Thus, for the “ new ” packaging determined via the combinations of values from the clusters, we carry out a step of verifying the adequacy between these fictitious packaging and the logistics load units, so as to select only the most appropriate.

• détermination d’un plan d’agencement de produits formant l’unité de charge logistique ;
• détermination des dimensions minimales d’un contenant apte à contenir les produits agencés conformément au plan d’agencement déterminé ;
• affectation des dimensions minimales déterminées à l’unité de charge logistique.

Preferably, the method first comprises a step of determining the dimensions of each logistics load unit implemented in the following manner:

• determination of an arrangement plan for products forming the logistics load unit;
• determination of the minimum dimensions of a container capable of containing the products arranged in accordance with the determined arrangement plan;
• allocation of the minimum dimensions determined to the logistics load unit.

Thus, the means determine an arrangement of products in the most compact way possible so that the logistics load unit is as small as possible.

• parmi les contenus à agencer dans le contenant, agencement virtuel d’un premier contenu à une position prédéterminée du contenant ;
• pour agencer virtuellement l’un des contenus restants dans le contenant :
• détermination des dimensions et coordonnées de plusieurs espaces vides restants du contenant, distincts les uns des autres et ayant des formes respectives de pavé droit ;
• détermination de positionnements possibles du contenu restant dans chaque espace vide ;
• détermination de distances respectives entre un sommet prédéterminé du contenant et des sommets respectifs du contenu restant dans chaque positionnement possible ;
• en fonction des distances déterminées, sélection de l’un des positionnements possibles en tant qu’agencement virtuel du contenu restant dans le contenant ;
  • réitération des étapes précédentes d’agencement pour successivement chacun des autres contenus restants à agencer virtuellement dans le contenant, de manière à déterminer un plan d’agencement de tous les contenus dans le contenant.

Advantageously, the arrangement plan is determined in the following manner, the logistics load unit being formed of several contents to be arranged in a container, the contents and the container having respective virtual shapes of straight pads, the method being implemented work by computer and comprising the following steps:

• among the contents to be arranged in the container, virtual arrangement of a first content at a predetermined position of the container;
• to virtually arrange any of the remaining contents in the container:
• determination of the dimensions and coordinates of several remaining empty spaces of the container, distinct from each other and having respective straight block shapes;
• determination of possible positions of the remaining content in each empty space;
• determination of respective distances between a predetermined vertex of the container and respective vertices of the contents remaining in each possible positioning;
• depending on the determined distances, selection of one of the possible positions as a virtual arrangement of the contents remaining 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.

Thus, both the container and the contents, as well as the empty spaces, are defined in the form of computer-manipulated data structures. Therefore, by arranging each content, in turn, in the furthest possible position from the same point of the container, after identifying the empty spaces available, it appears that on average the positioning of these contents is significantly optimized. so that the final arrangement of all these contents takes up as little volume as possible. The minimum dimensions determined for the container are then the smallest possible, and are assigned to the logistics load unit made up of these contents. The packaging subsequently tested for this logistics load unit is therefore also the smallest possible, given that they are sorted at least by volume.

• parcours d’une liste d’expéditions, chaque expédition ayant prévu une livraison d’un ou plusieurs contenus, et, pour chaque expédition de la liste, création d’unités de charge logistique exclusives pour les contenus de l’expédition destinés à des emballages exclusifs, et création d’au moins une unité de charge logistique destinée à regrouper les autres contenus de l’expédition non destinés à des emballages exclusif, de manière à former une liste d’unités de charge logistique ;
• retrait, de la liste des unités de charge logistique, d’au moins une unité de charge logistique associée à un emballage défini à l’avance, si l’emballage fait partie de la liste des emballages obtenue.

Preferably, the method comprises, beforehand, the following steps, to group contents into a logistics load unit:

• browsing a list of shipments, each shipment having planned delivery of one or more contents, and, for each shipment in the list, creating exclusive logistics load units for the contents of the shipment intended for packaging exclusive, and creation of at least one logistics load unit intended to group together the other contents of the shipment not intended for exclusive packaging, so as to form a list of logistics load units;
• removal, from the list of logistics load units, of at least one logistics load unit associated with packaging defined in advance, if the packaging is part of the list of packaging obtained.

Thus, the means prepare logistics load units from the orders provided as input, these logistics load units being able to be organized differently from those which were, among them, shipped in the past from these orders. In addition, the logistics load units associated with packaging defined in advance and included in the packaging list are deleted because it is not relevant to test the packaging to be selected on logistics load units already dedicated to a specific packaging.

• on stocke des produits dans un espace de prélèvement de produits, l’espace incluant des emplacements de produits, chaque emplacement de produit étant associé à un identifiant ;
• on identifie des emballages conformément au procédé de sélection d’emballages décrit plus haut ;
• on stocke les emballages identifiés dans un espace de prélèvement d’emballages, l’espace incluant des emplacements d’emballages, chaque emplacement d’emballage étant associé à un identifiant ;
• on obtient une sélection de produits, les produits sélectionnés formant une unité de charge logistique à emballer ;
• on obtient une sélection d'un emballage parmi les emballages stockés ;
• on obtient un parcours de collecte des produits sélectionnés et de l'emballage sélectionné dans les espaces de prélèvement, le parcours comprenant les identifiants des emplacements des produits et de l’emballage sélectionnés à collecter ;
• on collecte les produits sélectionnés et l'emballage sélectionné dans les espaces de prélèvement conformément au parcours et aux sélections ;
• dans un espace de préparation d’une unité de charge logistique à emballer, on agence les produits sélectionnés dans l'emballage sélectionné, de manière à former l’unité de charge logistique emballée.

According to the invention, there is also provided a method for preparing a logistics load unit to be packaged, in which:

• products are stored in a product picking space, the space including product locations, each product location being associated with an identifier;
• packaging is identified in accordance with the packaging selection method described above;
• the identified packaging is stored in a packaging picking space, the space including packaging locations, each packaging location being associated with an identifier;
• a selection of products is obtained, the selected products forming a logistics load unit to be packaged;
• a selection of a package is obtained from the stored packages;
• we obtain 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 in the collection areas in accordance with the route and the selections;
• in a preparation space for a logistics load unit to be packaged, the selected products are arranged in the selected packaging, so as to form the packaged logistics load unit.

According to the invention, there is also provided a computer program comprising instructions which, when the program is executed by a computer, lead it to implement the steps of the method described above.

According to the invention, there is also provided a computer-readable recording medium comprising instructions which, when executed by a computer, lead it to implement the steps of the method described above.

Brief description of the figures

The invention will be better understood on reading the description which follows, given solely by way of example and made with reference to the appended drawings in which:

is a diagram of computer means allowing the implementation of the methods of the invention;

is a flowchart illustrating a method for determining an arrangement plan according to a first mode of implementation;

is a schematic view of a content arrangement plan according to this first mode;

is a flowchart illustrating a method for determining an arrangement plan according to a second mode of implementation;

is a diagram illustrating the mode of implementation of the ;

is another diagram illustrating the mode of implementation of the ;

is another diagram illustrating the mode of implementation of the ;

is a schematic view of a content arrangement plan according to this second mode;

is a flowchart illustrating a method for determining an arrangement plan according to a third mode of implementation;

is a flowchart illustrating a method for determining an arrangement plan according to a fourth mode of implementation;

is a flowchart illustrating a method for determining an arrangement plan according to a fifth mode of implementation;

is a flowchart illustrating a process for grouping products into logistics load units, implemented in the packaging allocation process described;

is a flowchart illustrating a method of assigning a package to a logistics load unit according to a first mode of implementation;

is a flowchart illustrating a method of assigning a package to a logistics load unit according to a second mode of implementation;

is a flowchart illustrating a process for selecting packaging optimized as a function of logistics load units according to a first mode of implementation;

is a flowchart illustrating a process for selecting packaging optimized as a function of logistics load units according to a second mode of implementation;

is a diagram of an installation for preparing a logistics load unit according to a first embodiment;

is a drawing of part of the installation of the ;

is a drawing of another part of the installation of the ;

is a flowchart illustrating a process for preparing a logistics load unit to be packaged according to a first mode of implementation;

is a diagram of an installation for preparing a logistics load unit according to a second embodiment;

is a drawing of part of the installation of the ;

is a flowchart illustrating a process for preparing a logistics load unit to be packaged according to a second mode of implementation; And

is a flowchart illustrating a process for preparing a logistics load unit to be packaged according to a third mode of implementation.

We represented at the computer means 10 for implementing the processes which will be described subsequently. These computing means 10, conventional for those skilled in the art, include a processing unit 1 of the processor type, a memory 2, of the data carrier type, including a computer program 3 and a database 4, as well as means of interaction 5 for a possible user, such as a keyboard, a mouse. All of these means 10 form a conventional computer, but they can also be distributed among any remote hardware. Program 3 includes instructions which, when executed by unit 1 or any computer, lead them to implement the steps of the processes which will be described below. Corollarily, the medium 2 is any recording medium readable by the unit 1 or by any computer comprising instructions which, when executed by the unit or a computer, lead them to implement the stages of the processes which will be described below. The interaction means 5 allow a user to configure the processes, in particular by assigning chosen values to certain thresholds, certain variables, or by selecting certain characteristics rather than others, in accordance with the thresholds, characteristics and other parameters configurable which will be clearly apparent to those skilled in the art in the processes described below. Whether the steps are described indefinitely, in particular with the use of the pronoun "on", or whether computer means are explicitly mentioned, the steps of virtual arrangements, comparison, choice, arrangement and allocation and other calculation steps described, as well as in general all the steps which will be clear to those skilled in the art that they are of a computer nature, are entirely implemented by the means 10, unless human intervention, for example by a user of the processes, is explicitly mentioned.

We will first describe a process for determining an arrangement plan for several contents in a container, according to four implementation modes.

We will then describe a process for assigning packaging to a logistics load unit, according to two implementation modes.

We will then describe a process for selecting optimized packaging based on logistics load units.

Finally, we will describe a process for preparing a logistics load unit to be packaged.

In the following, by “ content ”, we will designate any object, virtual or real, intended to be integrated into a “ container ”, real or virtual. Unless explicitly stated otherwise, these two types of objects have the shape of straight blocks. It will be clear to those skilled in the art that they are manipulated virtually, that is to say solely through the prism of their data, by means 10, as described below. Thus, they are represented computationally by their three dimensions, and if necessary by their coordinates, in particular 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 processes described below. Naturally, the "real" contents and containers corresponding to these virtual elements do not necessarily have the shape of a right pad, even less of a perfect right pad, but their respective virtual counterparts are necessarily recorded digitally in the form of right pads to make the object of the processes which will be described. The way in which real content or container of any shape is provided with dimensions of virtual right tiles is not the subject of this request and will not be described.

By “ logistics load unit ”, we designate a set of contents, in particular one or more commercial products, intended to be grouped together to be arranged in a common container for delivery. This expression differs from the term “ parcel ” in that a parcel is often associated with a state or status of the logistics load unit. In particular, we usually consider that a package is a logistics load unit provided with a delivery label, en route or arriving at its destination. “ Logistics load unit ” is distinct from any delivery-related status. As for the rest of the objects described, it will be clear to those skilled in the art that by the expression " logistics load unit ", we will regularly designate a logistics load unit only manipulated in computer form by the means 10.

In summary, by "content", "container" and "logistical load unit", we designate entities manipulated by the means 10, such that they could just as easily be designated respectively by the expressions "virtual content", “virtual container” and “virtual logistics load unit”, except in the few cases where it will clearly appear that their real counterparts are designated.

By “ user ”, we mean any human person seeking to obtain the results of the processes described below. These could in particular be actors working in a delivery warehouse, such as an order picker, a buyer or a logistician.

As already mentioned, the implementation of the methods below assumes the possession of virtual objects, in the form of data structures, corresponding for some of them 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 real packaging in a warehouse, the means 10 have the dimensions of these elements so as to manipulate virtual contents and containers correspondent through this data. How these dimensions are obtained and how this data is organized is not the subject of this request. Likewise, the means 10 have databases comprising a multitude of variables relating to specific characteristics of packaging or other objects, such as the weight, the “ fragile ” nature or not of a product, the “ type ” packaging, and all parameters as will be clear from the description. The way in which this data is obtained beforehand and how it is organized into databases will not be described here and is not the subject of the request.

I. Method for determining a layout plan

A “layout plan” will be understood as a data report including at least indications on the result of the arrangement of certain identified contents. The layout plan can 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 can also include the coordinates of each of these contents thus arranged, possibly associated with the orientations of these contents. In more depth, it can present a guide, for example displayed on a screen, presenting in an educational manner the way in which the contents are to be arranged successively.

The input data for this process is three-dimensional content all in the shape of straight oriented tiles. They are represented computationally by any data allowing the dimensions of this content to be established, such as the three values of the respective dimensions of each content. The method aims to arrange them with each other in the most optimal manner possible in a three-dimensional empty space, in particular by minimizing as best as possible the volume of empty space resulting from the arrangement obtained when considering these contents arranged in a right block with dimensions adjusted to the contents thus arranged. The output data forms a plan for the arrangement of these contents in an empty space, a plan whose content varies depending on the implementation modes and the options chosen by a user of the process. The output data includes the minimum dimensions of a container suitable for the contents thus arranged.

This process is implemented automatically by the computer means 10 described above. The contents correspond to real products, belonging to the same logistics load unit, and which it is therefore necessary to arrange together in the most optimal way possible in the same packaging, the same pallet, the same container or the same truck. They can also correspond to different pallets which must be arranged together as optimally as possible in the same container or in the same truck, or even to different containers which must be arranged as optimally as possible in the same truck.

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.

There 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 achieved.

In step 101, the data corresponding to these contents 21, 22 and 23 are recovered. This concerns in particular the dimensions of the products to be arranged, these products having the shape of straight blocks. 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.

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, what is their lowest dimension among their three dimensions, the lowest dimension which is assigned to the “first dimension” of the content in the database. We also determine their respective highest dimensions that the means affect to the “third dimension” of the content. The remaining dimension is assigned to the “second dimension” of the content. On the , we represent the dimensions mi , ma and mo , corresponding to respectively, “first dimension”, “second dimension” and “third dimension” of each content.

In a second variant not illustrated, at least for some of the products to be arranged, we do not determine what are their respective smallest, largest and their intermediate dimensions, and we therefore do not reorganize these dimensions. Thus, for each of these products, the means 10 simply retrieve a first dimension, such as that provided first in a list of product dimensions, a second dimension then a third dimension, and assign them respectively to the first dimension, to the second dimension and the third dimension of each content. So the first dimension of content is not necessarily the smallest, the third dimension the largest, etc. This option is interesting for products for which a user wishes to fix the orientation, such as a bottle which must be oriented vertically. If, for example, the third dimension corresponds to a vertical z axis, the user can freeze the orientation of this product according to this orientation by indicating the height of the product as the third dimension and not allowing the reorganization of the dimensions by the means.

• on somme les valeurs correspondant à leurs « premières dimensions » respectivesmi, de manière à obtenir une première dimension de l’espace 24 les englobant. Sur la , c’est la dimension « DIM1 » ;
• on identifie la plus grande valeur correspondant à la « deuxième dimension »moparmi les deuxièmes dimensions des contenus, de manière à obtenir une deuxième dimension de l’espace les englobant. Sur la , c’est la dimension «mo» du contenu 22, renommée « DIM2 » ;
• on identifie la plus grande valeur correspondant à la troisième dimensionmaparmi les troisièmes dimensions des contenus, de manière à obtenir la troisième dimension de l’espace 24 les englobant. Sur la , c’est la dimension ma du contenu 23, renommée « DIM3 ».

In step 102, an arrangement is determined as follows:

• we sum the values corresponding to their respective “first dimensions” mi , so as to obtain a first dimension of the space 24 encompassing them. On the , this is the “DIM1” dimension;
• 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 the , this is the “ mo ” dimension of 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 the , this is the ma dimension of content 23, renamed “DIM3”.

In step 103, we then have a bounded space 24, having the shape of a straight block and encompassing an arrangement of the three contents as illustrated in the , 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 large ones of the second and third dimensions border the whole.

This space contains the contents arranged in the manner described, a manner which can be provided to a user through the means of interaction, via the display of the arrangement on a screen, and/or by the transmission of the coordinates of the arranged contents . The resulting dimensions of the space, which therefore correspond to the respective sums of the first dimensions, the largest of the second dimensions and the largest of the third dimensions of the contents, can also be provided to the user.

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.

As will be described below in the context of the process of assigning a package to a logistics load unit, a user can then choose a real container, such as a package, a pallet, a container or a truck, corresponding as optimally as possible to these dimensions, in which the actual contents can be arranged in accordance with the determined plan. In particular, the means determine the "minimum dimensions" of the container encompassing these contents, these three "minimum dimensions" simply corresponding to the sum of the first dimensions of the contents, to the largest of the second dimensions of the contents and to the largest of the third dimensions of content. The plan obtained provides the arrangement of contents to be respected for the container.

We will now describe with reference to Figures 4 to 7 a second mode of implementation 200 of a plan for determining the arrangement of the contents in a container.

In step 201, we recover the data of the contents to be arranged, as in step 101. Step 202 corresponds to the formation of a first bounded space which will constrain the search for the optimal arrangement in the following steps . The dimensions of this limited space are therefore the “maximum dimensions” of the container, which cannot be larger. To do this, the means 10 identify the largest content among the contents to be arranged in the container. Then they determine a value, called “value to add”, corresponding to the sum of the maximum dimensions of each content except the largest content. In other words, they identify, for each of the contents except the largest content, which dimension among the three dimensions of the content is the highest, then they sum these dimensions. Then, the means allocate to the first dimension of the bounded space, that is to say 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 add”. They similarly assign to the “maximum third dimension of the container”, the sum of the third dimension of the largest content and the “value to add”. In other words, this bounded space is formed, in the three dimensions, of the greatest possible juxtaposition of the three contents. It is therefore certain that the contents cannot be arranged in a larger space if they are juxtaposed with each other.

We now consider that this first bounded space or first empty space forms the container in which the contents are to be arranged. It's space 31 on the .

Thus, in step 203, one of the first contents, here content 32, is placed virtually in the empty space 31, at a predetermined position of this container 31. By placement, or “virtual” arrangement, we want to mean that it is the computer means 10 which consider the arrangement, for intermediate calculation purposes, without this generating a real effect or a final result. “ Virtual ” placement or arrangement does not necessarily mean that the arrangement is displayed virtually on a screen. It is distinguished from a real arrangement or real placement which would see an arrangement actually made from real contents and containers.

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, juxtaposed to the least three of the four virtual “walls” of the container.

Alternatively, the process can be configured beforehand so that this first content to be placed is the one whose volume is the largest among the contents to be arranged.

In another variant, the volume is replaced by one or more other characteristics specific to the contents, or it is combined with this or these other characteristics. These additional characteristics correspond to the weight of the content, its fragility, its perishable nature, its radioactivity level or another characteristic chosen by the user and available for the means 10, that is to say recorded in the database. of data. For example, the heaviest or least fragile content is placed first, and so on. In the case of combination, the means 10 determine a value combining these characteristics to carry out the sorting. This variant can be chosen by a user wishing to take into account the characteristic(s) of their choice. It therefore configures the process in this direction.

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 Economics, 2013, vol. 145, n°2, p. 500-510 ”, which will be called “ reference 1 ” in the following, itself referring to the document “ LAI, KK and CHAN, Jimmy WM. Developing a simulated annealing algorithm for the cutting stock problem. Computers & industrial engineering, 1997, vol. 32, n°1, p. 115-127 ”, which will be called “ reference 2 ” in the following. Thus, the computer means 10 determine in the container the largest possible empty spaces in the form of a straight block, illustrated in the by the 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 the means 10.

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 contents remaining to be arranged, or spaces included in other larger empty spaces. This step does not exclude any spaces in the .

In step 206, one of the remaining contents to be arranged is chosen. Optionally, the contents remaining to be arranged may have been sorted beforehand by decreasing 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.

In step 207, the chosen content is placed in accordance with the principle of the heuristic called DFTRC2 of “reference 1”, as illustrated in . This figure illustrates, in two dimensions, two possible positionings of content remaining to be arranged in the container 31, either above or next to 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, the illustrates this principle in two dimensions for reasons of simplicity, but the means 10 consider all the objects and therefore the distances in three dimensions. In other words, the means 10 virtually place the chosen content in each of the empty spaces retained in step 205, with a vertex of the content 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 top of the content closest to this point. As already mentioned, by “placent”, we mean that the computer means 10 “consider” a positioning, without it being constructed virtually, but only for calculation purposes. The predetermined point 38 of the container used to calculate these distances corresponds to the coordinates furthest possible from the origin (0, 0, 0), it is therefore the vertex of the container opposite this origin in three dimensions. The positioning chosen, among the positions tested, is the one corresponding to the greatest distance calculated.

It should be noted that “ reference 1 ” evokes a Euclidean distance of type

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 content 32 in a given BO orientation (for “Box orientation”) .

We will prefer, in the context of the invention, to use the following distance:

Indeed, this distance turns out to give more optimized layout results on average.

In step 208, we repeat the step of determining the empty spaces resulting from step 204, this time on the basis of the container including the first and second contents arranged.

In step 209, we repeat the step 205 of excluding certain resulting empty spaces.

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

This content is chosen in accordance with a sorting of the contents carried out beforehand, in particular if, as mentioned in step 206, the contents have been sorted by decreasing volume or according to one or more other characteristics. But it can also be chosen in accordance with an order predetermined by a user, or randomly. It is this last case that we apply in particular with reference to implementation mode 300 described below.

In step 211, step 207 is repeated with this content.

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

In step 212, a minimal space is then determined, in the form of a straight block, encompassing the contents thus arranged virtually. The means thus determine on the one hand its dimensions and its volume, and on the other hand form the layout plan to be provided to the user, who can then apply it to their actual contents. An example of a virtual arrangement with multiple contents, obtained by this method 200, is illustrated in .

In many cases, thanks to the virtual placement steps consistent with the maximum empty spaces determined, this minimum space will be less voluminous than the limited space 31 determined in step 202 and less voluminous than the space determined by the method 100.

Here again, as at the end of the method 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 layout plan can also contain, in addition to these elements, the minimum dimensions determined in order to choose optimized packaging, pallets, containers or trucks.

In optional steps not illustrated, possible positions of each content, both the first and the remaining contents to be arranged, include the possible orientations of the content. Thus, during step 207, it is not only the different possible locations of content oriented in the same way that are tested, but the different possible orientations of the content for each possible location. We therefore test the different “ BO ” (for “Box Orientation”) possible in the equation presented above.

Likewise, at the time of placement of the first content in step 203, the comparison of the distances in step 207 can be carried out for each possible orientation of this content in the predetermined location, at the position (0, 0, 0 ), so as to choose the orientation for which the distance is greatest.

The number of orientations tested for each of the contents, or even the choice of orientations tested, can be configured by a user of this process 200 beforehand. This setting can be applied to all content indifferently, but it can also be specific to each content. Thus, we can authorize certain orientations for one content but not for another.

We will now describe, with reference to the , 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 ”.

In step 301, we recover, as in steps 101 and 201, the data corresponding to the contents to be arranged.

In step 302, the contents are sorted according to their decreasing volume.

In step 303, the computer means 10 determine a sequence of random numbers between 0 and 1, these are the random keys, or digital scores.

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 is made up, in this order, of the scores 0.3, 0.7 and 0.4, the means reorder the contents by placing the least voluminous of these contents in the first position because 0.3 is the most smallest of the scores, the most important of the contents in second position because 0.7 is the largest of the scores and the one whose volume is intermediate last, because 0.4 is the intermediate score. Thus, the random sequence defines an order, or a sequence, of contents to be arranged according to a first arrangement plan. This principle will be taken up later.

In step 305, the means 10 determine this first arrangement plan in accordance with the method 200 described above, that is to say via the search for the maximum spaces available. The order of the contents to be arranged is defined by the sorting of step 304. It should be noted that where " reference 1 " encourages numerical scores to be given also to the different orientations of the contents, which are therefore treated as so many contents, it is alternatively provided in the invention to carry out the method 200 by testing all or more of the possible orientations taking into account the configuration constraints or the characteristics of each of the contents to be arranged, when choosing the positioning of the contents in the empty spaces, the number of orientations tested can be configured. Thus, the choice of orientations is made internally to the process 200.

Then, steps 303 to 305 are repeated, with therefore new numerical scores generated, for the same contents, so as to obtain several layout plans for several different orders of arrangement of the same contents, until the set of contents to be arranged has been chosen first. Alternatively, we can decide on a limited number of reiterations, configured upstream.

All of the determined layouts form an initial population, or initial generation, of layout plans.

In step 306, the means 10 determine the empty rate of each minimum container determined in the layout plans of this initial population. To calculate the void ratio, the means relate the volume of a container with the minimum dimensions, determined by the arrangement determination method 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 layout plans, associated with their void ratio.

The means then proceed in the following stages to the creation of a subsequent generation of layout plans of the same contents.

Thus, in step 307, the means 10 implement a step of selection, according to the genetic algorithm, of some of the plans of the initial population. This selection is made on the basis of the calculated void ratio. Thus, the means classify the plans by void ratio, and only select a predetermined number of these layout plans, for example the plans corresponding to the 20% of the plans whose void ratio is the lowest.

In step 308, the selected plans, forming “ the elites ”, are crossed with each other and/or with the other remaining plans of the initial population, in accordance with the genetic algorithm. Thus, to carry out this crossing, it must be remembered that each of these plans remains associated with a series, or sequence, of scores between 0 and 1, and an empty rate of this sequence. In this context, the means 10 randomly determine the position of the score from which the means 10 invert, two by two, the scores of these two selected sequences, called " parent ", so as to generate " child " sequences comprising first scores identical to those of one of the parent sequences and subsequent scores identical to those of the other parent sequence. By reproducing these crossings on several parent sequences from the “ elites ”, the means produce several child sequences. These “ child ” sequences are therefore each made up of a sequence of scores between 0 and 1, each forming a new order of contents to be arranged.

Thus, in step 308, the plans resulting from the crossing, which form the generation following the initial population, are the subject of the steps of the method 200 for each of the “ child ” sequences, determining their arrangement plan. Then, their respective void ratio is in turn determined.

Again, the selection 307 and crossing 308 steps are carried out according to these void ratios, to form subsequent generations of arrangement sequences. The population having followed the initial population therefore replaces the latter for the reiteration of the selection and crossing stages, to form a new generation, which is in turn subject to the selection and crossing stages, and so on.

During these steps, each layout plan determined on the basis of these layout sequences, and each void ratio of these plans, are saved by the means 10.

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 the means that the empty rates of successive plans no longer decrease sufficiently, or even rise again. , after crossing stages 307 and 308 of the last generation.

Alternatively, we can also provide as a stopping condition the fact that a specific plan has reached a predetermined void ratio.

In step 309, the means 10 choose the layout plan which presents, among all the layout plans determined at all the stages, that is to say of all the populations, the lowest void rate . Thus, it is this layout plan which is the result of this process 300.

In a variant, among all the layout plans determined at all stages, that is to say all populations, the means 10 identify the layout plans which respect one or more criteria selected beforehand by the user. These criteria relate to weight, fragility, a level of radioactivity, or even the perishable nature of the contents arranged. For example, if the user has configured the means 10 so as to require an arrangement organized according to the weight of the contents, then the means 10 only identify the arrangement plans in which the heaviest contents are located under the lighter contents. . If the criterion only refers to a level of radioactivity, the means identify the plans in which highly radioactive content is surrounded by contents limiting the emissions of radioactive substances outside the container, for example. It is then, among all the plans identified as corresponding to one or more criteria or a set of selected criteria, that the means 10 determine the arrangement plan having the lowest void ratio, a plan which then forms the result of this process 300.

Optionally, in addition to the crossing step, the means 10 also carry out a mutation step between two successive generations. Thus, they modify, randomly, one or more of the numerical scores of one or more parent or child sequences. This mutation step makes it possible to increase the amount of chance in the order of the contents to be arranged in order to explore arrangements which would not have been explored otherwise through the parent lineage.

This mode of implementation 300 is more optimized than the method 200 insofar as it compares the results of several methods 200 based on content arrangement sequences, that is to say content arrangement orders , different. In particular, for a large number of contents to be explored, this process 300 generally makes it possible, on average, to optimize the empty rate compared to a process 200 which would be based on an arrangement with random order or fixed arbitrarily, for example with the contents arranged in an order given by their volume, in descending order. In addition, the method 300 makes it possible to avoid the exhaustive search of arrangement possibilities compared to a classic algorithmic approach where all the possibilities would be explored. It therefore makes it possible to find an exact solution or approximate to an exact solution more quickly.

We will now describe, with reference to the , a fourth implementation mode 400 for determining an arrangement plan. This involves implementing at least two of the three implementation modes 100, 200 and 300 described previously, comparing the layout plans determined by each of them, and selecting the most appropriate.

Thus, in step 401, the means 10 implement the method 100 to determine a first arrangement plan for the contents in a container.

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.

In step 403, the means implement the steps of the method 200 to determine a second arrangement plan for the contents in a container.

In 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.

In step 405, the means select, among the two plans, the one whose resulting container has the lowest volume.

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

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

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

This implementation mode 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, if, on average, the process 200, and even more so the process 300, provide more optimized arrangements than those of the process 100, that is to say with smaller final container dimensions and therefore lower production rates. lower empty space, it happens in certain cases that the volume of the container determined by method 100 is lower than that resulting from other modes of implementation, for the same contents to be arranged. Comparing the results of processes 200 or 300 to those of process 100 therefore allows you to always choose the most optimal arrangement. In addition, the computer effort due to process 100 is relatively low compared to those linked to process 200, and especially to process 300, so that the additional time allocated to this process 100 and to the comparison of volumes or void ratio is negligible.

Alternatively, it can naturally be expected that it is the results of processes 200 and 300 which are compared. It can also be expected that the three processes 100, 200 and 300 are implemented and their results compared.

We will now describe, with reference to the , a fifth implementation mode 500 for determining an arrangement plan.

In step 501, the means 10 recover the data corresponding to the contents to be arranged, but also, and this is the difference with the previous modes of implementation, those 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 we wish to virtually test the arrangement of the contents. Thus, within the framework of this mode of implementation, we do not proceed to step 202 of the modes of implementation 200 to 400 previously described to generate a first empty bounded space, because this first empty bounded space in which the contents are to be arranged is, in this mode of implementation 500, that of the chosen container.

In step 502, all the steps of the method 300 are carried out for these contents and this container, the only difference being the absence of step 202, as explained above, replaced by the step of providing the dimensions of the container. We therefore determine, using the genetic algorithm with random keys, a plan for arranging the contents in the chosen container.

In other words, this fifth implementation mode 500 is the application of the genetic algorithm of the method 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 only the arrangement of these contents in this container provided upstream.

This mode of implementation 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 mode of implementation will thus be mentioned below in the context of an implementation mode 800 of a process for assigning packaging to a logistics load unit.

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

The user implementing this process through a process 10 can therefore obtain one or more layout plans for contents in 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 by eye, but chooses the packaging according to the dimensions of the virtual container resulting from the arrangement process. In addition, these means also provide him with the positions of the contents, that is to say products, to be arranged in the manner in which the process has determined it, in the container. Thus, the order picker does not have to worry about optimizing his layout, he can simply follow the instructions provided by the means 10 through the determined layout plan. These instructions can for example be provided via a screen available, on which the positions and orientations of the different contents corresponding to the logistics load unit that the order picker must prepare are illustrated. Alternatively, these positions can be provided to other automated means, which then automatically arrange the products in the packaging themselves in accordance with the plan determined by the means 10.

By optimizing the arrangement of contents in a container, and in particular by optimizing the arrangement of the products of a logistics load unit in its packaging, this process makes it possible to choose more suitable packaging, in particular with the closest possible dimensions. optimized layouts, and therefore reduce the empty rate of packaging. By automatically providing the appropriate layout and container, it makes it possible to have and therefore authorize the operational use of a greater variety of types of packaging in the warehouse. It allows you to choose the optimum packaging and arrange it in an optimized manner without wasting time preparing for shipment of the packaged logistics load unit.

In addition to allowing the arrangement of products in a package, this method is also suitable for the arrangement of several logistic load units, in particular packaged, which form contents, in a pallet, a container or a truck, which form a container. It is also suitable for the arrangement of several pallets, or several containers, which form contents, in a truck, which form a container.

II. Method for assigning a package to a logistics load unit

The inputs to this process, implemented by the computer means 10, are data structures corresponding to products intended to be grouped to form a logistics load unit to be packaged. The output of this process is the choice of a packaging, among several possible packagings, to package each logistics load unit, before shipment. The order picker can then choose the packaging indicated to him for the corresponding logistics load unit. Alternatively, the output of the process consists of ideal packaging dimensions to package the logistics load unit, the packaging then having to be manufactured to measure, manually or by robot.

Management of packaging with variable dimensions

Precise package dimensions are necessary in the processes described in this application. This is why, in steps not illustrated, carried out beforehand or during the processes described in the entirety of this application, the means 10 identify, among the packaging used in the processes, the so-called “ variable size ” packaging. These are packages whose usage dimensions can vary depending on how the user uses them. This is the case for plastic bags, but also for “gusset” type packaging, or “variable size” boxes. The means 10 then implement calculation methods known to those skilled in the art and specific to each type of packaging with variable dimensions, to determine their dimensions. This may include taking into account the dimensions of the packaging in its largest configuration. Once these dimensions are known, these are the dimensions which are recorded for the respective packaging and taken into account in the processes described in this application.

Grouping of products into logistics load units

In reference to the , we will describe a process 600 for grouping products into a logistics load unit, carried out prior to the process of assigning the packaging to a logistics load unit described below. It is implemented automatically by computer means 10. These receive a list of shipments, each shipment being made up of products to be sent to the same location, and therefore potentially in a grouped manner.

In step 601, the means considers one of the shipping lists and identifies whether it contains a single product. If so, they create a logistics workload unit, that is, a data structure associated with this logistics workload unit, and include only the product in it. The logistics load unit goes to step 604. If this is not the case, and therefore if the shipment contains several products, it goes to step 602.

In step 602, the means checks whether, in the shipment, certain products are associated with an exclusive packaging requirement. 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 pass to step 604. For the other products in the shipment , the means create a single logistics load unit which will group together these other products not requiring exclusive packaging, and the means pass to step 603 for this logistics load unit.

In step 603, the means 10 identify, among the products making up the logistics load unit, if some of them are associated with specific characteristics implying particular packaging requirements, that is to say packaging “types”. By “type of packaging”, we designate throughout the application a packaging associated with a specific type of packaging, the packaging of this type, or type, being similar in their structure or their material. For example, “double-fluted packaging” corresponds to a specific type of packaging, distinct from “single-fluted” type packaging. “Cardboard” packaging is a distinct type from “plastic” packaging, “paper” packaging, or “composite material” packaging. Packaging can alternatively or additionally be classified by type of “robustness”, for example by a score, since generally one type of packaging is more or less “robust” than another type of packaging. The possible types of packaging are known to those skilled in the art and will not be listed exhaustively. This type of data is recorded in advance in a manner not described. Here, at this step 603, the means then associate with the logistics load unit the most robust packaging among the packaging required by the products, if some of these products require packaging of particular robustness.

The logistics load unit is ready to move on to the packaging allocation 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 type of packaging will have been selected in step 603 for this logistics load unit, the packaging allocation method will only be implemented for a list of available packaging corresponding to the selected type.

Step 604 is implemented only for logistics load units including only one product. The means 10 check whether this product is associated with imposed packaging or with precalculated packaging, in which case, if real packaging is available to the user, in particular to the order picker, the method of assigning packaging to the modes 700 and 800 need not be implemented. Otherwise, this logistics load unit, equipped with a single product, is subject like the others to the following process. By “precalculated” or “imposed”, we designate specific packaging which is previously directly associated with the logistics load units, via indications to this effect in the database, so that the process described below, which aims to choosing a packaging from the available packaging is not necessary for these logistics load units. In particular, “imposed” packaging is generally imposed by the logistician on the product. “Precalculated” packaging is determined by means 10, in a manner not described, based on the order history of the logistician.

Finally, it should be noted that, for certain logistics load units including only one product, the product is “pre-packaged”, that is to say that it already has packaging. These products, and therefore the corresponding single-product logistics load units, are naturally excluded by the means 10 of this grouping process and are not the subject of the packaging allocation process which follows, since by definition these units logistics load are already made up of packaging.

Packaging assignment

In reference to the , we will first describe a first mode of implementation 700 of a method of assigning packaging to a logistics load unit. Like all the methods described, they are implemented by computer means 10.

The means go through the list of logistics load units and consider them one after the other. The following thus concerns only one of these logistic load units to be packaged, the same process being reproduced on the others.

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

In step 701, the logistics load units comprising several products are subject to the arrangement determination method described above, in accordance with implementation mode 100, 200, 300 or 400. In other words, the means 10, which store the data, that is to say dimensions and other coordinates, of the contents in the form of a right block corresponding to real products, determine the arrangement plan of these contents, as well as the minimum dimensions of the container intended to contain these contents. The choice between implementation modes 100, 200, 300 or 400 of the layout determination method depends on a level of service required by a user, by a parameter predetermined upstream. It may also be a one-off choice made by the user of the process for a logistics load unit or a group of particular logistics load units. At the end of this step, the minimum dimensions determined by the layout process, whatever its mode of implementation, are assigned to this logistics load unit.

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 process of assigning packaging to a unit of logistical burden. In fact, all the steps of the packaging allocation process are independent of the steps of the layout plan determination process. It is however advantageous, in order to reduce the empty rate of logistics load units, to proceed with the arrangement determination process as described above according to its different modes of implementation.

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

In step 703, among the list of packaging, the means 10 select only those which are materially capable of containing the logistic load unit, that is to say whose first dimension is greater than the first dimension of the the logistics load unit, the second dimension of which is greater than the second dimension of the logistics load unit and the third dimension of which is greater than the third dimension of the logistics load unit. Alternatively, the selection of packages whose smallest dimension of the package is greater than the smallest dimension of the logistics load unit, whose intermediate dimension is greater than the intermediate dimension of the logistics load unit, and whose largest dimension is greater than the largest dimension of the logistics load unit. In this way, it is certain that the selected packaging is spatially capable of containing the logistics load unit. In another variant, this verification/selection can be carried out subsequently, at the time of step 707 described below.

In step 704, the means carry out a prioritization step according to criteria configured by upstream use, and sorting according to this prioritization, on the packaging selected in step 703. According to a first option 704-A, this Prioritization is carried out solely based on the volume of packaging. Thus, the packaging is sorted by increasing volume. In the following we will speak indifferently of “criterion” or “characteristic”. This is a variable specific to an entity and known as such by means 10.

Alternatively, according to option 704-B, a criterion, or characteristic, of packaging durability is added to the volume of the packaging. Thus, packaging is, beforehand, associated with a sustainability score depending on its type, in particular a number between 1 and 2, but which could of course be located in a different range. In particular, reusable packaging is associated with a lower sustainability score than new packaging. Packaging that has been used a large number of times has an even lower score. The packaging materials also play a role in the packaging score. These scores are defined upstream, by a logistician or another user. To take them into account in addition to the volume in the context of this step 704-B, the means 10 multiply the actual volume of the packaging by the associated durability coefficient. The resulting data can be called " fictitious volume ", in that it associates the real volume of the packaging with a coefficient. The packaging is thus sorted by increasing fictitious volume. Thus, for the same real volume, packaging recorded as being more sustainable than another will see its fictitious volume smaller, its sustainability score being smaller, and will therefore be given priority.

Alternatively, according to option 704-C, at least one other characteristic can be taken into account, in addition to the real volume or the fictitious volume, to carry out this packaging sorting step. This concerns in particular the price of the packaging. To associate it with the real or fictitious volume of the packaging, the means 10 this time perform a normalization of all the variables to be taken into account. Thus, they take into account all the criteria of all the packaging to be sorted and standardize them according to the following formula:

, with x the type of variable to be normalized among the real or fictitious volume, or the price, max(x) and min(x) the maximum variables and respectively of the same type among all the packaging, x _i the value of the variable to normalize before normalization. The _normalized x is necessarily a value between 0 and 1.

After standardization of the variables of the packages to be sorted, the means 10 sum, for each package, these variables, 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 to 2 for the price, so that a high price generates a sum high. Then, the packages to be compared are sorted according to the result of their respective associated sums, in ascending order. Alternatively, we can assign the factors in a different way, in the example by reversing 1 and 2, and sort the sums in a decreasing manner.

According to a 704-C variant, other criteria, or characteristics, can 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 prioritization value, so that the packages can be sorted.

At the end of step 704, and whatever the variant implemented, the packaging is now sorted, at least according to the actual volume, or even by associating other criteria. The result is that they are sorted in such a way that, all things being equal, a package with a smaller volume takes priority over a package with a larger volume. By “ all things being equal ”, we mean that all other variables are identical.

In step 705, the means 10 consider the first packaging in the list to be sorted, so as to make it undergo the following steps. As this packaging has priority over the others, it is in fact the one that would be most appropriate for the logistics load unit if its assignment is confirmed. The means 10 determine whether margins are computationally associated with products forming the logistics load unit, and if so, assign the highest margin to the dimensions of the packaging for the following steps. Otherwise, the packaging itself may have been previously associated with a margin to be respected, therefore selected by the means 10 in the same way. Finally, as a last resort, an overall margin may have been configured beforehand by a user, who is then, at this step, selected by means 10. The result is that the “ referenced dimensions ” of the packaging chosen at the start of The step can be, at the end of this step 705, slightly modified by the means 10 to respect a margin, resulting in the “useful dimensions” of the packaging. By “useful dimensions”, we mean the dimensions used in the rest of the process, except in the context of a calculation of void ratio, and also the actually usable dimensions of the packaging. In particular, without a margin, it can be difficult to arrange the products provided in the packaging. Thus, in the following, when we use the dimensions of the packaging, unless specified in the case of void ratio calculations, we will refer to the useful dimensions calculated in this step 705, and by default to the dimensions as they are referenced and known to the means 10. For calculations of void ratio, however, reference will be made to the “real dimensions”, as explained below.

In step 706, the means 10 carry out a step of verifying the adequacy between the useful dimensions of the chosen packaging and the logistics load unit. In a variant 706-A, the means 10 only check if the weight of the logistics load unit is much less than or equal to the maximum weight theoretically supported by the packaging. The weight of the logistics load unit is determined on this occasion by summing the weights of the products, known by means 10 beforehand. Where applicable, suitability is confirmed, and the chosen packaging is assigned by means 10 to the logistics load unit. Otherwise, the adequacy is invalidated.

In a 706-B variant, after confirmation of the weight, the means check a void rate generated by this packaging for this logistics load unit. This involves calculating the volume of the packaging and relating it to the added volumes of the products in the logistics load unit. Means 10 use the “real” dimensions for this purpose and not the “useful dimensions” of the packaging. Indeed, if there is a margin, it increases the void and must therefore be counted as such. If the vacuum rate is lower than a predetermined threshold, called “individual vacuum threshold”, for example 60%, the adequacy is confirmed, otherwise this is not the case. This threshold can be predefined by a user, for example a logistician, or chosen by a client, for example a recipient or a sender of the logistics load unit.

In a non-illustrated variant of this step 706-B, a comparison of the empty rate is carried out not on a single logistics load unit but for a plurality of logistics load units. Thus, if the user has previously configured the method in this sense, to confirm or not the adequacy of a logistics load unit for an affected packaging, the means 10 calculate the average empty rate of the logistics load units, of which the adequacy has previously been confirmed, for the same predetermined period (the same day, the same week, the same month) having preceded the processing of this logistics load unit. If this average void rate is lower than a void threshold called the “global void threshold” defined by the logistician, then the logistics load unit sees its suitability for the affected packaging confirmed. Thus, even if this logistics load unit has an individual empty rate associated with its packaging greater than the planned individual threshold, its adequacy is still confirmed because it succeeds a series of logistics load units associated with packaging resulting in a sufficiently low average void ratio. This serves the objective of reducing the average empty rate of the logistics load units shipped, by tolerating that a part of them maintain empty rates higher than a fixed individual threshold. Furthermore, according to this variant, it can be provided that, if the average empty rate is greater than the overall empty threshold, rather than invalidating the adequacy of the current logistics load unit, the variant is implemented. of this step 706-B as described above, that is to say that its individual vacuum rate is compared to the planned individual vacuum threshold.

It can be expected, by configuration, that certain of the characteristics of the logistic load units as they are known to the means 10 make them exempt from the calculation of the void ratio and therefore from this step 706-B and its variants.

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

If the packaging assigned to the logistics load unit 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 if among the products forming the logistics load unit there is one or more products considered “ fragile ”. If necessary, the means 10 verify that the packaging is itself registered as being “ suitable ” for containing a fragile product, or even for containing a product presenting the type of fragility considered. Finally, if necessary, the means 10 check whether the arrangement, determined by the arrangement method of 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 located under another product, or under another product having a weight greater than a predetermined value. The means 10 therefore check at this step whether these possible constraints, known in the form of characteristics pre-recorded in the databases, are respected by the layout plan. If applicable, the assignment is confirmed, otherwise it is reversed.

Alternatively, the verification of adequacy may also relate to the dimensions of the packaging, the means verifying that each of the dimensions of the packaging is equal to or greater than each of the dimensions of the logistics load unit. This step is not necessary if the selection of packaging in step 703 has already been the subject of this verification.

In step 708, if the packaging is confirmed, it is assigned to the logistics load unit. The process of assigning packaging to the logistics load unit is then successfully completed.

In step 709, if the verification of adequacy has been invalidated in one of the previous steps and variants, the means select the next packaging in the sorted list resulting from step 704, and repeat steps 705 to 707, until a package is considered adequate, or until the end of the list of sorted packages. Alternatively, the step may not be repeated when a predetermined number of packages having been the subject of steps 705 to 707 has been reached.

In step 710, if no packaging from the list was deemed suitable during steps 706 and 707, the means 10 can identify that packaging not selected in step 702 is available in the warehouse, via their database . This concerns in particular the variant where only packaging presenting a certain type of robustness was selected in step 702. Thus, in step 710, packaging of another type can be selected. This is particularly the case if the criterion for the type of packaging selected is robustness, and there are packaging of a more robust type in the database. Therefore, steps 704 and following are repeated for packaging of this type. This step 710 can only be carried out if the user has previously authorized it.

Step 711 takes place if no packaging from the list, or lists if step 710 has been implemented, has been deemed adequate during steps 706 and 707 of checking the adequacy between the packaging and the logistics load unit. Means 10 then offer the user, the logistician or the order picker for example, the creation of tailor-made packaging. In this case, the means 10 assign to this future packaging the minimum dimensions calculated of the logistics load unit in step 701, that is to say thanks to the method of determining an arrangement plan according to the implementation modes 100, 200, 300 or 400. In a first possible variant, these dimensions are then displayed on a screen or provided by any means to a third party which produces, by manual preparation, the packaging. In a second variant, these dimensions are provided to a robot or other means which will not be described here and which can then proceed to the autonomous and automatic creation of the packaging, which like other packaging contains a data structure available to means 10, which allocate this packaging to the logistics load unit.

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

We will now describe a second mode of implementation 800 of the method of assigning packaging to a logistics load unit. As for mode 700, it is implemented after the process of grouping into logistics load units has been implemented. It therefore only concerns, as for mode 700, the load units which, at the end of the grouping process 600, are devoid of affected packaging.

As for implementation mode 700, the means consider each of the logistics load units one by one. The rest of the steps therefore concern the assignment of packaging to a specific logistics load unit.

Unlike implementation mode 700, in this implementation mode 800 the method does not begin with determining the layout plan for the products of the logistics load unit, stated in step 701.

Thus, in step 801, the means 10 recover the types of packaging corresponding to the logistics load unit, as in step 702.

In step 802, the means select only the packaging capable of containing the logistics load unit, as in step 703.

In step 804, the means sort the selected packages, in the same way as in step 704, on the basis of any possible same variants. At the end of this step 804, the selected packaging is therefore sorted in a list, as at the end of step 704.

At step 805, a journey through each of the packages in the list begins by means 10. Unlike implementation mode 700, this journey is not interrupted as soon as a package is deemed adequate. Thus, a list containing at least one packaging is subject to the following steps. The means first choose the highest priority packaging from the sorted list in step 804, and associate a margin determined in the same way as in step 705.

In step 806, the means 10 implement, for the logistics load unit, and for the packaging chosen in step 805, the arrangement determination method according to implementation mode 500 described more high. Indeed, as indicated during the description of this mode of implementation, it differs from other modes of implementation of the arrangement determination method in that the dimensions of a real container are provided as input. Thus, during the implementation of this step 806, the means 10 provide the "real" and possibly "useful" dimensions of the packaging selected in step 805, and determine, via the genetic algorithm as described below high in the context of process 300, the arrangement plan of the products of the logistics load unit in this packaging.

In step 807, the means 10 carry out a verification of the adequacy between the logistics load unit and the packaging in the same manner as in steps 706 and 707. The result of this verification is stored by the means 10 .

As mentioned above, the process does not stop here in the event of validation of adequacy. Indeed, steps 805 to 807, and therefore in particular the method of determining the arrangement of mode 500, are repeated for the following packages from the sorted list resulting from step 804, and always for the logistics load unit considered. at the start of the process. The results of step 807 are therefore stored for each of these packages.

The reiteration 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 configured beforehand by a user of the process. The higher it is, the higher the number of packaging “tested” via the arrangement process. These steps can also be interrupted if the list of packaging has been completely covered.

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

In step 809, if several packages have been deemed adequate, the means allocate to the logistics load unit the one for which the determined void rate is the lowest.

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

At the end of this mode of implementation, the process therefore identifies packaging suitable for the logistics load unit, or does not identify any packaging.

As mentioned, the description related to a single logistics load unit. Naturally, the means 10 then repeats the steps for the next logistics load unit in the list of logistics load units.

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

I II . Optimized packaging selection process based on logistics load units

The packaging selection process aims to identify, for a logistician, either on the basis of previous orders having been the subject of logistics load units shipped by the logistician, or on the basis of new products never shipped, which are the packaging references that are most appropriate for the products likely sent in the future by the logistician. This allows the logistician to anticipate future shipments by having in its stock packaging of the most suitable types and dimensions, so as to reduce the empty rates generated by the logistics load units packed and shipped, and in order to avoid unnecessary storage of packaging in warehouses or too high an empty rate of “packages”. We can speak of 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 logistician having appropriate packaging in the warehouse will generate on average less empty space than with unsuitable packaging. However, it is advantageous to combine the implementation of the methods described. An order will be understood to include a list of at least one product ordered, most often several products ordered.

This method of selecting packaging on the basis of logistics load units, implemented by the means 10, therefore receives as input at least a list of orders, considered to be based on products which will be shipped in the future by this same logistician. In a first mode of implementation described below, the method also receives as input a list of specific packaging to be tested on these products, to select only the most appropriate ones. We can anticipate the receipt of several packing lists. In a second mode of implementation described below, it only receives the products and/or orders and deduces ideal packaging to acquire, or even to have made to measure.

It is up to the logistician to configure which orders are provided to the input means 10. These may be orders, consisting of products, shipped in the past. Indeed, it generally happens that the type of orders shipped in the past are similar to orders shipped in the future. It is therefore relevant to select packaging based on a history of previously shipped orders. For example, it can be all of the orders that the logistician has shipped over a predetermined period, for example over an entire year, or a season, or over a shorter period, for example around Christmas. It could also be only a certain type of orders that it has shipped. This process is implemented occasionally or at predetermined intervals by the logistician, for example once a week, or once a month, in order to update the identified packaging references. But the logistician can also or alternatively provide orders for products that have never been shipped, for example new products that he expects to deliver in the future. He then wants to anticipate the packaging to be held in stock for these orders.

We will first describe, with reference to the , a first mode 900 of implementing a packaging selection process based on logistics load units.

In step 901, in one step, the means 10 obtain a list of products forming the orders previously shipped by the logistician, recorded in the form of a shipment list, each shipment including products to be shipped. These are the orders corresponding to those that the logistician wishes to test, to determine which packaging would be most appropriate in the future in the event of similar orders. Alternatively, the means 10 obtain a list of products forming orders never previously shipped by the logistician. These include, for example, new batches of products planned for Christmas. Alternatively, the resulting list contains both previously shipped orders and never shipped orders. In all cases, the means hold the necessary characteristics of the products, such as their dimensions, their possible additional characteristics: fragile, pre-imposed or not, margin, etc.

In step 902, the means obtains a list of packages. These packaging, distinct from each other, are also provided by the logistician. They correspond to the packaging references already recorded in the database, that is to say those available to the logistician in the warehouse or which the logistician already knows. The logistician then wants to identify which are the most appropriate references, in terms of dimensions or type, to the products of step 901, among these already known packaging.

Alternatively, at this step 902 other packaging references may be provided, which the logistician has not already tested or for which he does not have actual packaging in stock. These “to be tested” packaging come, for example, from packaging suppliers different from the logistician’s usual supplier. In this case, the logistician's objective is to test these new packaging references on his orders in order to identify whether there are references more appropriate than the packaging he uses.

Alternatively, he can naturally provide a list including both packaging references that he uses and new packaging references to test, so as to identify the references with which he can improve the packaging catalog of which he has and those he can ignore.

Means 10 go through these products from step 901 and exclude shipments containing at least one product which no longer exists. Indeed, if a product shipped in the past no longer exists, it is not necessary to carry out the following steps for this product.

In step 903, the means 10 group the products of step 901 into logistics load units, so as to create a list of logistics load units, and to possibly determine the types of packaging associated with the latter, by means of steps similar to those of method 600 described above. The only difference is at step 604: for the implementation of method 900, for the logistics load units comprising “ pre-imposed ” packaging, that is to say required in a predefined manner by a logistics load unit and thus associated with them in the database, the means 10 check whether this packaging exists among the packages of step 902, and, if necessary, exclude the logistics load unit from the list of logistics units. logistical burden created. Indeed, if a logistics load unit requires specific packaging which is already known, it is not necessary to carry out the following steps for this logistics load unit since it is not necessary to look for better packaging for this logistics load unit.

In step 904, the means go through each of the logistics load units from the list of logistics load units resulting from step 903 and determine their dimensions for each of them. For this, the means apply to each of these logistics load units the method of determining the layout plan 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.

Alternatively, the means could determine the dimensions of each logistics load unit in a separate manner as part of this process of selecting packaging based on logistics load units. However, it is advantageous for these logistics load units to be as compact as possible, so as to select the smallest possible packaging, so that the arrangement method described above is particularly relevant.

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

The following steps are carried out for each of the packages in this sorted list from step 905. In other words, the means 10 consider in step 906 the highest priority packaging among the sorted list of packages to be tested before to proceed to the next steps, and the following steps will be repeated for each of these packages, in the order of the sorted list.

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 identified, during step 603 of the method 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 that corresponds 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.

In step 908, the means 10 select from this local list of logistics load units resulting 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, both to the logistics load unit and to the packaging, to carry out this step, the margins being preconfigured by default or defined, possibly upstream, by the user.

In step 909, the means browse the local list of logistics load units, resulting from step 908, specific to the packaging chosen in step 906, and carry out, for each of these logistics load units, with respect to this packaging, the steps of verifying the adequacy 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 to say when it is judged suitable for packaging, the means 10 assign this logistics load unit to the packaging, and increment a counter of logistics load units assigned to packaging.

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.

In step 910, when each logistics load unit in the local list has been verified for its suitability for the packaging, the means determine, via the counter, how many of them have been deemed suitable for this packaging. If this number has reached a predetermined threshold, then the packaging is selected as part of the packaging that must be stored 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 orders tested. It is considered that if the packaging reaches this number, this proves that it has been judged adequate for many logistics load units, and therefore is likely to be suitable for future logistics load units, resulting from future orders. Furthermore, if this packaging is thus selected, and only if this is the case, the means 10 remove, from the list of logistics load units resulting from step 903, the logistics load units having been assigned to the packaging selected during step 909. Thus, the other packaging cannot be subject to verification of adequacy for these logistics load units, so as not to select packaging references which would be redundant. By having previously sorted the packaging references, we ensure that only the highest priority packaging is selected, therefore in particular those generating the lowest empty rate or, in addition and for example, depending on the variant of the packaging. The chosen step 704, associated with particularly relevant durability.

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 load units remaining to be processed. In this way, the further back a package is located in the sorted list, that is to say the less priority it is, the fewer the logistic load units remaining to be tested, and therefore the less likely it is that the packaging is selected, which favors, as mentioned, the selection of priority packaging and the exclusion of others. Conversely, a lower priority packaging selected means that there remained many unsuitable logistics load units with the previous higher priority packaging, so that this selected packaging is relevant in view of the orders supplied as input.

At the end of this mode of implementation, the logistician therefore has a list of selected packaging, part of the packaging provided in step 902. This list is the subject of a step 911 of sending the list to the logistician.

This allows it to acquire and have in stock, with a view to future shipments to be managed, selected packaging. By selected packaging, we naturally refer to “packaging references”, that is to say a specific type and dimensions of packaging. The quantity of these packaging, for each selected reference, is also data that can be provided by this process since the process has determined the number of logistics load units appropriate to each packaging. By extrapolating according to the number and possibly the period concerned by the orders provided as input, the means 10 determine a number of packaging to be acquired, over a given period, associated with each selected reference, and also provide this data during this step 911.

Alternatively, this list is associated with a calculation report including other information relevant to the logistician or any other user of the process. In particular, the means 10 can associate with each selected packaging reference the number of logistics load unit assignments, the price of the packaging if it is recorded in databases, but also the average empty rate of each package. For this last data, this is particularly the case if variant 706-B was implemented at the time of checking the adequacy between the logistics load unit and the packaging. Alternatively, this void rate 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 adequate for the purpose. 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 assigned to this packaging.

Sending this list or calculation report in step 911 can be carried out by automated means, for example by email. Alternatively, it may involve displaying these results on a screen available to the user.

Alternatively or in addition, the means 10 can automatically control the acquisition of selected packaging references, or certain of these references on the basis of predetermined criteria, such as the empty rate, to store these packaging and their adequate number in the logistician's warehouse for future shipments.

We will now describe a second mode 1000 of implementing a packaging selection process on the basis of products and/or orders. It can be implemented alternatively to mode 900, or in addition. It aims not to select packaging references from a list provided to the means 10, unlike the implementation mode 900, but to generate them directly according to the products and/or orders provided as inputs the most adapted.

Thus, in step 1001, the means 10 implement steps 901, 903 and 904 so as to obtain a list of logistics load units on the basis of products supplied as input, whether or not from orders shipped in the past , to determine their possibly associated types of packaging, and to determine their dimensions. Here again, it is the user who chooses which commands he provides to the means 10. For step 903, contrary to what was indicated above, here the means do not compare the types of packaging from the logistics load units provided to the types of packaging provided, since no packaging reference is provided here. Thus, no logistics load unit is excluded here, contrary to what is implemented in step 903 of method 900.

In step 1002, the means 10 group the logistics load units from the list by type of packaging, that is to say according to the types of packaging associated in the database with these logistics load units during of step 1001, so as to form a list of logistics load units by type of packaging.

Alternatively, this step is not carried out. Thus, packaging, with or without an associated type, is not grouped by type. This is an option left to the user’s choice. In this case, the rest of these steps only concern one list: the list of all packaging.

In step 1003, the means consider one of these lists by type, or the single list if step 1002 is not carried out. 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 type of packaging, or for the single list of packaging if none grouping by type has not taken place.

In steps 1004 to 1006, for the considered list of logistic load units, the means 10 implement a “ hierarchical clustering ” algorithm, or “ hierarchical grouping ”, to select different combinations of packaging dimensions fictitious data appropriate to these logistics load units. This is described in detail below.

Different “ hierarchical clustering ” algorithms are known to those skilled in the art. They allow the grouping of values into groups, each group including values close to each other, the number of groups being predetermined, set by a user. As part of this step 1004, an algorithm of this type, which will not be described here, is implemented for each of the dimensions of the logistics load units from the list considered. Thus, the means identify the first dimension, the second dimension and the third dimension of each of these logistic load units, these dimensions having been determined previously during step 1001. To this end, in a first variant of this step, if the user of the method allows the change of orientation of the logistics load unit, then the means 10 assign to the first dimension the minimum dimension of the logistics load unit, to the second dimension the intermediate dimension, to the third dimension the maximum dimension of the logistics load unit. In a second variant, if the orientation of the logistics load unit is fixed, the means 10 assign by default the first dimension received in a list of dimensions to the first dimension, the second to the second, the third to the third . Thus, in the same way as for the products, the orientation of the logistics load unit can be fixed, for example if one of the products it contains must be kept vertical. In the same way as for products, we can agree that the third dimension corresponds to the vertical axis, and we organize the first, second and third dimensions according to this choice. Any other choice is naturally possible. This possibility of freezing or not the orientations can be configured by the user upstream, globally, or for each logistics load unit.

Then, for all the logistics load units in the list considered, 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 groups of values, each group containing the values close to each other.

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

For each of these dimensions, the predetermined number of clusters is set beforehand by default or by the user. So, it may be different depending on the dimensions. For example, the values of the first dimensions can be grouped into two clusters, which means 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 second dimensions can be distributed over five clusters, that is to say that the values of the second dimensions of all these logistics load units are grouped around five labels.

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

In step 1006, the means carry out all possible combinations between these maximum values of the clusters of the first, second and third dimensions, so as to determine, virtually, packaging resulting from all these possible combinations. In other words, for each of the values representing the clusters of the first dimensions, the means associate them with values representing the clusters of the second dimensions and values representing the clusters of the third dimensions, to generate as many fictitious packagings as possible combinations .

Steps 1004 to 1006 are repeated for each of the lists of logistic load units resulting from step 1002 if there are several lists, that is to say for all possible types of packaging as they are associated with the logistics load units, if there was grouping by type in step 1002.

In a step 1007, the means 10 make a selection on these fictitious packaging generated in order to bring out only the most relevant ones. Thus, in a first variant 1007-A, this selection is based on sufficiently large dimensions of the packaging so that a label can be attached to it. Thus, packaging generated too small is excluded. In a 1007-B variant, any other selection criterion based on identified characteristics can be implemented.

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

In a variant 1007-D, beforehand and in addition to this variant 1007-C, the means 10 sort these fictitious packages in accordance with step 704-A, or even 704-B or 704-C if they have corresponding characteristics sustainability, price or other for these fictitious packaging.

Finally, in another variant 1007-E, the entire implementation mode 900 is applied to these fictitious packaging to select only some of them. These packaging, resulting from this implementation mode 1000, or part of these fictitious packaging, can thus be tested at the same time as real packaging references, within the framework of implementation mode 900.

The list of generated packaging is then sent to the logistician in step 1008, identical to step 911, that is to say by email or displayed on a screen.

The logistician then has a list of fictitious packaging adapted to his orders because the calculated dimensions come from the dimensions of the logistics load units calculated on the basis of orders previously shipped or which he has identified as probably shipped in the future. The logistician can then seek to acquire packaging corresponding to these determined fictitious packaging. This mode of implementation therefore makes it possible to generate ideal packaging references for orders provided as input. Alternatively, the means 10 can attempt to automatically acquire the generated packaging.

In another variant not illustrated, this implementation mode 1000 is activated only in addition to implementation mode 900. In this case, the list of logistics load units provided in step 1001 contains only the load units logistics for which none of the packaging tested in step 909 of process 900 was deemed adequate. In other words, these logistics load units are devoid of adequate packaging among the packaging references tested, it is therefore very relevant to apply implementation mode 1000 for these specific logistics load units, in a manner to generate new specific packaging for these logistics load units. In addition to the adequacy as provided in step 909 of method 900, other criteria can be provided in this variant, such as an individual void rate independent of the void rates previously described, activating for the packaging concerned this implementation mode 1000 in addition to implementation mode 900.

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

I V . Method for preparing a logistics load unit for packaging

We will now describe, with reference to Figures 17 to 24, a process for preparing a logistics load unit to be packaged, carried out in a warehouse, according to three implementation modes. The inputs provided to the process are at least the products forming the logistics load unit. The output of the process is the packaged logistics load unit. Unlike most of the steps of the previous processes, implemented by computer, certain steps are, in some of the implementation modes described below, carried out entirely or in part by a human, in particular by the order picker. The computer-automated steps remain implemented by the same means 10 as previously, while certain steps are carried out by other automated means which will be mentioned where appropriate.

The first mode of implementation 1100 is carried out in an installation 40 according to a first embodiment, the top view of which is schematized at the . Part of it is illustrated in and another at . We will first describe this installation.

This installation includes a space 41 for picking products and packaging, otherwise called “ picking space ”, and a space 42 for order preparation. By “sampling space”, or “picking space”, we mean a space identified as allowing the collection of objects stored within it, with a view to shipping, at known locations, that is to say from which the positions in the sampling space are known. Thus, each object location, whether the object is a product of an order or a package, is designated by a unique identifier of the sampling space 41 making it possible to find the product or the package using this identifier. The same location may contain identical products or identical packaging. This identified location characteristic distinguishes a picking space from a mass storage space, in which objects are stored by reference without a unit picking operation being possible. Another characteristic which distinguishes a sampling space from a mass storage space is generally the proximity of the sampling space 41 with the preparation space 42. Since a collection step, described subsequently, aims to take the products and packaging from the picking space 41 in order to bring them into the preparation space 42, it is in fact advantageous for these spaces 41 and 42 to be as close as possible to each other, without obstructing neither the collection of products and packaging in the picking space 41 nor the preparation of the order in the preparation space 42.

The product and packaging picking space 41 includes rows 43 of shelving or racks 44 or 45, illustrated in .

Shelving 44 is an open shelving, so that the presence of products and packaging can be observed in its locations. This rack 44 includes in particular a stack 46 of identical unfolded packaging, products 47, 48 and 49 represented in the form of straight blocks, and, on the lower floor, in plastic containers, identical products 50, a product 51 and another product 52. Each of the locations is associated with a unique identifier, such as identifiers 53 and 54. This identifier includes a series of alphanumeric characters making it possible to find, for each of these products, the corresponding row 43 in the space 41, the rack 44 of this row 43, the floor of this rack 44, and finally the location of this floor, where the product or the desired packaging is located.

Shelving 45 is another type of shelving, closed. It includes drawers 55 that can be opened, each drawer corresponding to a location, again provided with a unique identifier, and therefore including products or packaging to be collected.

The rows 43 thus contain a succession of shelves 44 and 45. Alternatively, they could be only racks 44 or only racks 45. Alternatively, other types of sampling locations are possible and are well known to the skilled person. These can be any sort of shelves or automated cabins giving access to the contents of the locations on computer control.

The preparation space 42 is illustrated in . It includes an order preparation table 56, the illustrating products 50, 51 and 52 from rack 44 and a packaging box 46 from the same rack 44. The space also includes a screen 5 corresponding to the means of interaction already described. This screen is naturally connected to the computer means 10 not illustrated here.

If we have illustrated a single preparation space for a sampling space, it is generally preferable to have several preparation spaces for a sampling space. Of course, the number of preparation spaces may vary.

The installation 40 also provides means for collecting products and packaging, through the cart 7, and, through the computer means 10, modules, or “computer modules”, for selecting the products, the means 10 supplying the products forming a logistics load unit, for selecting a package, the means 10 allowing the user to select a package from among the packages in space 41, or automatically providing the user with the appropriate packaging, as described below, and a module for obtaining a route for collecting products and packaging, the means 10 providing an optimized route for the locations of space 41.

By “ module ” or “ computer module ”, we designate a part of a computer program to which one or more predefined functions are assigned. Thus, this installation 40 comprises, in a manner not illustrated, the support 2 and the program 3 including these modules, that is to say generally the means 10.

We will now describe the mode of implementation 1100 carried out by means of this installation 40, with reference to these Figures 17 to 19 and to the .

In a step 1101, products are stored in the picking space 40, that is to say in the racks 44 or 45 of the rows 43. These products are the products intended to form the logistics load units. Products are brought into stock and stored in locations by human means or by users using robotic tools. During this step 1101, the means 10 associate, in the database, each product in stock with its location identifier in the racks 44 and 45. Thus, each product corresponds to an identifier making it possible to easily find the product in the racks 44 and 45. space 41. The way in which the products are chosen to form stocks is not the subject of this request.

In step 1102, the packaging is stored in the picking space 41, that is to say again in the racks 44 or 45 of the rows 43. During this step 1102, the means 10 associate, in base data, each package in stock has its location identifier in racks 44 and 45. Thus, each package corresponds to an identifier making it possible to easily find the product in space 41.

Thus, each product and each package corresponds to an identifier making it easy to find the product or respectively the packaging in space 41. Not shown, space 41 is separated into two sub-spaces, including racks. 44 and 45 containing either only products or only packaging. We therefore obtain a product picking space, including product locations, and a packaging picking space, including packaging locations. As a variant not shown, the racks 44 and 45 can contain both products and packaging. Space 41 is therefore here both a product picking space and a packaging picking space, including both product locations and packaging locations.

Concerning the way in which the packaging is chosen to form stocks, in a first variant 1102-A, this is a choice of practice and experience of the logistician, known to those skilled in the art. In particular, the logistician calls on his usual carton maker and the latter's catalog of packaging references. In a second variant 1102-B, the user 6 first implements the method 900 or 1000 for selecting optimized packaging based on logistics load units already shipped in the past or to be tested, described above, in accordance with to one or other of its modes of implementation 900 and 1000. The means 10 therefore select the packaging to be stored in the sampling space 41, on the basis of this method 900 or 1000. It is thus particularly advantageous that only packaging suitable for the logistics load units packaged in the past in this installation 40 are stored in the picking space 41 for the logistics load units to be shipped in the future, because it is probable that these packaging are suitable to these future logistics load units to be packaged, in particular with regard to the dimensions and therefore the empty rate of the packaged logistics load units.

In step 1103, the user 6, located in front of his preparation table and therefore in front of his screen 5, as illustrated in , obtains from the means 10 a selection of products, the selected products forming a logistics load unit to be packaged. These are therefore products corresponding to an order and grouped to form a logistics load unit. In a first variant 1103-A, this grouping is carried out beforehand by any means of those skilled in the art, in particular by the simple grouping of all the products of the same order, or by automated choices not described here. In a second variant 1103-B, the grouping is carried out beforehand by the means 10 in accordance with the method 600 of grouping products into a logistics load unit described above. It is indeed advantageous for the products to be grouped according to appropriate requirements in accordance with method 600. The user receives the selection of products via screen 5, or via a “ sampling voucher ”, or “ picking voucher ”.

In step 1104, the user receives, in parallel with step 1103, or immediately, the selection of a package, the package being intended to package the logistics load unit formed by the products of the step 1103. In a first variant 1104-A, it is the user 6 himself who chooses the packaging which seems appropriate to him among all the packaging available from the sampling space 41, for this logistics load unit . It can in particular rely on the dimensions of the logistics load unit, if they are known, to choose a packaging whose dimensions are slightly larger, by searching, through the means 10, in particular through the means of interaction such as screen 5, adequate packaging. In a second variant 1104-B, this step 1104 is carried out by the means 10 in accordance with the method of assigning a package to a logistics load unit, according to one of the implementation modes 700 or 800. In this case, the packaging provided as input to these modes 700 and 800 are those available in the sampling space 41. It is in fact particularly advantageous for the means 10 to select the appropriate packaging in this way since this makes it possible to generate less vacuum by choosing the most appropriate packaging for the logistics load unit. In addition, by automating this selection, we avoid the order picker having to choose packaging. We therefore compensate for the time taken by the subsequent step of collecting the packaging in the picking space by rapid and automatic selection of this packaging. More precisely, as described in the context of these processes, the means choose the most appropriate packaging for the logistics load units. The selected packaging is indicated to user 6 on screen 5, or in the form of an indication in the collection slip. In a third variant 1104-C, if no packaging has been selected, for example if no suitable packaging is available at the end of the process 700, and as described in step 711, the means 10 display to the preparer order the ideal dimensions of the packaging suitable for the logistics load unit, so that the preparer can look for packaging available but not recorded in the database, or order the appropriate packaging. Alternatively, the means 10 transmit the ideal dimensions to a robot which automatically manufactures the packaging. The received or manufactured package can be placed in the picking space, so that the following steps are implemented in the same way, or brought by other means to the preparation table without being subject to the steps obtaining routes and collecting.

In step 1105, the user 6 obtains a collection route for the selected products and the selected packaging in the sampling space 41, that is to say in the packaging sampling space and in the product collection area, the route including the identifiers of the locations of the products and packaging selected to be collected. Thus, the means 10 provide the user, via 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 determine also a collection route for products and packaging. The route is optimized so that the collection of user 6, in space 41, in particular his path along rows 43, is as fast as possible. Thus, the path, from the preparation table 56, to the correct locations of the racks 44 and 45, then the return to the preparation table 56, must be as short as possible. It is therefore the order of the products and packaging to be picked that matters, and which is optimized. The different ways in which this route is optimized, depending on the positions of the locations in the sampling space 41, are known to those skilled in the art and are not the subject of this request. These techniques rely on the positions of product locations. To these products is added packaging, which does not modify these techniques insofar as the packaging is stored, in the same way as a product, in a collection area, with a unique identifier.

In step 1106, the user 6 collects these selected products and packaging, in the picking space 41, in the order provided by the optimized route determined by the means 10. To collect the products and the packaging , user 6 uses cart 7, called “ picking cart ” or “ sampling cart ”. Alternatively, it is not the order picker who leaves to collect the products and packaging but another person, whose role is to collect the products and packaging to bring them to the preparation space 42 where the order picker remains. .

Other means of collection than a trolley are naturally possible as a variant. These may include, for example, warehouse transport vehicles, forklifts, exoskeletons, robots, etc.

In step 1107, in the preparation space 42, that is to say at the table 56, the user 6 arranges the selected products in the selected packaging, so as to form the logistics load unit packed. In the example illustrated on the , user 6 has products 50, 51 and 52 from rack 44 of the , and a package 46 from the same rack. They were collected in step 1106. In a first variant 1107-A, the user 6 arranges the products in the packaging according to his own experience and practice, within a specific time constraint. A second variant 1107-B corresponds to the case where the variant 1104-B was implemented in step 1104, that is to say when the method of assigning a package to a logistics load unit according to one of modes 700 and 800 was implemented to select the package. If mode 700 has been implemented, and on this occasion, a layout plan has been determined by means of one of the implementation modes of layout plans 100 to 400, then this plan is taken up in this step 1107-B to be provided to the order picker when arranging the products in the packaging. If mode 800 was implemented for the packaging assignment method, then it is implementation mode 500 which was implemented for the layout plan, and the plan corresponding to the The chosen packaging is made available to the order picker.

According to a third variant 1107-C, no arrangement plan according to one of the modes 100 to 500 has been implemented previously. The means 10 then implement the method of determining an arrangement plan according to mode 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.

At the end of this step 1107, the products forming the logistics load unit are packaged in the chosen packaging. This packaged logistics load unit can then be subjected to the following delivery steps known to those skilled in the art, in particular the sticking of a delivery label, its loading and its shipment.

In a variant not illustrated, the installation includes a space for picking only products and a space for picking only packaging. Thus, the route obtained by the means 10 includes two sub-routes: a route optimized only for the products to be collected in the product picking space, which does not include the collection of the packaging, and the route towards the The selected package, a journey that only includes the location of the package. This variant is suitable for cases where the product picking space is particularly far from the packaging picking space. The user completes the two routes and then goes to the order preparation table to prepare the logistics load unit to be packaged.

In another variant not illustrated, we do not only collect the products and the packaging of a single logistic load unit to be packaged, we simultaneously collect the products forming several logistic load units, and the packaging selected to package these units of load. logistical burden. Thus, beforehand, the user obtains a route to collect in an optimized manner all of the selected products forming the logistics load units to be packaged, and to collect in an optimized manner all of the corresponding packaging. The route is either a single route optimized for the collection of products and packaging in the same product and packaging picking area, or a first route optimized for the collection of products in a product picking area and a second route optimized for the collection of packaging in a packaging picking area. Then, once all the products and packaging have been collected, the user can prepare the different logistics load units to be packaged in the same preparation space, or the collection means travel through several preparation spaces to deposit the products and packaging forming each logistics load unit to be prepared. This variant therefore saves significant time by optimizing the collection of products and packaging intended for separate logistics load units.

We will now describe a second mode of implementation 1200 of the method of preparing a logistics load unit to be packaged, with reference to Figures 21 to 23. This mode is implemented in an installation 60, according to a second mode of production, illustrated in . It differs from installation 40 of the in that the product picking space 61 is distinct from the packaging picking spaces 71, 72 and 73. The latter are in fact integrated into the preparation spaces 62, 63 and 64, which are distinct from each other. Thus, the packaging stored in the sampling space 41 of the , are stored here in the picking spaces 71, 72, and 73, respectively within the order preparation spaces 62, 63 and 64.

Space 71 is shown in . The preparation table is identical to the preparation table 56 of the , but it is associated with a shelving or rack 45 comprising two locations, associated with their respective identifier, in which we can observe, through transparency, packaging unfolded for their use. Unlike the racks 44 and 45 of the installation 40, the packaging picking spaces, such as the shelving or rack 45 of the , of installation 60, only include packaging, and above all, they include packaging belonging to the same type. Thus, space 71, equipped with racks or shelving, only includes packaging of a first type. Space 72 only includes packaging of another type, space 73 includes packaging of a third type. Remember that a type corresponds to the same structure, the same material or the same level of robustness of a packaging. For example, space 71 can be dedicated to plastic bags, space 72 to single-corrugated cardboard boxes, space 73 to double-corrugated cardboard boxes. Of course, the number of preparation spaces in this installation 60 may vary.

We will now describe, with reference to these Figures 21 and 22 and to , the steps of mode 1200, emphasizing their differences with the steps of mode 1100.

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

Step 1202 is identical to step 1102, except that the packaging is not stored in space 61, but in spaces 71, 72, and 73, integrated into the respective preparation spaces 62, 63 and 64 , by type of packaging. Thus, in a manner not described, it is planned to distribute the packaging by type of packaging in the spaces 71, 72 and 73, the means 10 associating, as in step 1102, the identifiers of the locations with each packaging.

Steps 1203 and 1204 are identical to respective steps 1103 and 1104.

In step 1205, the user obtains a collection route for the selected products, but the route does not include the collection of the packaging in this space, because the packaging is already available in the collection space of packaging integrated into the preparation space, as illustrated in . On the other hand, it does receive the identifier of the location of the packaging within the rack 45 of this packaging picking space, so as to collect this packaging.

In step 1206, the user 6 only collects the products in the product sampling space 61, to bring them to the preparation table in the space 62, 63 or 64, and he collects, beforehand or then, the packaging, very simply since he has it at his disposal in his preparation space, in his rack 45. This mode of implementation therefore makes it possible to eliminate the collection of packaging in a space separate from the preparation space. It therefore saves time compared to the previous mode.

Arrangement step 1207 is identical to step 1107.

By having, for a product picking space, several order preparation spaces, each associated with a type of packaging, we increase the productivity of order preparation while maintaining gains in the empty rate.

Alternatively, in addition to the grouping of packaging by type of packaging within the picking spaces integrated into the preparation spaces, we can plan for these spaces to store certain packaging references rather than others. For example, such an integrated picking space can be configured to store the five most used packaging references of a predetermined packaging type.

This implementation mode 1200 can be combined with the implementation mode 1100, that is to say by providing packaging stored both in a packaging removal space distinct from the preparation space and other packaging stored in the picking space integrated into the preparation space. Thus, for multiple orders, the same route may include the collection of packaging in a separate picking area and the entry of packaging in a space integrated into the preparation area. This is particularly relevant if the most used packaging is stored in the picking space integrated into the preparation area while the least used packaging remains stored in a separate picking space.

In a third implementation mode 1300, illustrated in , the steps are similar to those of process 1100 or process 1200, but they are fully automated.

Thus, storage steps 1301 and 1302, in the product picking and packaging picking areas, are carried out by autonomous vehicles, presenting automated means of installation in the locations.

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

The collection step 1306 is also automated, an autonomous vehicle will automatically collect the products and, in the case of mode 1100, the packaging. Alternatively, it is the racks or shelving forming these sampling spaces which are automated so as to move autonomously.

The arrangement step 1307 is carried out automatically by robotic arms, in accordance with an arrangement plan determined according to one of the implementation modes described above.

Thus, the entire process of preparing a logistics load unit for packaging can be automated.

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

The invention is not limited to the embodiments and implementation presented and other modes will be clearly apparent to those skilled in the art.

In particular, the embodiments are combinable, whether this is explicitly written or whether it appears clearly to those skilled in the art.

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

Claims (16)

Method (900) for selecting optimized packaging based on logistics load units, implemented by computer (10), and comprising the following steps:

• obtaining (902) a list of packages;
• for each of the packages in the list obtained, determination (905) 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 a other packaging, or, all things being equal, priority over this other packaging;
• sorting the packaging according to their respective prioritization values so as to form a sorted list of packaging;
• choice (906) of one of the packages from the list depending on 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 in the list, verification (909) of the adequacy between the chosen packaging and the logistics load unit, the verification covering at least the weight of the logistics load unit with respect to screws with a maximum weight supported by the packaging;
• if the number of logistics load units verified as being adequate for the chosen packaging is greater than or equal to a predetermined threshold, selection (910) of the packaging and removal, from the list of logistics load units, of the units of logistical load verified as being adequate for this selected packaging.

Method according to the preceding claim, in which the list of logistics load units obtained includes logistics load units having been shipped previously. Method according to any one of the preceding claims, in which the list of packages obtained includes:

• packaging from at least two separate packaging suppliers; and or
• at least one packaging from a collection organization; and or
• at least one custom-made packaging for its own logistics load unit; and or
• at least one reusable packaging.

Method (900) according to any one of the preceding claims, comprising, for each package of the obtained list of packages, the reiteration of the steps of choosing (906) of packaging from the list as a function of sorting, of obtaining (901 ) of the list of logistics load units, checking (909) the adequacy and removing the logistics load units from the list if the packaging is selected (910), so as to obtain a list of selected packages . Method (900) according to any one of the preceding claims, in which packaging corresponding to the selected packaging is then obtained, and logistics load units are packaged in these packaging. Method (900) according to any of the preceding verifications, in which the verification (909) of the adequacy also relates to an empty rate (706-B) of the chosen packaging in which the logistic load unit would be packed, with respect to a predetermined threshold. Method (900) according to any one of the preceding claims, in which the verification (909) further relates to at least (706-C) the presence of a part of the logistics load unit classified as fragile with respect to -with regard to the chosen packaging, and/or the arrangement of the contents, forming the logistical load unit, within the packaging, with regard to an arrangement to be respected with regard to the fragility of the logistics load unit. Method (900) according to any one of the preceding claims, in which obtaining (901, 903) the list of logistics load units relates, in addition, only to logistics load units associated with the same type of packaging than a type of packaging chosen, the types of packaging corresponding to a material, structure and/or robustness of the packaging. Method (1000) according to any one of the preceding claims, further comprising, to select other packaging, the implementation of the following steps:

• among the list of logistics load units, identification of logistics load units for which no packaging has been deemed adequate at the end of the verification step, so as to obtain a list of identified logistics load units as being without adequate packaging;
• each logistic load unit of this list having, in a virtual form of a straight block, a first dimension, a second dimension orthogonal to the first dimension and a third dimension orthogonal to the first and second dimensions, distributions (1004) of the values of the first dimensions , values of the second dimensions and values of the third dimensions of the logistics load units, in respective clusters of first dimensions, second dimensions and third dimensions;
• identification (1005), for each cluster, of a dimension value specific to the cluster, in particular of a maximum value of each cluster;
• combining (1006) the identified values of the first dimension clusters with the identified values of the second dimension clusters and with the identified values of the third dimension clusters, so as to determine new packages having the combined dimensions.

Method (1000) according to the preceding claim, comprising the following steps:

• for each new packaging determined, verification (1008-C) of the adequacy between the new packaging and at least some of the logistic load units previously identified as being without adequate packaging, the verification covering at least the dimensions of these units of logistical burden in relation to the dimensions of the packaging;
• if the number of these logistic load units verified as being adequate for this new packaging is greater than or equal to a predetermined threshold, selection of this new packaging.

Method (900; 1000) according to any one of the preceding claims, comprising beforehand a step of determining the dimensions of each logistics load unit implemented in the following manner:

• determination (904) of a product arrangement plan forming the logistics load unit;
• determination of the minimum dimensions of a container capable of containing the products arranged in accordance with the determined arrangement plan;
• allocation of the minimum dimensions determined to the logistics load unit.

Method (900; 1000) according to the preceding claim, in which the arrangement plan is determined in the following manner, the logistics load unit being formed of several contents to be arranged in a container, the contents and the container having shapes respective virtual right pads, the method being implemented by computer (10) and comprising the following steps:

• 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 any of the remaining contents in the container:
  • determining (204) the dimensions and coordinates of several remaining empty spaces of the container, distinct from each other and having respective straight block shapes;
  • determination of possible positions of the remaining content in each empty space;
  • determination (207) of respective distances between a predetermined vertex of the container and respective vertices of the contents remaining in each possible positioning;
  • depending on the determined distances, selection of one of the possible positions as a virtual arrangement of the contents remaining in the container;
• reiteration (208, 209) of the previous arrangement steps for successively each of the other contents remaining to be arranged virtually in the container, so as to determine a plan for arrangement of all the contents in the container.

Method (900; 1000) according to any one of the preceding claims, comprising, beforehand, the following steps, for grouping contents into a logistics load unit:

• route (601, 602) of a list of shipments, each shipment having planned a delivery of one or more contents, and, for each shipment in the list, creation of exclusive logistics load units for the contents of the shipment intended for exclusive packaging, and creation of at least one logistics load unit intended to group the other contents of the shipment not intended for exclusive packaging, so as to form a list of logistics load units;
• removal, from the list of logistics load units, of at least one logistics load unit associated with packaging defined in advance, if the packaging is part of the list of packaging obtained.

Method (1100; 1200; 1300) for preparing a logistics load unit to be packaged, in which:

• 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;
• packaging is identified in accordance with the packaging selection method of any one of the preceding claims;
• the identified packaging is 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 ;
• we obtain (1103; 1203; 1303) a selection of products, the selected products forming a logistics load unit to be packaged;
• we obtain (1104; 1204; 1304) a selection of a package from among the stored packages;
• 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 packaged, the selected products are arranged (1107; 1207; 1307) in the selected packaging, so as to form the unit of packaged logistics load.

Computer program (3) comprising instructions which, when the program is executed by a computer, lead it to implement the steps of the selection method (900; 1000) according to any one of claims 1 to 13 or the preparation process according to claim 14. Computer-readable recording medium (2) comprising instructions which, when executed by a computer, cause it to implement the steps of the selection method (900; 1000) according to any one of claims 1 to 13 or the preparation process according to claim 14.