rinde.sim.pdptw.central.arrays.MultiVehicleArraysSolver Maven / Gradle / Ivy
/**
*
*/
package rinde.sim.pdptw.central.arrays;
import javax.annotation.Nullable;
/**
* Interface for solvers for the multi vehicle pickup-and-delivery problem with
* time windows (PDPTW). This interface uses int arrays for
* specification of the inputs and outputs.
*
* Note that usage of this interface is not recommended. The
* {@link rinde.sim.pdptw.central.Solver} interface provides exactly the same
* functionality but in a type safe manner.
* @author Rinde van Lon
*/
public interface MultiVehicleArraysSolver {
/**
* Computes a solution for the multi vehicle PDPTW as specified by the
* parameters. The returned solution does not necessarily need to be optimal
* but it needs to be feasible. The {@link ArraysSolverValidator} can check
* whether a {@link MultiVehicleArraysSolver} produces a valid solution and it
* can check whether the parameters for the {@link MultiVehicleArraysSolver}
* are valid.
*
* All times are in units relative to the current time (0). All constraints
* are soft, i.e. lateness at service locations and at depot are allowed. The
* start location has index 0, the end location (depot) has index n-1.
*
* @param travelTime Parameter as specified by
* {@link SingleVehicleArraysSolver#solve(int[][], int[], int[], int[][], int[], SolutionObject)}
* .
* @param releaseDates Parameter as specified by
* {@link SingleVehicleArraysSolver#solve(int[][], int[], int[], int[][], int[], SolutionObject)}
* .
* @param dueDates Parameter as specified by
* {@link SingleVehicleArraysSolver#solve(int[][], int[], int[], int[][], int[], SolutionObject)}
* .
* @param servicePairs Parameter as specified by
* {@link SingleVehicleArraysSolver#solve(int[][], int[], int[], int[][], int[], SolutionObject)}
* .
* @param serviceTimes Parameter as specified by
* {@link SingleVehicleArraysSolver#solve(int[][], int[], int[], int[][], int[], SolutionObject)}
* .
* @param vehicleTravelTimes v x n matrix, where v
* is the number of vehicles and n is the number of
* locations. Contains travel times from each vehicle to every
* location. Value vehicleTravelTimes[i][j] indicates
* travel time from location of vehicle i to location
* j.
* @param inventories m x 2 matrix of vehicle and location pairs.
* Value at inventories[i][0] indicates the vehicle,
* inventories[i][1] indicates the location. Vehicles
* may occur more than once (i.e. they may have more than one
* location in their inventory). Only delivery locations can be in
* the inventory.
* @param remainingServiceTimes contains the remaining service time for every
* vehicle. The length of this array equals the number of vehicles.
* When remainingServiceTimes[i] > 0 vehicle
* i will be servicing for the specified amount of time.
* The location it is currently servicing is defined by
* currentDestinations[i]. The length of this array
* equals the number of vehicles.
* @param currentDestinations contains a pointer to a location which indicates
* the current destination for every vehicle (or its current service
* location). If the value is 0 for a vehicle, it means
* that the vehicle has no destination or service location. In case a
* vehicle has a destination, the vehicle is obliged to continue
* traveling towards this destination and/or finish servicing it.
* In case remainingServiceTimes[i] > 0 the value at
* currentDestinations[i] points to the current service
* location. The length of this array equals the number of vehicles.
* @param currentSolutions If defined it contains a list of
* {@link SolutionObject}s containing the current routes of the
* vehicles. This can be used as a starting point for a new solution.
* If any new parcels have become known since these current solutions
* were computed these parcels will not be part of the
* solutions. This means that these solutions may not be feasible
* solutions and thus require adaptation.
* @return A solution object for every vehicle. Each location may occur in
* only one route at a time. Routes must respect the inventories, i.e.
* a vehicle with a location in its inventory must have that
* location in its route.
*/
SolutionObject[] solve(int[][] travelTime, int[] releaseDates,
int[] dueDates, int[][] servicePairs, int[] serviceTimes,
int[][] vehicleTravelTimes, int[][] inventories,
int[] remainingServiceTimes, int[] currentDestinations,
@Nullable SolutionObject[] currentSolutions);
}