https://github.com/wlun001/bin-packing

Bin Packing Problem (Minimise number of used Bins)
https://github.com/wlun001/bin-packing

algorithms-datastructures bin-packing java

Last synced: 7 months ago
JSON representation

Bin Packing Problem (Minimise number of used Bins)

• Host: GitHub
• URL: https://github.com/wlun001/bin-packing
• Owner: WLun001
• Created: 2018-08-04T06:17:22.000Z (over 7 years ago)
• Default Branch: master
• Last Pushed: 2018-08-30T23:57:57.000Z (about 7 years ago)
• Last Synced: 2025-02-09T13:41:36.347Z (9 months ago)
• Topics: algorithms-datastructures, bin-packing, java
• Language: Java
• Homepage:
• Size: 6.78 MB
• Stars: 3
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# bin-packing

Bin Packing Problem (Minimise number of used Bins)

## Problem

Pack parcels into trucks, using fewest trucks. Assume all trucks have the same load limit

### Solution

#### UML diagram

![uml diagram](docs/class-diagram.png)

#### Big-O Notation

| Algorithms  | Big-O Notation |

| ------------- | ------------- |

| First Fit  | ```O(n)``` |

| First Fit Decreasing | Best case: ```O(n)```, Worst case: ```O(n log n)```|

| Best Fit | O(n2) |

| Best Fit Decreasing | Best and worst case: O(n2) |

#### Truck Utilisation

![utilisation](docs/utilisation.png)

#### Sample Output

![output](docs/output.gif)