| Full text | |
| Author(s): |
Total Authors: 3
|
| Affiliation: | [1] University of Campinas. Institute of Computing - Brasil
[2] Federal University of Catalão. Institute of Mathematics and Technology - Brasil
[3] University of Campinas. Institute of Computing - Brasil
Total Affiliations: 3
|
| Document type: | Journal article |
| Source: | Pesquisa Operacional; v. 44, 2024-10-28. |
| Abstract | |
ABSTRACT This paper deals with the two-dimensional strip packing problem (2D-SPP) with the order/or multi-drop and vertical stability constraints. The existing exact algorithm that solves this problem is not able to provide optimal solutions on large instances in a reasonable amount of time. Hence, with a view to quickly obtain a physically stable packing of minimum height while satisfying the order constraint, the Biased Random-Key Genetic Algorithm (BRKGA) is combined with Bottom-Left-Fill (BLF) and Open Space (OS) heuristics. Both versions of the algorithm (BRKGA+BLF and BRKGA+OS) retrieved optimal solutions on many benchmark instances, consuming lesser computational time than the exact algorithm. A comparative study was also performed between the BRKGA, Simulated Annealing (SA) and Particle Swarm Optimization (PSO) algorithms on newly generated large instances. Moreover, the effectiveness of the BRKGA has also been checked on the classical 2D-SPP and two-dimensional orthogonal packing problem (2D-OPP) datasets. (AU) | |
| FAPESP's process: | 22/06707-8 - Algorithms for packing problems |
| Grantee: | Santosh Kumar Mandal |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
| FAPESP's process: | 15/11937-9 - Investigation of hard problems from the algorithmic and structural stand points |
| Grantee: | Flávio Keidi Miyazawa |
| Support Opportunities: | Research Projects - Thematic Grants |
| FAPESP's process: | 22/05803-3 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings |
| Grantee: | Reinaldo Morabito Neto |
| Support Opportunities: | Research Projects - Thematic Grants |