Code implementation of "Learning Efficient Online 3D Bin Packing on Packing Configuration Trees". We propose to enhance the practical applicability of online 3D Bin Packing Problem (BPP) via learning on a hierarchical packing configuration tree which makes the deep reinforcement learning (DRL) model easy to deal with practical constraints and we…

This repository contains the implementation of paper Online 3D Bin Packing with Constrained Deep Reinforcement Learning.

3D Bin Packing improvements based on https://github.com/enzoruiz/3dbinpacking

Realize 2D irregular packing algorithm with python

Evolutionary Algorithm for the 2D Packing Problem combined with the 0/1 Knapsack Problem (Master Thesis)

Algorithm for the strip packing problem with guillotine cuts constraint

GA algorithm to solve bin packing and production scheduling problems

3dbin packer where the bin size is unknown/undefined. Given a set of items the algorithm will try to give the smallest single bin to fit all items.

Steinberg algorithm with two heuristics for Strip Packing Problem

Python wrapper for libnest2d

Implementation of a 2x2 packing problem in a grid polygon on a plane.

Einsendung für die 2. Runde des 37. Bundeswettbewerbs für Informatik

A project which is used for calculating and displaying the number of possible boxes(squares/rectangles) of given size that can be packed inside a given circle

This project analyzes various gate packing algorithms, focusing on the Tetris-based algorithm. It achieves superior space optimization compared to more complex methods like the Sleator algorithm, in spite of its simple implementation. The project features visualizations and performance comparisons across multiple test cases.