/**
* Copyright (c) 1999-2014, Ecole des Mines de Nantes
* All rights reserved.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of the Ecole des Mines de Nantes nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE REGENTS AND CONTRIBUTORS BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/**
* Created by IntelliJ IDEA.
* User: Jean-Guillaume Fages
* Date: 18/09/13
* Time: 23:52
*/
package samples;
import solver.Solver;
import solver.propagation.hardcoded.TwoBucketPropagationEngine;
import solver.search.loop.monitors.SearchMonitorFactory;
public abstract class ParallelizedProblem extends AbstractProblem {
protected int searchIdx;
public ParallelizedProblem(int searchIdx){
super();
this.searchIdx = searchIdx;
// abstract execution methods
this.printDescription();
this.createSolver();
this.buildModel();
this.configureSearch();
overrideExplanation();
solver.set(new TwoBucketPropagationEngine(solver));
if (level.getLevel() > Level.SILENT.getLevel()) {
SearchMonitorFactory.log(solver,
level.getLevel() > Level.VERBOSE.getLevel(),
level.getLevel() > Level.SOLUTION.getLevel());
}
}
@Override
public void createSolver() {
solver = new Solver();
}
}