[NeurIPS 2023] DeepACO: Neural-enhanced Ant Systems for Combinatorial Optimization

[NeurIPS 2024] ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution

A solver for (geometrical) packing problems

Exact solutions for two-dimensional bin packing problems by branch-and-cut

This repo share our packing tools to provide research convenience for beginners, which includes packing shape processing, rendering tools, and simulation scenarios.

This package contains a PHP implementation to solve 3D bin packing problems.

Geometric Deep Learning Models for Vehicle Routing Problem

A new algorithm for the 3-Dimensional Case Picking Problem. A newly considered problem of operational research that combines the well-known case picking problem with the positioning of 3-dimensional items inside pallets (i.e., Pallet Loading Problem).

Java Version of a Bin Packer Algorithm to fit many blocks. Handles one or more bins.

Visualization of the algorithms needed to solve three-dimensional knapsack problems.

Nested branch-and-bound algorithm to solve two-dimensional orthogonal packing problems

C++ implementation of heuristics for solving the bin-packing problem

Unofficial implementation of DeepPack in PyTorch. DeepPack is a deep reinforcement learning based algorithm dealing with 2D online bin packing problem.

bin packing problem best fit and metaheuristics. genetic algorithm, bonus particle swarm optimization. comparing both algorithms

🪚 Panel cutting optimization software running in your browser

Harness the power of Evolutionary Algorithms to optimize bin packing. Experiment with crossover strategies, mutation techniques, and population sizes to achieve efficient item allocation in bins.

Combinatorial Arcflow Model for the Temporal Bin Packing Problem with Fire-Ups

Multidimensional Online Bin Packing with Neural Networks

Ant Colony Optimization on Bin Packing Problem, made in 2019.

This is a MATLAB project (developed in 2012) that solves 'Bin Packing' classic problem using evolutionary algorithms.