Optimal Design of a Speed Reducer

The mathematical model for optimal design of a speed reducer is a generalized geometric programming problem that is non-convex and not easy be globally solved. This paper applies a deterministic approach including convexification strategies and piecewise linearization techniques to globally solve speed reducer design problems. A practical speed reducer design problem is solved to demonstrate that this study obtains a better solution than other methods.

[1]  Luca Maria Gambardella,et al.  A survey on metaheuristics for stochastic combinatorial optimization , 2009, Natural Computing.

[2]  Christodoulos A. Floudas,et al.  Finding all solutions of nonlinearly constrained systems of equations , 1995, J. Glob. Optim..

[3]  Carlos A. Coello Coello,et al.  Solving Engineering Optimization Problems with the Simple Constrained Particle Swarm Optimizer , 2008, Informatica.

[4]  Jung-Fa Tsai,et al.  Solving Engineering Optimization Problems by a Deterministic Global Optimization Approach , 2012 .

[5]  Kaj-Mikael Björk,et al.  Global solution of optimization problems with signomial parts , 2008, Discret. Optim..

[6]  Tapio Westerlund.  Some Transformation Techniques in Global Optimization , 2006 .

[7]  Carlos A. Coello Coello,et al.  Solving constrained optimization problems with a hybrid particle swarm optimization algorithm , 2011 .

[8]  Li Chen,et al.  TAGUCHI-AIDED SEARCH METHOD FOR DESIGN OPTIMIZATION OF ENGINEERING SYSTEMS , 1998 .

[9]  Tapabrata Ray,et al.  A socio-behavioural simulation model for engineering design optimization , 2002 .

[10]  Costas D. Maranas,et al.  Global Optimization in Generalized Geometric Programming , 1997, Encyclopedia of Optimization.

[11]  George L. Nemhauser,et al.  Modeling disjunctive constraints with a logarithmic number of binary variables and constraints , 2008, Math. Program..

[12]  Jacobus E. Rooda,et al.  An augmented Lagrangian decomposition method for quasi-separable problems in MDO , 2006 .

[13]  Shen Lu,et al.  A Regularized Inexact Penalty Decomposition Algorithm for Multidisciplinary Design Optimization Problems With Complementarity Constraints , 2010 .

[14]  Singiresu S Rao,et al.  A Hybrid Genetic Algorithm for Mixed-Discrete Design Optimization , 2005 .

[15]  Jung-Fa Tsai,et al.  An Efficient Global Approach for Posynomial Geometric Programming Problems , 2011, INFORMS J. Comput..

[16]  K. Lee,et al.  A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice , 2005 .

[17]  Michel Gendreau,et al.  Handbook of Metaheuristics , 2010 .

[18]  Joakim Westerlund,et al.  Some transformation techniques with applications in global optimization , 2009, J. Glob. Optim..

[19]  M. Jaberipour,et al.  Two improved harmony search algorithms for solving engineering optimization problems , 2010 .

[20]  T. Westerlund,et al.  Convexification of different classes of non-convex MINLP problems , 1999 .

[21]  Shen Lu,et al.  A Regularized Inexact Penalty Decomposition Algorithm for Multidisciplinary Design Optimization Problem With Complementarity Constraints , 2009, DAC 2009.