Free cookie consent management tool by TermsFeed Policy Generator

source: branches/Parameter-less Population Pyramid/HeuristicLab.Algorithms.ParameterlessPopulationPyramid/3.3/Population.cs @ 11838

Last change on this file since 11838 was 11838, checked in by bgoldman, 9 years ago

#2282: Added BEACON to the copyright on P3 files and included comments referring to the publication

File size: 1.7 KB
RevLine 
[11663]1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2014 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
23using System.Collections.Generic;
24using HeuristicLab.Core;
25
26namespace HeuristicLab.Algorithms.ParameterlessPopulationPyramid {
[11838]27  // This code is based off the publication
28  // B. W. Goldman and W. F. Punch, "Parameter-less Population Pyramid," GECCO, pp. 785–792, 2014
29  // and the original source code in C++11 available from: https://github.com/brianwgoldman/Parameter-less_Population_Pyramid
[11663]30  public class Population {
[11669]31    public List<bool[]> Solutions {
32      get;
33      private set;
34    }
[11664]35
36    public LinkageTree Tree {
[11669]37      get;
38      private set;
[11664]39    }
40
[11663]41    public Population(int length, IRandom rand) {
[11669]42      Solutions = new List<bool[]>();
43      Tree = new LinkageTree(length, rand);
[11663]44    }
[11664]45    public void Add(bool[] solution) {
[11669]46      Solutions.Add(solution);
47      Tree.Add(solution);
[11663]48    }
49  }
50}
Note: See TracBrowser for help on using the repository browser.