https://github.com/chutrunganh/optimization-project-it3052e
Optimizing the bin packing problem, aiming to efficiently allocate items of varying sizes into a finite number of bins while maximizing total profit, using optimization algorithms
https://github.com/chutrunganh/optimization-project-it3052e
bin-packing-problem capstone-project constraint-programming greedy-algorithm hust it3052 it3052e knapsack linear-programming local-search optimization project
Last synced: about 1 month ago
JSON representation
Optimizing the bin packing problem, aiming to efficiently allocate items of varying sizes into a finite number of bins while maximizing total profit, using optimization algorithms
- Host: GitHub
- URL: https://github.com/chutrunganh/optimization-project-it3052e
- Owner: chutrunganh
- License: apache-2.0
- Created: 2024-01-29T17:45:26.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2025-02-01T03:48:51.000Z (over 1 year ago)
- Last Synced: 2025-04-02T04:49:35.175Z (about 1 year ago)
- Topics: bin-packing-problem, capstone-project, constraint-programming, greedy-algorithm, hust, it3052, it3052e, knapsack, linear-programming, local-search, optimization, project
- Language: Python
- Homepage:
- Size: 2.39 MB
- Stars: 3
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Bin Packing Problem
## Problem Statement
The bin packing problem is an optimization problem in which items of different sizes must be packed into a finite number of bins or containers, each having a
fixed given capacity, in a way that optimizes the problem depending on the desired outcome.
The goal in this case:
1) An “item” is packed to at most 1 “bin”;
2) Each “bin” must meet the requirements of loaded
quantities: a lower bound & an upper bound;
3) The profit gained from “packed items” is maximal.
Data provided:
- K number of vehicles/bins
- N number of items/orders. Each item has a weight (w) and a profit (p)
- Lower bound (c1) and upper bound (c2) of each vehicle
For more explanation, problem modeling and implementation, please refer to our [report](https://github.com/chutrunganh/Optimization-Project-IT3052E/blob/main/Group-5-Bin-packing-problem.pdf)
## Solution
We have implemented a solution for the bin packing problem using the following algorithms:
1. Integer Linear Programming (ILP)
2. Constraint Programming (CP)
3. "Greedy" assigning method
4. Local search algorithm for completion
## Results
