New Approach to Constrained Shape Optimization Using Genetic Algorithms

AIAA Journal ◽  
10.2514/2.351 ◽  
1998 ◽  
Vol 36 (1) ◽  
pp. 51-61 ◽  
Author(s):  
M. C. Sharatchandra ◽  
Mihir Sen ◽  
Mohamed Gad-El-Hak
Keyword(s):  
Genetic Algorithms ◽  
Shape Optimization ◽  
New Approach

New approach to constrained shape optimization using genetic algorithms

AIAA Journal ◽  
1998 ◽  
Vol 36 ◽  
pp. 51-61 ◽  
Author(s):  
M. C. Sharatchandra ◽  
Mihir Sen ◽  
Mohamed Gad-el-Hak
Keyword(s):  
Genetic Algorithms ◽  
Shape Optimization ◽  
New Approach

scholarly journals When Darwin Met Einstein: Gravitational Lens Inversion with Genetic Algorithms

2005 ◽  
Vol 22 (2) ◽  
pp. 128-135 ◽  
Author(s):  
Brendon J. Brewer ◽  
Geraint F. Lewis
Keyword(s):  
Genetic Algorithms ◽  
Gravitational Lensing ◽  
Surface Brightness ◽  
Initial Study ◽  
Brightness Distribution ◽  
Gravitational Lens ◽  
Atmospheric Effects ◽  
Lens Model ◽  
New Approach ◽  
Genetic Algorithm Approach

AbstractGravitational lensing can magnify a distant source, revealing structural detail which is normally unresolvable. Recovering this detail through an inversion of the influence of gravitational lensing, however, requires optimisation of not only lens parameters, but also of the surface brightness distribution of the source. This paper outlines a new approach to this inversion, utilising genetic algorithms to reconstruct the source profile. In this initial study, the effects of image degradation due to instrumental and atmospheric effects are neglected and it is assumed that the lens model is accurately known, but the genetic algorithm approach can be incorporated into more general optimisation techniques, allowing the optimisation of both the parameters for a lensing model and the surface brightness of the source.

scholarly journals Shape optimization of magnetic devices using genetic algorithms with dynamically adjustable parameters

1999 ◽  
Vol 35 (3) ◽  
pp. 1686-1689 ◽  
Author(s):  
Y. Yokose ◽  
V. Cingoski ◽  
K. Kaneda ◽  
H. Yamashita
Keyword(s):  
Genetic Algorithms ◽  
Shape Optimization ◽  
Magnetic Devices

Variable-Topology Shape Optimization With a Control on Perimeter

1994 ◽  
Author(s):  
Robert B. Haber ◽  
Chandrashekhar S. Jog ◽  
Martin P. Bendsøe
Keyword(s):  
Shape Optimization ◽  
Solution Space ◽  
New Method ◽  
Optimal Designs ◽  
Shape Design ◽  
Grid Refinement ◽  
New Approach ◽  
Complete Relaxation ◽  
Variable Topology ◽  
Well Posed

Abstract This paper describes a new method for variable-topology shape optimization. The method addresses certain problems that arise in relaxed formulations (i.e., homogenization design methods). For example, a complete relaxation generates optimal designs containing material with perforated microstructures that may be difficult or expensive to manufacture. Formulations that penalize perforated material, either explicitly or through a partial relaxation, can generate manufacturable designs. However, the same illposedness that motivates relaxed formulations reappears as the penalty against perforated material is strengthened. The practical consequence is that numerical implementations of the penalized formulations fail to converge with grid refinement. The new approach uses a control on the design perimeter to effectively exclude chattering designs (which have an infinite perimeter) from the feasible solution space. This achieves a well-posed shape design problem without the introduction of microstructure. Numerical examples demonstrate that manufacturable designs can be obtained in a single, automatic operation. Grid refinement improves geometric resolution without altering the design topology. The new method also provides a means to control the number and the length scale of holes in the optimal design.

Genetic Algorithms: A New Approach to the Timetable Problem

1992 ◽  
pp. 235-239 ◽  
Author(s):  
Alberto Colorni ◽  
Marco Dorigo ◽  
Vittorio Maniezzo
Keyword(s):  
Genetic Algorithms ◽  
New Approach ◽  
Timetable Problem

Optical Satellite Multiobjective Genetic Algorithms for Investigation of MH370 Debris

2020 ◽  
pp. 166-207
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Cloud Cover ◽  
Optical Remote Sensing ◽  
New Approach ◽  
Precise Method ◽  
Spectral Signatures ◽  
Remote Sensing Technique ◽  
Multiobjective Genetic Algorithms ◽  
Strength Constraints

At present, there is no precise method that can inform where the lost flight MH370 is. This chapter proposes a new approach to search for the missing flight MH370. To this end, multiobjective genetic algorithms are implemented. In this regard, a genetic algorithm is taken into consideration to optimize the MH370 debris that is notably based on the geometrical shapes and spectral signatures. Currently, there may be three limitations to optical remote sensing technique: (1) strength constraints of the spacecraft permit about two hours of scanning consistently within the day, (2) cloud cover prevents unique observations, and (3) moderate information from close to the ocean surface is sensed through the scanner. Needless to say that the objects that are spotted by different satellite data do not scientifically belong to the MH370 debris and could be just man-made without accurate identifications.

Sign in / Sign up

Export Citation Format

Share Document