|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectedu.mit.ll.group43.surfaceoptimization.dp.factory.cost.CostStrategy
edu.mit.ll.group43.surfaceoptimization.dp.factory.cost.SpotCostStrategy
edu.mit.ll.group43.surfaceoptimization.dp.factory.cost.OneGapSpotCostStrategy
edu.mit.ll.group43.surfaceoptimization.dp.factory.cost.OneGapForceSpotCostStrategy
public class OneGapForceSpotCostStrategy
Spot cost strategy for the One Gap Force algorithm. This algorithm considers the last gap in the projected take off sequence, and determines whether forcing this gap or scheduling the current aircraft to take off last incurs the least additional delay.
Constructor Summary | |
---|---|
OneGapForceSpotCostStrategy(int cps,
MinimumSeparationCalculator<? extends WeightClass> calc)
|
Method Summary | |
---|---|
int |
getEdgeWeight(NetworkEdge edge)
Returns the additional delay associated with the given edge that is given by the One Gap Force algorithm. |
void |
initializeFirstStage(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> network)
Initializes the first stage of the CPS network so that nodes in subsequent stages can be solved for. |
int |
safePrevTimeBound(java.util.ArrayList<Aircraft> releaseSequence,
Aircraft current)
Computes the earliest time at which current can be released, with respect to its release sequence predecessors. |
int |
safePrevTimeBound(CPSNetworkNode prevNode,
Aircraft current)
Computes the earliest time at which current can be released, with respect to its release sequence predecessors in the spot release sequence of the given previous node. |
void |
setOptimalValues(NetworkEdge edge,
int distance)
Sets the optimal values for the node being solved for as well as its last aircraft. |
java.util.ArrayList<Aircraft> |
sortedAlphasSoFar(java.util.ArrayList<Aircraft> sequence)
Returns a list of aircraft cloned from the given release sequence, sorted by runway ready time. |
java.util.ArrayList<Aircraft> |
sortedAlphasSoFar(NetworkEdge edge)
Returns a list of aircraft cloned from the release sequence of the source node of the given edge, sorted by runway ready time. |
Methods inherited from class edu.mit.ll.group43.surfaceoptimization.dp.factory.cost.OneGapSpotCostStrategy |
---|
canFitBefore, earliestRelease, earliestReleaseAfter, earliestReleaseAfter, earliestReleaseBetween, earliestReleaseBetween |
Methods inherited from class edu.mit.ll.group43.surfaceoptimization.dp.factory.cost.SpotCostStrategy |
---|
earliestRelease, earliestRelease |
Methods inherited from class java.lang.Object |
---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public OneGapForceSpotCostStrategy(int cps, MinimumSeparationCalculator<? extends WeightClass> calc)
Method Detail |
---|
public void setOptimalValues(NetworkEdge edge, int distance)
setOptimalValues
in class SpotCostStrategy
edge
- distance
- public java.util.ArrayList<Aircraft> sortedAlphasSoFar(NetworkEdge edge)
sortedAlphasSoFar
in class OneGapSpotCostStrategy
edge
-
public java.util.ArrayList<Aircraft> sortedAlphasSoFar(java.util.ArrayList<Aircraft> sequence)
sequence
-
public int safePrevTimeBound(CPSNetworkNode prevNode, Aircraft current)
prevNode
- current
-
public int safePrevTimeBound(java.util.ArrayList<Aircraft> releaseSequence, Aircraft current)
releaseSequence
- current
-
public void initializeFirstStage(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> network)
initializeFirstStage
in class SpotCostStrategy
network
- public int getEdgeWeight(NetworkEdge edge)
getEdgeWeight
in class SpotCostStrategy
edge
-
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |