From 8ca6966d950e7b96d78110fc1150ee0660fb9f7b Mon Sep 17 00:00:00 2001
From: Stefan Schroeder <4sschroeder@gmail.com>
Date: Thu, 5 Dec 2013 12:32:43 +0100
Subject: [PATCH] play

---
 .../src/main/java/jsprit/examples/BicycleMessenger.java        | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/jsprit-examples/src/main/java/jsprit/examples/BicycleMessenger.java b/jsprit-examples/src/main/java/jsprit/examples/BicycleMessenger.java
index 00889a93..38503a8c 100644
--- a/jsprit-examples/src/main/java/jsprit/examples/BicycleMessenger.java
+++ b/jsprit-examples/src/main/java/jsprit/examples/BicycleMessenger.java
@@ -206,7 +206,7 @@ public class BicycleMessenger {
 		stateManager.addStateUpdater(new UpdateLatestActivityStartTimes(stateManager, routingCosts, nearestMessengers));
 		
 		//create your algorithm
-		VehicleRoutingAlgorithm algorithm = VehicleRoutingAlgorithms.readAndCreateAlgorithm(bicycleMessengerProblem,"input/algorithmConfig_open.xml", stateManager);
+		VehicleRoutingAlgorithm algorithm = VehicleRoutingAlgorithms.readAndCreateAlgorithm(bicycleMessengerProblem,4,"input/algorithmConfig_open.xml", stateManager);
 		//if you want, terminate it after 1000 iterations with no change
 		algorithm.setPrematureAlgorithmTermination(new IterationWithoutImprovementTermination(1000));
 //		algorithm.addListener(new AlgorithmSearchProgressChartListener("output/progress.png"));
@@ -216,7 +216,6 @@ public class BicycleMessenger {
 		//this is just to ensure that solution meet the above constraints
 		validateSolution(Solutions.bestOf(solutions), bicycleMessengerProblem, nearestMessengers);
 		
-		SolutionPrinter.print(Solutions.bestOf(solutions));
 		SolutionPrinter.print(bicycleMessengerProblem, Solutions.bestOf(solutions), Print.VERBOSE);
 		
 		//you may want to plot the problem