State of Art in Genetic Algorithms for Agricultural Systems
Sorana D. BOLBOACĂ, Lorentz JÄNTSCHI, Mugur C. BĂLAN and 2 more
Notulae Botanicae Horti Agrobotanici Cluj-Napoca · 2010
doi:10.15835/nbha3835455 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Genetic algorithms are built as abstract populations of a number of candidate solutions, each of it being evaluated for accomplish a desired performance. Populations evolve from one generation to another through mutation, crossover and selection in order to obtain an acceptable solution. Genetic algorithms applications cover the subject of decision, classification, optimization and simulation of hard problems. The quality of a genetic algorithm is evaluated in terms of speed, accuracy and domain of applicability. The use of all genetic operators could assure the convergence towards the optimum solution for a specific hard problem. The approaches used to construct the search space and the objective function (survival of the fittest, natural selection) assure the diversity of genetic algorithms. Studies on the development and use of genetic algorithms in solving hard problems in the field of agricultural systems were identified, analyzed and are presented here.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.