Abstract
An efficient simulated annealing-based algorithm which optimizes component layout is presented. The efficiency comes in the algorithm's ability to calculate component overlap quickly by taking advantage of a hierarchical decomposition of the model's geometry. The result is an algorithm able to optimize the placement of components of arbitrary geometry inside an arbitrarily shaped container over multiple design goals and subject to inter-component spatial and performance constraints. The algorithm is demonstrated on test problems of known solution, and a variety of industrial problems of a priori unknown solution.
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.
