Space Optimization Problem
Budget: ₹150,000 – ₹250,000 INR
This is a spatial optimization problem to place the given square boxes in a rectangular area minimizing the total area under the following constraints.
Some boxes are required to be close to some other boxes. These relations are given in the “Adjacency Map”. If 1 is shown in a cell, the boxes in that row and column should be close to each other within a specified distance.
The boxes should not overlap.
The boxes are aligned with the axes, ie., not rotated.
Some boxes are to be placed with their lower side aligned on the x-axis. These are given “X Axis Objs”.
The boxes and their dimensions are given in “Objects” tab.
Objective : Find the location of the boxes so that the total enclosed area is minimized. Also find the minimum area.
Some boxes are required to be close to some other boxes. These relations are given in the “Adjacency Map”. If 1 is shown in a cell, the boxes in that row and column should be close to each other within a specified distance.
The boxes should not overlap.
The boxes are aligned with the axes, ie., not rotated.
Some boxes are to be placed with their lower side aligned on the x-axis. These are given “X Axis Objs”.
The boxes and their dimensions are given in “Objects” tab.
Objective : Find the location of the boxes so that the total enclosed area is minimized. Also find the minimum area.