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...
I tiakina i:
| Ngā kaituhi matua: | , , , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
MDPI AG
2023-02-01
|
| Rangatū: | Mathematics |
| Ngā marau: | |
| Urunga tuihono: | https://www.mdpi.com/2227-7390/11/4/1028 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|