|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
The interface used by all algorithms to access VRP algorithms.
Method Summary | |
double |
getCost()
Returns the total cost of the solution tours. |
double[] |
getCosts()
Returns the cost of each of the solution tours. |
double[] |
getLoads()
Returns the load for each of the solution tours. |
java.util.Vector[] |
getTours()
Returns the solution tours generated by the algorithm. |
void |
setCapacityConstraint(double maxLoadPerVehicle)
Sets the vehicle capacity constraint. |
void |
setCostConstraint(double maxCostPerVehicle)
Sets the vehicle cost constraint. |
void |
setEdgeKey(java.lang.Object edgeKey)
Sets the key used to select from parallel edges between vertices. |
void |
setGraph(GraphI graph)
Sets the graph for the VRP algorithm. |
void |
setProperties(PropertiesI properties)
Sets the properties object. |
void |
setVehicleCost(double vehicleCost)
Sets the vehicle cost. |
Method Detail |
public void setGraph(GraphI graph)
public void setVehicleCost(double vehicleCost)
public void setCostConstraint(double maxCostPerVehicle)
public void setCapacityConstraint(double maxLoadPerVehicle)
public void setProperties(PropertiesI properties)
public void setEdgeKey(java.lang.Object edgeKey)
public double getCost() throws SolutionNotFoundException
public double[] getCosts() throws SolutionNotFoundException
public double[] getLoads() throws SolutionNotFoundException
public java.util.Vector[] getTours() throws SolutionNotFoundException
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |