Código QR (código de barras bidimensional)

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...

ver descrição completa

Na minha lista:
Principais autores: Jie Fang, Yunqing Rao, Qiang Luo, Jiatai Xu
Formato: Artigo
Idioma:Inglês
Publicado em: MDPI AG 2023-02-01
coleção:Mathematics
Assuntos:
cutting stock problem
one-dimensional
combination optimization
deep reinforcement learning
mathematical model
pointer network
Acesso em linha:https://www.mdpi.com/2227-7390/11/4/1028
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!

Registros relacionados