In this work we present an overview of the most prominent population-based algorithms and
the methodologies used to extend them to multiple objective problems. Although not exact in …

The current global interest in improving the use of ever-scarcer natural resources calls for
the re-alignment of supply chain operations to include not only economic factors, but …

With the development of intelligent logistics technology, some companies began to use
robots instead of humans to load cargo. This paper studies a novel container loading …

The paper addresses the heterogeneous fleet vehicle routing problem with three-
dimensional (3D) loading constraints (3L-HFVRP), a new practical variant of the combined …

Recent studies have revealed that neural combinatorial optimization (NCO) has advantages
over conventional algorithms in many combinatorial optimization problems such as routing …

The 2D packing problem is categorized as one branch of the cutting and packing problems,
which is widely spread in the manufacturing industries. Over the years many metaheuristics …

In this paper, we present an efficient intelligent search algorithm for the two‐dimensional
rectangular strip packing problem. This algorithm involves three stages, namely greedy …

We examine the 2D strip packing problems with guillotine-cut constraint, where the objective
is to pack all rectangles into a strip with fixed width and minimize the total height of the strip …

High utilization of cargo volume is an essential factor in the success of modern enterprises in
the market. Although mathematical models have been presented for container loading …

This paper investigates the 2D guillotine knapsack packing problem, in which the objective
is to select and cut a set of rectangles from a sheet with fixed size and maximize the total …