reformat according to .editorconfig

jsprit-core/src/main/java/jsprit/core/algorithm/box/ConcurrentInsertionNoiseMaker.java

@@ -32,8 +32,8 @@ class ConcurrentInsertionNoiseMaker implements SoftActivityConstraint, Iteration
         this.noiseLevel = noiseLevel;
         this.noiseProbability = noiseProbability;
         this.maxCosts = maxCosts;
-        randomArray = new Random[vrp.getNuActivities()+2];
+        randomArray = new Random[vrp.getNuActivities() + 2];
-        for(int i=0;i<randomArray.length;i++){
+        for (int i = 0; i < randomArray.length; i++) {
             Random r = new Random();
             r.setSeed(random.nextLong());
             randomArray[i] = r;

jsprit-core/src/main/java/jsprit/core/algorithm/ruin/JobNeighborhoodsImpl.java

@@ -86,7 +86,7 @@ class JobNeighborhoodsImpl implements JobNeighborhoods {
             for (Job j : vrp.getJobs().values()) {
                 if (i == j) continue;
                 double distance = jobDistance.getDistance(i, j);
-                if(distance > maxDistance) maxDistance = distance;
+                if (distance > maxDistance) maxDistance = distance;
                 ReferencedJob refNode = new ReferencedJob(j, distance);
                 treeSet.add(refNode);
                 nuOfDistancesStored++;

jsprit-core/src/main/java/jsprit/core/algorithm/ruin/JobNeighborhoodsImplWithCapRestriction.java

@@ -92,7 +92,7 @@ class JobNeighborhoodsImplWithCapRestriction implements JobNeighborhoods {
             for (Job j : vrp.getJobs().values()) {
                 if (i == j) continue;
                 double distance = jobDistance.getDistance(i, j);
-                if(distance > maxDistance) maxDistance = distance;
+                if (distance > maxDistance) maxDistance = distance;
                 ReferencedJob refNode = new ReferencedJob(j, distance);
                 if (treeSet.size() < capacity) {
                     treeSet.add(refNode);

jsprit-core/src/main/java/jsprit/core/algorithm/state/UpdateVehicleDependentPracticalTimeWindows.java

@@ -97,8 +97,8 @@ public class UpdateVehicleDependentPracticalTimeWindows implements RouteVisitor,
             double potentialLatestArrivalTimeAtCurrAct = latestArrTimeAtPrevAct - transportCosts.getBackwardTransportTime(activity.getLocation(), prevLocation,
                 latestArrTimeAtPrevAct, route.getDriver(), vehicle) - activity.getOperationTime();
             double latestArrivalTime = Math.min(activity.getTheoreticalLatestOperationStartTime(), potentialLatestArrivalTimeAtCurrAct);
-            if(latestArrivalTime < activity.getTheoreticalEarliestOperationStartTime()){
+            if (latestArrivalTime < activity.getTheoreticalEarliestOperationStartTime()) {
-                stateManager.putTypedInternalRouteState(route,vehicle,InternalStates.SWITCH_NOT_FEASIBLE,true);
+                stateManager.putTypedInternalRouteState(route, vehicle, InternalStates.SWITCH_NOT_FEASIBLE, true);
             }
             stateManager.putInternalTypedActivityState(activity, vehicle, InternalStates.LATEST_OPERATION_START_TIME, latestArrivalTime);
             latest_arrTimes_at_prevAct[vehicle.getVehicleTypeIdentifier().getIndex()] = latestArrivalTime;

jsprit-core/src/main/java/jsprit/core/problem/constraint/SwitchNotFeasible.java

@@ -7,7 +7,7 @@ import jsprit.core.problem.misc.JobInsertionContext;
 /**
  * Created by schroeder on 19/09/15.
  */
-public class SwitchNotFeasible implements HardRouteConstraint{
+public class SwitchNotFeasible implements HardRouteConstraint {
 
     private StateManager stateManager;
 
@@ -17,8 +17,9 @@ public class SwitchNotFeasible implements HardRouteConstraint{
 
     @Override
     public boolean fulfilled(JobInsertionContext insertionContext) {
-        Boolean notFeasible = stateManager.getRouteState(insertionContext.getRoute(),insertionContext.getNewVehicle(), InternalStates.SWITCH_NOT_FEASIBLE,Boolean.class);
+        Boolean notFeasible = stateManager.getRouteState(insertionContext.getRoute(), insertionContext.getNewVehicle(), InternalStates.SWITCH_NOT_FEASIBLE, Boolean.class);
-        if(notFeasible == null || insertionContext.getRoute().getVehicle().getVehicleTypeIdentifier().equals(insertionContext.getNewVehicle().getVehicleTypeIdentifier())) return true;
+        if (notFeasible == null || insertionContext.getRoute().getVehicle().getVehicleTypeIdentifier().equals(insertionContext.getNewVehicle().getVehicleTypeIdentifier()))
+            return true;
         else return !notFeasible;
     }
 

jsprit-core/src/main/java/jsprit/core/problem/constraint/TimeWindowConstraint.java

@@ -107,7 +107,7 @@ class TimeWindowConstraint implements HardActivityConstraint {
             routingCosts.getBackwardTransportTime(nextActLocation, newAct.getLocation(), latestArrTimeAtNextAct, iFacts.getNewDriver(),
                 iFacts.getNewVehicle()) - newAct.getOperationTime());
             /*
-			 *  |--- prevAct ---|
+             *  |--- prevAct ---|
 			 *                       		                 |--- vehicle's arrival @newAct
 			 *        latest arrival of vehicle @newAct ---|
 			 */

jsprit-core/src/main/java/jsprit/core/util/FastVehicleRoutingTransportCostsMatrix.java

@@ -119,7 +119,7 @@ public class FastVehicleRoutingTransportCostsMatrix extends AbstractForwardVehic
      *
      * @return
      */
-    public double[][][] getMatrix(){
+    public double[][][] getMatrix() {
         return matrix;
     }
 

jsprit-core/src/test/java/jsprit/core/algorithm/MeetTimeWindowConstraint_IT.java

@@ -560,7 +560,7 @@ public class MeetTimeWindowConstraint_IT {
         VehicleRoutingAlgorithm algorithm = Jsprit.Builder.newInstance(vrp).buildAlgorithm();
         algorithm.setMaxIterations(1000);
         VehicleRoutingProblemSolution solution = Solutions.bestOf(algorithm.searchSolutions());
-        for(VehicleRoute r : solution.getRoutes()){
+        for (VehicleRoute r : solution.getRoutes()) {
             assertTrue(r.getVehicle().getEarliestDeparture() <= r.getDepartureTime());
             assertTrue(r.getVehicle().getLatestArrival() >= r.getEnd().getArrTime());
         }
@@ -576,7 +576,7 @@ public class MeetTimeWindowConstraint_IT {
         VehicleRoutingAlgorithm algorithm = new SchrimpfFactory().createAlgorithm(vrp);
         algorithm.setMaxIterations(1000);
         VehicleRoutingProblemSolution solution = Solutions.bestOf(algorithm.searchSolutions());
-        for(VehicleRoute r : solution.getRoutes()){
+        for (VehicleRoute r : solution.getRoutes()) {
             assertTrue(r.getVehicle().getEarliestDeparture() <= r.getDepartureTime());
             assertTrue(r.getVehicle().getLatestArrival() >= r.getEnd().getArrTime());
         }
@@ -592,20 +592,20 @@ public class MeetTimeWindowConstraint_IT {
         VehicleRoutingAlgorithm algorithm = new GreedySchrimpfFactory().createAlgorithm(vrp);
         algorithm.setMaxIterations(1000);
         VehicleRoutingProblemSolution solution = Solutions.bestOf(algorithm.searchSolutions());
-        for(VehicleRoute r : solution.getRoutes()){
+        for (VehicleRoute r : solution.getRoutes()) {
             assertTrue(r.getVehicle().getEarliestDeparture() <= r.getDepartureTime());
             assertTrue(r.getVehicle().getLatestArrival() >= r.getEnd().getArrTime());
         }
     }
 
-    
+
     private FastVehicleRoutingTransportCostsMatrix createMatrix() throws IOException {
         BufferedReader reader = new BufferedReader(new FileReader(new File("src/test/resources/matrix.txt")));
         String line;
-        FastVehicleRoutingTransportCostsMatrix.Builder builder = FastVehicleRoutingTransportCostsMatrix.Builder.newInstance(11,false);
+        FastVehicleRoutingTransportCostsMatrix.Builder builder = FastVehicleRoutingTransportCostsMatrix.Builder.newInstance(11, false);
-        while((line = reader.readLine()) != null){
+        while ((line = reader.readLine()) != null) {
             String[] split = line.split("\t");
-            builder.addTransportDistance(Integer.parseInt(split[0]),Integer.parseInt(split[1]),Double.parseDouble(split[2]));
+            builder.addTransportDistance(Integer.parseInt(split[0]), Integer.parseInt(split[1]), Double.parseDouble(split[2]));
             builder.addTransportTime(Integer.parseInt(split[0]), Integer.parseInt(split[1]), Double.parseDouble(split[3]));
         }
         return builder.build();

jsprit-core/src/test/java/jsprit/core/algorithm/RefuseCollectionWithCostsHigherThanTimesAndFiniteFleet_IT.java

@@ -167,7 +167,7 @@ public class RefuseCollectionWithCostsHigherThanTimesAndFiniteFleet_IT {
             }
             String[] lineTokens = line.split(",");
             /*
-			 * build service
+             * build service
 			 */
             Service service = Service.Builder.newInstance(lineTokens[0]).addSizeDimension(0, Integer.parseInt(lineTokens[1]))
                 .setLocation(Location.newInstance(lineTokens[0])).build();

jsprit-core/src/test/java/jsprit/core/algorithm/RefuseCollectionWithCostsHigherThanTimesAndFiniteFleet_withTimeAndDistanceCosts_IT.java

@@ -167,7 +167,7 @@ public class RefuseCollectionWithCostsHigherThanTimesAndFiniteFleet_withTimeAndD
             }
             String[] lineTokens = line.split(",");
             /*
-			 * build service
+             * build service
 			 */
             Service service = Service.Builder.newInstance(lineTokens[0]).addSizeDimension(0, Integer.parseInt(lineTokens[1]))
                 .setLocation(Location.newInstance(lineTokens[0])).build();

jsprit-core/src/test/java/jsprit/core/algorithm/RefuseCollection_IT.java

@@ -115,7 +115,7 @@ public class RefuseCollection_IT {
         vrpBuilder.addVehicle(bigVehicle);
 
 		/*
-		 * create cost-matrix
+         * create cost-matrix
 		 */
         VehicleRoutingTransportCostsMatrix.Builder matrixBuilder = VehicleRoutingTransportCostsMatrix.Builder.newInstance(true);
 		/*

jsprit-core/src/test/java/jsprit/core/algorithm/recreate/TestLocalActivityInsertionCostsCalculator.java

@@ -409,7 +409,7 @@ public class TestLocalActivityInsertionCostsCalculator {
         //new: 50 - 50 = 0
 
 		/*
-		activity start time delay at next act = start-time-old - start-time-new is always bigger than subsequent waiting time savings
+        activity start time delay at next act = start-time-old - start-time-new is always bigger than subsequent waiting time savings
 		 */
 		/*
 		old = 10 + 30 + 10 = 50

jsprit-core/src/test/java/jsprit/core/algorithm/recreate/TestMixedServiceAndShipmentsProblemOnRouteLevel.java

@@ -109,7 +109,7 @@ public class TestMixedServiceAndShipmentsProblemOnRouteLevel {
         VehicleType vehicleType = vehicleTypeBuilder.build();
 
 		/*
-		 * get a vehicle-builder and build a vehicle located at (10,10) with type "vehicleType"
+         * get a vehicle-builder and build a vehicle located at (10,10) with type "vehicleType"
 		 */
         Builder vehicleBuilder = VehicleImpl.Builder.newInstance("vehicle");
         vehicleBuilder.setStartLocation(Location.newInstance(10, 10));

jsprit-examples/src/main/java/jsprit/examples/ConfigureAlgorithmInCodeInsteadOfPerXml.java

@@ -87,7 +87,7 @@ public class ConfigureAlgorithmInCodeInsteadOfPerXml {
         Collection<VehicleRoutingProblemSolution> solutions = algorithm.searchSolutions();
 
 		/*
-		 * get the best
+         * get the best
 		 */
         VehicleRoutingProblemSolution bestSolution = Solutions.bestOf(solutions);
 

jsprit-examples/src/main/java/jsprit/examples/EnRoutePickupAndDeliveryWithMultipleDepotsAndOpenRoutesExample.java

@@ -126,7 +126,7 @@ public class EnRoutePickupAndDeliveryWithMultipleDepotsAndOpenRoutesExample {
         VehicleRoutingAlgorithm algorithm = VehicleRoutingAlgorithms.readAndCreateAlgorithm(problem, "input/algorithmConfig.xml");
 //		algorithm.setMaxIterations(30000);
         /*
-		 * and search a solution
+         * and search a solution
 		 */
         Collection<VehicleRoutingProblemSolution> solutions = algorithm.searchSolutions();
 

jsprit-examples/src/main/java/jsprit/examples/MultipleDepotExample.java

@@ -91,7 +91,7 @@ public class MultipleDepotExample {
         VehicleRoutingProblem vrp = vrpBuilder.build();
 
 		/*
-		 * plot to see how the problem looks like
+         * plot to see how the problem looks like
 		 */
 //		SolutionPlotter.plotVrpAsPNG(vrp, "output/problem01.png", "p01");
 

jsprit-examples/src/main/java/jsprit/examples/MultipleDepotExample2.java

@@ -97,7 +97,7 @@ public class MultipleDepotExample2 {
         VehicleRoutingProblem vrp = vrpBuilder.build();
 
 		/*
-		 * plot to see how the problem looks like
+         * plot to see how the problem looks like
 		 */
 //		SolutionPlotter.plotVrpAsPNG(vrp, "output/problem08.png", "p08");
 

jsprit-examples/src/main/java/jsprit/examples/MultipleDepotWithInitialRoutesExample.java

@@ -62,7 +62,7 @@ public class MultipleDepotWithInitialRoutesExample {
 		 */
         VehicleRoutingProblem vrp = vrpBuilder.build();
         /*
-		 * since job (service) 26 and 44 are already planned in initial route and thus static AND sequence is fixed they
+         * since job (service) 26 and 44 are already planned in initial route and thus static AND sequence is fixed they
 		 * should not be in jobMap anymore (only variable jobs are in jobMap)
 		 */
         assert !vrp.getJobs().containsKey("26") : "strange. service 26 should not be part of the problem";

jsprit-examples/src/main/java/jsprit/examples/PickupAndDeliveryExample.java

@@ -72,7 +72,7 @@ public class PickupAndDeliveryExample {
         VehicleRoutingAlgorithm vra = VehicleRoutingAlgorithms.readAndCreateAlgorithm(vrp, "input/algorithmConfig_solomon.xml");
         vra.getAlgorithmListeners().addListener(new AlgorithmSearchProgressChartListener("output/sol_progress.png"));
         /*
-		 * Solve the problem.
+         * Solve the problem.
 		 *
 		 *
 		 */

jsprit-examples/src/main/java/jsprit/examples/PickupAndDeliveryExample2.java

@@ -78,7 +78,7 @@ public class PickupAndDeliveryExample2 {
         Collection<VehicleRoutingProblemSolution> solutions = vra.searchSolutions();
 
 		/*
-		 * Retrieve best solution.
+         * Retrieve best solution.
 		 */
         VehicleRoutingProblemSolution solution = new SelectBest().selectSolution(solutions);
 

jsprit-examples/src/main/java/jsprit/examples/PickupAndDeliveryOpenExample.java

@@ -69,7 +69,7 @@ public class PickupAndDeliveryOpenExample {
         VehicleRoutingAlgorithm vra = VehicleRoutingAlgorithms.readAndCreateAlgorithm(vrp, "input/algorithmConfig_open.xml");
         vra.getAlgorithmListeners().addListener(new AlgorithmSearchProgressChartListener("output/sol_progress.png"));
         /*
-		 * Solve the problem.
+         * Solve the problem.
 		 *
 		 *
 		 */

jsprit-examples/src/main/java/jsprit/examples/RefuseCollectionExample.java

@@ -110,7 +110,7 @@ public class RefuseCollectionExample {
             }
             String[] lineTokens = line.split(",");
             /*
-			 * build service
+             * build service
 			 */
             Service service = Service.Builder.newInstance(lineTokens[0]).addSizeDimension(0, Integer.parseInt(lineTokens[1])).setLocation(Location.newInstance(lineTokens[0])).build();
 			/*

jsprit-examples/src/main/java/jsprit/examples/RefuseCollectionWithFastMatrixExample.java

@@ -109,7 +109,7 @@ public class RefuseCollectionWithFastMatrixExample {
             }
             String[] lineTokens = line.split(",");
             /*
-			 * build service
+             * build service
 			 */
             Service service = Service.Builder.newInstance(lineTokens[0])
                 .addSizeDimension(0, Integer.parseInt(lineTokens[1]))

jsprit-examples/src/main/java/jsprit/examples/ServicePickupsWithMultipleDepotsExample.java

@@ -109,7 +109,7 @@ public class ServicePickupsWithMultipleDepotsExample {
         Collection<VehicleRoutingProblemSolution> solutions = algorithm.searchSolutions();
 
 		/*
-		 * get the best
+         * get the best
 		 */
         VehicleRoutingProblemSolution bestSolution = Solutions.bestOf(solutions);
 

jsprit-examples/src/main/java/jsprit/examples/SimpleDepotBoundedPickupAndDeliveryExample.java

@@ -88,7 +88,7 @@ public class SimpleDepotBoundedPickupAndDeliveryExample {
         Collection<VehicleRoutingProblemSolution> solutions = algorithm.searchSolutions();
 
 		/*
-		 * get the best
+         * get the best
 		 */
         VehicleRoutingProblemSolution bestSolution = Solutions.bestOf(solutions);
 

jsprit-examples/src/main/java/jsprit/examples/SimpleEnRoutePickupAndDeliveryExample.java

@@ -93,7 +93,7 @@ public class SimpleEnRoutePickupAndDeliveryExample {
         Collection<VehicleRoutingProblemSolution> solutions = algorithm.searchSolutions();
 
 		/*
-		 * get the best
+         * get the best
 		 */
         VehicleRoutingProblemSolution bestSolution = Solutions.bestOf(solutions);
 

jsprit-examples/src/main/java/jsprit/examples/SimpleEnRoutePickupAndDeliveryOpenRoutesExample.java

@@ -93,7 +93,7 @@ public class SimpleEnRoutePickupAndDeliveryOpenRoutesExample {
         Collection<VehicleRoutingProblemSolution> solutions = algorithm.searchSolutions();
 
 		/*
-		 * get the best
+         * get the best
 		 */
         VehicleRoutingProblemSolution bestSolution = Solutions.bestOf(solutions);
 

jsprit-examples/src/main/java/jsprit/examples/SimpleEnRoutePickupAndDeliveryWithDepotBoundedDeliveriesExample.java

@@ -97,7 +97,7 @@ public class SimpleEnRoutePickupAndDeliveryWithDepotBoundedDeliveriesExample {
         VehicleRoutingProblem problem = vrpBuilder.build();
 
 		/*
-		 * build the algorithm
+         * build the algorithm
 		 */
         VehicleRoutingAlgorithmBuilder vraBuilder = new VehicleRoutingAlgorithmBuilder(problem, "input/algorithmConfig.xml");
         vraBuilder.addCoreConstraints();

jsprit-examples/src/main/java/jsprit/examples/SimpleExample.java

@@ -93,7 +93,7 @@ public class SimpleExample {
         Collection<VehicleRoutingProblemSolution> solutions = algorithm.searchSolutions();
 
 		/*
-		 * get the best
+         * get the best
 		 */
         VehicleRoutingProblemSolution bestSolution = Solutions.bestOf(solutions);
 

jsprit-examples/src/main/java/jsprit/examples/SimpleExampleOpenRoutes.java

@@ -87,7 +87,7 @@ public class SimpleExampleOpenRoutes {
         Collection<VehicleRoutingProblemSolution> solutions = algorithm.searchSolutions();
 
 		/*
-		 * get the best
+         * get the best
 		 */
         VehicleRoutingProblemSolution bestSolution = Solutions.bestOf(solutions);
 

jsprit-examples/src/main/java/jsprit/examples/SimpleExampleWithSkills.java

@@ -115,7 +115,7 @@ public class SimpleExampleWithSkills {
         Collection<VehicleRoutingProblemSolution> solutions = algorithm.searchSolutions();
 
 		/*
-		 * get the best
+         * get the best
 		 */
         VehicleRoutingProblemSolution bestSolution = Solutions.bestOf(solutions);
 

jsprit-examples/src/main/java/jsprit/examples/SimpleVRPWithBackhaulsExample.java

@@ -103,7 +103,7 @@ public class SimpleVRPWithBackhaulsExample {
         SolutionPrinter.print(bestSolution);
 
 		/*
-		 * plot
+         * plot
 		 */
         Plotter plotter = new Plotter(problem, bestSolution);
         plotter.setLabel(Label.SIZE);

jsprit-examples/src/main/java/jsprit/examples/SolomonExample.java

@@ -74,7 +74,7 @@ public class SolomonExample {
         Collection<VehicleRoutingProblemSolution> solutions = vra.searchSolutions();
 
 		/*
-		 * Retrieve best solution.
+         * Retrieve best solution.
 		 */
         VehicleRoutingProblemSolution solution = new SelectBest().selectSolution(solutions);
 

jsprit-examples/src/main/java/jsprit/examples/SolomonExampleWithSpecifiedVehicleEndLocations.java

@@ -77,7 +77,7 @@ public class SolomonExampleWithSpecifiedVehicleEndLocations {
 //		vra.setPrematureBreak(100);
         vra.getAlgorithmListeners().addListener(new AlgorithmSearchProgressChartListener("output/sol_progress.png"));
         /*
-		 * Solve the problem.
+         * Solve the problem.
 		 *
 		 *
 		 */

jsprit-examples/src/main/java/jsprit/examples/SolomonExampleWithSpecifiedVehicleEndLocationsWithoutTWs.java

@@ -77,7 +77,7 @@ public class SolomonExampleWithSpecifiedVehicleEndLocationsWithoutTWs {
 //		vra.setPrematureBreak(100);
 //		vra.getAlgorithmListeners().addListener(new AlgorithmSearchProgressChartListener("output/sol_progress.png"));
         /*
-		 * Solve the problem.
+         * Solve the problem.
 		 *
 		 *
 		 */

jsprit-examples/src/main/java/jsprit/examples/SolomonOpenExample.java

@@ -69,7 +69,7 @@ public class SolomonOpenExample {
 //		vra.setPrematureBreak(100);
 //		vra.getAlgorithmListeners().addListener(new AlgorithmSearchProgressChartListener("output/sol_progress.png"));
         /*
-		 * Solve the problem.
+         * Solve the problem.
 		 *
 		 *
 		 */

jsprit-examples/src/main/java/jsprit/examples/SolomonR101Example.java

@@ -68,7 +68,7 @@ public class SolomonR101Example {
         vra.setMaxIterations(20000);
 //		vra.setPrematureBreak(100);
         vra.getAlgorithmListeners().addListener(new AlgorithmSearchProgressChartListener("output/sol_progress.png"));
-		/*
+        /*
 		 * Solve the problem.
 		 *
 		 *

jsprit-examples/src/main/java/jsprit/examples/SolomonWithRegretInsertionExample.java

@@ -81,7 +81,7 @@ public class SolomonWithRegretInsertionExample {
         Collection<VehicleRoutingProblemSolution> solutions = vra.searchSolutions();
 
 		/*
-		 * Retrieve best solution.
+         * Retrieve best solution.
 		 */
         VehicleRoutingProblemSolution solution = new SelectBest().selectSolution(solutions);
 

jsprit-examples/src/main/java/jsprit/examples/TransportOfDisabledPeople.java

@@ -186,7 +186,7 @@ public class TransportOfDisabledPeople {
         algorithm.setPrematureAlgorithmTermination(new IterationWithoutImprovementTermination(100));
 
 		/*
-		 * and search a solution
+         * and search a solution
 		 */
         Collection<VehicleRoutingProblemSolution> solutions = algorithm.searchSolutions();
 

jsprit-examples/src/main/java/jsprit/examples/VRPWithBackhaulsExample.java

@@ -77,7 +77,7 @@ public class VRPWithBackhaulsExample {
         VehicleRoutingAlgorithm vra = vraBuilder.build();
         vra.getAlgorithmListeners().addListener(new AlgorithmSearchProgressChartListener("output/sol_progress.png"));
         /*
-		 * Solve the problem.
+         * Solve the problem.
 		 *
 		 *
 		 */

jsprit-examples/src/main/java/jsprit/examples/VRPWithBackhaulsExample2.java

@@ -105,7 +105,7 @@ public class VRPWithBackhaulsExample2 {
         Collection<VehicleRoutingProblemSolution> solutions = vra.searchSolutions();
 
 		/*
-		 * Retrieve best solution.
+         * Retrieve best solution.
 		 */
         VehicleRoutingProblemSolution solution = new SelectBest().selectSolution(solutions);