Design optimization of a speed reducer using deterministic techniques

Abstract

The optimal design problem of minimizing the total weight of a speed reducer under constraints is a generalized geometric programming problem. Since the metaheuristic approaches cannot guarantee to find the global optimum of a generalized geometric programming problem, this paper applies an efficient deterministic approach to globally solve speed reducer design problems. The original problem is converted by variable transformations and piecewise linearization techniques. The reformulated problem is a convex mixed-integer nonlinear programming problem solvable to reach an approximate global solution within an acceptable error. Experiment results from solving a practical speed reducer design problem indicate that this study obtains a better solution comparing with the other existing methods. © 2013 Ming-Hua Lin et al.