The GABi genetic algorithm employs an 'island' model, in which distinct subpopulations are allowed to evolve in isolation of each other. In order to avoid total isolation, subpopulations may periodically exchange a solution with each other.

1 | ```
exchangeSols(demes,fitnesses,fittestonly,proximity)
``` |

`demes` |
List of numeric arrays, each one a distinct subpopulation of GA solutions. |

`fitnesses` |
List of numeric vectors, each one indicating the fitness of the corresponding solution (row) of the corresponding array in |

`fittestonly` |
Boolean indicating whether or not only the fittest solution from each subpopulation is exchanged. |

`proximity` |
Boolean indicating whether or not the solution exchange can only occur between 'adjacent' subpopulations (i.e. consecutive elements of the list |

In the solution exchange process, a predetermined number of randomly selected solutions from each subpopulation (i.e. rows from each numeric array) are swapped with solutions from another subpopulation. See Whitley 1995 for more details on the Island Model of GA populations.

List of numeric arrays, as input `demes`

but with some solutions having been exchanged between the subpopulations.

Ed Curry e.curry@imperial.ac.uk

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.