Mitigating Dimensionality in 2D Rectangle Packing Problem under Reinforcement Learning Schema

Waldemar Kołodziejczyk, Mariusz Kaleta
9/15/2024
cs.LGmath.OC

No confident code implementation found for this paper.

Abstract

This paper explores the application of Reinforcement Learning (RL) to the two-dimensional rectangular packing problem. We propose a reduced representation of the state and action spaces that allow us for high granularity. Leveraging UNet architecture and Proximal Policy Optimization (PPO), we achieved a model that is comparable to the MaxRect heuristic. However, our approach has great potential to be generalized to nonrectangular packing problems and complex constraints.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{koodziejczyk2024mitigating,
  title  = {Mitigating Dimensionality in 2D Rectangle Packing Problem under Reinforcement Learning Schema},
  author = {Waldemar Kołodziejczyk and Mariusz Kaleta},
  year   = {2024},
  eprint = {2409.09677},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2409.09677v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2409.09677.svg)](https://codeofpaper.com/paper/2409.09677)

Discussion