Abstract
The experimental results from Chapter 5 have confirmed two important assumptions. First, when using recombination best results were obtained with a relatively low limit to segment length. Second, segment recombination has not been found to be more powerful than segment mutation. Both aspects motivate the use of mutations that affect one instruction only. The following considerations try to point out why linear programs in particular are likely to be served better by using only minimal mutation operations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2007 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
(2007). Linear Genetic Operators II — Instruction Mutations. In: Linear Genetic Programming. Genetic and Evolutionary Computation. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-31030-5_6
Download citation
DOI: https://doi.org/10.1007/978-0-387-31030-5_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-31029-9
Online ISBN: 978-0-387-31030-5
eBook Packages: Computer ScienceComputer Science (R0)