Research Papers

An Evolutionary Algorithm Based Approach to Design Optimization Using Evidence Theory

[+] Author and Article Information
Rupesh Kumar Srivastava

Graduate Student
Dalle Molle Institute for AI (IDSIA),
CH-6928, Manno-Lugano, Switzerland
e-mail: rupesh@idsia.ch

Kalyanmoy Deb

Koenig Endowed Chair Professor
Department of Electrical and Computer Engineering,
Professor, Department of Mechanical Engineering,
Michigan State University,
East Lansing, MI 48824;
Professor, Department of Computer Science and Engineering,
Michigan State University,
East Lansing, MI 48824
e-mail: kdeb@egr.msu.edu

Rupesh Tulshyan

Research Associate
Kanpur Genetic Algorithms Laboratory,
Indian Institute of Technology
Kanpur, 208016 Uttar Pradesh, India
e-mail: tulshyan@iitk.ac.in

Contributed by the Design Automation Committee of ASME for publication in the JOURNAL OF MECHANICAL DESIGN. Manuscript received May 14, 2011; final manuscript received February 23, 2013; published online June 10, 2013. Assoc. Editor: Zissimos P. Mourelatos.

J. Mech. Des 135(8), 081003 (Jun 10, 2013) (12 pages) Paper No: MD-11-1233; doi: 10.1115/1.4024223 History: Received May 14, 2011; Revised February 23, 2013

For problems involving uncertainties in design variables and parameters, a bi-objective evolutionary algorithm (EA) based approach to design optimization using evidence theory is proposed and implemented in this paper. In addition to a functional objective, a plausibility measure of failure of constraint satisfaction is minimized. Despite some interests in classical optimization literature, this is the first attempt to use evidence theory with an EA. Due to EA's flexibility in modifying its operators, nonrequirement of any gradient, its ability to handle multiple conflicting objectives, and ease of parallelization, evidence-based design optimization using an EA is promising. Results on a test problem and two engineering design problems show that the modified evolutionary multi-objective optimization algorithm is capable of finding a widely distributed trade-off frontier showing different optimal solutions corresponding to different levels of plausibility failure limits. Furthermore, a single-objective evidence-based EA is found to produce better optimal solutions than a previously reported classical optimization algorithm. Furthermore, the use of a graphical processing unit (GPU) based parallel computing platform demonstrates EA's performance enhancement around 160–700 times in implementing plausibility computations. Handling uncertainties of different types are getting increasingly popular in applied optimization studies and this EA based study is promising to be applied in real-world design optimization problems.

Copyright © 2013 by ASME
Your Session has timed out. Please sign back in to continue.


