Multi-package preparation process

Abstract

The invention relates to a method (100) for preparing multi-packages, implemented by computer and comprising the following steps: - obtaining (102) at least one group of items to be shipped; - obtaining (105) at least one list of virtual packages; - selecting (106, 107, 108, 109), from the list of virtual packages, a virtual package based on at least one dimension of at least one item from each group of items to be shipped; - opening (110) at least one instance of the virtual package; - for each item in the group or at least one of the groups, item by item: arrangement (111, 112, 113, 114, 115) of the item in the or one of the open instances according to the remaining capacity of the instance, this remaining capacity corresponding to the maximum weight supported remaining by the packaging, and according to available spaces remaining in the instance;Update (116) the remaining capacity of the instance in which the item is arranged, and update the remaining available space in the instance; - formation (134) of theoretical packages, each theoretical package comprising the items arranged in the same instance. No figure;

Description

Title of the invention: Method for preparing multi-packages

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

[0002] In the prior art, in a warehouse, the order picker has a list of items to be shipped to a single recipient. The items on this list, intended to be grouped into a single package, form a logistics unit of load. The list of items to be shipped is therefore designed to be transformed into one or more logistics units of load to be shipped. A "logistics unit of load" is generally called a "package" when it is associated with an order being prepared or completed. The logistics specialist or order picker also has the machines or packaging materials used to pack these logistics units of load to be shipped.

[0003] For a given logistics unit load, the packaging is generally chosen visually by the order picker based on their estimate of the volume of the products comprising the logistics unit load and their estimate of the packaging volume. However, faced with time constraints and a limited number of different container types, many choices are not optimal. Poorly arranged within the packaging, the items occupy too small an overall volume. Consequently, the packaging for logistics units, chosen to be too bulky, thus exhibits an average of excessive empty space. This average empty space leads to, among other drawbacks, overconsumption of packaging, overconsumption of storage space, significant material waste, associated greenhouse gas emissions, and major economic losses for those involved in the delivery sector.

[0004] A method for optimally arranging items within a logistics unit is already known from documents FR3141547A1, FR3141453A1, FR3141452A1, and FR3141546A1 filed in the applicant's name. These documents also describe a method for assigning packaging to select the optimal packaging for a given logistics unit, based on the items to be packaged.

[0005] However, prior to these optimal arrangement and allocation steps, it is often necessary to divide the list of items to be shipped into several logistics load units. Yet, the grouping of items in this list is done arbitrarily, for example, by taking the items in the order they appear in an order. The determination of the items comprising each logistics load unit is therefore not carried out in an optimized manner. In particular, these groupings do not minimize the empty space within the logistics load units.

[0006] The invention aims in particular to group items, from an order of items to be shipped, in an optimal way for their future packaging, in order to reduce the empty space in the packages finally shipped.

[0007] To this end, the invention relates to a method for preparing multi-packages, implemented by computer and comprising the following steps:

[0008] - obtaining at least one group of items to be shipped;

[0009] - obtaining at least one list of virtual packages;

[0010] - selection, from the list of virtual packages, of a virtual package according to of at least one dimension of at least one item of the or each group of items to be shipped;

[0011] - opening at least one instance of the virtual packaging;

[0012] - for each article of the group or at least one of the groups, article by article: • arrangement of the item in the open instance or one of the open instances according to the remaining capacity of the instance, this remaining capacity corresponding to the maximum weight supported remaining by the packaging, and according to available spaces remaining in the instance; • update the remaining capacity of the instance in which the item is arranged, and update the remaining available spaces in the instance; - formation of theoretical packages, each theoretical package comprising the items arranged in the same instance.

[0013] Thus, the items are grouped into one or more instances of a virtual package. The selection of the virtual package is not arbitrary; it is made "based on" at least one dimension of an item in the group. As a result, the choice of the package in which the items are virtually arranged is optimized. In particular, the empty space in the packages resulting from the list of items is reduced on average thanks to these steps, and this reduction is adapted to each order. Taking into account the maximum remaining capacity during each arrangement prevents excessively heavy items from being grouped together. Arranging the items according to the remaining available space optimizes the arrangement and therefore minimizes the empty space in each instance.The result of these steps is the reorganization of the items into packaging instances in which the items are distributed and arranged in an optimized manner, at least with regard to the void ratios generated. "Void ratio" refers to one way, among others, of quantifying the empty space in a container containing items, by relating the available volume in the container to the volume occupied by the items in that container. Reducing the void ratio therefore reduces the generated void space.

[0014] The theoretical packages can then be assigned packaging in order to form the logistical load units.

[0015] Other optional features follow, taken alone or in combination.

[0016] Preferably, the method includes, when the open instance or none of the open instances has sufficient remaining capacity and / or available spaces to accommodate the item, opening a new identical instance of the virtual packaging to arrange the item in it.

[0017] Thus, a new, identical instance is opened to arrange the following items from the group(s). Choosing identical instances, that is, representing the same virtual packaging previously selected based on the items, facilitates the optimized grouping of items and therefore reduces the empty space generated at the end of the process.

[0018] Advantageously, the method comprises the following steps for selecting the virtual packaging:

[0019] - obtaining a list of packages;

[0020] - for each package in the list, obtaining the dimensions of the package and the packaging capacity, this capacity corresponding to the maximum weight supported by the packaging;

[0021] - selection of packaging from the list having a capacity greater than the shortest item heavy of the group(s) of items and less than a predetermined capacity value, having a volume greater than the largest item of the group(s) of items and less than the cumulative volume of the items of the group(s) of items, and having dimensions greater than the largest dimensions of the items of the group(s) of items;

[0022] - among the selected packages, sorting of the packages according to one or more predetermined criteria.

[0023] - among the sorted packages, selection of the first package.

[0024] Thus, the virtual packaging is sufficiently strong and large to contain any item from any group, particularly the largest item, but it cannot contain all the items from all the groups. It is therefore specifically chosen to distribute the items into at least two instances.

