Abstract
In the Physical Internet supply chain paradigm, modular boxes are one of the main drivers. The dimension of the modular boxes has already been subject to some studies. However, the usage of a modular approach on the container loading problem has not been accessed. In thiswork, we aim to assess the impact of modular boxes in the context of the Physical Internet on the optimization of loading solutions. A mathematical model for the CLP problem is used, and extensive computational experimentswere performed in a set of problem instances generated considering the Physical Internet concept. From this study, it was possible to conclude for the used instances that modular boxes contribute to a higher volume usage and lower computational times.

Abstract
We present heuristics for two related two-dimensional non-guillotine packing problems. The first problem aims to pack a set of items into the minimum number of larger identical bins, while the second aims to pack the items that generates most value into one bin. Our approach successively creates sequences of items that defines a packing order considering knowledge obtained from sequences previously generated. Computational experiments demonstrated that the proposed heuristics are very effective in terms of solution quality with small computing times. © 2021, Springer Nature Switzerland AG.

Abstract
The CrossLog project aims to investigate, study, develop and implement an automated and collaborative cross-docking system (aligned with Industry 4.0) capable of moving and managing the flow of products within the warehouse in the fastest and safest way. In CrossLog, the ability to generate intelligent three-dimensional packing patterns is essential to ensure the flexibility and productivity of the cross-docking system while ensuring the stability of the palletised load. In this work, a heuristic solution approach is proposed to generate efficient pallet packing patterns that simultaneously minimise the total number of pallets required and address the balance of weight and volume between pallets. Computational experiments with data from a real company demonstrate the quality of the proposed solution approach.

Abstract
In this paper, we consider the two-dimensional Variable-Sized Cutting Stock Problem (2D-VSCSP) with guillotine constraint, applied to the home textile industry. This is a challenging class of real-world prob-lems where, given a set of predefined widths of fabric rolls and a set of piece types, the goal is to de-cide the widths and lengths of the fabric rolls to be produced, and to generate the cutting patterns to cut all demanded pieces. Each piece type considered has a rectangular shape with a specific width and length and a fixed demand to be respected. The main objective function is to minimize the total amount of the textile materials produced/cut to satisfy the demand. According to Wascher, Hau ss ner, & Schu-mann (2007), the addressed problem is a Cutting Stock Problem (CSP), as the demand for each item is greater than one. However, in the real-world application at stake, the demand for each item type is not very high (below ten for all item types). Therefore, addressing the problem as a Bin-Packing Problem (BPP), in which all items are considered to be different and have a unitary demand, was a possibility. For this reason, two approaches to solve the problems were devised, implemented, and tested: (1) a CSP model, based on the well-known Lodi and Monaci (2003) model (3 variants), and (2) an original BPP-based model. Our research shows that, for this level of demand, the new BPP model is more competitive than CSP models. We analyzed these different models and described their characteristics, namely the size and the quality of the linear programming relaxation bound for solving the basic mono-objective variant of the problem. We also propose an epsilon-constraint approach to deal with a bi-objective extension of the problem, in which the number of cutting patterns used must also be minimized. The quality of the models was evaluated through computational experiments on randomly generated instances, yielding promising results.(c) 2022 Published by Elsevier B.V.

Abstract
Cutting and packing problems are challenging combinatorial optimization problems that have many rel-evant industrial applications and arise whenever a raw material has to be cut into smaller parts while minimizing waste, or products have to be packed, minimizing the empty space. Thus, the optimal solution to these problems has a positive economic and environmental impact. In many practical applications, both the raw material and the cut parts have a rectangular shape, and cut-ting plans are generated for one raw material rectangle (also known as plate) at a time. This is known in the literature as the (two-dimensional) rectangular cutting problem. Many variants of this problem may arise, led by cutting technology constraints, raw-material characteristics, and different planning goals, the most relevant of which are the guillotine cuts. The absence of the guillotine cuts imposition makes the problem harder to solve to optimality.Based on the Floating-Cuts paradigm, a general and flexible mixed-integer programming model for the general rectangular cutting problem is proposed. To the best of our knowledge, it is the first mixed inte-ger linear programming model in the literature for both non-guillotine and guillotine problems. The basic idea of this model is a tree search where branching occurs by successive first-order non-guillotine-type cuts. The exact position of the cuts is not fixed, but instead remains floating until a concrete small rect-angle (also known as item) is assigned to a child node. This model does not include decision variables either for the position coordinates of the items or for the coordinates of the cuts. Under this framework, it was possible to address various different variants of the problem.Extensive computational experiments were run to evaluate the model's performance considering 16 dif-ferent problem variants, and to compare it with the state-of-the-art formulations of each variant. The results confirm the power of this flexible model, as, for some variants, it outperforms the state-of-the-art approaches and, for the other variants, it presents results fairly close to the best approaches. But, even more importantly, this is a new way of looking at these problems which may trigger even better approaches, with the consequent economic and environmental benefits.

Abstract
Over the years, methods and algorithms have been extensively studied to solve variations of the rectangular twodimensional strip packing problem (2D-SPP), in which small rectangles must be packed inside a larger object denominated as a strip, while minimizing the space necessary to pack all rectangles. In the rectangular 2D-SPP, constraints are used to restrict the packing process, satisfying physical and real-life practical conditions that can impact the material cutting. The objective of this paper is to present an extensive literature review covering scientific publications about the rectangular 2D-SPP constraints in order to provide a useful foundation to support new research works. A systematic literature review was conducted, and 223 articles were selected and analyzed. Real-life practical constraints concerning the rectangular 2D-SPP were classified into seven different groups. In addition, a bibliometric analysis of the rectangular 2D-SPP academic literature was developed. The most relevant authors, articles, and journals were discussed, and an analysis made concerning the basic constraints (orientation and guillotine cutting) and the main solving methods for the rectangular 2D-SPP. Overall, the present paper indicates opportunities to address real-life practical constraints.