package examples; import java.util.Arrays; import java.util.Collection; import util.Coordinate; import util.Solutions; import algorithms.VehicleRoutingAlgorithms; import analysis.AlgorithmSearchProgressChartListener; import analysis.SolutionPlotter; import analysis.SolutionPrinter; import analysis.StopWatch; import basics.VehicleRoutingAlgorithm; import basics.VehicleRoutingProblem; import basics.VehicleRoutingProblem.FleetSize; import basics.VehicleRoutingProblemSolution; import basics.algo.VehicleRoutingAlgorithmListeners.Priority; import basics.io.VrpXMLReader; import basics.route.Vehicle; import basics.route.VehicleImpl; import basics.route.VehicleImpl.VehicleType; public class MultipleDepotExampleWithPenaltyVehicles { /** * @param args */ public static void main(String[] args) { VehicleRoutingProblem.Builder vrpBuilder = VehicleRoutingProblem.Builder.newInstance(); /* * Read cordeau-instance p01, BUT only its services without any vehicles */ new VrpXMLReader(vrpBuilder).read("input/vrp_cordeau_08.xml"); /* * add vehicles with its depots * 2 depots: * (-33,33) * (33,-33) * * each with 14 vehicles each with a capacity of 500 and a maximum duration of 310 */ int nuOfVehicles = 14; int capacity = 500; double maxDuration = 310; Coordinate firstDepotCoord = Coordinate.newInstance(-33, 33); Coordinate second = Coordinate.newInstance(33, -33); int depotCounter = 1; for(Coordinate depotCoord : Arrays.asList(firstDepotCoord,second)){ for(int i=0;i solutions = vra.searchSolutions(); SolutionPrinter.print(Solutions.getBest(solutions)); SolutionPlotter.plotSolutionAsPNG(vrp, Solutions.getBest(solutions), "output/p08_solution.png", "p08"); } }