[0025] Preferably, the method includes, for arranging at least one of the articles of the or at least one of the groups, traversing, in order of opening, the instances already opened and, when an open instance has sufficient capacity and remaining available spaces, the virtual arrangement of the article in the instance.

[0026] Thus, a new instance is not opened for each group of articles. On the contrary, each instance already open and containing articles from one or more groups can be rearranged with articles from one or more other groups. The groups provided as input are therefore reorganized differently in instances. By proceeding in this way, we ensure that we minimize the empty rates of each instance and therefore of the packages formed subsequently.

[0027] Advantageously, the process comprises the following preliminary steps:

[0028] - obtaining a list of items to be shipped;

[0029] - distribution of articles into several groups of articles, each or at least some of the groups only include items having at least one predetermined characteristic in common.

[0030] Thus, starting from a pre-existing list of items, particularly from a single order of items destined for the same recipient, the items are grouped into different groups according to specific criteria. Indeed, recipients and order pickers may prefer to handle items grouped by common characteristics. These groups are then regrouped by instance, while respecting the groupings by criteria. In fact, based on predetermined parameters, it may be decided that items with common characteristics should not be mixed with other items within the instances. In this case, for each new group of items to be arranged that includes common characteristics, a new instance is opened to begin the arrangement of the items in that group, even if other instances are already open and may have sufficient space and capacity.

[0031] Preferably, the or at least one of the characteristics common to the articles of at least one of the same group is a common article model.

[0032] Thus, the items are grouped upstream, within item groups, by model, for example by item reference. It is indeed useful for an order picker to handle identical items and arrange them in common packaging or at least packaging located close to each other. Items of the same model but different colors can also be grouped together according to predetermined settings. Alternatively, it can be stipulated that only completely identical items are grouped together.

[0033] Preferably, the method comprises, for virtually arranging the articles of a group having the same article model in one or more open instances virtually already containing articles of one or more other models, the following steps:

[0034] - identification, among the open instances, of one of the instances capable of containing all items in the group depending at least on the remaining capacity of the instance and the remaining available space within the instance,

[0035] - formation of a package comprising the articles respectively arranged in this instance.

[0036] Thus, if an already open instance can contain all the identical articles, they are arranged in that instance.

[0037] Advantageously, the method comprises, for virtually arranging the articles of a group having the same article model in one or more open instances virtually already containing articles of one or more other models, the following steps:

[0038] - obtaining the number of articles in the group, having the same model, to be arranged in the cases already opened;

[0039] - obtaining a maximum number of permitted instances to contain these articles having the same article model as articles of other models;

[0040] - for each of the packaging instances already opened, determination of the capacity remaining of the instance, this remaining capacity corresponding to the maximum weight supported remaining by the packaging, determination of the dividend resulting from the division of the remaining capacity by the weight of an item to be arranged, and determination of the modulo resulting from this division;

[0041] - for a value k starting at 2 and, at most, ending at the maximum number of permitted instances: • formation of all combinations, called k-tuples, of already open packaging instances, each k-tuple comprising k instances; • for each k-tuple, determination of the sum of the dividends of the instances of the k-tuple, and determination of the sum of the moduli of the instances of the k-tuple; • selection of k-tuples whose sum of dividends is greater than or equal to the number of items to be arranged; • sorting of selected k-tuples by increasing sum of modulos; • for each k-tuple in sort order, attempt to virtually arrange the items in the instances of the k-tuple, and, when all items can be virtually arranged in these instances, formation of theoretical packages comprising the items respectively arranged in these instances of this k-tuple, or, when at least one of the items cannot be arranged in one of the k-tuples, increment k and reiteration of the previous steps with the new value of k.

[0042] These steps are implemented in particular when a user authorizes the "unbundling" of items of the same model to place them in already open instances that therefore contain items of a different model. This minimizes the empty space rate of the instances and thus of future logistics workload units. These steps also minimize the number of open instances, and therefore the number of theoretical packages formed, and thus the number of packages. Consequently, they reduce the shipping costs of the items. The calculations performed take advantage of the fact that, since the items are identical, their weights and dimensions are identical.

[0043] Preferably, the method includes, before the virtual arrangement attempt, a verification step requiring that the articles of the group be arranged in instances of the k-tuple opened only consecutively.

[0044] Thus, it is required that identical items, although placed in different instances with different items, not be distributed in open instances too far apart from each other. Indeed, by creating consecutive theoretical packages comprising these identical items, real logistics load units are produced for which the order picker can quickly, even simultaneously, arrange all the identical items in the packaging provided for this purpose.

[0045] Advantageously, the method includes, when the open instances cannot contain all the identical articles, opening a new identical instance of the virtual packaging to virtually arrange, article by article, as many articles of the same model as possible.

[0046] Thus, if the already open instances cannot contain the articles of the same model according to the stated parameters, a new instance is opened and the articles of the same model to be arranged are carried out, article by article, within this instance. For the remaining articles that cannot be arranged in this new instance, due to insufficient capacity or available space, the previous steps of identifying an already open instance to contain these remaining articles are repeated, and, failing that, of distributing these remaining articles across the k-tuples of already open instances.

[0047] Advantageously, to achieve a virtual arrangement of an article in an instance, the articles and the instance having respective virtual rectangular prism shapes, the following steps are implemented:

[0048] • determination of the dimensions and coordinates of several remaining empty spaces of the instance, distinct from each other and having respective virtual forms of rectangular prism;

[0049] • determination of possible positions of the article in each empty space;

[0050] • determination of respective distances between a predetermined vertex of the instance and the respective vertices of the article in each possible positioning;

[0051] • depending on the determined distances, selection of one of the positions possible as a virtual arrangement of the article in the instance.

[0052] Thus, items are placed in an instance according to the maximum available space remaining in the instance. The instance's empty space rate is therefore minimized. In particular, these virtual arrangement steps are repeated for each item, one after the other.

