Mathematics – Logic
Scientific paper
Dec 1993
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1993aas...183.4807l&link_type=abstract
American Astronomical Society, 183rd AAS Meeting, #48.07; Bulletin of the American Astronomical Society, Vol. 25, p.1366
Mathematics
Logic
Scientific paper
We discuss the general problem of finding multiple planets around pulsars through analysis of pulsar timing data. Fitting a full Keplerian orbit requires a search through four non-linear parameters for each planet. This problem is especially difficult when there is a large range of planetary masses and orbital periods. As one means for attacking the search problem, we have considered genetic algorithms, which are a general method for optimization that make use of biological-like genetic concepts like ``survival of the fittest,'' mutation, and chromosome exchange. Through these means, the algorithm searches parameter space in the same way that life finds optimal niches in the biological environment: through incremental rewarding of successful genetic variations. We show examples of the genetic algorithm as applied to simulated pulsar data and we compare its performance with alternative methods such as grid searches, nonlinear least squares fitting, the simplex method, hill-climbing, and simulated annealing. We also show preliminary application to real pulsar data.
Cordes James M.
Lazio Joseph T. W.
Novak Jurica
No associations
LandOfFree
The Genetic Algorithm: Searching for Planets around Pulsars does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Genetic Algorithm: Searching for Planets around Pulsars, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Genetic Algorithm: Searching for Planets around Pulsars will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-778900