globalcompare.java

用java实现的改进粒子群算法

/**
 * Description: Global package for comparison.
 *
 * @ Author        Create/Modi     Note
 * Xiaofeng Xie    Jun 15, 2002    [e-mail]
 *
 * 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.
 *
 * @version 1.0
 * @Since MAOS1.0
 */


package Global;

import java.util.*;

public class GlobalCompare {

/* compare the data1 and data2, if data1=data2, return 0
 * if data1 < data2, return LESS_THAN, else if data1 > data2, LARGER_THAN
 **/
  static public int compare(double data1, double data2) {
    if (data1 < data2)
      return CompareValue.LESS_THAN;
    else if (data1 > data2)
      return CompareValue.LARGER_THAN;
    else
      return CompareValue.EQUAL_TO;
  }

/* check the magnitude of two array, the frontial is more important
 **/
  public static int compareArray(double[] fit1, double[] fit2) {
    if (fit1.length!=fit2.length) {
      return CompareValue.INVALID;  //error
    }
    for (int i=0; i<fit1.length; i++) {
      if (fit1[i]>fit2[i]) {
        return CompareValue.LARGER_THAN; //Large than
      } else if (fit1[i]<fit2[i]){
        return CompareValue.LESS_THAN; //Less than
      }
    }
    return CompareValue.EQUAL_TO; //same
  }
}