Container loading is a pivotal function for operating supply chains efficiently.
Underperformance results in unnecessary costs (eg cost of additional containers to be …

We survey the main formulations and solution methods for two-dimensional orthogonal
cutting and packing problems, where both items and bins are rectangles. We focus on exact …

Three‐dimensional cutting and packing problems have a range of important applications
and are of particular relevance to the transportation of cargo in the form of container loading …

We consider difficult combinatorial optimization problems arising in transportation logistics
when one is interested in optimizing both the routing of vehicles and the loading of goods …

In this paper we present a novel biased random-key genetic algorithm (BRKGA) for 2D and
3D bin packing problems. The approach uses a maximal-space representation to manage …

We consider a special case of the symmetric capacitated vehicle routing problem, in which a
fleet of K identical vehicles must serve n customers, each with a given demand consisting in …

Pallet loading requires the solution of a three-dimensional bin packing problem (3DBPP)
with additional requirements. In particular, vertical support and load bearing, which are not …

In this article, we focus on the use of low-Earth orbit (LEO) satellites providing the
narrowband Internet of Things (NB-IoT) connectivity to the on-ground user equipments …

The capacitated vehicle routing problem with three-dimensional loading constraints
combines capacitated vehicle routing and three-dimensional loading with additional packing …

We present a metaheuristic methodology for the Capacitated Vehicle Routing Problem with
two-dimensional loading constraints (2L-CVRP). 2L-CVRP is a generalisation of the …