Project by Mark Rothermel and me for the lecture "Optimierungsalgorithmen" at the Technical University Darmstadt.
The Rectangle Packing Problem (RPP) describes the issue of putting n
(almost arbitrary) rectangles into N
squares (boxes) such that N
is minimized.
Automatic solving using one of two different and efficiently implemented algorithmic approaches (local search
and greedy search
) with multiple tuning possibilities
By setting the hyperparameters such as number and sizes of rectangles, box size, etc.
Just execute run_gui.py
.
This GUI is implemented using PyGame (for the grid world) and PyGame Menu (for the UI).