[0053] Preferably, the method includes a step of sorting the articles of one or each group according to at least one predetermined criterion chosen from the volume of each article, the weight of each article, and the density of each article, so as to form an ordered sequence of the articles of the group to be arranged virtually in the instance or instances.

[0054] Thus, the arrangement order of the articles in a group depends on the characteristics of the articles and is obtained simply, so as to minimize the rate of empty space generated at the end of the process while limiting calculation times.

[0055] Advantageously, the method includes a step of sorting the groups according to at least one predetermined criterion chosen from among the cumulative volume of the articles of each group, the cumulative weight of the articles of each, and the cumulative density of the articles of each group, so as to form an ordered sequence of the groups whose articles are arranged virtually in the instances.

[0056] Thus, the groups are ordered to decide which items in the groups are to be arranged one after the other. The order in which the groups are arranged depends on the characteristics of the items in the group and is obtained simply, so as to minimize the amount of empty space generated at the end of the process while limiting computation time.

[0057] Preferably, the sequence of article groups is ordered so that the group or groups comprising articles having the same model are placed before the group or groups of articles comprising articles not having a common model.

[0058] Thus, the "outside groupings" articles are arranged virtually, at the end of the process, in the instances already containing the articles intended to be grouped.

[0059] Preferably, one or at least one of the characteristics common to the articles of a group is chosen from the following:

[0060] - at least certain dimensions of the articles;

[0061] - a level of fragility of the articles;

[0062] - a need for a specific type of packaging for the articles, for example a single-wall corrugated packaging, double-wall corrugated packaging, or a plastic bag;

[0063] - the orientation of the articles;

[0064] - the cost of the items;

[0065] - a level of article weight;

[0066] - the fact that the articles are pre-packaged;

[0067] - a maximum packaging rate not to be exceeded for the items; and

[0068] - a choice of a shipping preparation area for the items.

[0069] Thus, the articles are grouped upstream of their virtual arrangements, based on similarities, structural criteria, or other common constraints. For example, processing articles requiring the same type of packaging together, or Having identical dimensions allows for a better response to business and organizational constraints. For example, fragile items are grouped together for manual preparation because they require specific securing to limit the risk of breakage.

[0070] Advantageously, the process then comprises, for each theoretical package formed, a step of assigning a package made in the following manner:

[0071] - selection of available packaging;

[0072] - for each selected package, determination of a prioritization value of the packaging, the value depending on at least the volume of the packaging so that a package less voluminous than another package, is, all other things being equal, given priority over that other package;

[0073] - sorting of packaging according to their respective prioritization values ​​so as to to create a sorted list of packaging;

[0074] - selection of one of the packages from the list according to the sorting;

[0075] - verification of the suitability between the chosen packaging and a theoretical package at packaging, the verification relating at least to the theoretical weight of the package in relation to a maximum weight supported by the packaging.

[0076] Thus, these packaging assignment steps allow the selection of packaging, the dimensions of which may be different from those of the previously chosen virtual packaging instance, adapted to the items of the instance, in order to minimize the empty rate of the packaging.

[0077] Preferably, for each chosen package, the steps of the virtual arrangement, as stated above, of the items of the theoretical package in the packaging are implemented in order to determine the arrangement plan of the items in the packaging.

[0078] Thus, since the chosen packaging may have different dimensions than the previously selected virtual packaging instance, the arrangement may differ from that realized in the instance. In other words, the arrangement of the items is reset to optimize the packaging's void ratio. When several packages can be verified as suitable for the theoretical package, virtual arrangements are created for each of them. In this case, at the end of the process, the package with the lowest generated void ratio is selected.

[0079] The invention also relates to a computer program comprising instructions which, when the program is executed by a computer, lead the latter to implement the steps of the process stated above.

[0080] The invention also relates to a computer-readable recording medium comprising instructions which, when executed by a computer, lead the computer to implement the steps of the process stated above.

[0081] The data processing device comprising a processor configured to implement the steps of the process stated above. Brief description of the figures

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

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

[0084] [Fig.2] is a flowchart of a method for preparing the invention according to a mode implementation;

[0085] [Fig.3] is an example diagram of a list of items to be shipped;

[0086] [Fig.4] is a scheme for forming groups of articles from the list of the [Fig.3];

[0087] [Fig.5] is a diagram of a list of virtual packages;

[0088] [Fig.6] is a diagram of the result of a step in the process of [Fig.2];

[0089] [Fig.7] is a diagram of the result of a step in the process of [Fig.2];

[0090] [Fig.8] is a diagram of the result of a step in the process of [Fig.2];

[0091] [Fig.9] is a diagram of the result of a step in the process of [Fig.2]. Detailed description

[0092] Figure 1 shows computer means 1 for implementing the process 100, which will be described later. These computer means 1, conventional for those skilled in the art, include a data processing device 2, a data storage device 3 containing a computer program 4 and a database 5, as well as interaction means 6 for a potential user, such as a keyboard and a mouse. All of these means 1 together form a conventional computer, but they can also be distributed across any remote hardware. The program 4 comprises instructions which, when executed by the device 2 or any computer, cause them to carry out the steps of the process 100 described below.Consequently, the medium 3 is any recording medium readable by the device 2 or by any computer, comprising instructions which, when executed by the device 2 or a computer, cause them to implement the steps of the process 100 described below. It also follows that the data processing device 2 includes a processor configured to implement the steps of the process 100.

[0093] The interaction means 6 allow a user to configure the process 100, 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 configurable parameters that will be clear to a person skilled in the art in the processes described below. Whether the steps are described indefinitely, in particular with the use of the pronoun "one," or whether computer means are explicitly mentioned, the virtual arrangement, comparison, selection, assignment, and other calculation steps described, as well as, in general, all steps that will be clear to a person skilled in the art as being computer-based, are entirely implemented by the means 1, unless human intervention, for example by a user of the processes, is explicitly mentioned.

