trans/graphhopper-jsprit
1
0
Fork 0
mirror of https://github.com/graphhopper/jsprit.git synced 2020-01-24 07:45:05 +01:00
Code Issues Releases Wiki Activity

benchmarking

Browse source
This commit is contained in:
oblonski 2013-06-28 08:49:01 +02:00
parent cc47719eac
commit aab465a349
1 changed files with 93 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

93
jsprit-analysis/src/main/java/analysis/Benchmarker.java Normal file
View file

@ -0,0 +1,93 @@
package analysis;
import java.util.ArrayList;
import java.util.Collection;
import java.util.List;
import util.Solutions;
import algorithms.VehicleRoutingAlgorithms;
import basics.VehicleRoutingAlgorithm;
import basics.VehicleRoutingProblem;
import basics.VehicleRoutingProblemSolution;
import basics.algo.VehicleRoutingAlgorithmListeners.Priority;
public class Benchmarker {
static class Problem {
public final String name;
public final VehicleRoutingProblem vrp;
public final Double bestKnown;
public Problem(String name, VehicleRoutingProblem vrp, Double bestKnown) {
super();
this.name = name;
this.vrp = vrp;
this.bestKnown = bestKnown;
}
}
static class Result {
public final double result;
public final double time;
public final Problem problem;
public Double delta = null;
public Result(Problem p, double result, double time) {
super();
this.result = result;
this.time = time;
this.problem = p;
}
void setBestKnownDelta(double delta){
this.delta = delta;
}
}
private String algorithmConfig;
private List<Problem> problems = new ArrayList<Problem>();
public Benchmarker(String algorithmConfig) {
super();
this.algorithmConfig = algorithmConfig;
}
public void addProblem(String name, VehicleRoutingProblem problem){
problems.add(new Problem(name,problem,null));
}
public void addProblem(String name, VehicleRoutingProblem problem, double bestKnown){
problems.add(new Problem(name,problem,bestKnown));
}
public void run(){
List<Result> results = new ArrayList<Benchmarker.Result>();
for(Problem p : problems){
VehicleRoutingAlgorithm vra = VehicleRoutingAlgorithms.readAndCreateAlgorithm(p.vrp, algorithmConfig);
StopWatch stopwatch = new StopWatch();
vra.getAlgorithmListeners().addListener(stopwatch,Priority.HIGH);
Collection<VehicleRoutingProblemSolution> solutions = vra.searchSolutions();
VehicleRoutingProblemSolution best = Solutions.getBest(solutions);
Result result = new Result(p,best.getCost(),stopwatch.getCompTimeInSeconds());
if(p.bestKnown != null) result.setBestKnownDelta((best.getCost()/p.bestKnown-1));
results.add(result);
}
print(results);
}
private void print(List<Result> results) {
System.out.println("instance,time [in sec],result,delta [in percent to bestKnown]");
double sumTime=0.0;
double sumResult=0.0;
for(Result r : results){
sumTime+=r.time;
sumResult+=r.result;
System.out.println("[instance="+r.problem.name+"][time="+round(r.time,2)+"][result="+round(r.result,2)+"][delta="+round(r.delta,3)+"]");
}
System.out.println("[avgTime="+round(sumTime/(double)results.size(),2)+"][avgResult="+round(sumResult/(double)results.size(),2)+"]");
}
private double round(Double delta, int i) {
long roundedVal = Math.round(delta*Math.pow(10, i));
return (double)roundedVal/(double)(Math.pow(10, i));
}
}