Abstract

Models such as the Cornell Net Carbohydrate and Protein System include many non-linear functions. As such, non-linear optimization techniques that converge quickly and efficiently for field application are required. The objective of this paper is to introduce a genetic algorithm for optimization within the CNCPS ver. 6.1 framework. Genetic algorithms are generally categorized as global search heuristics. The genetic algorithm initially seeds the optimization with binary (0,1) representations of potential solutions (chromosomes). It then introduces crossover and mutation rates (set by the user) that automatically force changes in the chromosome combinations by changing the binary coding. Each solution is evaluated against fitness tests (e.g. nutrient and feed constraints). Two types of nutrient constraints have been utilized: soft and hard. A hard constraint forces the solution to be within set ranges. Soft constraints are set to be either equal, or within the range of the hard constraints. As solutions are evaluated, they are compared with soft constraints first. If a solution falls between a soft and hard constraint, a penalty function is applied. Solutions not meeting hard constraints are removed from the solution set. The penalty adds a ‘cost’ to the solution. If the resulting ‘cost’ adjusted solution is favorable over other solutions, it is kept within the solution set. This allows for solutions to be evaluated that may be nutritionally acceptable but slightly less then desirable. As an example, given variation in parameter measurements and model variation, it is nearly impossible to say that a 20.9% peNDF solution is different then a 21% peNDF solution; however, the cost of such a solution may be 1–10% different. Genetic algorithms also allow multiple objective functions. In this implementation, least cost or maximum income over feed costs were selected. Evaluations have shown that marginal incomes can be increased 5–10% by simply changing the objective function.Keywordsnonlinearobjective functionmodels

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.