0
1. 2. 2018.
Consistent Neighbourhood Search for Two-Dimensional Vector Packing
We propose a consistent neighbourhood search (CNS) approach to solving the Two-Dimensional Vector Packing problem (2-DVPP). Given a set of items, each having a weight and a volume, the 2-DVPP consists of finding the minimum number of bins, with a weight and a volume capacity, necessary to pack all the items. The best results on the classical benchmark set for 2-DVPP are obtained by iterative local search algorithm presented in [5].