Truck - Package optimization problem

We've modeled this problem and use a MILP python solver (Pulp)

Model specifications
✅ Can	❌ Can't
Packages Position Parallelepiped Rectangle Packages Overlap Truck Size Maximize Packages amount (weight tunable) Maximize Packages size (weight tunable) Packages Rotation	Maximize large empty space Levitating packages Multiple Trucks Delivery order Real physics with weight (small package can carry a huge package Fragile packages Not Parallelepiped Rectangle Packages

It also offers a visualization of the output :

Name		Name	Last commit message	Last commit date
Latest commit History 12 Commits
.gitignore		.gitignore
README.md		README.md
RPC.pdf		RPC.pdf
exemple_1.png		exemple_1.png
exemple_2.png		exemple_2.png
generate.py		generate.py
input		input
input.sample		input.sample
notebook.ipynb		notebook.ipynb
output		output
output.sample		output.sample
output.txt		output.txt
output_cp.txt		output_cp.txt
visualize.py		visualize.py

Provide feedback