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

Merge pull request #43 from bringg/less_logs

Browse source 
less logs
This commit is contained in:
kobyb 2018-03-18 12:04:59 +02:00 • committed by GitHub
commit e94a76fd1c
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 5 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

10
jsprit-core/src/main/java/com/graphhopper/jsprit/core/algorithm/VehicleRoutingAlgorithm.java
View file

@ -218,14 +218,14 @@ public class VehicleRoutingAlgorithm {
} }
public Collection<VehicleRoutingProblemSolution> searchSolutions(Collection<VehicleRoutingProblemSolution> solutions) { public Collection<VehicleRoutingProblemSolution> searchSolutions(Collection<VehicleRoutingProblemSolution> solutions) {
logger.info("algorithm starts: [maxIterations={}]", maxIterations); logger.debug("algorithm starts: [maxIterations={}]", maxIterations);
double now = System.currentTimeMillis(); double now = System.currentTimeMillis();
int noIterationsThisAlgoIsRunning = maxIterations; int noIterationsThisAlgoIsRunning = maxIterations;
counter.reset(); counter.reset();
logger.info("algorithmStarts func call"); logger.debug("algorithmStarts func call");
algorithmStarts(problem, solutions); algorithmStarts(problem, solutions);
bestEver = Solutions.bestOf(solutions); bestEver = Solutions.bestOf(solutions);
logger.info("algorithm iterations start"); logger.debug("algorithm iterations start");
if (logger.isTraceEnabled()) { if (logger.isTraceEnabled()) {
log(solutions); log(solutions);
} }
@ -247,10 +247,10 @@ public class VehicleRoutingAlgorithm {
} }
iterationEnds(i + 1, problem, solutions); iterationEnds(i + 1, problem, solutions);
} }
logger.info("iterations end at {} iterations", noIterationsThisAlgoIsRunning); logger.debug("iterations end at {} iterations", noIterationsThisAlgoIsRunning);
addBestEver(solutions); addBestEver(solutions);
algorithmEnds(problem, solutions); algorithmEnds(problem, solutions);
logger.info("took {} seconds", ((System.currentTimeMillis() - now) / 1000.0)); logger.debug("took {} seconds", ((System.currentTimeMillis() - now) / 1000.0));
return solutions; return solutions;
} }