Cruse, T. R., 1997, Reliability-Based Mechanical Design, Marcel Dekker, New York.
Deb, K., Gupta, S., Daum, D., Branke, J., Mall, A., and Padmanabhan, D., 2009, “Reliability-Based Optimization Using Evolutionary Algorithms,” IEEE Trans. Evol. Comput., 13(5), pp. 1054–1074. [CrossRef]
Du, X., and Chen, W., 2004, “Sequential Optimization and Reliability Assessment Method for Efficient Probabilistic Design,” ASME J. Mech. Des., 126(2), pp. 225–233. [CrossRef]
Ditlevsen, O., and Bjerager, P., 1989, “Plastic Reliability Analysis by Directional Simulation,” ASCE J. Eng. Mech., 115(6), pp. 1347–1362. [CrossRef]
Gu, L., and Yang, R., 2006, “On Reliability-Based Optimisation Methods for Automotive Structures,” Int. J. Mater. Prod. Technol., 25(1/2/3), pp. 3–26.
Salazar, D. E., and Rocco, C. M., 2007, “Solving Advanced Multi-Objective Robust Designs by Means of Multiple Objective Evolutionary Algorithms (MOEA): A Reliability Application,” Reliab. Eng. Syst. Saf., 92(6), pp. 697–706. [CrossRef]
Daum, D., Deb, K., and Branke, J., 2007, “Reliability-Based Optimization for Multiple Constraint With Evolutionary Algorithms,” Congress on Evolutionary Computation, IEEE, pp. 911–918.
Gunawan, S., and Papalambros, P. Y., 2006, “A Bayesian Approach to Reliability-Based Optimization With Incomplete Information,” ASME J. Mech. Des., 128, pp. 909–918.
Li, M., Gabriel, S. A., Shim, Y., and Azarm, S., 2011, “Interval Uncertainty-Based Robust Optimization for Convex and Non-Convex Quadratic Programs With Applications in Network Infrastructure Planning,” Netw. Spatial Econ., 11(1), pp. 159–191. [CrossRef]
Soyster, A. L., 1973, “Convex Programming With Set-Inclusive Constraints and Applications to Inexact Linear Programming,” Oper. Res., pp. 1154–1157. [CrossRef]
Majumder, L., and Rao, S. S., 2009, “Interval-Basedoptimization of Aircraft Wings Under Landing Loads,” Comput. Struct., 87(3–4), pp. 225–235. [CrossRef]
Du, X., 2012, “Reliability-Based Design Optimization With Dependent Interval Variables,” Int. J. Numer. Methods Eng., 91, pp. 218–228. [CrossRef]
Mourelatos, Z. P., and Zhou, J., 2006, “A Design Optimization Method Using Evidence Theory,” ASME J. Mech. Des., 128, pp. 901–908. [CrossRef]
Rao, S. S., 2008, “Evidence-Based Fuzzy Approach for the Safety Analysis of Uncertain Systems,” AIAA J., 46, pp. 2383–2387. [CrossRef]
Srivastava, R., and Deb, K., 2011, “An EA-Based Approach to Design Optimization Using Evidence Theory,” Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, ACM, pp. 1139–1146.
Srivastava, R., and Deb, K., 2010, “Bayesian Reliability Analysis Under Incomplete Information Using Evolutionary Algorithms,” Simulated Evolution and Learning, Vol. 6457 of Lecture Notes in Computer Science, Springer, Berlin/Heidelberg, pp. 435–444.
Srivastava, R., and Deb, K., 2012, “An Evolutionary Based Bayesian Design Optimization Approach Under Incomplete Information,” Eng. Optim., 45, pp. 141–165. [CrossRef]
Beyer, H.-G., and Sendhoff, B., 2007, “Robust Optimization—A Comprehensive Survey,” Comput. Methods Appl. Mech. Eng., 196(33–34), pp. 3190–3218. [CrossRef]
Jin, Y., and Sendhoff, B., 2003, “Trade-Off Between Performance and Robustness: An Evolutionary Multiobjective Approach,” Evolutionary Multi-Criterion Optimization, Springer, Paper No. LNCS 2632, pp. 237–251.
Gaspar-Cunha, A., and Covas, J. A., 2008, “Robustness in Multi-Objective Optimization Using Evolutionary Algorithms,” Comput. Optim. Appl., 39, pp. 75–96. [CrossRef]
Lagaros, N., Plevris, V., and Papadrakakis, M., 2005, “Multi-Objective Design Optimization Using Cascade Evolutionary Computation,” Comput. Methods Appl. Mech. Eng., 194, pp. 3496–3515. [CrossRef]
Zhang, J., Wiecek, M., and Chen, W., 2000, “Local Approximation of the Efficient Frontier in Robust Design,” ASME J. Mech. Des., 122(2), pp. 232–236. [CrossRef]
Ben-Tal, A., and Nemirovski, A., 2002, “Robust Optimization—Methodology and Applications,” Math. Program., 92, pp. 453–480. [CrossRef]
Bertsimas, D., and Sim, M., 2004, “The Price of Robustness,” Oper. Res., 52, pp. 35–53. [CrossRef]
Lucas, C., and Araabi, B. N., 1999, “Generalization of the Dempster-Shafer Theory: A Fuzzy-Valued Measure,” IEEE Trans. Fuzzy Syst., 7, pp. 255–270. [CrossRef]
Dempster, P., 1967, “Upper and Lower Probabilities Induced by a Multi-Valued Mapping,” Ann. Math. Stat., 38(2), pp. 325–339. [CrossRef]
Shafer, G., 1976, A Mathematical Theory of Evidence, Princeton University Press, Princeton, NJ.
Mourelatos, Z. P., and Zhou, J., 2006, “A Design Optimization Method Using Evidence Theory,” ASME J. Mech. Des., 128(4), pp. 901–908. [CrossRef]
Dellnitz, M., Schütze, O., and Sertl, S., 2002, “Finding Zeros by Multilevel Subdivision Techniques,” IMA J. Numer. Anal., 22(2), pp. 167–185. [CrossRef]
Ye, K. Q., Li, W., and Sudjianto, A., 2000, “Algorithmic Construction of Optimal Symmetric Latin Hypercube Designs,” J. Stat. Plan. Infer., 90, pp. 145–159. [CrossRef]
Byrd, R. H., Nocedal, J., and Waltz, R. A., 2006, “Knitro: An Integrated Package for Nonlinear Optimization,” Large Scale Nonlinear Optimization, Springer-Verlag, New York, pp. 35–59.
Zou, T., Mourelatos, Z. P., Mahadevan, S., and Tu, J., 2008, “An Indicator Response Surface Method for Simulation-Based Reliability Analysis,” ASME J. Mech. Des., 130(7), p. 071401. [CrossRef]
Deb, K., Pratap, A., Agarwal, S., and Meyarivan, T., 2002, “A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II,” IEEE Trans. Evol. Comput., 6(2), pp. 182–197. [CrossRef]
Deb, K., 2001, Multi-Objective Optimization Using Evolutionary Algorithms, Wiley, Chichester, UK.
Deb, K., and Agrawal, R. B., 1995, “Simulated Binary Crossover for Continuous Search Space,” Complex Syst., 9(2), pp. 115–148.
Keeney, R. L., and Raiffa, H., 1976, Decisions With Multiple Objectives: Preferences and Value Tradeoffs, Wiley, New York.
Deb, K., and Gupta, S., 2011, “Understanding Knee Points in Bicriteria Problems and Their Implications as Preferred Solution Principles,” Eng. Optim., 43(11), pp. 1175–1204. [CrossRef]
Wu, Y. T., Shin, Y., Sues, R., and Cesare, M., 2001, “Safety-Factor Based Approach for Probabilistic-Based Design Optimization,” 42nd AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics and Materials Conference, Paper No. AIAA-2001-1522.
Liang, J., Mourelatos, Z. P., and Tu, J., 2008, “A Single-Loop Method for Reliability-Based Design Optimization,” Int. J. Prod. Dev., 5, pp. 76–92. [CrossRef]
Lewis, K., and Mistree, F., 1998, “Collaborative, Sequential, and Isolated Decisions in Design,” ASME J. Mech. Des., 120(4), pp. 643–652. [CrossRef]
Cantú-Paz, E., 1998, “A Survey of Parallel Genetic Algorithms,” Calculateurs Paralleles Reseaux Et Systems Repartis, 10, pp. 141–171.
NVIDIA, 2008, Nvidia Compute Unified Device Architecture C Programming Guide 3.2, http://developer.nvidia.com/cuda-toolkit-32-downloads
Zitzler, E., and Thiele, L., 1999, “Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach,” IEEE Trans. Evol. Comput., 3(4), pp. 257–271. [CrossRef]


Grahic Jump Location
Fig. 1

Various methods of handling incomplete information in RBDO

Grahic Jump Location
Fig. 3

Results obtained for the two-variable test problem

Grahic Jump Location
Fig. 6

Obtained trade-off front for the cantilever design problem

Grahic Jump Location
Fig. 7

Obtained trade-off front for the pressure vessel design problem

Grahic Jump Location
Fig. 4

Results obtained for the modified two-variable test problem

Grahic Jump Location
Fig. 8

Effect of varying number of threads per block (tcount) for the cantilever problem run for 30 generations

Grahic Jump Location
Fig. 5

A mirrored S shaped Pareto-optimal front and likely preferred point (A) and set (BC) are illustrated. The point B is obtained by drawing a tangent line from A on to the Pareto-optimal front.



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