vnsmutator.java

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

/**
 * Description: The description of variable neighborhood search (VNS)
 *
 * @ Author        Create/Modi     Note
 * Xiaofeng Xie    Apr 28, 2006
 * Xiaofeng Xie    Jul 14, 2006
 *
 * @version 1.0
 */

package maosKernel.behavior.mutate;

import maosKernel.represent.encode.iEncode.*;
import maosKernel.represent.space.*;
import maosKernel.behavior.mutate.*;

public class VNSMutator extends AbsExplicitMutator {
  private AbsExplicitMutator[] mutators = new AbsExplicitMutator[0];

  public void initMutators(AbsExplicitMutator[] mutators) {
    this.mutators = mutators;
  }

  public String getSummary() {
    String sumInfo = "";
    sumInfo += super.getSummary();
    if (mutators.length>0) {
      sumInfo += "[";
      for (int i=0; i<mutators.length; i++) {
        sumInfo += mutators[i].getSummary();
        if (i<mutators.length-1) sumInfo += "|";
      }
      sumInfo += "]";
    }
    return sumInfo;
  }

  public int mutateBehavior(SearchState baseState) {
    for (int i=0; i<mutators.length; i++) {
      mutators[i].mutateBehavior(baseState);
    }
    return OEncodeIData.WOSRTVALUE;
  }

}