mirror of
https://github.com/graphhopper/jsprit.git
synced 2020-01-24 07:45:05 +01:00
6dbcd7431a
access-egress-costs-merged-with-routes-with-spec-start-end Conflicts: jsprit-core/src/test/java/jsprit/core/algorithm/recreate/TestCalculatesServiceInsertion.java jsprit-examples/src/main/java/jsprit/examples/MultipleDepotExampleWithPenaltyVehicles.java jsprit-examples/src/main/java/jsprit/examples/SolomonExample.java jsprit-examples/src/main/java/jsprit/examples/SolomonOpenExample.java
109 lines
4 KiB
Java
109 lines
4 KiB
Java
/*******************************************************************************
|
|
* 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.Collection;
|
|
|
|
import jsprit.analysis.toolbox.Plotter;
|
|
import jsprit.analysis.toolbox.Plotter.Label;
|
|
import jsprit.analysis.toolbox.SolutionPrinter;
|
|
import jsprit.core.algorithm.VehicleRoutingAlgorithm;
|
|
import jsprit.core.algorithm.box.SchrimpfFactory;
|
|
import jsprit.core.problem.VehicleRoutingProblem;
|
|
import jsprit.core.problem.io.VrpXMLWriter;
|
|
import jsprit.core.problem.job.Delivery;
|
|
import jsprit.core.problem.job.Pickup;
|
|
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 SimpleDepotBoundedPickupAndDeliveryExample {
|
|
|
|
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);
|
|
VehicleType vehicleType = vehicleTypeBuilder.build();
|
|
|
|
/*
|
|
* get a vehicle-builder and build a vehicle located at (10,10) with type "vehicleType"
|
|
*/
|
|
Builder vehicleBuilder = VehicleImpl.Builder.newInstance("vehicle");
|
|
vehicleBuilder.setStartLocationCoordinate(Coordinate.newInstance(10, 10));
|
|
vehicleBuilder.setType(vehicleType);
|
|
Vehicle vehicle = vehicleBuilder.build();
|
|
|
|
/*
|
|
* build pickups and deliveries at the required locations, each with a capacity-demand of 1.
|
|
*/
|
|
Pickup pickup1 = (Pickup) Pickup.Builder.newInstance("1", 1).setCoord(Coordinate.newInstance(5, 7)).build();
|
|
Delivery delivery1 = (Delivery) Delivery.Builder.newInstance("2", 1).setCoord(Coordinate.newInstance(5, 13)).build();
|
|
|
|
Pickup pickup2 = (Pickup) Pickup.Builder.newInstance("3", 1).setCoord(Coordinate.newInstance(15, 7)).build();
|
|
Delivery delivery2 = (Delivery) Delivery.Builder.newInstance("4", 1).setCoord(Coordinate.newInstance(15, 13)).build();
|
|
|
|
|
|
VehicleRoutingProblem.Builder vrpBuilder = VehicleRoutingProblem.Builder.newInstance();
|
|
vrpBuilder.addVehicle(vehicle);
|
|
vrpBuilder.addJob(pickup1).addJob(pickup2).addJob(delivery1).addJob(delivery2);
|
|
|
|
|
|
VehicleRoutingProblem problem = vrpBuilder.build();
|
|
|
|
/*
|
|
* get the algorithm out-of-the-box.
|
|
*/
|
|
VehicleRoutingAlgorithm algorithm = new SchrimpfFactory().createAlgorithm(problem);
|
|
|
|
/*
|
|
* and search a solution
|
|
*/
|
|
Collection<VehicleRoutingProblemSolution> solutions = algorithm.searchSolutions();
|
|
|
|
/*
|
|
* get the best
|
|
*/
|
|
VehicleRoutingProblemSolution bestSolution = Solutions.bestOf(solutions);
|
|
|
|
new VrpXMLWriter(problem, solutions).write("output/problem-with-solution.xml");
|
|
|
|
SolutionPrinter.print(bestSolution);
|
|
|
|
/*
|
|
* plot
|
|
*/
|
|
Plotter plotter = new Plotter(problem,bestSolution);
|
|
plotter.setLabel(Label.SIZE);
|
|
plotter.setShowFirstActivity(true);
|
|
plotter.plot("output/solution.png", "solution");
|
|
|
|
}
|
|
|
|
}
|