Containerization has been used in many applications for isolation purposes due to its
lightweight, scalable, and highly portable properties. However, to apply containerization in …

This paper describes a novel approach making use of genetic algorithms to find optimal
solutions for multi-dimensional vector bin packing problems with the goal to improve cloud …

Local search algorithms have been successfully used for many combinatorial optimisation
problems. The choice of the most suitable local search algorithm is, however, a challenging …

In this paper, we address the Bin Packing Problem with Compatible Categories (BPCC), a
challenging optimization problem that arises in the context of last mile distribution to …

Consolidation problems in cloud computing (CC) encompass server consolidation, virtual
machine (VM) consolidation, and task consolidation. These problems have become …

The two-dimensional vector packing problem is a well-known generalization of the classical
bin packing problem. It considers two attributes for each item and bin. Two capacity …

We propose a consistent neighborhood search approach for solving the one-dimensional
bin packing problem (BPP). The goal of this local search is to derive a feasible solution with …

Parameter tuning is a challenging and time-consuming task, crucial to obtaining improved
metaheuristic performance. There is growing interest in cross-domain search methods …

Virtual Machine (VM) placement consolidates VMs into a minimum number of Physical
Machines (PMs), which can be viewed as a Vector Bin-Packing (VBP) problem. Recent …

We propose an iterated local search based on several classes of local and large
neighborhoods for the bin packing problem with conflicts. This problem, which combines the …