public class SGMPCSearch extends Object
This implementation is based on paper "Solution-guided Multi-point Constructive Search for Job Shop Scheduling" by J. Christopher Beck, Journal of Artificial Intelligence Research 29 (2007) 49–77.
Modifier and Type | Field and Description |
---|---|
IntVar |
cost
Cost variable.
|
int |
costPosition |
int |
e |
int |
eInit |
int[][] |
elite |
static int |
luby |
static int |
poly |
Store |
store |
IntVar[] |
vars
Variables for search.
|
Constructor and Description |
---|
SGMPCSearch(Store store,
IntVar[] vars,
IntVar cost) |
SGMPCSearch(Store store,
IntVar[] vars,
IntVar cost,
ImproveSolution<IntVar> search) |
Modifier and Type | Method and Description |
---|---|
void |
findEliteSolutions() |
int |
getLuby(int i) |
int |
lastCost() |
int[] |
lastSolution() |
void |
printSolution(int[] solution) |
boolean |
search() |
void |
setEliteSize(int e) |
void |
setEliteSolutions(int[][] solutions) |
void |
setFailStrategy(int strategy) |
void |
setInitialSolutionsSize(int eInit) |
void |
setPrintInfo(boolean print) |
void |
setProbability(double p) |
void |
setTimeOut(long t) |
public Store store
public IntVar[] vars
public IntVar cost
public int e
public int eInit
public static final int luby
public static final int poly
public int[][] elite
public int costPosition
public SGMPCSearch(Store store, IntVar[] vars, IntVar cost, ImproveSolution<IntVar> search)
public boolean search()
public void findEliteSolutions()
public void setTimeOut(long t)
public int getLuby(int i)
public void setEliteSolutions(int[][] solutions)
public void setProbability(double p)
public void setEliteSize(int e)
public void setInitialSolutionsSize(int eInit)
public void setFailStrategy(int strategy)
public void setPrintInfo(boolean print)
public void printSolution(int[] solution)
public int[] lastSolution()
public int lastCost()
Copyright © 2022. All rights reserved.