A hybrid approach of simulation and metaheuristic for the polyhedra packing problem
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This document presents a simulation-based method for the polyhedra packing problem (PPP). This problem refers to packing a set of irregular polyhedra (convex and concave) into a cuboid with the objective of minimizing the cuboid’s volume, considering non-overlapping and containment constraints. The PPP has applications in additive manufacturing and packing situations where volume is at a premium. The proposed approach uses Unity® as the simulation environment and considers nine intensification and two diversification movements. The intensification movements induce the items within the cuboid to form packing patterns allowing the cuboid to decrease its size with the help of gravity-like accelerations. On the other hand, the diversification movements are classic transition operators such as removal and filling of pieces and enlargement of the container, which allow searching on different solution neighborhoods. All simulated movements were hybridized with a probabilistic tabu search. The proposed methodology (with and without the hybridization) was compared by benchmarking with all previous works solving the PPP with irregular items. Results show that satisfactory solutions were reached in a short time; even a few published results were improved.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it