Automatic Synthesis of Dynamic Systems Based on Hungarian Algorithm and Genetic Programming

Abstract:

Article Preview

Genetic programming is an effective way to generate design candidates in an open-ended, but statistically structured, manner. A critical aspect of the procedure is a fitness measure, which guides candidate designs toward an optimal scheme in reasonable time. This paper has suggested a new definition of fitness base on Hungarian algorithm for automatically synthesizing designs for multi-domain, lumped parameter dynamic systems, and uses a type of embryo bond graph model with three modifiable sites to initialize population. Although the experiments run to date are not sufficient to allow making strong statistical assertions, it shows that the search capability of genetic programming combining Hungarian algorithm is good enough to make feasible automated design methodology proposed here for multi-domain systems.

Info:

Periodical:

Key Engineering Materials (Volumes 467-469)

Edited by:

Dehuai Zeng

Pages:

160-163

DOI:

10.4028/www.scientific.net/KEM.467-469.160

Citation:

G. C. Yang et al., "Automatic Synthesis of Dynamic Systems Based on Hungarian Algorithm and Genetic Programming", Key Engineering Materials, Vols. 467-469, pp. 160-163, 2011

Online since:

February 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.