mirror of
https://github.com/graphhopper/jsprit.git
synced 2020-01-24 07:45:05 +01:00
add SolutionPrinter to core
This commit is contained in:
Stefan Schroeder
parent
78ec852f86
commit
7cff3c58ec
1 changed files with 178 additions and 0 deletions
|
|
@ -0,0 +1,178 @@
|
||||||
|
/*******************************************************************************
|
||||||
|
* 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.core.reporting;
|
||||||
|
|
||||||
|
import jsprit.core.problem.VehicleRoutingProblem;
|
||||||
|
import jsprit.core.problem.job.Job;
|
||||||
|
import jsprit.core.problem.job.Service;
|
||||||
|
import jsprit.core.problem.job.Shipment;
|
||||||
|
import jsprit.core.problem.solution.VehicleRoutingProblemSolution;
|
||||||
|
import jsprit.core.problem.solution.route.VehicleRoute;
|
||||||
|
import jsprit.core.problem.solution.route.activity.TourActivity;
|
||||||
|
import jsprit.core.problem.solution.route.activity.TourActivity.JobActivity;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Printer to print the details of a vehicle-routing-problem solution.
|
||||||
|
*
|
||||||
|
* @author stefan schroeder
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
public class SolutionPrinter {
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Enum to indicate verbose-level.
|
||||||
|
*
|
||||||
|
* <p> Print.CONCISE and Print.VERBOSE are available.
|
||||||
|
*
|
||||||
|
* @author stefan schroeder
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
public enum Print {
|
||||||
|
|
||||||
|
CONCISE,VERBOSE
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Prints costs and #vehicles to stdout (System.out.println).
|
||||||
|
*
|
||||||
|
* @param solution
|
||||||
|
*/
|
||||||
|
public static void print(VehicleRoutingProblemSolution solution){
|
||||||
|
System.out.println("[costs="+solution.getCost() + "]");
|
||||||
|
System.out.println("[#vehicles="+solution.getRoutes().size() + "]");
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
private static class Jobs {
|
||||||
|
int nServices;
|
||||||
|
int nShipments;
|
||||||
|
public Jobs(int nServices, int nShipments) {
|
||||||
|
super();
|
||||||
|
this.nServices = nServices;
|
||||||
|
this.nShipments = nShipments;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
public static void print(VehicleRoutingProblem problem, VehicleRoutingProblemSolution solution, Print print){
|
||||||
|
String leftAlign = "| %-13s | %-8s | %n";
|
||||||
|
|
||||||
|
System.out.format("+--------------------------+%n");
|
||||||
|
System.out.printf("| problem |%n");
|
||||||
|
System.out.format("+---------------+----------+%n");
|
||||||
|
System.out.printf("| indicator | value |%n");
|
||||||
|
System.out.format("+---------------+----------+%n");
|
||||||
|
|
||||||
|
System.out.format(leftAlign, "nJobs", problem.getJobs().values().size());
|
||||||
|
Jobs jobs = getNuOfJobs(problem);
|
||||||
|
System.out.format(leftAlign, "nServices",jobs.nServices);
|
||||||
|
System.out.format(leftAlign, "nShipments",jobs.nShipments);
|
||||||
|
System.out.format(leftAlign, "fleetsize",problem.getFleetSize().toString());
|
||||||
|
System.out.format("+--------------------------+%n");
|
||||||
|
|
||||||
|
|
||||||
|
String leftAlignSolution = "| %-13s | %-40s | %n";
|
||||||
|
System.out.format("+----------------------------------------------------------+%n");
|
||||||
|
System.out.printf("| solution |%n");
|
||||||
|
System.out.format("+---------------+------------------------------------------+%n");
|
||||||
|
System.out.printf("| indicator | value |%n");
|
||||||
|
System.out.format("+---------------+------------------------------------------+%n");
|
||||||
|
System.out.format(leftAlignSolution, "costs",solution.getCost());
|
||||||
|
System.out.format(leftAlignSolution, "nVehicles",solution.getRoutes().size());
|
||||||
|
System.out.format("+----------------------------------------------------------+%n");
|
||||||
|
|
||||||
|
if(print.equals(Print.VERBOSE)){
|
||||||
|
printVerbose(problem,solution);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
private static void printVerbose(VehicleRoutingProblem problem, VehicleRoutingProblemSolution solution) {
|
||||||
|
String leftAlgin = "| %-7s | %-20s | %-21s | %-15s | %-15s | %-15s | %-15s |%n";
|
||||||
|
System.out.format("+--------------------------------------------------------------------------------------------------------------------------------+%n");
|
||||||
|
System.out.printf("| detailed solution |%n");
|
||||||
|
System.out.format("+---------+----------------------+-----------------------+-----------------+-----------------+-----------------+-----------------+%n");
|
||||||
|
System.out.printf("| route | vehicle | activity | job | arrTime | endTime | costs |%n");
|
||||||
|
int routeNu = 1;
|
||||||
|
for(VehicleRoute route : solution.getRoutes()){
|
||||||
|
System.out.format("+---------+----------------------+-----------------------+-----------------+-----------------+-----------------+-----------------+%n");
|
||||||
|
double costs = 0;
|
||||||
|
System.out.format(leftAlgin, routeNu, route.getVehicle().getId(), route.getStart().getName(), "-", "undef", Math.round(route.getStart().getEndTime()),Math.round(costs));
|
||||||
|
TourActivity prevAct = route.getStart();
|
||||||
|
for(TourActivity act : route.getActivities()){
|
||||||
|
String jobId;
|
||||||
|
if(act instanceof JobActivity) jobId = ((JobActivity)act).getJob().getId();
|
||||||
|
else jobId = "-";
|
||||||
|
double c = problem.getTransportCosts().getTransportCost(prevAct.getLocationId(), act.getLocationId(), prevAct.getEndTime(), route.getDriver(), route.getVehicle());
|
||||||
|
c+= problem.getActivityCosts().getActivityCost(act, act.getArrTime(), route.getDriver(), route.getVehicle());
|
||||||
|
costs+=c;
|
||||||
|
System.out.format(leftAlgin, routeNu, route.getVehicle().getId(), act.getName(), jobId, Math.round(act.getArrTime()), Math.round(act.getEndTime()),Math.round(costs));
|
||||||
|
prevAct=act;
|
||||||
|
}
|
||||||
|
double c = problem.getTransportCosts().getTransportCost(prevAct.getLocationId(), route.getEnd().getLocationId(), prevAct.getEndTime(), route.getDriver(), route.getVehicle());
|
||||||
|
c+= problem.getActivityCosts().getActivityCost(route.getEnd(), route.getEnd().getArrTime(), route.getDriver(), route.getVehicle());
|
||||||
|
costs+=c;
|
||||||
|
System.out.format(leftAlgin, routeNu, route.getVehicle().getId(), route.getEnd().getName(), "-", Math.round(route.getEnd().getArrTime()), "undef", Math.round(costs));
|
||||||
|
routeNu++;
|
||||||
|
}
|
||||||
|
System.out.format("+--------------------------------------------------------------------------------------------------------------------------------+%n");
|
||||||
|
}
|
||||||
|
|
||||||
|
private static Jobs getNuOfJobs(VehicleRoutingProblem problem) {
|
||||||
|
int nShipments = 0;
|
||||||
|
int nServices = 0;
|
||||||
|
for(Job j : problem.getJobs().values()){
|
||||||
|
if(j instanceof Shipment) nShipments++;
|
||||||
|
if(j instanceof Service) nServices++;
|
||||||
|
}
|
||||||
|
return new Jobs(nServices,nShipments);
|
||||||
|
}
|
||||||
|
|
||||||
|
// /**
|
||||||
|
// * Prints the details of the solution according to a print-level, i.e. Print.CONCISE or PRINT.VERBOSE.
|
||||||
|
// *
|
||||||
|
// * <p>CONCISE prints total-costs and #vehicles.
|
||||||
|
// * <p>VERBOSE prints the route-details additionally. If the DefaultVehicleRouteCostCalculator (which is the standard-calculator)
|
||||||
|
// * is used in VehicleRoute, then route-costs are differentiated further between transport, activity, vehicle, driver and other-costs.
|
||||||
|
// *
|
||||||
|
// * @param solution
|
||||||
|
// * @param level
|
||||||
|
// *
|
||||||
|
// * @deprecated is not going to work anymore
|
||||||
|
// */
|
||||||
|
// @Deprecated
|
||||||
|
// public static void print(VehicleRoutingProblemSolution solution, Print level){
|
||||||
|
// if(level.equals(Print.CONCISE)){
|
||||||
|
// print(solution);
|
||||||
|
// }
|
||||||
|
// else{
|
||||||
|
// print(solution);
|
||||||
|
// System.out.println("routes");
|
||||||
|
// int routeCount = 1;
|
||||||
|
// for(VehicleRoute route : solution.getRoutes()){
|
||||||
|
// System.out.println("[route="+routeCount+"][departureTime="+route.getStart().getEndTime()+"[total=" + route.getCost() + "]");
|
||||||
|
// if(route.getVehicleRouteCostCalculator() instanceof DefaultVehicleRouteCostCalculator){
|
||||||
|
// DefaultVehicleRouteCostCalculator defaultCalc = (DefaultVehicleRouteCostCalculator) route.getVehicleRouteCostCalculator();
|
||||||
|
// System.out.println("[transport=" + defaultCalc.getTpCosts() + "][activity=" + defaultCalc.getActCosts() +
|
||||||
|
// "][vehicle=" + defaultCalc.getVehicleCosts() + "][driver=" + defaultCalc.getDriverCosts() + "][other=" + defaultCalc.getOther() + "]");
|
||||||
|
// }
|
||||||
|
// routeCount++;
|
||||||
|
// }
|
||||||
|
// }
|
||||||
|
//
|
||||||
|
//
|
||||||
|
// }
|
||||||
|
|
||||||
|
}
|
||||||
Loading…
Add table
Add a link
Reference in a new issue