The multi-drop container loading problem (MDCLP) requires loading a truck so that boxes can be unloaded at each drop-off point without rearranging other boxes to deliver later. However, modeling such unloading constraints as hard constraints, as done in the literature, considerably limits the...

We consider a real-world packing problem faced by a logistics company that loads and ships hundreds of trucks every day. For each shipment, the cargo has to be selected from a set of heterogeneous boxes. The goal of the resulting container loading problem (CLP) is to maximize the value of the...

Purpose: The purpose of this paper is to study the Manufacturers pallet-loading problem (MPLP), by loading identical small boxes onto a rectangle pallet to maximise the pallet utilization percentage while reducing the Complexity of loading. Design/methodology/approach: In this research a Block...

The minimum weight vertex cover problem (MWVCP) is well known combinatorial optimization problem that has several practical applications and formally defined as: Given an undirected graph with a set of vertices and edges, each vertex is assigned bya positive weight, the MWVCP aims to find a...