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...
-д хадгалсан:
| Үндсэн зохиолчид: | , , , |
|---|---|
| Формат: | Artigo |
| Хэл сонгох: | Inglês |
| Хэвлэсэн: |
MDPI AG
2023-02-01
|
| Цуврал: | Mathematics |
| Нөхцлүүд: | |
| Онлайн хандалт: | https://www.mdpi.com/2227-7390/11/4/1028 |
| Шошгууд: |
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!
|