https://github.com/andreasnel/bin-packing-hyper-heuristics

Contains the code related to solving the one-dimensional bin-packing problem with hyper heuristics.
https://github.com/andreasnel/bin-packing-hyper-heuristics

Last synced: 3 months ago
JSON representation

Contains the code related to solving the one-dimensional bin-packing problem with hyper heuristics.

• Host: GitHub
• URL: https://github.com/andreasnel/bin-packing-hyper-heuristics
• Owner: AndreasNel
• Created: 2018-08-11T16:33:09.000Z (almost 7 years ago)
• Default Branch: master
• Last Pushed: 2018-09-02T13:24:58.000Z (almost 7 years ago)
• Last Synced: 2025-01-30T12:12:03.242Z (5 months ago)
• Language: Python
• Size: 17.6 KB
• Stars: 4
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# bin-packing-hyper-heuristics

Contains the code related to solving the offline one-dimensional bin-packing problem with hyper heuristics.

This was done in accordance with the specifications for the first assignment of the COS790 (Hyper Heuristics) course of the University of Pretoria.

The data sets used were retrieved from the Scholl benchmark set, found at https://www2.wiwi.uni-jena.de/Entscheidung/binpp/index.htm.