A deep reinforcement learning algorithm for the rectangular strip packing problem.
As a branch of the two-dimensional (2D) optimal blanking problem, rectangular strip packing is a typical non-deterministic polynomial (NP-hard) problem. The classical packing solution method relies on heuristic and metaheuristic algorithms. Usually, it needs to be designed with manual decisions to g...
Na minha lista:
| Principais autores: | , , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Public Library of Science (PLoS)
2023-01-01
|
| Serier: | PLoS ONE |
| Online adgang: | https://doi.org/10.1371/journal.pone.0282598 |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|