The genetic algorithm is examined as a method for solving optimization problems in econometric estimation. It does not restrict either the form or regulalrity of the objective function, allows a reasonbly large parameter space, and does not rely on a point-to-point search. The performance is evaluated through two sets of experiments on standard test problems as well as econometric problems from the literature. First, alternative genetic algorithms are contrasted that vary over mutation and crossover rates, population sizes, and other features. Second, the genetic algorithm is compared to Nelder-Mead simplex, simulated annealing, adaptive random search, and MSCORE.
Download Info
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page
whether it is in fact available.
3. Perform a search for a similarly titled item that would be
available.
Volume (Year): 13 (1995) Issue (Month): 1 (January) Pages: 53-66 Download reference. The following formats are available: HTML
(with abstract),
plain text
(with abstract),
BibTeX,
RIS (EndNote, RefMan, ProCite),
ReDIF
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)