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...
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
MDPI AG
2023-02-01
|
| Serie: | Mathematics |
| Soggetti: | |
| Accesso online: | https://www.mdpi.com/2227-7390/11/4/1028 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|