A Hybrid Multi-objective Evolutionary Algorithm and Its Application in Component-based Product Design

Component-based product design usually appears as a multi-objective optimization problem (MOP). Traditional methods solving MOPs are robust and have proven their effectiveness in handling many classes of optimization problems. However, such techniques can encounter difficulties such as getting trapped in local minima, increasing computational complexity, and not being applicable to certain classes of objective functions. Multi-Objective Evolutionary Algorithms (MOEAs) can overcome these disadvantages and have shown great potentials to solve MOPs. In this paper, an h-MOEA is proposed by employing effective strategies from evolutionary computation, which is suitable for solving the MOP in design optimization and can generate more diverse solutions in an accepted time span. Then, the effectiveness and correctness of h-MOEA is verified using several popular benchmark functions. Also, a prototype is developed and used in component-based product design optimization. Finally, the optimization results of a product design case are shown in detail.

[1]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[2]  Ehud D. Karnin,et al.  On secret sharing systems , 1983, IEEE Trans. Inf. Theory.

[3]  Jonathan Cagan,et al.  Formal Engineering Design Synthesis , 2005 .

[4]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[5]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[6]  Ed Dawson,et al.  Multistage secret sharing based on one-way function , 1994 .

[7]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[8]  R. J. McEliece,et al.  On sharing secrets and Reed-Solomon codes , 1981, CACM.

[9]  L. Harn.  Efficient sharing (broadcasting) of multiple secrets , 1995 .

[10]  Enrique Alba,et al.  New Ideas in Applying Scatter Search to Multiobjective Optimization , 2005, EMO.

[11]  Moti Yung,et al.  Optimal-resilience proactive public-key cryptosystems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[12]  Dieter Gollmann,et al.  Secret Sharing with Reusable Polynomials , 1997, ACISP.

[13]  R.-J. Hwang,et al.  Efficient cheater identification method for threshold schemes , 1997 .

[14]  Carlos A. Coello Coello,et al.  Evolutionary multi-objective optimization: a historical view of the field , 2006, IEEE Comput. Intell. Mag..

[15]  Lothar Thiele,et al.  Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study , 1998, PPSN.

[16]  Sihan Qing,et al.  Analysis and Improvement of a Multisecret Sharing Authenticating Scheme , 2006 .

[17]  Gary B. Lamont,et al.  Multiobjective evolutionary algorithms: classifications, analyses, and new innovations , 1999 .

[18]  Marco Laumanns,et al.  A unified model for multi-objective evolutionary algorithms with elitism , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[19]  P. J. Fleming,et al.  The good of the many outweighs the good of the one: evolutionary multi-objective optimization , 2003 .

[20]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[21]  J. He,et al.  Multisecret-sharing scheme based on one-way function , 1995 .

[22]  Tong Heng Lee,et al.  A Study on Distribution Preservation Mechanism in Evolutionary Multi-Objective Optimization , 2005, Artificial Intelligence Review.

[23]  Shi Rong.  A Multisecret Sharing Authenticating Scheme , 2003 .