https://github.com/jackmarsh/ants-in-your-bin
Ant Colony Optimisation of the bin packing problem
https://github.com/jackmarsh/ants-in-your-bin
Last synced: about 1 year ago
JSON representation
Ant Colony Optimisation of the bin packing problem
- Host: GitHub
- URL: https://github.com/jackmarsh/ants-in-your-bin
- Owner: jackmarsh
- Created: 2019-03-26T11:22:39.000Z (about 7 years ago)
- Default Branch: master
- Last Pushed: 2019-03-26T11:26:18.000Z (about 7 years ago)
- Last Synced: 2024-11-30T18:37:56.993Z (over 1 year ago)
- Language: Python
- Size: 415 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Ants-in-your-bin
Ant Colony Optimisation of the bin packing problem
## ACO
The Bin-Packing Problem is an NP-hard combinatorial optimization problem. The objective is to equally distribute items of different weights into a finite set of bins. Due to its combinatorial complexity, it is impractical to solve for optimal solutions and hence computational approximations are better suited, especially for larger instances of the problem. This paper explores the growing field of nature-inspired solutions applied to Bin Packing. The paper then focuses on Ant Colony Optimisation as a heuristic approach to Bin Packing by trans- forming the problem to finding the best path through a weighted graph. It then highlights the limitations of this model before attempting to solve them with the Max-Min Ant Colony Optimisation algorithm.