0
TECHNICAL PAPERS

A Hybrid Fuzzy Simplex Genetic Algorithm

[+] Author and Article Information
Mohamed B. Trabia

Department of Mechanical Engineering, University of Nevada, Las Vegas, NV 89154-4027

J. Mech. Des 126(6), 969-974 (Feb 14, 2005) (6 pages) doi:10.1115/1.1803852 History: Received January 07, 2003; Revised March 16, 2004; Online February 14, 2005
Copyright © 2004 by ASME
Your Session has timed out. Please sign back in to continue.

References

Spendley,  W., Hext,  G., and Himsworth,  F., 1962, “Sequential Application of Simplex Designs in Optimization and Evolutionary Operation,” Technometrics, 4, pp. 441–461.
Nelder,  J., and Mead,  R., 1965, “A Simplex Method for Function Minimization,” Comput. J., 7, pp. 308–313.
Rekalitis, V., Ravindaran, A., and Ragsdell, K. M., 1983, Engineering Optimization: Methods and Applications, Wiley-Interscience, New York.
Hedlund,  P., and Gustavsson,  A., 1999, “Design and Evaluation of an Effective Modified Simplex Method,” Anal. Chim. Acta, 391, pp. 257–267.
Trabia,  M., and Lu,  X., 2001, “A Fuzzy Adaptive Simplex Search Optimization Algorithm,” ASME J. Mech. Des., 123, pp. 216–225.
Gen, M., and Cheng, R., 1997, Genetic Algorithms & Engineering Design, Wiley Interscience, New York.
Ishibuchi,  H., Yamamoto,  N., Murata,  T., and Tanaka,  H., 1994, “Genetic Algorithms and Neighborhood Search Algorithms for Fuzzy Flowshop Problems,” Fuzzy Sets Syst., 67, pp. 81–100.
Renders,  J. and Flasse,  S., 1999, “Hybrid Methods Using Genetic Algorithms for Global Optimization,” IEEE Trans. Syst. Man Cybern., 26, pp. 243–258.
Sotiropoulos,  D., Stavropoulos,  E., and Vrahatis,  M., 1997, “A New Hybrid Genetic Algorithm for Global Optimization,” Nonlinear Anal. Theory, Methods Appl., 30, pp. 4529–4538.
Yen,  J., Liao,  J., and Randolph,  D., 1998, “A Hybrid Approach to Modeling Metabolic Systems Using a Genetic Algorithm and Simplex Method,” IEEE Trans. Syst. Man Cybern., 28, pp. 173–191.
Okamoto,  M., Nonaka,  T., Ochiai,  S., and Tominaga,  D., 1998, “Nonlinear Numerical Optimization with Use of a Hybrid Genetic Algorithm Incorporating the Modified Powell Method,” Appl. Math. Comput., 91, pp. 63–72.
Jwo,  W., Liu,  C., and Liu,  C., 1999, “Large-Scale Optimal VAR Planning by Hybrid Simulated Annealing/Genetic Algorithm,” Int. J. Electr. Power Energy Syst., 21, pp. 39–44.
Musil,  M., Wilmut,  M., and Chapman,  N., 1999, “A Hybrid Simplex Genetic Algorithm for Estimating Geoacoustic Parameters Using Matched-Field Inversion,” IEEE J. Ocean. Eng., 24, pp. 358–369.
Nassef, A. O., Hegazi, H. A., and Metwalli, S. M., 2000, “A Hybrid Genetic-Direct Search Algorithm for the Shape Optimization of Solid C-frame Cross-Sections,” Proceedings of the 26th Design Automation Conference.
Michalewicz, Z., 1994, Genetic Algorithms+Data Structure=Evolutionary Programs, Springer-Verlag, New York.
Haupt, R., and Haupt, S., 1998, Practical Genetic Algorithms, Wiley Interscience, New York.
Teng, C., and Angeles, J., 1999, “A Sequential Quadratic-Programming Algorithm Using Orthogonal Decomposition with Gerschgorin Stabilization,” Proceedings of the 1999 ASME Design Engineering Technical Conferences.
Lo, C., and Papalambros, P., 1990, “A Deterministic Global Design Optimization Method for Nonconvex Generalized Polynomial Problems,” Advances in Design Automation, ASME, New York, pp. 41–49.
Ostermark,  R., 1999, “Solving a Nonlinear Non-Convex Trim Loss Problem with a Genetic Hybrid Algorithm,” Computers & Operations Research, 26, pp. 623–635.

Figures

Grahic Jump Location
Typical performance for cost of compressed air storage minimization
Grahic Jump Location
Typical performance for cost of welded beam minimization
Grahic Jump Location
Typical performance for automotive screwdriver bit minimization
Grahic Jump Location
Typical performance for sine function no. 2 minimization
Grahic Jump Location
Typical performance for sine function no. 1 minimization
Grahic Jump Location
Typical performance for Ackley’s function minimization
Grahic Jump Location
Reflection of the highest point in the fuzzy simplex algorithm
Grahic Jump Location
Reflection of the highest point in the Nelder and Mead simplex algorithm

Tables

Errata

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In