Packing problems, also known as nesting problems or bin packing problems, are classic
and popular NP-hard problems with high computational complexity. Inspired by classic …

Cutting and packing problems are hard combinatorial optimization problems that arise in
several manufacturing and process industries or in their supply chains. The solution of these …

At many airports, space on the apron is scarce and has to be used efficiently. To that end, we
optimize the layout of aircraft parking positions adjacent to the airport terminal, pursuing two …

Addressed in this study is a vehicle routing problem with two‐dimensional loading
constraints and time windows (2L‐CVRPTW), aiming to minimize the transportation cost …

In the contemporary era, the limited availability of terrestrial resources has prompted an
increasing number of nations to turn their attention towards space, wherein extraterrestrial …

In this paper, the multiple‐choice knapsack problem with setups is tackled with an iterative
method, where both local branching and descent method cooperate. First, an iterative …

Additive Manufacturing (AM), the technology of rapid prototyping directly from 3D digital
models, has made a significant impact on both academia and industry. When facing the …

Background: The Irregular Strip Packing Problem (ISPP) involves packing a set of irregularly
shaped items within a strip while minimizing its length. Methods: This study introduces the …

The present research deals with the two-dimensional knapsack problem by considering the
cutting of irregular items from a rectangular plate with defects. While the defects are only …

Rural preferential loans usually take the form of portfolio credits. From the perspective of
public interest, the total delay time for obtaining loans is expected to be minimized. To use …