Free cookie consent management tool by TermsFeed Policy Generator

source: branches/PersistentDataStructures/HeuristicLab.Algorithms.ParameterlessPopulationPyramid/3.3/Population.cs @ 18242

Last change on this file since 18242 was 14186, checked in by swagner, 8 years ago

#2526: Updated year of copyrights in license headers

File size: 1.8 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
4 * and the BEACON Center for the Study of Evolution in Action.
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
23using System.Collections.Generic;
24using HeuristicLab.Core;
25using HeuristicLab.Encodings.BinaryVectorEncoding;
26
27namespace HeuristicLab.Algorithms.ParameterlessPopulationPyramid {
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
31  public class Population {
32    public List<BinaryVector> Solutions {
33      get;
34      private set;
35    }
36
37    public LinkageTree Tree {
38      get;
39      private set;
40    }
41
42    public Population(int length, IRandom rand) {
43      Solutions = new List<BinaryVector>();
44      Tree = new LinkageTree(length, rand);
45    }
46    public void Add(BinaryVector solution) {
47      Solutions.Add(solution);
48      Tree.Add(solution);
49    }
50  }
51}
Note: See TracBrowser for help on using the repository browser.