Genetic Algorithms: A New Approach to the Timetable Problem

1992 ◽  
pp. 235-239 ◽  
Author(s):  
Alberto Colorni ◽  
Marco Dorigo ◽  
Vittorio Maniezzo
AIAA Journal ◽  
1998 ◽  
Vol 36 ◽  
pp. 51-61 ◽  
Author(s):  
M. C. Sharatchandra ◽  
Mihir Sen ◽  
Mohamed Gad-el-Hak

2005 ◽  
Vol 22 (2) ◽  
pp. 128-135 ◽  
Author(s):  
Brendon J. Brewer ◽  
Geraint F. Lewis

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.


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.


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

2004 ◽  
Vol 13 (04) ◽  
pp. 791-800 ◽  
Author(s):  
HOLGER FRÖHLICH ◽  
OLIVIER CHAPELLE ◽  
BERNHARD SCHÖLKOPF

The problem of feature selection is a difficult combinatorial task in Machine Learning and of high practical relevance, e.g. in bioinformatics. Genetic Algorithms (GAs) offer a natural way to solve this problem. In this paper we present a special Genetic Algorithm, which especially takes into account the existing bounds on the generalization error for Support Vector Machines (SVMs). This new approach is compared to the traditional method of performing cross-validation and to other existing algorithms for feature selection.


Sign in / Sign up

Export Citation Format

Share Document