[11663] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[14186] | 3 | * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[11838] | 4 | * and the BEACON Center for the Study of Evolution in Action.
|
---|
[11663] | 5 | *
|
---|
| 6 | * This file is part of HeuristicLab.
|
---|
| 7 | *
|
---|
| 8 | * HeuristicLab is free software: you can redistribute it and/or modify
|
---|
| 9 | * it under the terms of the GNU General Public License as published by
|
---|
| 10 | * the Free Software Foundation, either version 3 of the License, or
|
---|
| 11 | * (at your option) any later version.
|
---|
| 12 | *
|
---|
| 13 | * HeuristicLab is distributed in the hope that it will be useful,
|
---|
| 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
| 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
| 16 | * GNU General Public License for more details.
|
---|
| 17 | *
|
---|
| 18 | * You should have received a copy of the GNU General Public License
|
---|
| 19 | * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
|
---|
| 20 | */
|
---|
| 21 | #endregion
|
---|
| 22 |
|
---|
| 23 | using System.Collections.Generic;
|
---|
| 24 | using HeuristicLab.Core;
|
---|
[12005] | 25 | using HeuristicLab.Encodings.BinaryVectorEncoding;
|
---|
[11663] | 26 |
|
---|
| 27 | namespace HeuristicLab.Algorithms.ParameterlessPopulationPyramid {
|
---|
[11838] | 28 | // This code is based off the publication
|
---|
| 29 | // B. W. Goldman and W. F. Punch, "Parameter-less Population Pyramid," GECCO, pp. 785–792, 2014
|
---|
| 30 | // and the original source code in C++11 available from: https://github.com/brianwgoldman/Parameter-less_Population_Pyramid
|
---|
[11663] | 31 | public class Population {
|
---|
[12005] | 32 | public List<BinaryVector> Solutions {
|
---|
[11669] | 33 | get;
|
---|
| 34 | private set;
|
---|
| 35 | }
|
---|
[11664] | 36 |
|
---|
| 37 | public LinkageTree Tree {
|
---|
[11669] | 38 | get;
|
---|
| 39 | private set;
|
---|
[11664] | 40 | }
|
---|
| 41 |
|
---|
[11663] | 42 | public Population(int length, IRandom rand) {
|
---|
[12005] | 43 | Solutions = new List<BinaryVector>();
|
---|
[11669] | 44 | Tree = new LinkageTree(length, rand);
|
---|
[11663] | 45 | }
|
---|
[12005] | 46 | public void Add(BinaryVector solution) {
|
---|
[11669] | 47 | Solutions.Add(solution);
|
---|
| 48 | Tree.Add(solution);
|
---|
[11663] | 49 | }
|
---|
| 50 | }
|
---|
| 51 | }
|
---|