summaryrefslogtreecommitdiff
path: root/nlpsolver/ThirdParty/EvolutionarySolver/src/net/adaptivebox/space/DesignSpace.java
blob: 0b98752acb804cec2cf8b0fb1f135173b909bd70 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
/**
 * Description: provide the information for the search space (S)
 *
 * @ Author        Create/Modi     Note
 * Xiaofeng Xie    Mar 2, 2003
 * Xiaofeng Xie    May 11, 2004
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * Please acknowledge the author(s) if you use this code in any way.
 *
 * @References:
 * [1] Zhang W J, Xie X F, Bi D C. Handling boundary constraints for numerical
 * optimization by particle swarm flying in periodic search space. Congress
 * on Evolutionary Computation, Oregon, USA, 2004
 * @ especially for particle swarm agent
 */

package net.adaptivebox.space;
import net.adaptivebox.global.*;

public class DesignSpace {
  //The information of all the dimension
  private DesignDim[] dimProps;

  public DesignSpace(int dim) {
    dimProps = new DesignDim[dim];
  }



  public void setElemAt(DesignDim elem, int index) {
    dimProps[index] = elem;
  }

  public int getDimension() {
    if (dimProps==null) {
      return -1;
    }
    return dimProps.length;
  }

  public double boundAdjustAt(double val, int dim){
    return dimProps[dim].paramBound.boundAdjust(val);
  }

  private void annulusAdjust (double[] location){
    for (int i=0; i<getDimension(); i++) {
      location[i] = dimProps[i].paramBound.annulusAdjust(location[i]);
    }
  }





  public void mutationAt(double[] location, int i){
    location[i] = dimProps[i].paramBound.getRandomValue();
  }







  public double getMagnitudeIn(int dimensionIndex) {
    return dimProps[dimensionIndex].paramBound.getLength();
  }




  public void initializeGene(double[] tempX){
    for(int i=0;i<tempX.length;i++) tempX[i] =  dimProps[i].paramBound.getRandomValue(); //Global.RandomGenerator.doubleRangeRandom(9.8, 10);
  }

  public double[] getFreshGene() {
    double[] tempX = new double[this.getDimension()];
    initializeGene(tempX);
    return tempX;
  }
  public void getMappingPoint(double[] point) {
    for(int i=0; i<getDimension(); i++) {
      point[i] = dimProps[i].paramBound.annulusAdjust(point[i]);
      if(dimProps[i].isDiscrete()) {
        point[i] = dimProps[i].getGrainedValue(point[i]);
      }
    }
  }

}