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...
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 |
Ejemplares similares
-
Algorithm for the assignment problem (rectangular matrices) {H}
por: Bourgeois, F, et al.
Publicado: (1971) -
BoxStacker: Deep Reinforcement Learning for 3D Bin Packing Problem in Virtual Environment of Logistics Systems
por: Murdivien, Shokhikha Amalana, et al.
Publicado: (2023) -
Exact solutions for the 2d-strip packing problem using the positions-and-covering methodology
por: Cid-Garcia, Nestor M., et al.
Publicado: (2021) -
Flexible Wolf Pack Algorithm for Dynamic Multidimensional Knapsack Problems
por: Wu, Husheng, et al.
Publicado: (2020) -
An improved Wolf pack algorithm for optimization problems: Design and evaluation
por: Chen, Xuan, et al.
Publicado: (2021)