diff --git a/jsprit-examples/src/main/java/jsprit/examples/BicycleMessenger.java b/jsprit-examples/src/main/java/jsprit/examples/BicycleMessenger.java
index 123834d9..5a10111c 100644
--- a/jsprit-examples/src/main/java/jsprit/examples/BicycleMessenger.java
+++ b/jsprit-examples/src/main/java/jsprit/examples/BicycleMessenger.java
@@ -4,7 +4,11 @@ import java.io.BufferedReader;
 import java.io.File;
 import java.io.FileReader;
 import java.io.IOException;
+import java.util.Arrays;
 import java.util.Collection;
+import java.util.Collections;
+import java.util.HashMap;
+import java.util.Map;
 
 import jsprit.analysis.toolbox.Plotter;
 import jsprit.analysis.toolbox.SolutionPrinter;
@@ -14,17 +18,71 @@ import jsprit.core.algorithm.termination.IterationWithoutImprovementTermination;
 import jsprit.core.problem.VehicleRoutingProblem;
 import jsprit.core.problem.VehicleRoutingProblem.Builder;
 import jsprit.core.problem.VehicleRoutingProblem.FleetSize;
+import jsprit.core.problem.constraint.HardActivityStateLevelConstraint;
+import jsprit.core.problem.cost.VehicleRoutingTransportCosts;
+import jsprit.core.problem.driver.DriverImpl;
+import jsprit.core.problem.job.Job;
 import jsprit.core.problem.job.Shipment;
+import jsprit.core.problem.misc.JobInsertionContext;
 import jsprit.core.problem.solution.VehicleRoutingProblemSolution;
+import jsprit.core.problem.solution.route.activity.DeliverShipment;
+import jsprit.core.problem.solution.route.activity.TourActivity;
 import jsprit.core.problem.vehicle.Vehicle;
 import jsprit.core.problem.vehicle.VehicleImpl;
 import jsprit.core.problem.vehicle.VehicleType;
 import jsprit.core.problem.vehicle.VehicleTypeImpl;
 import jsprit.core.util.Coordinate;
+import jsprit.core.util.CrowFlyCosts;
 import jsprit.core.util.Solutions;
 
 public class BicycleMessenger {
 
+	static class ThreeTimesLessThanDirectRouteConstraint implements HardActivityStateLevelConstraint {
+
+		private VehicleRoutingTransportCosts vrpCosts;
+		
+		//jobId map direct-distance by nearestMessenger
+		private Map<String,Double> bestMessengers = new HashMap<String, Double>();
+		
+		public ThreeTimesLessThanDirectRouteConstraint(VehicleRoutingTransportCosts vrpCosts, Collection<Job> envelopes, Collection<Vehicle> messengers) {
+			super();
+			this.vrpCosts = vrpCosts;
+			determineNearestMessenger(envelopes,messengers);
+		}
+		
+		private void determineNearestMessenger(Collection<Job> envelopes,Collection<Vehicle> messengers) {
+			for(Job envelope : envelopes){
+				double minDirect = Double.MAX_VALUE;
+				for(Vehicle m : messengers){
+					double direct = getDirectRouteDistance(envelope,m);
+					if(direct < minDirect){
+						minDirect = direct;
+					}
+				}
+				bestMessengers.put(envelope.getId(), minDirect);
+			}
+		}
+
+		private double getDirectRouteDistance(Job job, Vehicle v) {
+			Shipment envelope = (Shipment) job;
+			double direct = vrpCosts.getTransportTime(v.getLocationId(), envelope.getPickupLocation(), 0.0, DriverImpl.noDriver(), v) + 
+					vrpCosts.getTransportTime(envelope.getPickupLocation(), envelope.getDeliveryLocation(), 0.0, DriverImpl.noDriver(), v);
+			return direct;
+		}
+
+		@Override
+		public ConstraintsStatus fulfilled(JobInsertionContext iFacts,TourActivity prevAct, TourActivity newAct, TourActivity nextAct, double prevActDepTime) {
+			if(newAct instanceof DeliverShipment){
+				double deliveryTime = prevActDepTime + vrpCosts.getTransportTime(prevAct.getLocationId(), newAct.getLocationId(), prevActDepTime, iFacts.getNewDriver(), iFacts.getNewVehicle());
+				if(deliveryTime > 3 * bestMessengers.get(((DeliverShipment) newAct).getJob().getId())){
+					return ConstraintsStatus.NOT_FULFILLED_BREAK;
+				}
+			}
+			return ConstraintsStatus.FULFILLED;
+		}
+		
+	}
+	
 	/**
 	 * @param args
 	 * @throws IOException 
@@ -35,22 +93,23 @@ public class BicycleMessenger {
 		readEnvelopes(problemBuilder);
 		readMessengers(problemBuilder);
 		problemBuilder.setFleetSize(FleetSize.FINITE);
-		
+		problemBuilder.addConstraint(new ThreeTimesLessThanDirectRouteConstraint(new CrowFlyCosts(problemBuilder.getLocations()),problemBuilder.getAddedJobs(),problemBuilder.getAddedVehicles()));
 		VehicleRoutingProblem bicycleMessengerProblem = problemBuilder.build();
 		
-		VehicleRoutingAlgorithm algorithm = VehicleRoutingAlgorithms.readAndCreateAlgorithm(bicycleMessengerProblem, 6, "input/algorithmConfig_open.xml");
-		algorithm.setPrematureAlgorithmTermination(new IterationWithoutImprovementTermination(50));
+		VehicleRoutingAlgorithm algorithm = VehicleRoutingAlgorithms.readAndCreateAlgorithm(bicycleMessengerProblem, "input/algorithmConfig_open.xml");
+		algorithm.setPrematureAlgorithmTermination(new IterationWithoutImprovementTermination(200));
 		Collection<VehicleRoutingProblemSolution> solutions = algorithm.searchSolutions();
 		
 		SolutionPrinter.print(Solutions.bestOf(solutions));
 		Plotter plotter = new Plotter(bicycleMessengerProblem);
 		plotter.plotShipments(true);
-		plotter.plot("output/bicycleMessengerProblem.png", "bicycleMenssenger");
+		plotter.plot("output/bicycleMessengerProblem.png", "bicycleMessenger");
 		
 		
-		Plotter plotter1 = new Plotter(bicycleMessengerProblem, Solutions.bestOf(solutions));
+		Plotter plotter1 = new Plotter(bicycleMessengerProblem, Arrays.asList(Solutions.bestOf(solutions).getRoutes().iterator().next()));
 		plotter1.plotShipments(false);
-		plotter1.plot("output/bicycleMessengerSolution.png", "bicycleMenssenger");
+		plotter1.setShowFirstActivity(true);
+		plotter1.plot("output/bicycleMessengerSolution.png", "bicycleMessenger");
 		
 
 	}
@@ -73,7 +132,7 @@ public class BicycleMessenger {
 		BufferedReader reader = new BufferedReader(new FileReader(new File("input/bicycle_messenger_supply.txt")));
 		String line = null;
 		boolean firstLine = true;
-		VehicleType messengerType = VehicleTypeImpl.Builder.newInstance("messengerType", 15).setCostPerDistance(1).build();
+		VehicleType messengerType = VehicleTypeImpl.Builder.newInstance("messengerType", 5).setCostPerDistance(1).build();
 		while((line = reader.readLine()) != null){
 			if(firstLine) { firstLine = false; continue; }
 			String[] tokens = line.split("\\s+");