Objective Function Based Pattern Search: A Computationally Efficient Algorithm for 3D Component Layout

Abstract

A new class of pattern search algorithms called Objective Function-based Pattern Search is proposed for 3D Layout. These algorithms are driven by decreasing expected change in objective function rather than by decreasing step size. Current pattern search algorithms rely on decreasing step size of all patterns at the same rate. Also, all translation and rotation patterns are active at all step sizes of patterns. The new class of algorithms decreases the step sizes of the patterns based on the expected change in objective function value due to that pattern. Also, whether a pattern is active or inactive at a particular step size is decided by the expected change in objective function due to that pattern at that step size. The new algorithm is found to be up to 50% faster in runtime compared to previous pattern search based algorithms.