ProjectDescriptions The 2-Dimensional vector Bin Packing Problem (2DBPP) You are given a set of items, each having two dimensions (e.g. weight and volume, length and widths, etc.). Your task is to...

I need help implementing the tabu search into the 2d bin packing problem.


ProjectDescriptions The 2-Dimensional vector Bin Packing Problem (2DBPP) You are given a set of items, each having two dimensions (e.g. weight and volume, length and widths, etc.). Your task is to packs all the items in as few bins (e.g. containers) as possible. All bins are equal and have a maximum capacity for each of the dimensions. More formally: • Minimize the number of bins used • One item can only be packed in one bin • All items must be packed • A bin cannot pack items exceeding the maximum capacities K1 and K2 Data description Each data file is named using the following convention CL_X_N_Z.txt, where X is the instance class, N is the number of items, and Z is an identifier. Each instance includes first the number of items, then the maximum capacities of the bins, and finally a list of items. For each item it lists and ID, and the dimensions. 1 2 3 4 5 ... ... Best known solutions Best known solution can be found here: http://or.dei.unibo.it/general-files/best-solution-known-each-instance The following summarizes the best-known objective values. Instance Bins Instance Bins Instance Bins Instance Bins CL_01_25_1 6 CL_06_50_1 21 CL_07_100_1 41 CL_09_200_1 51 CL_01_25_2 7 CL_06_50_2 21 CL_07_100_2 40 CL_09_200_2 51 CL_01_25_3 7 CL_06_50_3 21 CL_07_100_3 41 CL_09_200_3 51 CL_01_25_4 7 CL_06_50_4 21 CL_07_100_4 40 CL_09_200_4 51 CL_01_25_5 7 CL_06_50_5 21 CL_07_100_5 41 CL_09_200_5 51 CL_01_25_6 7 CL_06_50_6 22 CL_07_100_6 40 CL_09_200_6 51 CL_01_25_7 7 CL_06_50_7 22 CL_07_100_7 41 CL_09_200_7 51 CL_01_25_8 7 CL_06_50_8 22 CL_07_100_8 40 CL_09_200_8 52 CL_01_25_9 7 CL_06_50_9 22 CL_07_100_9 41 CL_09_200_9 52 CL_01_25_10 7 CL_06_50_10 22 CL_07_100_10 40 CL_09_200_10 52