mirror of
https://github.com/graphhopper/jsprit.git
synced 2020-01-24 07:45:05 +01:00
112 lines
3.7 KiB
Java
112 lines
3.7 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 examples;
|
|
|
|
import java.io.File;
|
|
import java.util.Collection;
|
|
|
|
import algorithms.VehicleRoutingAlgorithms;
|
|
import algorithms.selectors.SelectBest;
|
|
import analysis.AlgorithmSearchProgressChartListener;
|
|
import analysis.Plotter;
|
|
import analysis.SolutionPlotter;
|
|
import analysis.SolutionPrinter;
|
|
import analysis.Plotter.Label;
|
|
import analysis.SolutionPrinter.Print;
|
|
import basics.VehicleRoutingAlgorithm;
|
|
import basics.VehicleRoutingProblem;
|
|
import basics.VehicleRoutingProblemSolution;
|
|
import basics.VehicleRoutingProblem.Constraint;
|
|
import basics.costs.VehicleRoutingActivityCosts;
|
|
import basics.io.VrpXMLReader;
|
|
import basics.route.Driver;
|
|
import basics.route.TourActivity;
|
|
import basics.route.Vehicle;
|
|
|
|
public class VRPWithBackhaulsExample {
|
|
|
|
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/pickups_and_deliveries_solomon_r101.xml");
|
|
|
|
/*
|
|
* Finally, the problem can be built. By default, transportCosts are crowFlyDistances (as usually used for vrp-instances).
|
|
*/
|
|
vrpBuilder.addProblemConstraint(Constraint.DELIVERIES_FIRST);
|
|
|
|
VehicleRoutingProblem vrp = vrpBuilder.build();
|
|
|
|
// SolutionPlotter.plotVrpAsPNG(vrp, "output/vrpwbh_solomon_r101.png", "pd_r101");
|
|
|
|
/*
|
|
* 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.
|
|
*/
|
|
Plotter plotter = new Plotter(vrp, solution);
|
|
plotter.setLabel(Label.SIZE);
|
|
plotter.setShowFirstActivity(true);
|
|
plotter.plot("output/vrpwbh_solomon_r101_solution.png","vrpwbh_r101");
|
|
|
|
|
|
}
|
|
|
|
}
|