[0094] In the following, "article", which could also be called "product", will mean any object, virtual or real, intended to be integrated into a real or virtual package.

[0095] The term “packaging” will refer to any object, virtual or real, intended to house one or more articles.

[0096] Unless explicitly stated otherwise, these two types of objects, the articles and the packaging, have virtual forms of perfect rectangular prisms. Naturally, the "real" articles and packaging corresponding to these virtual elements do not necessarily have the shape of a rectangular prism, much less a perfect rectangular prism.

[0097] It will be clear to those skilled in the art that they are manipulated virtually, that is, solely through the lens of their data, by means 1, as described below. Thus, they are represented digitally by their three dimensions, and if necessary by their coordinates, in particular those of the items within a virtual packaging instance, in the form of structured data in database 5. It is through this data that the computer means 1 process these elements in the process 100 described below. The manner in which these dimensions are obtained and the manner in which this data is organized are not the subject of this application.

[0098] Similarly, database 5 contains a multitude of variables relating to specific characteristics of the articles, such as weight, whether an article is fragile or not, the type of packaging the article requires, and all parameters as will be clearly apparent from the description. The database also contains the necessary packaging characteristics. The manner in which this data is obtained beforehand and organized into databases will not be described here and is not the subject of this application.

[0099] The term "packaging instance," or simply "instance," refers to a necessarily virtual copy of a package. In other words, it is a virtual copy corresponding to a previously selected packaging model. When an instance is "opened," no actual action is performed on the package; rather, a virtual package corresponding to a previously selected packaging model is considered, with the aim of virtually arranging one or more items within it. An "open" instance is therefore a virtual copy of a package that has been opened previously and may already contain one or more virtual items that have been virtually arranged within it.

[0100] “Virtual arrangement” refers to identifying how to place a virtual item in a packaging instance. The result of the virtual arrangement includes, in particular, the coordinates of the virtual item arranged in the instance.

[0101] The term "theoretical package" refers to a packaging instance and the articles virtually arranged within it. A theoretical package is therefore a virtual object. When a real package is assigned to a theoretical package, that is, when a real package is chosen in order to place the articles of the theoretical package into it, the theoretical package becomes a "logistics unit of load".

[0102] The term "logistics load unit" refers to a set of items, including one or more commercial products, intended to be grouped together and arranged in a specific common package 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, a parcel is usually considered a logistics load unit when it has a delivery label, is in transit, or has arrived at its destination. The "logistics load unit" is distinct from any status related to a delivery. As with the other objects described, it will be clear to those skilled in the art that the expression "logistics load unit" regularly refers to a logistics load unit handled solely in computer form by means of 1.

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

[0104] We will now describe a multi-package preparation process 100, implemented by means 1 and schematically represented in [Fig. 2]. We will describe it by illustrating it with an example. The steps described are naturally not limited to this example, in particular to the number, types, and dimensions of the articles and packages illustrated. The illustrations are also schematic and do not represent actual dimensions and Precise positioning of the illustrated objects. In particular, the articles and packaging are represented in two dimensions, whereas the invention manipulates them in three dimensions.

[0105] Step 101 is obtaining a list 7 of articles 8 to 12 to be shipped. In [Fig. 3], the articles bearing the same numerical reference are identical. Thus, articles 8 have the same article model. Articles 9 have another identical article model. This list 7 comes from a user order, comprising articles intended for the same recipient. Alternatively, it is a list of several orders, but grouped together for any purpose. In all cases, it consists of articles to be shipped that must be processed as a single unit.

[0106] Step 102 is the division of the articles into several groups 13, 14, and 15, illustrated in [Fig. 4]. In our example, some of these groups include only articles sharing at least one predetermined characteristic. Thus, in our example, articles 8 and 9 are grouped into groups 13 and 14, respectively. In other words, the articles are grouped "by article reference." Thus, within each of these groups 13 and 14, the articles in the group are identical to each other. Alternatively, it can be configured that the articles grouped by reference differ from each other by a color, or by another characteristic that does not affect the shape, dimensions, or weight of the article.

[0107] Group 15 therefore includes unique articles, or "out-of-grouping" articles, that is, articles not grouped by reference with other articles. In our example, these articles have no common characteristics.

[0108] In another embodiment, the items in the resulting list are grouped according to another criterion. For example, one or more of the characteristics common to the items in a group is chosen from the following:

[0109] - at least certain dimensions of the articles;

[0110] - a level of fragility of the articles;

[0111] - a need for a specific type of packaging for the articles, for example a single-wall corrugated packaging, double-wall corrugated packaging, or a plastic bag;

[0112] - the orientation of the articles;

[0113] - the cost of the items;

[0114] - a level of article weight;

[0115] - the fact that the articles are pre-packaged;

[0116] - a maximum packaging rate not to be exceeded for the articles; and

[0117] - a choice of a shipping preparation area for the items.

[0118] These embodiments can be combined. Thus, for example, the items in a list obtained can be grouped by specific type of packaging and then, within these groups, grouped by item references to form subgroups, subsequently treated like the other groups.

[0119] In our example, all articles require the same type of packaging, and none of the other characteristics mentioned are relevant. If different types of packaging were determined, the following steps could be implemented independently for each type of packaging. In other words, the multi-pack preparation process in this case would only apply to articles of the same type of packaging, and it would be repeated for articles of a different type of packaging. Conversely, it could be provided that different types of packaging would be involved.

[0120] In an unillustrated variant, the list of items can be divided into groups of items that have no common characteristics, for example, when each item in the list is unique. In other words, the groups to be processed may all correspond to group 15, all made up of items of different models. In this case, they are all processed according to the steps described below concerning group 15.

[0121] The result of step 102 is, in our example, obtaining groups of articles 13 to 15 to be shipped, all these groups being intended for the same recipient, or in any case part of a common list 7 of articles to be dealt with together.

