mirror of
https://github.com/graphhopper/jsprit.git
synced 2020-01-24 07:45:05 +01:00
cleaned up project, i.e. deleted redundant files
This commit is contained in:
Stefan Schroeder
parent
0e851b4802
commit
64ed26e12e
8 changed files with 0 additions and 1640 deletions
|
|
@ -1,256 +0,0 @@
|
|||
package jsprit.core.algorithm;
|
||||
/*******************************************************************************
|
||||
* 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 algorithms;
|
||||
//
|
||||
//import static org.hamcrest.CoreMatchers.is;
|
||||
//import static org.junit.Assert.assertThat;
|
||||
//
|
||||
//import java.util.ArrayList;
|
||||
//import java.util.Collection;
|
||||
//
|
||||
//import org.junit.Before;
|
||||
//import org.junit.Test;
|
||||
//
|
||||
//import util.ManhattanDistanceCalculator;
|
||||
//import algorithms.FindCheaperVehicleAlgo;
|
||||
//import algorithms.TourStateUpdater;
|
||||
//import basics.Coordinate;
|
||||
//import basics.Driver;
|
||||
//import basics.Service;
|
||||
//import basics.TimeWindow;
|
||||
//import basics.Tour;
|
||||
//import basics.TourBuilder;
|
||||
//import basics.Vehicle;
|
||||
//import basics.VehicleFleetManager;
|
||||
//import basics.VehicleFleetManagerImpl;
|
||||
//import basics.VehicleImpl;
|
||||
//import basics.VehicleRoute;
|
||||
//import basics.VehicleRoutingCosts;
|
||||
//import basics.VehicleImpl.Type;
|
||||
//
|
||||
//
|
||||
//public class FindCheaperVehicleTest {
|
||||
//
|
||||
// Tour tour;
|
||||
//
|
||||
// Vehicle heavyVehicle;
|
||||
//
|
||||
// Vehicle lightVehicle;
|
||||
//
|
||||
// VehicleRoutingCosts cost;
|
||||
//
|
||||
// @Before
|
||||
// public void setUp(){
|
||||
//
|
||||
// cost = new VehicleRoutingCosts() {
|
||||
//
|
||||
// @Override
|
||||
// public double getBackwardTransportTime(String fromId, String toId,
|
||||
// double arrivalTime, Driver driver, Vehicle vehicle) {
|
||||
// // TODO Auto-generated method stub
|
||||
// return 0;
|
||||
// }
|
||||
//
|
||||
// @Override
|
||||
// public double getBackwardTransportCost(String fromId, String toId,
|
||||
// double arrivalTime, Driver driver, Vehicle vehicle) {
|
||||
// // TODO Auto-generated method stub
|
||||
// return 0;
|
||||
// }
|
||||
//
|
||||
// @Override
|
||||
// public double getTransportCost(String fromId, String toId, double departureTime, Driver driver, Vehicle vehicle) {
|
||||
//
|
||||
// String[] fromTokens = fromId.split(",");
|
||||
// String[] toTokens = toId.split(",");
|
||||
// double fromX = Double.parseDouble(fromTokens[0]);
|
||||
// double fromY = Double.parseDouble(fromTokens[1]);
|
||||
//
|
||||
// double toX = Double.parseDouble(toTokens[0]);
|
||||
// double toY = Double.parseDouble(toTokens[1]);
|
||||
//
|
||||
// return vehicle.getType().vehicleCostParams.perDistanceUnit*ManhattanDistanceCalculator.calculateDistance(new Coordinate(fromX, fromY), new Coordinate(toX, toY));
|
||||
// }
|
||||
//
|
||||
// @Override
|
||||
// public double getTransportTime(String fromId, String toId, double departureTime, Driver driver, Vehicle vehicle) {
|
||||
// return 0;
|
||||
// }
|
||||
// };
|
||||
//
|
||||
// Type lightType = VehicleImpl.TypeBuilder.newInstance().setId("light").setCapacity(10).setFixedCost(1.0).setCostPerDistance(1.0).build();
|
||||
// lightVehicle = VehicleImpl.VehicleBuilder.newInstance("light").setLocationId("0,0").setType(lightType).build();
|
||||
//
|
||||
// Type heavyType = VehicleImpl.TypeBuilder.newInstance().setId("heavy").setCapacity(10).setFixedCost(2.0).setCostPerDistance(2.0).build();
|
||||
// heavyVehicle = VehicleImpl.VehicleBuilder.newInstance("heavy").setLocationId("0,0").setType(heavyType).build();
|
||||
// }
|
||||
//
|
||||
// @Test
|
||||
// public void runCheaperVehicle_lightIsCheaperThanHeavy_changeVehicle(){
|
||||
// TourStateUpdater tourStateCalculator = new TourStateUpdater(cost, new ExampleTransportCostFunction());
|
||||
//
|
||||
// TourBuilder tourBuilder = new TourBuilder();
|
||||
// Service firstShipment = getService("10,0");
|
||||
// tourBuilder.scheduleStart("0,0", 0.0, Double.MAX_VALUE);
|
||||
// tourBuilder.scheduleDeliveryService(firstShipment);
|
||||
// tourBuilder.scheduleEnd("0,0", 0.0, Double.MAX_VALUE);
|
||||
//
|
||||
// Tour tour = tourBuilder.build();
|
||||
//
|
||||
// VehicleRoute route = new VehicleRoute(tour,new Driver(){},heavyVehicle);
|
||||
// tourStateCalculator.updateTour(route);
|
||||
//
|
||||
// Collection<Vehicle> vehicles = new ArrayList<Vehicle>();
|
||||
// vehicles.add(lightVehicle);
|
||||
// vehicles.add(heavyVehicle);
|
||||
// VehicleFleetManager fleetManager = new VehicleFleetManagerImpl(vehicles);
|
||||
// fleetManager.lock(heavyVehicle);
|
||||
//
|
||||
// FindCheaperVehicleAlgo findCheaperVehicle = new FindCheaperVehicleAlgo(fleetManager, tourStateCalculator);
|
||||
// VehicleRoute newRoute = findCheaperVehicle.runAndGetVehicleRoute(route);
|
||||
//
|
||||
// assertThat(lightVehicle, is(newRoute.getVehicle()));
|
||||
// }
|
||||
//
|
||||
// @Test
|
||||
// public void runCheaperVehicle_costComparisonBetweenHeavyAndLight_keepHeavy(){
|
||||
//
|
||||
//
|
||||
// Type lightType = VehicleImpl.TypeBuilder.newInstance().setId("light").setCapacity(10).setFixedCost(1.0).setCostPerDistance(1.0).build();
|
||||
// lightVehicle = VehicleImpl.VehicleBuilder.newInstance("light").setLocationId("0,0").setType(lightType).build();
|
||||
//
|
||||
// Type heavyType = VehicleImpl.TypeBuilder.newInstance().setId("heavy").setCapacity(10).setFixedCost(2.0).setCostPerDistance(1.0).build();
|
||||
// heavyVehicle = VehicleImpl.VehicleBuilder.newInstance("heavy").setLocationId("0,0").setType(heavyType).build();
|
||||
//
|
||||
//
|
||||
// TourStateUpdater tourStateCalculator = new TourStateUpdater(cost, new ExampleTransportCostFunction());
|
||||
//
|
||||
// TourBuilder tourBuilder = new TourBuilder();
|
||||
// Service firstShipment = getService("10,0");
|
||||
// tourBuilder.scheduleStart("0,0", 0.0, Double.MAX_VALUE);
|
||||
// tourBuilder.scheduleDeliveryService(firstShipment);
|
||||
// tourBuilder.scheduleEnd("0,0", 0.0, Double.MAX_VALUE);
|
||||
//
|
||||
// Tour tour = tourBuilder.build();
|
||||
//
|
||||
//
|
||||
// VehicleRoute route = new VehicleRoute(tour,new Driver(){},heavyVehicle);
|
||||
// tourStateCalculator.updateTour(route);
|
||||
//
|
||||
// Collection<Vehicle> vehicles = new ArrayList<Vehicle>();
|
||||
// vehicles.add(lightVehicle);
|
||||
// vehicles.add(heavyVehicle);
|
||||
// VehicleFleetManager fleetManager = new VehicleFleetManagerImpl(vehicles);
|
||||
// fleetManager.lock(heavyVehicle);
|
||||
//
|
||||
// FindCheaperVehicleAlgo findCheaperVehicle = new FindCheaperVehicleAlgo(fleetManager, tourStateCalculator);
|
||||
// findCheaperVehicle.setWeightFixCosts(0.0);
|
||||
// VehicleRoute newRoute = findCheaperVehicle.runAndGetVehicleRoute(route);
|
||||
//
|
||||
// assertThat(heavyVehicle, is(newRoute.getVehicle()));
|
||||
//
|
||||
// }
|
||||
//
|
||||
// @Test
|
||||
// public void runCheaperVehicle_lightIsTheCheapest_doNotChangeVehicle(){
|
||||
// TourBuilder tourBuilder = new TourBuilder();
|
||||
// Service firstShipment = getService("10,0");
|
||||
// tourBuilder.scheduleStart("0,0", 0.0, Double.MAX_VALUE);
|
||||
// tourBuilder.scheduleDeliveryService(firstShipment);
|
||||
// tourBuilder.scheduleEnd("0,0", 0.0, Double.MAX_VALUE);
|
||||
//
|
||||
// VehicleRoute route = new VehicleRoute(tourBuilder.build(),new Driver(){},lightVehicle);
|
||||
//
|
||||
// Collection<Vehicle> vehicles = new ArrayList<Vehicle>();
|
||||
// vehicles.add(lightVehicle);
|
||||
// vehicles.add(heavyVehicle);
|
||||
// VehicleFleetManager fleetManager = new VehicleFleetManagerImpl(vehicles);
|
||||
// fleetManager.lock(heavyVehicle);
|
||||
//
|
||||
// TourStateUpdater tourStateCalculator = new TourStateUpdater(cost, new ExampleTransportCostFunction());
|
||||
// FindCheaperVehicleAlgo findCheaperVehicle = new FindCheaperVehicleAlgo(fleetManager, tourStateCalculator);
|
||||
// VehicleRoute newRoute = findCheaperVehicle.runAndGetVehicleRoute(route);
|
||||
//
|
||||
// assertThat(lightVehicle, is(newRoute.getVehicle()));
|
||||
//
|
||||
//
|
||||
// }
|
||||
//
|
||||
// @Test
|
||||
// public void runCheaperVehicle_noAlterativeVehicle_doNotChangeVehicle(){
|
||||
// TourBuilder tourBuilder = new TourBuilder();
|
||||
// Service firstShipment = getService("10,0");
|
||||
// tourBuilder.scheduleStart("0,0", 0.0, Double.MAX_VALUE);
|
||||
// tourBuilder.scheduleDeliveryService(firstShipment);
|
||||
// tourBuilder.scheduleEnd("0,0", 0.0, Double.MAX_VALUE);
|
||||
//
|
||||
// VehicleRoute route = new VehicleRoute(tourBuilder.build(),new Driver(){},heavyVehicle);
|
||||
//
|
||||
// Collection<Vehicle> vehicles = new ArrayList<Vehicle>();
|
||||
//// vehicles.add(lightVehicle);
|
||||
// vehicles.add(heavyVehicle);
|
||||
// VehicleFleetManager fleetManager = new VehicleFleetManagerImpl(vehicles);
|
||||
// fleetManager.lock(heavyVehicle);
|
||||
//
|
||||
// TourStateUpdater tourStateCalculator = new TourStateUpdater(cost, new ExampleTransportCostFunction());
|
||||
// FindCheaperVehicleAlgo findCheaperVehicle = new FindCheaperVehicleAlgo(fleetManager, tourStateCalculator);
|
||||
// VehicleRoute newRoute = findCheaperVehicle.runAndGetVehicleRoute(route);
|
||||
//
|
||||
//
|
||||
// assertThat(heavyVehicle, is(newRoute.getVehicle()));
|
||||
//
|
||||
// }
|
||||
//
|
||||
// @Test
|
||||
// public void runCheaperVehicle_noTour_throwException(){
|
||||
// TourBuilder tourBuilder = new TourBuilder();
|
||||
// Service firstShipment = getService("10,0");
|
||||
// tourBuilder.scheduleStart("0,0", 0.0, Double.MAX_VALUE);
|
||||
// tourBuilder.scheduleDeliveryService(firstShipment);
|
||||
// tourBuilder.scheduleEnd("0,0", 0.0, Double.MAX_VALUE);
|
||||
//
|
||||
// VehicleRoute route = new VehicleRoute(null,null,heavyVehicle);
|
||||
//
|
||||
// Collection<Vehicle> vehicles = new ArrayList<Vehicle>();
|
||||
//// vehicles.add(lightVehicle);
|
||||
// vehicles.add(heavyVehicle);
|
||||
// VehicleFleetManager fleetManager = new VehicleFleetManagerImpl(vehicles);
|
||||
// fleetManager.lock(heavyVehicle);
|
||||
//
|
||||
// TourStateUpdater tourStateCalculator = new TourStateUpdater(cost, new ExampleTransportCostFunction());
|
||||
// FindCheaperVehicleAlgo findCheaperVehicle = new FindCheaperVehicleAlgo(fleetManager, tourStateCalculator);
|
||||
// VehicleRoute newRoute = findCheaperVehicle.runAndGetVehicleRoute(route);
|
||||
//
|
||||
// assertThat(heavyVehicle, is(newRoute.getVehicle()));
|
||||
// }
|
||||
//
|
||||
// private Service getService(String to, double serviceTime) {
|
||||
// Service s = Service.Builder.newInstance("s", 0).setLocationId(to).setServiceTime(serviceTime).setTimeWindow(TimeWindow.newInstance(0.0, 20.0)).build();
|
||||
// return s;
|
||||
// }
|
||||
//
|
||||
// private Service getService(String to) {
|
||||
// Service s = getService(to, 0.0);
|
||||
// return s;
|
||||
// }
|
||||
//
|
||||
//
|
||||
//
|
||||
//
|
||||
//
|
||||
//}
|
||||
|
|
@ -1,305 +0,0 @@
|
|||
///*******************************************************************************
|
||||
// * 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.algorithm;
|
||||
//
|
||||
//import static org.junit.Assert.assertEquals;
|
||||
//
|
||||
//import java.util.ArrayList;
|
||||
//import java.util.Arrays;
|
||||
//import java.util.Collection;
|
||||
//import java.util.List;
|
||||
//
|
||||
//import jsprit.core.algorithm.module.Gendreau;
|
||||
//import jsprit.core.algorithm.recreate.BestInsertion;
|
||||
//import jsprit.core.algorithm.recreate.InsertionStrategy;
|
||||
//import jsprit.core.algorithm.recreate.JobInsertionConsideringFixCostsCalculator;
|
||||
//import jsprit.core.algorithm.recreate.JobInsertionCostsCalculator;
|
||||
//import jsprit.core.algorithm.recreate.LocalActivityInsertionCostsCalculator;
|
||||
//import jsprit.core.algorithm.recreate.ServiceInsertionCalculator;
|
||||
//import jsprit.core.algorithm.recreate.VehicleSwitched;
|
||||
//import jsprit.core.algorithm.recreate.VehicleTypeDependentJobInsertionCalculator;
|
||||
//import jsprit.core.algorithm.ruin.RuinRadial;
|
||||
//import jsprit.core.algorithm.ruin.distance.JobDistanceAvgCosts;
|
||||
//import jsprit.core.algorithm.state.StateFactory;
|
||||
//import jsprit.core.algorithm.state.StateManager;
|
||||
//import jsprit.core.problem.VehicleRoutingProblem;
|
||||
//import jsprit.core.problem.constraint.TimeWindowConstraint;
|
||||
//import jsprit.core.problem.cost.VehicleRoutingActivityCosts;
|
||||
//import jsprit.core.problem.cost.VehicleRoutingTransportCosts;
|
||||
//import jsprit.core.problem.driver.Driver;
|
||||
//import jsprit.core.problem.driver.DriverImpl;
|
||||
//import jsprit.core.problem.job.Job;
|
||||
//import jsprit.core.problem.job.Service;
|
||||
//import jsprit.core.problem.solution.VehicleRoutingProblemSolution;
|
||||
//import jsprit.core.problem.solution.route.VehicleRoute;
|
||||
//import jsprit.core.problem.solution.route.activity.ServiceActivity;
|
||||
//import jsprit.core.problem.solution.route.activity.TimeWindow;
|
||||
//import jsprit.core.problem.solution.route.activity.TourActivities;
|
||||
//import jsprit.core.problem.vehicle.FiniteFleetManagerFactory;
|
||||
//import jsprit.core.problem.vehicle.Vehicle;
|
||||
//import jsprit.core.problem.vehicle.VehicleFleetManager;
|
||||
//import jsprit.core.problem.vehicle.VehicleImpl;
|
||||
//import jsprit.core.problem.vehicle.VehicleTypeImpl;
|
||||
//import jsprit.core.util.Coordinate;
|
||||
//import jsprit.core.util.ManhattanDistanceCalculator;
|
||||
//import jsprit.core.util.RouteUtils;
|
||||
//
|
||||
//import org.junit.Before;
|
||||
//import org.junit.Test;
|
||||
//
|
||||
//
|
||||
//public class GendreauPostOptTest {
|
||||
//
|
||||
// TourActivities tour;
|
||||
//
|
||||
// Vehicle heavyVehicle;
|
||||
//
|
||||
// Vehicle lightVehicle1;
|
||||
//
|
||||
// Vehicle lightVehicle2;
|
||||
//
|
||||
// VehicleRoutingTransportCosts cost;
|
||||
//
|
||||
// VehicleRoutingActivityCosts activityCosts;
|
||||
//
|
||||
// VehicleRoutingProblem vrp;
|
||||
//
|
||||
// Service job1;
|
||||
//
|
||||
// Service job2;
|
||||
//
|
||||
// Service job3;
|
||||
//
|
||||
// private StateManager states;
|
||||
//
|
||||
// private List<Vehicle> vehicles;
|
||||
//
|
||||
// private VehicleFleetManager fleetManager;
|
||||
//
|
||||
// private JobInsertionCostsCalculator insertionCalc;
|
||||
//
|
||||
// @Before
|
||||
// public void setUp(){
|
||||
//
|
||||
// cost = new VehicleRoutingTransportCosts() {
|
||||
//
|
||||
// @Override
|
||||
// public double getBackwardTransportTime(String fromId, String toId,
|
||||
// double arrivalTime, Driver driver, Vehicle vehicle) {
|
||||
// // TODO Auto-generated method stub
|
||||
// return 0;
|
||||
// }
|
||||
//
|
||||
// @Override
|
||||
// public double getBackwardTransportCost(String fromId, String toId,
|
||||
// double arrivalTime, Driver driver, Vehicle vehicle) {
|
||||
// // TODO Auto-generated method stub
|
||||
// return 0;
|
||||
// }
|
||||
//
|
||||
// @Override
|
||||
// public double getTransportCost(String fromId, String toId, double departureTime, Driver driver, Vehicle vehicle) {
|
||||
//
|
||||
// String[] fromTokens = fromId.split(",");
|
||||
// String[] toTokens = toId.split(",");
|
||||
// double fromX = Double.parseDouble(fromTokens[0]);
|
||||
// double fromY = Double.parseDouble(fromTokens[1]);
|
||||
//
|
||||
// double toX = Double.parseDouble(toTokens[0]);
|
||||
// double toY = Double.parseDouble(toTokens[1]);
|
||||
//
|
||||
// double costPerDistanceUnit;
|
||||
// if(vehicle != null){
|
||||
// costPerDistanceUnit = vehicle.getType().getVehicleCostParams().perDistanceUnit;
|
||||
// }
|
||||
// else{
|
||||
// costPerDistanceUnit = 1;
|
||||
// }
|
||||
//
|
||||
// return costPerDistanceUnit*ManhattanDistanceCalculator.calculateDistance(new Coordinate(fromX, fromY), new Coordinate(toX, toY));
|
||||
// }
|
||||
//
|
||||
// @Override
|
||||
// public double getTransportTime(String fromId, String toId, double departureTime, Driver driver, Vehicle vehicle) {
|
||||
// return 0;
|
||||
// }
|
||||
// };
|
||||
//
|
||||
// VehicleTypeImpl lightType = VehicleTypeImpl.Builder.newInstance("light", 10).setFixedCost(10).setCostPerDistance(1.0).build();
|
||||
// VehicleTypeImpl heavyType = VehicleTypeImpl.Builder.newInstance("heavy", 10).setFixedCost(30).setCostPerDistance(2.0).build();
|
||||
//
|
||||
// lightVehicle1 = VehicleImpl.Builder.newInstance("light").setLocationId("0,0").setType(lightType).build();
|
||||
// lightVehicle2 = VehicleImpl.Builder.newInstance("light2").setLocationId("0,0").setType(lightType).build();
|
||||
// heavyVehicle = VehicleImpl.Builder.newInstance("heavy").setLocationId("0,0").setType(heavyType).build();
|
||||
//
|
||||
//
|
||||
// job1 = getService("10,0");
|
||||
// job2 = getService("10,10");
|
||||
// job3 = getService("0,10");
|
||||
//
|
||||
// Collection<Job> jobs = new ArrayList<Job>();
|
||||
// jobs.add(job1);
|
||||
// jobs.add(job2);
|
||||
// jobs.add(job3);
|
||||
//
|
||||
// vehicles = Arrays.asList(lightVehicle1,lightVehicle2, heavyVehicle);
|
||||
//
|
||||
//// Collection<Vehicle> vehicles = Arrays.asList(lightVehicle1,lightVehicle2, heavyVehicle);
|
||||
// fleetManager = new FiniteFleetManagerFactory(vehicles).createFleetManager();
|
||||
// states = new StateManager();
|
||||
//
|
||||
// activityCosts = new ExampleActivityCostFunction();
|
||||
//
|
||||
//
|
||||
// ServiceInsertionCalculator standardServiceInsertion = new ServiceInsertionCalculator(cost, new LocalActivityInsertionCostsCalculator(cost, activityCosts), new LoadConstraint(states), new TimeWindowConstraint(states, cost));
|
||||
//
|
||||
//
|
||||
//
|
||||
//
|
||||
// JobInsertionConsideringFixCostsCalculator withFixCost = new JobInsertionConsideringFixCostsCalculator(standardServiceInsertion, states);
|
||||
// withFixCost.setWeightOfFixCost(1.2);
|
||||
//
|
||||
// insertionCalc = new VehicleTypeDependentJobInsertionCalculator(fleetManager, withFixCost);
|
||||
//
|
||||
//// updater = new TourStateUpdater(states, cost, activityCosts);
|
||||
//
|
||||
// }
|
||||
//
|
||||
// @Test
|
||||
// public void whenPostOpt_splitsTour_oneActiveTourBecomeTwoSeperateActiveTours(){
|
||||
// Collection<Job> jobs = new ArrayList<Job>();
|
||||
// jobs.add(job1);
|
||||
// jobs.add(job2);
|
||||
//
|
||||
// vrp = VehicleRoutingProblem.Builder.newInstance().addAllJobs(jobs).addAllVehicles(vehicles).setRoutingCost(cost).build();
|
||||
//
|
||||
// TourActivities tour = new TourActivities();
|
||||
// tour.addActivity(ServiceActivity.newInstance(job1));
|
||||
// tour.addActivity(ServiceActivity.newInstance(job2));
|
||||
//
|
||||
// VehicleRoute route = VehicleRoute.newInstance(tour,DriverImpl.noDriver(),heavyVehicle);
|
||||
//
|
||||
// fleetManager.lock(heavyVehicle);
|
||||
//
|
||||
// UpdateStates stateUpdater = new UpdateStates(states, vrp.getTransportCosts(), vrp.getActivityCosts());
|
||||
// stateUpdater.update(route);
|
||||
//
|
||||
// Collection<VehicleRoute> routes = new ArrayList<VehicleRoute>();
|
||||
// routes.add(route);
|
||||
//// routes.add(new VehicleRoute(getEmptyTour(),getDriver(),getNoVehicle()));
|
||||
//// routes.add(new VehicleRoute(getEmptyTour(),getDriver(),getNoVehicle()));
|
||||
//
|
||||
//
|
||||
// VehicleRoutingProblemSolution sol = new VehicleRoutingProblemSolution(routes, states.getRouteState(route, StateFactory.COSTS).toDouble() + getFixedCosts(routes));
|
||||
//
|
||||
//
|
||||
// assertEquals(110.0, sol.getCost(), 0.5);
|
||||
//
|
||||
//
|
||||
// RuinRadial radialRuin = new RuinRadial(vrp, 0.2, new JobDistanceAvgCosts(vrp.getTransportCosts()));
|
||||
//// radialRuin.addListener(stateUpdater);
|
||||
//
|
||||
// InsertionStrategy insertionStrategy = new BestInsertion(insertionCalc);
|
||||
// insertionStrategy.addListener(stateUpdater);
|
||||
// insertionStrategy.addListener(new VehicleSwitched(fleetManager));
|
||||
// Gendreau postOpt = new Gendreau(vrp, radialRuin, insertionStrategy, fleetManager);
|
||||
//
|
||||
// VehicleRoutingProblemSolution newSolution = postOpt.runAndGetSolution(sol);
|
||||
// newSolution.setCost(getCosts(newSolution,states));
|
||||
//
|
||||
// assertEquals(2,RouteUtils.getNuOfActiveRoutes(newSolution.getRoutes()));
|
||||
// assertEquals(2,newSolution.getRoutes().size());
|
||||
// assertEquals(80.0,newSolution.getCost(),0.5);
|
||||
// }
|
||||
//
|
||||
// private double getFixedCosts(Collection<VehicleRoute> routes) {
|
||||
// double c = 0.0;
|
||||
// for(VehicleRoute r : routes){ c += r.getVehicle().getType().getVehicleCostParams().fix; }
|
||||
// return c;
|
||||
// }
|
||||
//
|
||||
// private double getCosts(VehicleRoutingProblemSolution newSolution, StateManager states) {
|
||||
// double c = 0.0;
|
||||
// for(VehicleRoute r : newSolution.getRoutes()){
|
||||
//
|
||||
// c += states.getRouteState(r, StateFactory.COSTS).toDouble() + r.getVehicle().getType().getVehicleCostParams().fix;
|
||||
//
|
||||
// }
|
||||
// return c;
|
||||
// }
|
||||
//
|
||||
// @Test
|
||||
// public void whenPostOpt_optsRoutesWithMoreThanTwoJobs_oneRouteBecomesTwoRoutes(){
|
||||
// Collection<Job> jobs = new ArrayList<Job>();
|
||||
// jobs.add(job1);
|
||||
// jobs.add(job2);
|
||||
// jobs.add(job3);
|
||||
//
|
||||
// vrp = VehicleRoutingProblem.Builder.newInstance().addAllJobs(jobs).addAllVehicles(vehicles).setRoutingCost(cost).build();
|
||||
//
|
||||
// TourActivities tour = new TourActivities();
|
||||
// tour.addActivity(ServiceActivity.newInstance(job1));
|
||||
// tour.addActivity(ServiceActivity.newInstance(job2));
|
||||
// tour.addActivity(ServiceActivity.newInstance(job3));
|
||||
//
|
||||
// VehicleRoute route = VehicleRoute.newInstance(tour,DriverImpl.noDriver(),heavyVehicle);
|
||||
//
|
||||
// UpdateStates stateUpdater = new UpdateStates(states, vrp.getTransportCosts(), vrp.getActivityCosts());
|
||||
// stateUpdater.update(route);
|
||||
//
|
||||
// fleetManager.lock(heavyVehicle);
|
||||
//
|
||||
// Collection<VehicleRoute> routes = new ArrayList<VehicleRoute>();
|
||||
// routes.add(route);
|
||||
//
|
||||
// VehicleRoutingProblemSolution sol = new VehicleRoutingProblemSolution(routes, route.getCost());
|
||||
// sol.setCost(getCosts(sol,states));
|
||||
//
|
||||
// assertEquals(110.0, sol.getCost(), 0.5);
|
||||
//
|
||||
// RuinRadial radialRuin = new RuinRadial(vrp, 0.2, new JobDistanceAvgCosts(vrp.getTransportCosts()));
|
||||
// InsertionStrategy insertionStrategy = new BestInsertion(insertionCalc);
|
||||
// insertionStrategy.addListener(stateUpdater);
|
||||
// insertionStrategy.addListener(new VehicleSwitched(fleetManager));
|
||||
// Gendreau postOpt = new Gendreau(vrp, radialRuin, insertionStrategy, fleetManager);
|
||||
// postOpt.setShareOfJobsToRuin(1.0);
|
||||
// postOpt.setNuOfIterations(1);
|
||||
//
|
||||
//// postOpt.setWithFix(withFixCost);
|
||||
// VehicleRoutingProblemSolution newSolution = postOpt.runAndGetSolution(sol);
|
||||
// newSolution.setCost(getCosts(newSolution,states));
|
||||
//
|
||||
// assertEquals(2,RouteUtils.getNuOfActiveRoutes(newSolution.getRoutes()));
|
||||
// assertEquals(2,newSolution.getRoutes().size());
|
||||
// assertEquals(80.0,newSolution.getCost(),0.5);
|
||||
// }
|
||||
//
|
||||
// private Service getService(String to, double serviceTime) {
|
||||
// Service s = Service.Builder.newInstance(to, 0).setLocationId(to).setServiceTime(serviceTime).setTimeWindow(TimeWindow.newInstance(0.0, 20.0)).build();
|
||||
//
|
||||
// return s;
|
||||
// }
|
||||
//
|
||||
// private Service getService(String to) {
|
||||
// Service s = getService(to, 0.0);
|
||||
// return s;
|
||||
// }
|
||||
//
|
||||
//
|
||||
//
|
||||
//
|
||||
//}
|
||||
|
|
@ -1,215 +0,0 @@
|
|||
package jsprit.core.algorithm.recreate;
|
||||
/*******************************************************************************
|
||||
* 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 algorithms;
|
||||
//
|
||||
//import java.util.ArrayList;
|
||||
//import java.util.Collection;
|
||||
//import java.util.List;
|
||||
//
|
||||
//import junit.framework.TestCase;
|
||||
//
|
||||
//import org.junit.Test;
|
||||
//
|
||||
//import util.EuclideanDistanceCalculator;
|
||||
//import basics.Coordinate;
|
||||
//import basics.Driver;
|
||||
//import basics.Job;
|
||||
//import basics.Service;
|
||||
//import basics.TimeWindow;
|
||||
//import basics.Tour;
|
||||
//import basics.TourActivity;
|
||||
//import basics.TourBuilder;
|
||||
//import basics.Vehicle;
|
||||
//import basics.VehicleRoutingTransportCosts;
|
||||
|
||||
//
|
||||
//
|
||||
//public class TestAuxilliaryCostCalculatorWithServices extends TestCase{
|
||||
//
|
||||
// AuxilliaryCostCalculator costCalc;
|
||||
//
|
||||
// Tour tour;
|
||||
//
|
||||
// public void setUp(){
|
||||
//
|
||||
// VehicleRoutingTransportCosts cost = new VehicleRoutingTransportCosts() {
|
||||
//
|
||||
// @Override
|
||||
// public double getBackwardTransportTime(String fromId, String toId,
|
||||
// double arrivalTime, Driver driver, Vehicle vehicle) {
|
||||
// // TODO Auto-generated method stub
|
||||
// return 0;
|
||||
// }
|
||||
//
|
||||
// @Override
|
||||
// public double getBackwardTransportCost(String fromId, String toId,
|
||||
// double arrivalTime, Driver driver, Vehicle vehicle) {
|
||||
// // TODO Auto-generated method stub
|
||||
// return 0;
|
||||
// }
|
||||
//
|
||||
// @Override
|
||||
// public double getTransportCost(String fromId, String toId, double departureTime, Driver driver, Vehicle vehicle) {
|
||||
// String[] fromTokens = fromId.split(",");
|
||||
// String[] toTokens = toId.split(",");
|
||||
// double fromX = Double.parseDouble(fromTokens[0]);
|
||||
// double fromY = Double.parseDouble(fromTokens[1]);
|
||||
//
|
||||
// double toX = Double.parseDouble(toTokens[0]);
|
||||
// double toY = Double.parseDouble(toTokens[1]);
|
||||
//
|
||||
// return EuclideanDistanceCalculator.calculateDistance(new Coordinate(fromX, fromY), new Coordinate(toX, toY));
|
||||
// }
|
||||
//
|
||||
// @Override
|
||||
// public double getTransportTime(String fromId, String toId, double departureTime, Driver driver, Vehicle vehicle) {
|
||||
//
|
||||
// return 0;
|
||||
// }
|
||||
// };
|
||||
//
|
||||
// costCalc = AuxilliaryCostCalculator.newInstance(cost, new ExampleTransportCostFunction());
|
||||
//
|
||||
// Service firstService = Service.Builder.newInstance("1", 0).setLocationId("10,0").setTimeWindow(TimeWindow.newInstance(0, 20)).build();
|
||||
// Service secondService = Service.Builder.newInstance("2", 0).setLocationId("0,10").setTimeWindow(TimeWindow.newInstance(0, 20)).build();
|
||||
//
|
||||
// Collection<Job> services = new ArrayList<Job>();
|
||||
// services.add(firstService);
|
||||
// services.add(secondService);
|
||||
//
|
||||
// ActivityStates states = new ActivityStates();
|
||||
// states.initialiseStateOfJobs(services);
|
||||
//
|
||||
// TourBuilder tourBuilder = new TourBuilder();
|
||||
//
|
||||
// tourBuilder.scheduleStart("0,0", 0.0, Double.MAX_VALUE);
|
||||
// tourBuilder.addActivity(states.getActivity(firstService,true));
|
||||
// tourBuilder.addActivity(states.getActivity(secondService,true));
|
||||
// tourBuilder.scheduleEnd("0,0", 0.0, Double.MAX_VALUE);
|
||||
//
|
||||
// tour = tourBuilder.build();
|
||||
// costCalc.setActivityStates(states);
|
||||
//
|
||||
// }
|
||||
//
|
||||
//// @Test
|
||||
//// public void testGetPath(){
|
||||
//// List<TourActivity> path = AuxilliaryCostCalculator.getPath(tour,tour.getStart(), tour.getActivities().get(1));
|
||||
//// assertEquals(3,path.size());
|
||||
//// }
|
||||
////
|
||||
//// @Test
|
||||
//// public void testGetPath_withEnd(){
|
||||
//// List<TourActivity> path = AuxilliaryCostCalculator.getPath(tour,tour.getActivities().get(0), tour.getEnd());
|
||||
//// assertEquals(3,path.size());
|
||||
//// }
|
||||
//
|
||||
//
|
||||
//// public void testCalcTourCost(){
|
||||
//// List<TourActivity> path = AuxilliaryCostCalculator.getPath(tour,tour.getStart(), tour.getActivities().get(1));
|
||||
//// assertEquals(0.0, costCalc.costOfPath(path,0.0,null,null));
|
||||
//// }
|
||||
//
|
||||
//// public void testCalcTourCost2(){
|
||||
//// assertEquals(10.0, costCalc.costOfPath(AuxilliaryCostCalculator.getPath(tour,tour.getActivities().get(0), tour.getActivities().get(2)),0.0,null,null));
|
||||
//// }
|
||||
////
|
||||
//// public void testCalcTourCost3(){
|
||||
//// assertEquals(20.0, costCalc.costOfPath(AuxilliaryCostCalculator.getPath(tour,tour.getActivities().get(2), tour.getActivities().get(6)),0.0,null,null));
|
||||
//// }
|
||||
////
|
||||
//// public void testCalcTourCost4(){
|
||||
//// assertEquals(30.0, costCalc.costOfPath(AuxilliaryCostCalculator.getPath(tour,tour.getActivities().get(0), tour.getActivities().get(6)),0.0,null,null));
|
||||
//// }
|
||||
////
|
||||
//// public void testCalcTourCost5(){
|
||||
//// assertEquals(40.0, costCalc.costOfPath(AuxilliaryCostCalculator.getPath(tour,tour.getActivities().get(1), tour.getActivities().get(7)),0.0,null,null));
|
||||
//// }
|
||||
//
|
||||
//// public void testCalcTourCost6(){
|
||||
//// assertEquals(0.0, costCalc.costOfPath(AuxilliaryCostCalculator.getPath(tour,tour.getActivities().get(1), tour.getActivities().get(1)),0.0,null,null));
|
||||
//// }
|
||||
////
|
||||
//// public void testCalcTourCost7(){
|
||||
//// try{
|
||||
//// double c =costCalc.costOfPath(AuxilliaryCostCalculator.getPath(tour,tour.getActivities().get(1), tour.getActivities().get(0)),0.0,null,null);
|
||||
//// assertTrue(false);
|
||||
//// }
|
||||
//// catch(AssertionError e){
|
||||
//// assertTrue(true);
|
||||
//// }
|
||||
//// catch(IllegalArgumentException e){
|
||||
//// assertTrue(true);
|
||||
//// }
|
||||
//// }
|
||||
////
|
||||
//// public void testCalcTourCost8(){
|
||||
//// try{
|
||||
//// Shipment s = getShipment("10,10","0,10");
|
||||
//// TourActivity pickup = new Pickup(s);
|
||||
////
|
||||
//// double c = costCalc.costOfPath(AuxilliaryCostCalculator.getPath(tour,tour.getActivities().get(0), pickup),0.0,null,null);
|
||||
//// assertTrue(false);
|
||||
//// }
|
||||
//// catch(AssertionError e){
|
||||
//// assertTrue(true);
|
||||
//// }
|
||||
//// catch(IllegalArgumentException e){
|
||||
//// assertTrue(true);
|
||||
//// }
|
||||
//// }
|
||||
////
|
||||
//// public void testBoundary1(){
|
||||
//// assertEquals(40.0, costCalc.costOfPath(AuxilliaryCostCalculator.getPath(tour,tour.getActivities().get(1), tour.getActivities().get(tour.getActivities().size()-1)),0.0,null,null));
|
||||
//// }
|
||||
////
|
||||
//// public void testBoundary2(){
|
||||
//// try{
|
||||
//// costCalc.costOfPath(AuxilliaryCostCalculator.getPath(tour,tour.getActivities().get(tour.getActivities().size()-1), tour.getActivities().get(0)),0.0,null,null);
|
||||
//// assertTrue(false);
|
||||
//// }
|
||||
//// catch(AssertionError e){
|
||||
//// assertTrue(true);
|
||||
//// }
|
||||
//// catch(IllegalArgumentException e){
|
||||
//// assertTrue(true);
|
||||
//// }
|
||||
//// }
|
||||
////
|
||||
////// public void testBoundary3(){
|
||||
////// assertEquals(40.0, costCalc.calculateCost(tour, tour.getActivities().getFirst(), tour.getActivities().getLast(), Double.MAX_VALUE, null, null));
|
||||
////// }
|
||||
//////
|
||||
////// public void testBoundary4(){
|
||||
////// try{
|
||||
////// costCalc.calculateCost(tour, tour.getActivities().getFirst(), tour.getActivities().getLast(), (-1)*Double.MAX_VALUE, null, null);
|
||||
////// assertTrue(false);
|
||||
////// }
|
||||
////// catch(AssertionError e){
|
||||
////// assertTrue(true);
|
||||
////// }
|
||||
////// }
|
||||
////
|
||||
////
|
||||
////
|
||||
//// private Shipment getShipment(String string, String string2) {
|
||||
//// Shipment s = Shipment.Builder.newInstance("first", 0).setFromId(string).setToId(string2).setPickupTW(TimeWindow.newInstance(0.0, 20.0)).setDeliveryTW(TimeWindow.newInstance(0.0, 20.0)).build();
|
||||
//// return s;
|
||||
//// }
|
||||
////
|
||||
//}
|
||||
Loading…
Add table
Add a link
Reference in a new issue