LNS META-HEURISTICS APPLIED TO THE QUADRATIC PACKING PROBLEM

The QMC-VSBPP (Quadratic Multiple Constraint Variable Sized Bin-Packing Problem) is
A variant of the packaging problem that emerges whenever items with multiple dimensions < /> Weight groups need to be allocated in different types of boxes in order to minimize both
fixed costs of using these boxes as well as the joint (communication) costs between items se-
stopped. With direct applications in the context of deploying services in cloud environments, < /> QMC-VSBPP has recently been introduced into the literature. This work proposes data structures
and a Wide Neighborhood Search algorithm for the QMC-VSBPP. Experiments
computational solutions show that the proposed solution surpasses the state-of-the-art solution, finding new
Best solutions for 83 instances of literature.