Paper Titles

The Application of Lightweight Visualization Tool-Product View to Aircraft Development
p.307

Study on Numerical Simulation Method of Aerodynamic Performance of High-Speed Train on Bridge
p.312

Aerodynamic Heating Numerical Simulation of Terminal-Sensitive Projectile at Deceleration and Despinning Trajectory
p.317

Modeling the CAD-CAE Collaborative Process Using Colored Petri Nets
p.323

Optimal Design of a Speed Reducer
p.327

Evaluation of Gun Support Structure Using Equivalent Dynamic Approach in Non Linear FEA
p.331

PV Array Mathematical Model Optimization Based on Monitoring Data
p.336

Aerodynamic Simulation of Road Vehicle in Steady Crosswind
p.341

2D Unstructured Mesh Finite Volume Method for Simulating Structural Dynamics
p.345

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 376Optimal Design of a Speed Reducer

Optimal Design of a Speed Reducer

Article Preview

Abstract:

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.

You might also be interested in these eBooks

Materials and Diverse Technologies in Industry and Manufacture

Info:

Periodical:

Applied Mechanics and Materials (Volume 376)

Pages:

327-330

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.376.327

Citation:

Cite this paper

Online since:

August 2013

Authors:

Ming Hua Lin, Jung Fa Tsai

Keywords:

Deterministic Techniques, Optimal Design, Speed Reducer

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] K.S. Lee, Z.W. Geem, A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice, Comput. Methods Appl. Mech. Engrg. 194 (2005) 3902-3933.

DOI: 10.1016/j.cma.2004.09.007

[2] M. Jaberipour, E. Khorram, Two improved harmony search algorithms for solving engineering optimization problems, Commun. Nonlinear Sci. Numer. Simul. 15 (2010) 3316-3331.

DOI: 10.1016/j.cnsns.2010.01.009

[3] F.W. Glover, G.A. Kochenberger, Handbook of metaheuristics, Springer, New York, USA, (2003).

[4] L. Bianchi, M. Dorigo, L.M. Gambardella, W.J. Gutjahr, A survey on metaheuristics for stochastic combinatorial optimization, Nat. Comput. 8 (2009) 239-287.

DOI: 10.1007/s11047-008-9098-4

[5] J.K. Kuang, S.S. Rao, L. Chen, Taguchi-aided search method for design optimization of engineering system, Engrg. Optim. 30 (1998) 1-23.

[6] S. Akhtar, K. Tai, T. Ray, A socio-behavioural simulation model for engineering design optimization, Engrg. Optim. 34 (2002) 341-354.

DOI: 10.1080/03052150212723

[7] S.S. Rao, Y. Xiong, A Hybrid Genetic algorithm for mixed-discrete design optimization, J. Mech. Design 127 (2005) 1100-1112.

DOI: 10.1115/1.1876436

[8] L.C. Cagnina, S.C. Esquivel, C.A. Coello Coello, Solving engineering optimization problems with the simple constrained particle swarm optimizer, Inform. 32 (2008) 319-326.

DOI: 10.1080/0305215x.2010.522707

[9] S. Tosserams, L. F. P. Etman, J. E. Rooda, An augmented Lagrangian decomposition method for quasi-separable problems in MDO, Struct. Multidiscip. Optim. 34 (2007) 211-227.

DOI: 10.1007/s00158-006-0077-z

[10] S. Lu, H.M. Kim, A regularized inexact penalty decomposition algorithm formultidisciplinary design optimization problem with complementarity constraints, Transactions of ASME: J. Mech. Design 132 (2010), http: /dx. doi. org/10. 1115/1. 4001206.

DOI: 10.1115/1.4001206

[11] R. Pörn, I. Harjunkoski, T. Westerlund, Convexification of different classes of non-convex MINLP problems, Comput. Chemical Engrg. 23 (1999) 439-448.

DOI: 10.1016/s0098-1354(98)00305-6

[12] C.D. Maranas, C.A. Floudas, Global optimization in generalized geometric programming, Comput. Chemical Engrg. 21 (1997) 351-369.

DOI: 10.1016/s0098-1354(96)00282-7

[13] A. Lundell, J. Westerlund, T. Westerlund, Some transformation techniques with applications in global optimization, J. Global Optim. 43 (2009) 391-405.

DOI: 10.1007/s10898-007-9223-4

[14] J.F. Tsai, M.H. Lin, An efficient global approach for posynomial geometric programming problems, INFORMS J. Comput. 23 (2011) 483-492.

DOI: 10.1287/ijoc.1100.0403

[15] M.H. Lin, J.F. Tsai, P.C. Wang, Solving engineering optimization problems by a deterministic global approach, Appl. Math. Info. Sci. 6-3S (2012) 1101-1107.

[16] C.D. Maranas, C.A. Floudas, Finding all solutions of nonlinearly constrained systems of equations, J. Global Optim. 7 (1995) 143-182.

DOI: 10.1007/bf01097059

[17] R. Pörn, K.M. Bjork, T. Westerlund, Global solution of optimization problems with signomial parts, Discret. Optim. 5 (2008) 108-120.

DOI: 10.1016/j.disopt.2007.11.005

[18] T. Westerlund, Some transformation techniques in global optimization, in: L. Liberti, N. Maculan (Eds. ), Global Optimization, from Theory to Implementations, Springer, New York, USA, 2007, pp.45-74.

DOI: 10.1007/0-387-30528-9_3

[19] J.P. Vielma, G. Nemhauser, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, Math. Prog. 128 (2011) 49-72.

DOI: 10.1007/s10107-009-0295-4

[20] LINGO, Release. 11. 0. 2008. Lindo System Inc., Chicago.