Different methods of solving the packing rectangles problem (see https://en.wikipedia.org/wiki/Packing_problems#Packing_rectangles)
git clone https://github.com/danielroth1/PackingRectanglesOptimizer.git && cd PackingRectanglesOptimizer && mkdir build && javac src/main/GuiControl.java -d build -sourcepath src/
cd build
java main.GuiControl
- three methods of solving the packing rectangles problem are implemented
- it can be chosen between the three different optimization algorithms: local search, simulated annealing, tabu search
- visualization of the search process
- by clicking on the menu entry Test->Test test runs over multiple randomly created instances with all three methods and search algorithms are executed. At the end, the results are visualized.
Visualization after the execution of a local search run: the dashed line represents the surrounding rectangle of the previously greedily applied approach.
Example test results: The red bard indicates the improvements from the greedy approach.
