Quaternion-based formulations for volume maximisation problems

Jonas Tollenaere () and Tony Wauters
Additional contact information
Jonas Tollenaere: KU Leuven
Tony Wauters: KU Leuven

Journal of Combinatorial Optimization, 2025, vol. 50, issue 2, No 10, 35 pages

Abstract: Abstract This paper introduces a mathematical formulation for the problem of determining the optimal position for a three-dimensional item inside a convex container, where its scale can be increased the most and thus its volume maximised. Until now, no methods have been presented that guarantee optimal solutions to this volume maximisation problem while considering continuous free rotation of the item, with approaches relying on heuristics, approximations or enforcing a discrete number of rotations. We aim to find optimal solutions when considering continuous rotation, represented using quaternions. This enables modelling rotation through quadratic constraints. The resulting quadratically constrained problem can be solved to optimality by mathematical solvers. To keep the required computation time within reasonable limits, various improvements to the model such as symmetry breaking are introduced. Experiments show that the majority of our benchmark instances can be solved to optimality within minutes. The expansion to concave containers is also explored, but proves to be more challenging as the required number of quadratic constraints quickly becomes prohibitive.

Keywords: Cutting and packing; Volume maximisation problems; Quaternions; Quadratically constrained programming (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-025-01351-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:50:y:2025:i:2:d:10.1007_s10878-025-01351-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-025-01351-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().