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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
