Abstract
Combinatorial optimisation can be applied in a multitude of areas, and this article presents its application to the optimisation of LEGO constructions. Building LEGO constructions is an inherently combinatorial problem, with a large but finite number of possible brick combinations. The objective was to make an aesthetically pleasing construction which is cheap and is structurally stable. Through the application of an adaptive large neighbourhood search metaheuristic, in combination with a mixed integer programming model neighbourhood search procedure and a quadratic programming model ensuring static equilibrium, this article demonstrates how to optimise LEGO constructions with up to 77.000 brick positions.
| Original language | English |
|---|---|
| Article number | 21 |
| Journal | Operations Research Forum |
| Volume | 2 |
| ISSN | 2662-2556 |
| DOIs | |
| Publication status | Published - 2021 |
Bibliographical note
Funding Information:First author Torkil Kollsker studied as an Industrial Ph.D. student, funded by the Innovation Fund (DK), project number 5189-00095B. LEGO also funded part of the project. Second author, Associate Professor Thomas Stidsen, did not receive any external funding.
Publisher Copyright:
© 2021, The Author(s), under exclusive licence to Springer Nature Switzerland AG.
Keywords
- Approximation methods and heuristics (90C59)
- Combinatorial optimisation (90C27)
- Combinatorics and topology (37F20)
- Mixed integer programming (90C11)