[0122] Step 103 is the sorting of the groups according to at least one predetermined criterion chosen from among the cumulative volume of the items in each group, the cumulative weight of the items in each group, and the cumulative density of the items in each group, so as to form an ordered sequence of the groups whose items will be virtually arranged in virtual packaging instances as described below. The density of an item is its weight per unit volume. The result of step 103 is therefore an ordered sequence of the groups according to one or more of these criteria. In the example, they are considered to be ordered by cumulative volume, resulting in a sequence conforming to the numerical references: 13, 14, then 15.

[0123] In a variant, the sequence of article groups is further ordered so that the group(s) containing articles with the same model are placed before the group(s) containing articles without a common model. This criterion is cumulative with the previous ones, but can take precedence: the groups are ordered first according to these groupings, then according to the other criteria. In our example, the result would be the same: groups 13 and 14, containing articles with common models respectively, are placed before group 15.

[0124] Step 104 is, for each group, the sorting of the items in one or both groups according to at least one predetermined criterion chosen from among the volume of each item, the weight of each item, and the density of each item, so as to form an ordered sequence of the items in the group to be virtually arranged in the instance(s). The result of the step is therefore, for each group, an ordered sequence of item arrangement. In our example, the sorting of the items in groups 13 and 14 is irrelevant since the items are identical. It may not even be done. On the other hand, sorting is important for group 15. It results, for this group 15, by sorting by volume, in a sequence starting with article 10, then 12, then 11.

[0125] The result of these steps 103 and 104 is that, in our example, we will first arrange the articles of group 13, then those of group 14, then those of group 15, starting with article 10, then continuing with article 12 and article 11.

[0126] Steps 105 to 109 are aimed at selecting a virtual package, which can be called a "pilot package", instances of which will be used subsequently to house the items of each group.

[0127] Step 105 is the obtaining of a list 20 of packages 21 to 24. These virtual packages correspond to actual packages already in stock at a logistics provider. Each of these packages may have different characteristics, such as different dimensions or capacities. The "capacity" corresponds to the maximum weight of items that the package can support.

[0128] If the items were grouped by packaging type in step 102, then this step, and subsequent steps, concern only one packaging type. In other words, for a different packaging type, a new step 105 is performed to obtain a list of packages corresponding to this new packaging type. Alternatively, it may be provided that different packaging types are concerned. The packaging list then contains packages of potentially different types.

[0129] Alternatively, they correspond to packaging references available to the logistics provider. Alternatively, they may be packaging previously selected by the logistics provider or another user.

[0130] Step 106 is, for each package in list 20, obtaining the dimensions of the package and the capacity of the package.

[0131] Step 107 is the selection of packages from the list having a capacity greater than the heaviest item in the item groups and less than a predetermined capacity value. The packages must also have a volume greater than the largest item in the item groups and less than the combined volume of the items in the item groups, and have dimensions greater than the largest dimensions of the items in the item groups.

[0132] In our example, the largest items are the 8 items of group 13. The choice therefore falls, in the example, on the packages which successfully pass the criteria mentioned with regard to these 8 items. It follows, in our example, that only the packages 21 and 23, which are able to accommodate at least one of these 8 items, but not able to accommodate all the items of all groups 13, 14 and 15, and which have a capacity less than a predetermined capacity, are selected.

[0133] The predetermined capacity value is either set by the user or fixed by default. Its purpose is to prevent the selection of packaging with a capacity that is far too high compared to the usual actual packaging that will be subject to a subsequent packaging assignment step. This maximum capacity can be the cumulative weight of the items in the group.

[0134] Furthermore, choosing packaging that is not suitable for all the items in the group aims to force the distribution of the items into at least two packages. Without this criterion, packaging large enough to hold all the items could be chosen, and the subsequent steps of distributing the items into multiple instances would no longer be necessary.

[0135] Step 108 involves sorting the selected packages, here packages 21 and 23, according to one or more predetermined criteria. In one embodiment, the first criterion is the volume of the packages, with sorting performed in descending order of volume. For packages of equal volume, a second criterion is considered: the sum of the three dimensions of each package, with sorting performed in ascending order of sum. Other criteria could be selected alternatively or in addition to sorting the packages. In particular, if several different types of packages are in the list, the packages can be sorted by type; for example, a cardboard package might be preferred to a plastic one. The result of step 108 is an ordered sequence of virtual packages. In our example, they are considered to be sorted according to volume, resulting in a sequence conforming to the numerical references: package 21 followed by package 23.

[0136] Step 109 is the selection of the first virtual package from among the sorted packages; in our example, package 21. The result of steps 105 to 109 is therefore the selection of a virtual package, which can be called the "pilot virtual package," and which will be used to arrange the items of all the groups. Thus, in our example, it is on the basis of this virtual package 21 that list 7 of the items of all the groups to be shipped is drawn up.

[0137] Alternatively to these steps, the choice of this pilot packaging can be defined manually, for example by the logistics provider, or via other criteria. It should be noted that this virtual packaging does not necessarily correspond to the actual packaging that will subsequently be assigned to each theoretical package formed. These instances of virtual packaging aim to form theoretical packages by grouping the items potentially differently and arranging them within the instances.

[0138] Step 110 is the opening of a first instance 31 of the virtual packaging.

[0139] Step 111 is the virtual arrangement of a first article 8 of group 11 to a predetermined position of the first open instance 31.

[0140] To virtually arrange the remaining items of group 11 in instance 31, the steps in accordance with the arrangement process described in documents FR3141547A1, FR3141453A1, FR3141452A1 and FR3141546A1 are carried out. Therefore, we only represent below the main steps for a given item: • a step 112 of determining the dimensions and coordinates of several remaining empty spaces of instance 31, distinct from each other and having respective virtual rectangular prism shapes; • a step 113 of determining possible positions of the remaining article in each empty space; • a step 114 of determining respective distances between a predetermined vertex of instance 31 and the respective vertices of the remaining article in each possible positioning; • depending on the distances determined, a step 115 of selection of one of the possible positions as a virtual arrangement of the article remaining in instance 31.

