/**
 * SLSearchTest - Test stochastic local search algorithms and problems
 *
 * Created: Tue Sep 14 11:03:35 2004
 *
 * @author Todd Neller
 * @version 1.0
 */
public final class SLSearchTest {

    public static void main(final String[] args) {
	final int ITERATIONS = 1000000;
	final double ACCEPT_RATE = .1; // try 1, .1, .01, .001, ..., 0
	
	BinPackingProblem state = new BinPackingProblem();
	//state.swapping = true;
	//Rastrigin state = new Rastrigin();
	
	SLSearcher searcher = new IterativeImprover(state, ACCEPT_RATE); 

	Annealable bestState = searcher.search(ITERATIONS);
	System.out.println(bestState);
	System.out.println(bestState.energy());
    }

}