Cooperative Genetic Multi-Objective Optimization Algorithm and Application

Abstract:

It is very difficult to find out the best solution for some complicated system problems frequently appear. These problems are mostly of multi-objective. The present solution, however, is short of communication. Based on CO, one of MDO method, this paper gives a new simple kind of multi-objective framework, which will be suitable to multi-subject problems. It can not only organize each disciplinary effectively, but gives the inter-influence between disciplinaries by fitness function as well. Meanwhile, the perfect NSGAⅡ is used as be the basic algorithm, prematurity can be avoided and Pareto front with good distribution is obtained. Micro machined accelerometer example validates the correctness of the framework.

• Periodical: Applied Mechanics and Materials (Volumes 220-223)
• Pages: 2814-2817
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.220-223.2814
• Online since: November 2012
• Authors: Li Gao, Dan Kong
• Keywords: Cooperative, Genetic Algorithm (GA), Multi-Objective Optimization (MOP)

References

[1] Liu Baoding, Zhao Ruiqiing, Wang gang. Uncertainty Programming and Application. Beijing: Tsinghua Press, pp.4-7, (2004).

[2] K. Deb. Mufti-objective genetic algorithms: Problem difficulties and construction of test Functions. Evolutionary Computation, 7(3), 205-230, (1999).

DOI: 10.1162/evco.1999.7.3.205

[3] Carlos C.H. Borges and Helio J.C. Barbosa. A Non-generational Genetic Algorithm for Multiobjective Optimization. In 2000 Congress on Evolutionary Computation, volume I, San Diego, California, pp.172-179, July, (2000).

DOI: 10.1109/cec.2000.870292

[4] Yu Biqiang, Weng Haishan, etc. Coupling design modeling of MEMS multi2physics region based on MDO. Mechanical Ddesign, vol.23, No.11, pp.10-12, (2006).