[0141] Step 116 is the update of the remaining capacity of instance 31 in which the article is arranged, this remaining capacity corresponding to the maximum weight supported remaining by the packaging, and the update of available spaces remaining in the instance.

[0142] The arrangement steps 112 to 116 are then repeated successively for each of the remaining articles 8 of group 13 to be virtually arranged in the instance, as long as the remaining capacity and available spaces are sufficient, so as to determine an arrangement plan for all the articles in the instance. The result of a virtual arrangement of an article in an instance includes the coordinates of the article in the instance where it is arranged.

[0143] Throughout the description that follows, when we refer to the arrangement of an article, we will be referring to steps 112 to 115 for arranging that article in an instance or in a package.

[0144] In step 117, when the open instance, in our example instance 31, does not have sufficient remaining capacity and / or available space to accommodate the item, a new identical instance 32 of the virtual packaging 21 is opened to accommodate the remaining item 8. The result of this step is illustrated in [Fig. 6].

[0145] From this stage onwards, when we have at least two open instances, in our example instances 31 and 32, the choice of the instance in which to virtually arrange each article then depends on the group to which it belongs and on predetermined choices of a user of the process.

[0146] Thus, for groups 13 and 14 where the articles are grouped by article reference, the steps implemented depend on a predetermined parameter for allow or not to "break" these groups in order to arrange their respective articles in already open instances, to minimize the respective empty rates of the instances.

[0147] If this permission is not enabled, to begin arranging articles from each of these groups—in our example, to begin arranging articles from group 14—a new instance is opened. This way, articles grouped by reference are not mixed with other articles, even if they might be spread across multiple instances containing only identical articles. This variant is not shown.

[0148] Conversely, if it is permitted to "break" these groups to distribute these articles in already open instances, steps 118 to 130 described below are carried out.

[0149] Step 118 is the attempt to identify, among the open instances, one of the instances capable of containing all the articles of the group, based at least on the remaining capacity of the instance and the remaining available space within the instance. Alternatively, the remaining volume of each instance is determined beforehand.

[0150] Thus, in the order in which the instances are opened, starting with the first opened instance, the remaining volume of the instance is checked, and then, if sufficient, the remaining capacity is checked by comparing these values ​​to the cumulative capacities of the items. If they are sufficient, it is checked whether the available space is compatible with the items. These checks could be performed in a different order. To check the available space, a virtual arrangement of all the items, in accordance with steps 112 to 116, is attempted in the instance. If all the items can be arranged in the instance, it is identified. When an instance is identified, step 119 is implemented, which is the formation of a package containing the items arranged in that instance.

[0151] In our example, no instance is identified at step 118. The articles will therefore necessarily be distributed across several instances, in accordance with the following steps.

[0152] Step 120 is to obtain the number of articles in the group, having the same model, to arrange in the already open instances. In our example, this refers to the five identical articles 9 from group 14.

[0153] Step 121 is to determine the maximum number of permitted instances for containing items of the same type with items of other types. For example, an order picker or other user may have previously indicated that they do not want their identical items distributed across more than six packages containing mixed items. The maximum number of instances may vary.

[0154] Step 122 is, for each of the already opened packaging instances, the determination of the remaining capacity of the instance, this remaining capacity corresponding to the maximum weight supported remaining by the packaging.

[0155] Step 123 is, for each of these instances, the determination of the dividend resulting from the division of the remaining capacity by the weight of an item to be arranged.

[0156] Step 124 is, for each of these instances, the determination of the modulo resulting from this division.

[0157] Steps 125 to 131 are performed for a value k starting at 2 and, at most, ending at the maximum number of allowed instances obtained in step 119.

[0158] Step 125 is the formation of all combinations, called k-tuples, of already open packaging instances, each k-tuple comprising k instances.

[0159] Step 126 is, for each k-tuple, the determination of the sum of the dividends of the instances of the k-tuple.

[0160] Step 127 is the determination of the sum of the modulos of the instances of the k-tuple.

[0161] Step 128 is selection of k-tuples whose sum of dividends is greater or equal to the number of items to be arranged.

[0162] Step 129 is the sorting of the selected k-tuples by increasing sum of the modulos.

[0163] Step 130 is, for each k-tuple in sort order, the attempt to virtually arrange the articles in the instances of the k-tuple.

[0164] At step 131, when all the articles can be arranged virtually in these instances, theoretical packages are formed comprising the articles respectively arranged in these instances of this k-tuple.

[0165] Conversely, when at least one of the items cannot be arranged in one of the k-tuples, step 132 is the incrementation of k. Steps 125 to 131 are then repeated with the new value of k.

[0166] Alternatively, before the virtual arrangement attempt 130, a verification step requires that the group's items be arranged in k-tuple instances opened only consecutively. Thus, identical items cannot be distributed across non-consecutive instances.

[0167] In our example, the result of these steps is illustrated in [Fig.7], with the mixing, in the two open instances, of the identical articles 8 and 9.

[0168] In an embodiment not illustrated, when the open instances cannot contain all the identical items, a step is performed to open a new identical instance of the virtual packaging in order to virtually arrange, item by item, as many items of the same model as possible within it. In other words, when, for k reaching the maximum number of instances, none of the k-tuples can contain all the items of the same model, a new identical instance of the virtual packaging is opened and the virtual arrangement steps are performed for as many items as possible. of the same model to be arranged as much as possible. A new theoretical package is therefore created containing the maximum number of items of the same model possible. For the remaining item(s) of the same model that cannot be arranged in this new instance, due to insufficient capacity or available space, the previous steps 118 and 119 of identifying an already open instance to contain these remaining items are repeated. If no instance is identified, steps 120 to 132 of distributing these remaining items across the k-tuples of already open instances are performed. If necessary, a new instance is opened. These steps are repeated until all items of the same model are arranged in instances.

