Question 3
Consider a 1-dimensionale open box in which objects have to be piled up. The objects have a long and short side and are not allowed to be piled up on each other. However, they may rest on their long or short side in the box. Suppose that we want to transport as much objects as possible with that box in 1 trip and that the amount of free space in the box should be as low as possible avoiding movement of the objects as much as possible during transport. Furthermore, the global height of the objects in the box should be as low as possible.
a. Construct a GRASP heuristic to find a good solution for this problem. b. Apply your GRASP heuristic on the following problem and use 15 iterations as stopping condition after constructing the initial solution knowing that the box has a length capacity of 140.
Item 1 2 3 4 5 6 7 8 9 10 11 12
Lange kant 13 19 18 11 13 10 8 15 10 10 17 16
Korte kant 8 15 15 6 8 9 7 13 6 10 9 15
In case random numbers are needed, please use these in vertical order, first column, then second column, etc
1
Zo weinig mogelijk lucht vervoeren, maar zoveel mogelijk op hunne korte kant? Probeer hier 1 criterium van te maken, want ze werken mekaar tegen.
0.081 0.165 0.82 0.28 0.896 0.763 0.313 0.02 0.287 0.047 0.331 0.036 0.987 0.676 0.42 0.01 0.816 0.293 0.549 0.693 0.986 0.014 0.52 0.215 0.783 0.711 0.757 0.283 0.529 0.879 0.09 0.61 0.044 0.91 0.889 0.941 0.673 0.203 0.961 0.96 0.25 0.291 0.996 0.238 0.967 0.415 0.247 0.783 0.708 0.796 0.476 0.694 0.81 0.996 0.909 0.593 0.707 0.666 0.876 0.237 0.545 0.966 0.846 0.589 0.876 0.736 0.53 0.549 0.938 0.49 0.509 0.189 0.782 0.504 0.426 0.749 0.92 0.673 0.532 0.628 0.469 0.008 0.322 0.279 0.004 0.231 0.872 0.711 0.898 0.748 0.948 0.443 0.713 0.794 0.032 0.589 0.53 0.562 0.138 0.468 0.052 0.646 0.657 0.834 0.151 0.083 0.582 0.07 0.756 0.114 0.698 0.225 0.122 0.021 0.504 0.126 0.252 0.376 0.837 0.15 2
