mhrimaz/KnapsackFX
Solving Knapsack 0/1 problem with various Local Search algorithms like Hill Climbing, Genetic Algorithms, Simulated Annealing, Tabu Search
This helps you determine the best combination of items to include in a limited-capacity container, like a backpack or a truck, to maximize total value without exceeding weight limits. You input a list of items, each with a weight and a value, along with the total capacity available. It outputs the specific items you should choose to get the most value. Anyone who needs to optimize packing or resource allocation within strict constraints would find this useful.
No commits in the last 6 months.
Use this if you need to quickly find an excellent, though not necessarily perfectly optimal, solution for selecting items with different weights and values into a fixed-capacity container.
Not ideal if you absolutely require the mathematically proven optimal solution every single time, as some methods prioritize speed over guaranteed global optimality.
Stars
28
Forks
4
Language
Java
License
MIT
Category
Last pushed
May 11, 2017
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/mhrimaz/KnapsackFX"
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...