[0169] In step 133, for items from a group not containing identical items (in our example, group 15) and which are compatible, from the point of view of all other possible grouping criteria, with the already open instances, the already open instances are traversed in order of opening. When an open instance has sufficient capacity and available space, the virtual arrangement of the item within the instance is performed according to the virtual arrangement process described previously. Thus, for our group 15, which contains non-identical items and therefore does not need to be delivered grouped, the items are placed, one by one, as efficiently as possible in the already open instances according to steps 112 to 116, in order to minimize the empty spaces in these instances. In our example, the result is illustrated in [Fig. 8].

[0170] Following all these steps, all the items from all the groups have been arranged into instances. Thus, step 134 is the formation of theoretical packages, each theoretical package comprising the items arranged in the same instance. In our example, the input list 7 results in the creation of two theoretical packages comprising all the items from list 7 arranged in the respective instances 31 and 32.

[0171] To form logistics load units, steps are then carried out to assign packaging to each theoretical package. As mentioned above, the packaging may differ from the dimensions of the instance chosen beforehand. These assignment steps are described in documents FR3141547A1, FR3141453A1, FR3141452A1, and FR3141546A1. We only represent the main steps below.

[0172] Thus, step 135 is the selection of available packaging. This packaging corresponds, for example, to actual packaging available in stock or to references that the logistics provider can have available.

[0173] Step 136 is, for each selected package, the determination of a prioritization value for the package, the value depending on at least the volume of the package so that a package that is less bulky than another package, all other things being equal, has priority over that other package.

[0174] Step 137 is sorting the packages according to their respective prioritization values ​​in order to form a sorted list of packages.

[0175] Step 138 is choosing one of the packages from the list according to the sorting.

[0176] Step 139 is the verification of the suitability of the chosen packaging to a parcel theoretical to be packed, the verification relating at least to the weight of the theoretical package in relation to a maximum weight supported by the packaging.

[0177] For each package deemed suitable, a virtual arrangement step 138 is implemented again, according to the arrangement process described above, of the items from the theoretical package into the packaging. Thus, although an arrangement plan for the items in the instance is already available, the same steps are repeated in order to determine the arrangement plan for the same items but this time in a chosen package which may be different from the instance.

[0178] In step 141, for each suitable package, the void ratio generated by the arrangement plan is then determined.

[0179] At step 142, the chosen packaging is the one for which the determined void ratio is the lowest.

[0180] Following these steps, a physical package is assigned to the theoretical package formed, thus producing a logistics load unit. This unit comprises the virtually arranged items and the assigned packaging. The order picker can then prepare the actual logistics load unit comprising the actual items corresponding to the virtually arranged items, as well as the actual packaging. In our example illustrated in [Fig. 9], the logistics load units are packaged by the respective packagings 33 and 34.

[0181] The result of these steps is the allocation of packages 33 and 34 but also the arrangement plans of the articles in each of these packages, that is to say the coordinates of the articles.

[0182] It should be noted that, during the packaging allocation process, the other criteria described in documents FR3141547A1, FR3141453A1, FR3141452A1 and FR3141546A1 may be taken into account for selecting and then sorting the packaging. These include dimensions, to select only packaging suitable for the articles, as well as criteria related to durability, price, and greenhouse gas emissions. Suitability verification is also based on the criteria described, such as fragility, price, and weight.

[0183] The invention is not limited to the embodiments shown and other embodiments will be obvious to a person skilled in the art. List of references

[0184] 1: computer resources 2: Data processing device; 3: Data storage medium

[0185] 4: computer program

[0186] 5: database

[0187] 6: means of interaction

[0188] 7: list of articles

[0189] 8: identical articles

[0190] 9: identical articles

[0191] 10: single article

[0192] 11: single article

[0193] 12: single article

[0194] 13: group of identical articles

[0195] 14: group of identical articles

[0196] 15: group of unique articles

[0197] 20: list of virtual packages

[0198] 21: packaging

[0199] 22: packaging

[0200] 23: packaging

[0201] 24: packaging

[0202] 31: packaging instance

[0203] 32: packaging instance

[0204] 33: Affected packaging

[0205] 34: Affected packaging

[0206] 100: parcel preparation method

Claims

Demands

1. A method (100) for preparing multi-packages, implemented by computer (1) and comprising the following steps: - obtaining (102) at least one group (13, 14, 15) of items (8, 9, 10, 11, 12) to be shipped; - obtaining (105) at least one list (20) of virtual packages (21, 22, 23, 24); - selecting (106, 107, 108, 109), from the list (20) of virtual packages, a virtual package based on at least one dimension of at least one item from the or each group of items to be shipped; - opening (110) at least one instance (31, 32) of the virtual package;- for each item in group (13, 14, 15) or at least one of the groups, item (8, 9, 10, 11, 12) by item: • arrangement (111, 112, 113, 114, 115) of the item in the or one of the open instances (31, 32) according to the remaining capacity of the instance, this remaining capacity corresponding to the maximum weight supported remaining by the packaging, and according to the remaining available spaces in the instance; • update (116) of the remaining capacity of the instance (31, 32) in which the item (8, 9, 10, 11, 12) is arranged, and update of the remaining available spaces in the instance; - formation (132) of theoretical packages, each theoretical package comprising the articles (8, 9, 10, 11, 12) arranged in the same instance (31, 32).;

2. A method (100) according to the preceding claim, comprising, when the open instance (31) or none of the open instances has sufficient remaining capacity and / or available spaces to accommodate the article (8, 9, 10, 11, 12), opening a new identical instance (32) of the virtual packaging (21) to arrange the article therein.

