Solving One-Dimensional Cutting Stock Problems with the Deep Reinforcement Learning
It is well known that the one-dimensional cutting stock problem (1DCSP) is a combinatorial optimization problem with nondeterministic polynomial (NP-hard) characteristics. Heuristic and genetic algorithms are the two main algorithms used to solve the cutting stock problem (CSP), which has problems o...
Kaydedildi:
| Asıl Yazarlar: | , , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
MDPI AG
2023-02-01
|
| Seri Bilgileri: | Mathematics |
| Konular: | |
| Online Erişim: | https://www.mdpi.com/2227-7390/11/4/1028 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|