albert-espin/knapsack-packing
Evolutionary Algorithm for the 2D Packing Problem combined with the 0/1 Knapsack Problem (Master Thesis)
This project helps optimize how items of different shapes, values, and weights are placed into a container of a specific shape, aiming to maximize the total value without exceeding the container's weight limit or causing items to overlap. You provide a list of items with their properties and a container definition, and it outputs the ideal arrangement and which items to include. This is for operations managers, logistics planners, or anyone who needs to efficiently pack items into a confined space.
No commits in the last 6 months.
Use this if you need to find the most valuable way to pack various shaped items into a limited container, considering both spatial fit and weight constraints.
Not ideal if your packing problem only involves identical square or rectangular items without weight limits or value considerations.
Stars
61
Forks
18
Language
Python
License
—
Category
Last pushed
Jul 29, 2020
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/albert-espin/knapsack-packing"
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...
ashishpatel26/Amazing-Collection-Vehicle-Routing-Problem
Amazing Collection Vehicle Routing Problem
rithinch/pareto-optimal-student-supervisor-allocation
🎓An AI tool to assist universities with optimal allocation of students to supervisors for their...