add example input

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

@@ -0,0 +1,93 @@
+package examples;
+
+import java.io.File;
+import java.util.Collection;
+
+import algorithms.VehicleRoutingAlgorithms;
+import algorithms.selectors.SelectBest;
+import analysis.AlgorithmSearchProgressChartListener;
+import analysis.Plotter;
+import analysis.Plotter.Label;
+import analysis.SolutionPlotter;
+import analysis.SolutionPrinter;
+import analysis.SolutionPrinter.Print;
+import basics.VehicleRoutingAlgorithm;
+import basics.VehicleRoutingProblem;
+import basics.VehicleRoutingProblemSolution;
+import basics.VehicleRoutingProblem.Constraint;
+import basics.io.VrpXMLReader;
+
+public class PickupAndDeliveryExample2 {
+	
+	public static void main(String[] args) {
+		
+		/*
+		 * some preparation - create output folder
+		 */
+		File dir = new File("output");
+		// if the directory does not exist, create it
+		if (!dir.exists()){
+			System.out.println("creating directory ./output");
+			boolean result = dir.mkdir();  
+			if(result) System.out.println("./output created");  
+		}
+		
+		/*
+		 * Build the problem.
+		 * 
+		 * But define a problem-builder first.
+		 */
+		VehicleRoutingProblem.Builder vrpBuilder = VehicleRoutingProblem.Builder.newInstance();
+		
+		/*
+		 * A solomonReader reads solomon-instance files, and stores the required information in the builder.
+		 */
+		new VrpXMLReader(vrpBuilder).read("input/pd_christophides_vrpnc1_vcap50.xml");
+		
+		/*
+		 * Finally, the problem can be built. By default, transportCosts are crowFlyDistances (as usually used for vrp-instances).
+		 */
+		
+		VehicleRoutingProblem vrp = vrpBuilder.build();
+		
+		SolutionPlotter.plotVrpAsPNG(vrp, "output/pd_christophides_vrpnc1.png", "pd_vrpnc1");
+		
+		/*
+		 * Define the required vehicle-routing algorithms to solve the above problem.
+		 * 
+		 * The algorithm can be defined and configured in an xml-file.
+		 */
+//		VehicleRoutingAlgorithm vra = new SchrimpfFactory().createAlgorithm(vrp);
+		VehicleRoutingAlgorithm vra = VehicleRoutingAlgorithms.readAndCreateAlgorithm(vrp, "input/algorithmConfig_solomon.xml");
+		vra.getAlgorithmListeners().addListener(new AlgorithmSearchProgressChartListener("output/sol_progress.png"));
+		/*
+		 * Solve the problem.
+		 * 
+		 *
+		 */
+		Collection<VehicleRoutingProblemSolution> solutions = vra.searchSolutions();
+		
+		/*
+		 * Retrieve best solution.
+		 */
+		VehicleRoutingProblemSolution solution = new SelectBest().selectSolution(solutions);
+		
+		/*
+		 * print solution
+		 */
+		SolutionPrinter.print(solution, Print.VERBOSE);
+		
+		/*
+		 * Plot solution. 
+		 */
+//		SolutionPlotter.plotSolutionAsPNG(vrp, solution, "output/pd_solomon_r101_solution.png","pd_r101");
+		Plotter plotter = new Plotter(vrp, solution);
+		plotter.setLabel(Label.SIZE);
+		plotter.setShowFirstActivity(true);
+		plotter.plot("output/pd_christophides_vrpnc1.png","pd_vrpnc1");
+	
+		
+		
+	}
+
+}