absblindmutator.java

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

/**
 * Description: The description of generating operator by moving based on an exist point.
 *  or generate directly
 *
 * @ Author        Create/Modi     Note
 * Xiaofeng Xie    Apr 12, 2005     For TSP problem
 * Xiaofeng Xie    Apr 28, 2006    MAOS-TSP Beta 1.1.002
 *
 * @version 1.0
 */

package maosKernel.behavior.mutate;

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

public abstract class AbsBlindMutator extends AbsExplicitMutator {
  public AbsBlindMutator() {
    super.setKey("BlindMutator");
  }

  abstract protected void blindMutateBehavior(SearchState baseState);

  //If possible, return the delta cost value, else return WORSTVALUE
  public int mutateBehavior(SearchState baseState) {
    blindMutateBehavior(baseState);
    return OEncodeIData.WOSRTVALUE;
  }
}