3. A method (100) according to any one of the preceding claims, comprising, for selecting the virtual packaging (21) depending on the group or groups of items (13, 14, 15) to be shipped, the following steps: - for each package (21, 22, 23, 24) from the list (20) of virtual packages, obtaining (106) the dimensions of the package and the capacity of the package, this capacity corresponding to the maximum weight supported by the package; - selection (107) of the packages from the list (20) having a capacity greater than the heaviest item in the group or groups of items and less than a predetermined capacity value, having a volume greater than the largest item in the group or groups of items and less than the cumulative volume of the items in the group or groups of items, and having dimensions greater than the largest dimensions of the items in the group or groups of items; - among the selected packages, sorting (108) the packages (21, 22, 23, 24) according to one or more predetermined criteria. - among the sorted packages, selection (109) of the first package.

4. A method (100) according to any one of the preceding claims, comprising, for arranging at least one of the articles (8, 9, 10, 11, 12) of the or at least one of the groups (13, 14, 15), traversing (131), in order of opening, the instances (31, 32) already open and, when an open instance has sufficient capacity and remaining available spaces, the virtual arrangement (111, 112, 113, 114, 115) of the article in the instance.

5. A method (100) according to any one of the preceding claims, comprising the following preliminary steps: - obtaining (101) a list of articles to be shipped; - dividing (102) the articles into several groups (13, 14, 15) of articles, each or at least some of the groups (13, 14) comprising only articles (8, 9) having in common at least one predetermined characteristic.

6. A method (100) according to at least the preceding claim, wherein the or at least one of the features common to articles (8, 9) of at least one of the same group (13, 14) is a common article design.

7. A method (100) according to at least the preceding claim, comprising, for virtually arranging the articles (8, 9) of a group (13, 14) having the same article model in one or more

8. For open instances that already contain virtually all items from one or more models, the following steps: - obtaining (120) the number of articles in the group, having the same model, to be arranged in the instances already opened; - obtaining (121) a maximum number of allowed instances to contain these items having the same item model with items of other models; - for each of the packaging instances already opened, determination (122) of the remaining capacity of the instance, this remaining capacity corresponding to the maximum weight supported remaining by the packaging, determination (123) of the dividend resulting from the division of the remaining capacity by the weight of an item to be arranged, and determination (124) of the modulo resulting from this division; - for a value k starting at 2 and, at most, ending at the maximum number of allowed instances: • formation (125) of all combinations, called k-tuples, of already open packaging instances, each k-tuple comprising k instances; • for each k-tuple, determination (126) of the sum of the dividends of the instances of the k-tuple, and determination (127) of the sum of the modulos of the instances of the k-tuple; • selection (128) of k-tuples whose sum of dividends is greater than or equal to the number of items to be arranged; • sorting (129) of the selected k-tuples by increasing sum of the modulos; • for each k-tuple in sort order, attempt (130) to virtually arrange the items in the instances of the k-tuple, and, when all the items can be virtually arranged in these instances, formation (131) of theoretical packages comprising the items respectively arranged in these instances of this k-tuple, or, when at least one of the items cannot be arranged in one of the k-tuples, increment (132) of k and reiteration of the previous steps with the new value of k. Method (100) according to the preceding claim, comprising, before the virtual arrangement attempt (130), a verification step requiring that the articles of the group be arranged in instances of the k-tuple opened only consecutively.

9. A method (100) according to any one of the preceding claims, wherein, in order to achieve a virtual arrangement of an article (8, 9, 10, 11, 12) in an instance (31, 32), the articles and the instance having respective virtual rectangular prism shapes, the following steps are carried out: - determination (112) of the dimensions and coordinates of several remaining empty spaces in the instance, distinct from one another and having respective virtual rectangular prism shapes; - determination (113) of possible positionings of the article in each empty space; - determination (114) of respective distances between a predetermined vertex of the instance and the respective vertices of the article in each possible positioning; - based on the determined distances, selection (115) of one of the possible positionings as the virtual arrangement of the article in the instance.

10. A method (100) according to any one of the preceding claims, comprising a sorting step (104) of the articles (8, 9, 10, 11, 12) of one or each group according to at least one predetermined criterion chosen from the volume of each article, the weight of each article, and the density of each article, so as to form an ordered sequence of the articles of the group to be arranged virtually in the instance or instances.

11. A method (100) according to any one of the preceding claims, comprising a sorting step (103) of the groups (13, 14, 15) according to at least one predetermined criterion chosen from the cumulative volume of the items in each group, the cumulative weight of the items in each, and the cumulative density of the items in each group, so as to form an ordered sequence of the groups whose items are arranged virtually in the instances.

12. A method (100) according to at least claim 5, wherein one or at least one of the features common to articles (8, 9) of a group is selected from the following: - at least certain dimensions of the items; - a level of fragility of the items; - a need for a specific type of packaging for the items, for example single-wall corrugated cardboard, double-wall corrugated cardboard, or a plastic bag; - the orientation of the items; - the cost of the items; - a level of weight of the items; - whether the items are pre-packaged; - a maximum packaging rate not to be exceeded for the items; and - a choice of a shipping preparation area for the items.

13. A method (100) according to any one of the preceding claims, comprising, subsequently, for each theoretical package formed, a step of assigning a package made in the following manner: - selection (135) of available packages; - for each package selected, determination (136) of a prioritization value for the package, the value depending on at least the volume of the package so that a package less voluminous than another package, is, all other things being equal, prioritized over that other package; - sorting (137) of the packages according to their respective prioritization values ​​so as to form a sorted list of packages; - selection (138) of one of the packages from the list according to the sorting; - verification (139) of the suitability between the chosen package and a theoretical package to be packaged, the verification relating at least to the weight of the theoretical package in relation to a maximum weight supported by the package.

14. Computer program (4) comprising instructions which, when the program is executed by a computer, cause the computer to carry out the steps of the method (100) according to any one of the preceding claims.

15. Computer-readable recording medium (3) comprising instructions which, when executed by a computer, cause the computer to carry out the steps of the process (100) according to any one of claims 1 to 13. 27

16. Data processing device (2) comprising a processor configured to carry out the steps of the process (100) according to any one of claims 1 to 13.

Images