Cargando…

A deep reinforcement learning algorithm for the rectangular strip packing problem

As a branch of the two-dimensional (2D) optimal blanking problem, rectangular strip packing is a typical non-deterministic polynomial (NP-hard) problem. The classical packing solution method relies on heuristic and metaheuristic algorithms. Usually, it needs to be designed with manual decisions to g...

Descripción completa

Detalles Bibliográficos
Autores principales: Fang, Jie, Rao, Yunqing, Shi, Mingliang
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2023
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10019708/
https://www.ncbi.nlm.nih.gov/pubmed/36928505
http://dx.doi.org/10.1371/journal.pone.0282598