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...
Kaydedildi:
| Asıl Yazarlar: | , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Public Library of Science (PLoS)
2023-01-01
|
| Seri Bilgileri: | PLoS ONE |
| Online Erişim: | https://doi.org/10.1371/journal.pone.0282598 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|