Blade shape designing method, program thereof and...

Data processing: structural design – modeling – simulation – and em – Modeling by mathematical expression

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C703S006000, C703S007000, C706S015000, C706S026000

Reexamination Certificate

active

07047167

ABSTRACT:
An initial set of individuals having design parameters of a blade as a gene, is determined at random (S12). Next, an analysis using Navier-Stokes equations is performed. On the basis of the analysis result, ranking (evaluation) of respective individuals are performed using a pressure loss coefficient, a trailing edge deviation angle and the like as objective functions (S14). When a shape of a blade having a desirable performance is obtained, or when a predetermined number of generations is achieved, the analysis is terminated assuming that a termination condition has been met (S22). When the termination condition has not been met, processes about individual selection, crossing between individuals and mutation are performed so that generation is incremented by 1. The above processes are repeated, so that Pareto solutions can be obtained according to MOGA in consideration of a trade-off relationship between the objective functions.

REFERENCES:
patent: 5524341 (1996-06-01), Ferleger et al.
patent: 6022188 (2000-02-01), Bancalari
patent: 6062819 (2000-05-01), Zangeneh et al.
patent: 6139268 (2000-10-01), Murawski et al.
patent: 6315420 (2001-11-01), Standen et al.
patent: 6419187 (2002-07-01), Buter et al.
patent: 6527510 (2003-03-01), Olhofer et al.
patent: 6606612 (2003-08-01), Rai et al.
patent: 6638021 (2003-10-01), Olhofer et al.
patent: 6654710 (2003-11-01), Keller
patent: 2002/0099929 (2002-07-01), Jin et al.
patent: 2002/0138457 (2002-09-01), Jin et al.
patent: 2002/0177985 (2002-11-01), Kraft et al.
patent: 9325949 (1997-12-01), None
patent: 10149384 (1998-06-01), None
“An Updated Survey of GA-Based Multiobjective Optimization Techniques”, C.A. Coello, ACM Computing Surveys, vol. 32, No. 2, Jun. 2000.
“Aerodynamic and Aeroacoustic Optimization of Airfoils via a Parallel Genetic Algorithm”, B.R. Jones et al, AIAA 98-4811, 1998.
“Multiobjective Optimization with Messy Genetic Algorithms”, D.A. Van Veldhuizen et al, SAC 00', ACM 1-58113-239-5/00/003, ACM May 2000.
“Multidiciplinary Turbomachinery Blade Design Optimization”, R. Dornberger et al, AIAA-2000-0838, AIAA 2000.
“Multi-Objective Optimization of Turbomachinery Cascades for Minimum Loss, Maximum Loading, and Maximum Gap-to-Chord Ratio”, Dennis et al, 8thAIAA/NASA/USAF/ISSMO Symposium on MAO, AIAA 2000-4876, Sep. 2000.
“Multidiciplinary Optimization in Turbomachinery Design”, R. Dornberger et al, ECCOMAS 2000.
“Multiobjective Evolutionary Algorithm Test Suites”, D.A. Van Veldhuizen, ACM 1-58113-086-4/99/0001, ACM 1998.
Fonseca, Carlos M., et al., “Genetic Algorithms for Multiobjective Optimization: Formulation, Discussion and Generalization”, Proceedings of the Fifth International Conference on Genetic Algorithms, University of Illinois, Jul. 17-21, 1993, pp. 416-423.
Michalewicz, Zbigniew, “GAs: What are they?”, Genetric Algorithms+ Data Structures=Evolution Programs, Book excerpts at Chapters 1, 2; pp. 13-44.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Blade shape designing method, program thereof and... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Blade shape designing method, program thereof and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Blade shape designing method, program thereof and... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3539817

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.