aliensearchspace.java

来自「用于求解TSP(Traveling salesman problem」· Java 代码 · 共 46 行

/**
 * Description: provide the information for the search space
 *
 * @ Author        Create/Modi     Note
 * Xiaofeng Xie    Apr 6, 2005
 * Xiaofeng Xie    Apr 28, 2006    MAOS-TSP Beta 1.1.002
 * Xiaofeng Xie    Aug 10, 2006
 */

package implement.common.represent;

import java.util.*;
import Global.methods.*;
import maosKernel.represent.space.*;

public class AlienSearchSpace extends AbsSearchSpace {
  private int nodeNumber = -1;

  public AlienSearchSpace(int nodeNumber) {
    this.nodeNumber = nodeNumber;
  }

  public int getNodeNumber() {
    return nodeNumber;
  }

  public SearchState getRandomState() {
    return new SearchState(RandomGenerator.randomDistinctSelection(getNodeNumber()));
  }

  public boolean isValid(SearchState point) {
    int[] tourArray = point.getIArray();
    if (tourArray == null) return false;
    if (tourArray.length!= this.getNodeNumber()) return false;
    int[] locs = (int[])tourArray.clone();
    Arrays.sort(locs);
    for (int i=0; i<this.getNodeNumber(); i++) {
      if(locs[i]!=i) {
        return false;
      }
    }
    return true;
  }
}