CaastOS/3dknapsacksolver
Visualization of the algorithms needed to solve three-dimensional knapsack problems.
This project helps operations managers, logistics planners, or anyone who needs to efficiently pack items into a confined space. You input the dimensions and values of various three-dimensional objects (like parcels or L, P, T pentominoes) and a container's size. It then uses different algorithms to show you how to arrange the items to maximize the total value packed inside, helping you make the most of limited space.
No commits in the last 6 months.
Use this if you need to visualize and compare different strategies for packing various 3D items into a fixed container to optimize the total value of packed goods.
Not ideal if you need a solution for packing irregular, real-world objects with flexible orientations or if you require a commercial-grade, fully integrated inventory or warehouse management system.
Stars
8
Forks
2
Language
Java
License
—
Category
Last pushed
Jan 22, 2022
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/CaastOS/3dknapsacksolver"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
pdrm83/py2opt
How to solve the traveling salesman problem with the 2-opt algorithm, a fast heuristic search algorithm.
aimclub/SAMPO
Open-source framework for adaptive manufacturing processes scheduling
yining043/TSP-improve
An improvement-based Deep Reinforcement Learning Algorithm presented in paper...
albert-espin/knapsack-packing
Evolutionary Algorithm for the 2D Packing Problem combined with the 0/1 Knapsack Problem (Master Thesis)
rithinch/pareto-optimal-student-supervisor-allocation
🎓An AI tool to assist universities with optimal allocation of students to supervisors for their...