mirror of
https://github.com/graphhopper/jsprit.git
synced 2020-01-24 07:45:05 +01:00
added example
This commit is contained in:
parent
dc24411802
commit
941e4ae29b
1 changed files with 146 additions and 0 deletions
|
|
@ -0,0 +1,146 @@
|
||||||
|
/*******************************************************************************
|
||||||
|
* Copyright (C) 2013 Stefan Schroeder
|
||||||
|
*
|
||||||
|
* This library is free software; you can redistribute it and/or
|
||||||
|
* modify it under the terms of the GNU Lesser General Public
|
||||||
|
* License as published by the Free Software Foundation; either
|
||||||
|
* version 3.0 of the License, or (at your option) any later version.
|
||||||
|
*
|
||||||
|
* This library is distributed in the hope that it will be useful,
|
||||||
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||||||
|
* Lesser General Public License for more details.
|
||||||
|
*
|
||||||
|
* You should have received a copy of the GNU Lesser General Public
|
||||||
|
* License along with this library. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
******************************************************************************/
|
||||||
|
package jsprit.examples;
|
||||||
|
|
||||||
|
import java.util.Arrays;
|
||||||
|
import java.util.Collection;
|
||||||
|
|
||||||
|
import jsprit.analysis.toolbox.GraphStreamViewer;
|
||||||
|
import jsprit.analysis.toolbox.GraphStreamViewer.Label;
|
||||||
|
import jsprit.analysis.toolbox.Plotter;
|
||||||
|
import jsprit.analysis.toolbox.SolutionPrinter;
|
||||||
|
import jsprit.core.algorithm.VehicleRoutingAlgorithm;
|
||||||
|
import jsprit.core.algorithm.io.VehicleRoutingAlgorithms;
|
||||||
|
import jsprit.core.problem.VehicleRoutingProblem;
|
||||||
|
import jsprit.core.problem.VehicleRoutingProblem.FleetSize;
|
||||||
|
import jsprit.core.problem.io.VrpXMLWriter;
|
||||||
|
import jsprit.core.problem.job.Shipment;
|
||||||
|
import jsprit.core.problem.solution.VehicleRoutingProblemSolution;
|
||||||
|
import jsprit.core.problem.vehicle.Vehicle;
|
||||||
|
import jsprit.core.problem.vehicle.VehicleImpl;
|
||||||
|
import jsprit.core.problem.vehicle.VehicleImpl.Builder;
|
||||||
|
import jsprit.core.problem.vehicle.VehicleType;
|
||||||
|
import jsprit.core.problem.vehicle.VehicleTypeImpl;
|
||||||
|
import jsprit.core.util.Coordinate;
|
||||||
|
import jsprit.core.util.Solutions;
|
||||||
|
import jsprit.util.Examples;
|
||||||
|
|
||||||
|
|
||||||
|
public class EnRoutePickupAndDeliveryWithMultipleDepotsExample {
|
||||||
|
|
||||||
|
public static void main(String[] args) {
|
||||||
|
/*
|
||||||
|
* some preparation - create output folder
|
||||||
|
*/
|
||||||
|
Examples.createOutputFolder();
|
||||||
|
|
||||||
|
/*
|
||||||
|
* get a vehicle type-builder and build a type with the typeId "vehicleType" and a capacity of 2
|
||||||
|
*/
|
||||||
|
VehicleTypeImpl.Builder vehicleTypeBuilder = VehicleTypeImpl.Builder.newInstance("vehicleType", 2);
|
||||||
|
vehicleTypeBuilder.setCostPerDistance(1.0);
|
||||||
|
VehicleType vehicleType = vehicleTypeBuilder.build();
|
||||||
|
|
||||||
|
/*
|
||||||
|
* define two depots, i.e. two vehicle locations ([10,10],[50,50]) and equip them with an infinite number of vehicles of type 'vehicleType'
|
||||||
|
*/
|
||||||
|
Builder vehicleBuilder1 = VehicleImpl.Builder.newInstance("vehicles@[10,10]");
|
||||||
|
vehicleBuilder1.setLocationCoord(Coordinate.newInstance(10, 10));
|
||||||
|
vehicleBuilder1.setType(vehicleType);
|
||||||
|
Vehicle vehicle1 = vehicleBuilder1.build();
|
||||||
|
|
||||||
|
Builder vehicleBuilder2 = VehicleImpl.Builder.newInstance("vehicles@[50,50]");
|
||||||
|
vehicleBuilder2.setLocationCoord(Coordinate.newInstance(50, 50));
|
||||||
|
vehicleBuilder2.setType(vehicleType);
|
||||||
|
Vehicle vehicle2 = vehicleBuilder2.build();
|
||||||
|
|
||||||
|
|
||||||
|
/*
|
||||||
|
* build shipments at the required locations, each with a capacity-demand of 1.
|
||||||
|
* 4 shipments
|
||||||
|
* 1: (5,7)->(6,9)
|
||||||
|
* 2: (5,13)->(6,11)
|
||||||
|
* 3: (15,7)->(14,9)
|
||||||
|
* 4: (15,13)->(14,11)
|
||||||
|
*/
|
||||||
|
|
||||||
|
Shipment shipment1 = Shipment.Builder.newInstance("1", 1).setPickupCoord(Coordinate.newInstance(5, 7)).setDeliveryCoord(Coordinate.newInstance(6, 9)).build();
|
||||||
|
Shipment shipment2 = Shipment.Builder.newInstance("2", 1).setPickupCoord(Coordinate.newInstance(5, 13)).setDeliveryCoord(Coordinate.newInstance(6, 11)).build();
|
||||||
|
|
||||||
|
Shipment shipment3 = Shipment.Builder.newInstance("3", 1).setPickupCoord(Coordinate.newInstance(15, 7)).setDeliveryCoord(Coordinate.newInstance(14, 9)).build();
|
||||||
|
Shipment shipment4 = Shipment.Builder.newInstance("4", 1).setPickupCoord(Coordinate.newInstance(15, 13)).setDeliveryCoord(Coordinate.newInstance(14, 11)).build();
|
||||||
|
|
||||||
|
Shipment shipment5 = Shipment.Builder.newInstance("5", 1).setPickupCoord(Coordinate.newInstance(55, 57)).setDeliveryCoord(Coordinate.newInstance(56, 59)).build();
|
||||||
|
Shipment shipment6 = Shipment.Builder.newInstance("6", 1).setPickupCoord(Coordinate.newInstance(55, 63)).setDeliveryCoord(Coordinate.newInstance(56, 61)).build();
|
||||||
|
|
||||||
|
Shipment shipment7 = Shipment.Builder.newInstance("7", 1).setPickupCoord(Coordinate.newInstance(65, 57)).setDeliveryCoord(Coordinate.newInstance(64, 59)).build();
|
||||||
|
Shipment shipment8 = Shipment.Builder.newInstance("8", 1).setPickupCoord(Coordinate.newInstance(65, 63)).setDeliveryCoord(Coordinate.newInstance(64, 61)).build();
|
||||||
|
|
||||||
|
|
||||||
|
VehicleRoutingProblem.Builder vrpBuilder = VehicleRoutingProblem.Builder.newInstance();
|
||||||
|
vrpBuilder.addVehicle(vehicle1).addVehicle(vehicle2);
|
||||||
|
vrpBuilder.addJob(shipment1).addJob(shipment2).addJob(shipment3).addJob(shipment4);
|
||||||
|
vrpBuilder.addJob(shipment5).addJob(shipment6).addJob(shipment7).addJob(shipment8);
|
||||||
|
|
||||||
|
vrpBuilder.setFleetSize(FleetSize.FINITE);
|
||||||
|
VehicleRoutingProblem problem = vrpBuilder.build();
|
||||||
|
|
||||||
|
/*
|
||||||
|
* get the algorithm out-of-the-box.
|
||||||
|
*/
|
||||||
|
VehicleRoutingAlgorithm algorithm = VehicleRoutingAlgorithms.readAndCreateAlgorithm(problem, "input/algorithmConfig_noVehicleSwitch.xml");
|
||||||
|
algorithm.setNuOfIterations(30000);
|
||||||
|
/*
|
||||||
|
* and search a solution
|
||||||
|
*/
|
||||||
|
Collection<VehicleRoutingProblemSolution> solutions = algorithm.searchSolutions();
|
||||||
|
|
||||||
|
/*
|
||||||
|
* get the best
|
||||||
|
*/
|
||||||
|
VehicleRoutingProblemSolution bestSolution = Solutions.bestOf(solutions);
|
||||||
|
|
||||||
|
/*
|
||||||
|
* write out problem and solution to xml-file
|
||||||
|
*/
|
||||||
|
new VrpXMLWriter(problem, solutions).write("output/shipment-problem-with-solution.xml");
|
||||||
|
|
||||||
|
/*
|
||||||
|
* print nRoutes and totalCosts of bestSolution
|
||||||
|
*/
|
||||||
|
SolutionPrinter.print(bestSolution);
|
||||||
|
|
||||||
|
/*
|
||||||
|
* plot problem without solution
|
||||||
|
*/
|
||||||
|
Plotter problemPlotter = new Plotter(problem);
|
||||||
|
problemPlotter.plotShipments(true);
|
||||||
|
problemPlotter.plot("output/enRoutePickupAndDeliveryWithMultipleLocationsExample_problem.png", "en-route pickup and delivery");
|
||||||
|
|
||||||
|
/*
|
||||||
|
* plot problem with solution
|
||||||
|
*/
|
||||||
|
Plotter solutionPlotter = new Plotter(problem,Arrays.asList(Solutions.bestOf(solutions).getRoutes().iterator().next()));
|
||||||
|
solutionPlotter.plotShipments(true);
|
||||||
|
solutionPlotter.plot("output/enRoutePickupAndDeliveryWithMultipleLocationsExample_solution.png", "en-route pickup and delivery");
|
||||||
|
|
||||||
|
new GraphStreamViewer(problem,Solutions.bestOf(solutions)).labelWith(Label.ACTIVITY).setRenderDelay(100).setRenderShipments(true).display();
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue