All Classes and Interfaces
Class
Description
Created by schroeder on 14.07.14.
Enhanced AbstractInsertionCalculator with more common functionality moved up
to simplify implementation of concrete calculators.
Created by schroeder on 14.07.14.
AbstractVehicle to handle indeces of vehicles.
Event emitted when a solution acceptance decision is made.
Created by schroeder on 09/02/16.
Provides insertion context information about a particular activity.
Optional overrides for activity choices that are normally made during optimization.
Specifies one activity in a route.
Created by schroeder on 08/07/15.
Created by schroeder on 08/07/15.
Created by schroeder on 08/07/15.
Specifies which activity of a job to schedule in a route.
Adaptive spatial filter that learns whether spatial filtering is effective for a given problem.
Result of filtering decision.
Base interface for all algorithm events.
Adapter that bridges the existing fragmented listener interfaces to the unified event system.
Listener interface for receiving algorithm events.
Created by schroeder on 02/08/16.
Average-based regret-k scoring function.
Calculator that calculates average distance between two jobs based on the input-transport costs.
Calculator that calculates average distance between two jobs based on the input-transport costs.
Sequential insertion that processes jobs in random order, inserting each at its best position.
Break extends Service and is intended to model a time-window based driver break.
Created by schroeder on 07/04/16.
Deprecated.
Capacity with an arbitrary number of capacity-dimension.
Builder that builds Capacity
True Best Insertion (Cheapest Insertion) as defined in VRP literature.
Concurrent version of
CheapestInsertion.Created by schroeder on 22/07/15.
Manager that manage hard- and soft constraints, both on route and activity level.
Created by schroeder on 04/02/15.
Created by schroeder on 15/10/15.
Delivery extends Service and is intended to model a Service where smth is UNLOADED (i.e.
Created by schroeder on 12/07/16.
Created by schroeder on 04.12.14.
Interface for search strategy modules that provide dynamic strategy IDs.
Delivery extends Service and is intended to model a Service where smth is UNLOADED (i.e.
Pickup extends Service and is intended to model a Service where smth is LOADED (i.e.
Created by schroeder on 19/05/15.
CostMatrix that allows pre-compiled time and distance-matrices to be considered as
VehicleRoutingTransportCosts
in the VehicleRoutingProblem.Builder that builds the matrix.
Factory that creates a finite fleetmanager.
Created by schroeder on 28.11.14.
Acceptor that accepts solutions to be memorized only better solutions.
Factory that creates the
VehicleRoutingAlgorithm as proposed by Schrimpf et al., 2000 with the following parameters:Hard constraint that evaluates whether a new activity can be inserted between an activity segment (prevAct,nextAct).
Indicates whether a hard activity constraint is fulfilled or not
Hard constraint that evaluates whether a new job (insertionContext.getJob()) can be inserted
existing route (insertionContext.getRoute()).
SkillConstraint that ensures that only vehicles with according skills can serve route and job to be inserted.
Created by schroeder on 14.07.14.
Created by schroeder on 14.07.14.
A ruin-and-recreate module that selects ruin and insertion operators independently.
Factory that creates an infinite fleetmanager.
Interface for all factories that create initial solutions for the specified
VehicleRoutingProblem.Factory methods for creating common insertion operator configurations.
Deprecated.
Captures a breakdown of insertion costs by component.
Data object that collects insertion information.
Event emitted when an insertion is evaluated for a job.
Factory interface for creating insertion strategies.
Context object containing all dependencies needed to create an insertion strategy.
Basic interface for insertion strategies
Event emitted when an iteration completes.
Event emitted when an iteration starts.
Terminates algorithm prematurely based on iterations without any improvement (i.e.
Basic interface for all jobs.
JobActivityFactory that creates the activities to the specified job.
Event emitted when a job is successfully inserted into a route.
Provides context information about a particular job insertion.
Created by schroeder on 11.12.14.
Created by schroeder on 07/01/15.
Created by schroeder on 05/03/15.
Event emitted when a job is removed during the ruin phase.
Event emitted when a job cannot be inserted and remains unassigned.
Created by schroeder on 06/02/17.
Insertion operators for independent selection mode.
Ruin operators for independent selection mode.
Clusters jobs in a route using Kruskal's Minimum Spanning Tree algorithm.
Calculates activity insertion costs locally, i.e.
Created by schroeder on 16.12.14.
Created by schroeder on 11/10/16.
Max-based regret-k scoring function.
Created by schroeder on 15/09/16.
Created by schroeder on 16/01/15.
Pickup extends Service and is intended to model a Service where smth is LOADED (i.e.
Constraint that ensures capacity constraint at each activity.
Position-based regret insertion strategy.
Fast position-based regret insertion with hybrid optimization.
Basic interface for prematureTermination.
Created by schroeder on 10.12.14.
Created by schroeder on 14/01/15.
Event emitted when the recreate (insertion) phase completes.
Event emitted when the recreate (insertion) phase starts.
Insertion based on regret approach.
Insertion based on regret approach.
Insertion based on regret approach.
Insertion based on regret approach with affected-job tracking optimization.
Holds k-best insertion alternatives for a job, sorted by insertion cost.
Represents a single insertion alternative with its route and cost.
Interface for scoring functions that work with k-best insertion alternatives.
Adapter that wraps a legacy RegretScoringFunction to work with the new
RegretKScoringFunction interface.
Factory for creating RegretKScoringFunction instances.
Available regret-k scoring strategies.
Specifies one route in a solution.
Factory methods for creating common ruin operator configurations.
Created by schroeder on 04/08/15.
Ruin strategy that ruins current solution randomly.
Event emitted when the ruin phase completes.
Ruin strategy that removes clusters of jobs identified using Kruskal's MST algorithm.
Listener that listens to the ruin-process.
Factory interface for creating ruin strategies.
Context object containing all dependencies needed to create a ruin strategy.
RuinStrategy that ruins the neighborhood of a randomly selected job.
Revised radial ruin strategy that operates on route activities instead of jobs.
Deprecated.
Ruin strategy that ruins current solution randomly.
Event emitted when the ruin phase starts.
RuinString is adopted from
Ruin strategy that ruins current solution randomly.
ThresholdAcceptance-Function defined by Schrimpf et al.
Factory that creates the
VehicleRoutingAlgorithm as proposed by Schrimpf et al., 2000 with the following parameters:Created by schroeder on 15/10/15.
Service implementation of a job.
Builder that builds a service.
Ensures load constraint for inserting ServiceActivity.
Ensures that capacity constraint is met, i.e.
Shipment is an implementation of Job and consists of a pickup and a delivery of something.
Builder that builds the shipment.
Skill container managing skills
Acceptor that decides whether the newSolution is accepted or not.
Calculates a set of statistics for a solution.
Interface for all solutionCostCalculators which should be the objective-functions of the problem.
Enhanced printer to print the details of a vehicle-routing-problem solution.
Enum to indicate verbose-level.
Specifies a complete solution.
Materializes a
SolutionSpec into a VehicleRoutingProblemSolution.Result of validating a spec against a VRP.
Created by schroeder on 28.07.14.
Manages states.
Emitted after a strategy has been executed (ruin and insertion completed).
Emitted when a search strategy is selected for the current iteration,
before the strategy runs (ruin/recreate).
Sum-based regret-k scoring function.
Created by schroeder on 19/09/15.
Terminates algorithm prematurely based on specified time.
Created by schroeder on 04.12.14.
TimeWindow consists of a startTime and endTime.
Created by schroeder on 20/05/15.
Created by schroeder on 26/05/15.
Basic interface for tour-activities.
Basic interface of job-activies.
Created by schroeder on 23/12/14.
Created by schroeder on 06/02/17.
Updates arrival and end times of activities.
Updates arrival and end times of activities.
Updates arrival and end times of activities.
Updates and memorizes latest operation start times at activities.
Created by schroeder on 15/09/16.
Update to update required skills on route
Updates total costs (i.e.
Default objective function which is the sum of all fixed vehicle and variable
transportation costs, i.e.
Terminates algorithm prematurely based on variationCoefficient (http://en.wikipedia.org/wiki/Coefficient_of_variation).
Basic interface for vehicle-data.
Created by schroeder on 17/05/16.
Implementation of
Vehicle.Builder that builds the vehicle.
Extension of
VehicleImpl representing an unspecified vehicle with the id 'noVehicle'
(to avoid null).Contains the tour, i.e.
Builder that builds the vehicle route.
Interface for overall routing and operation costs.
Algorithm that solves a
VehicleRoutingProblem.Contains and defines the vehicle routing problem.
Builder to build the routing-problem.
Enum that characterizes the fleet-size.
Contains the solution of a vehicle routing problem and its corresponding costs.
Interface for transportCost and transportTime.
CostMatrix that allows pre-compiled time and distance-matrices to be considered as
VehicleRoutingTransportCosts
in the VehicleRoutingProblem.Builder that builds the matrix.
Basic interface for vehicle-type-data.
Implementation of
VehicleType.Builder that builds the vehicle-type.
CostParameter consisting of fixed cost parameter, time-based cost parameter and distance-based cost parameter.
Key to identify similar vehicles
Created by schroeder on 23/07/15.
Selects operators based on their weights using weighted random selection.
Entry holding an operator with its weight.