|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use NetworkEdge | |
---|---|
edu.mit.ll.group43.surfaceoptimization.dp.factory.cost | |
edu.mit.ll.group43.surfaceoptimization.network | |
edu.mit.ll.group43.surfaceoptimization.network.dp |
Uses of NetworkEdge in edu.mit.ll.group43.surfaceoptimization.dp.factory.cost |
---|
Methods in edu.mit.ll.group43.surfaceoptimization.dp.factory.cost with parameters of type NetworkEdge | |
---|---|
int |
SpotCostStrategy.earliestRelease(NetworkEdge edge)
Returns the earliest release time for the last aircraft of the target without incurring any delay at the runway, without leaving until it is ready and without leaving before the source's last aircraft has already been released. |
int |
OneGapSpotCostStrategy.earliestRelease(NetworkEdge edge)
Determines the earliest time at which the last aircraft of the target node of the given network edge can be released from the spot. |
int |
AllGapsSpotCostStrategy.earliestRelease(NetworkEdge edge)
Determines the earliest time at which the last aircraft of the target node of the given network edge can be released from the spot. |
int |
AllGapsSpotCostStrategy.earliestRelease(NetworkEdge edge,
java.util.ArrayList<Aircraft> sortedTakeOffs)
Determines the earliest time at which the last aircraft of the target node of the given network edge can be released from the spot. |
int |
SpotCostStrategy.getEdgeWeight(NetworkEdge edge)
Returns the calculated edge weight, based on what has already been solved for the source node in the given network edge. |
int |
RunwayCostStrategy.getEdgeWeight(NetworkEdge edge)
Returns the minimum separation time between the source and target nodes of the given edge. |
int |
OneGapForceSpotCostStrategy.getEdgeWeight(NetworkEdge edge)
Returns the additional delay associated with the given edge that is given by the One Gap Force algorithm. |
abstract int |
CostStrategy.getEdgeWeight(NetworkEdge edge)
Returns the additional delay incurred when the optimal spot release time of the last aircraft of the target node of the edge is calculated immediately after that of the source node of the edge. |
int |
AllGapsForceSpotCostStrategy.getEdgeWeight(NetworkEdge edge)
Returns the additional delay associated with scheduling the current aircraft according to the All Gaps Force heuristic algorithm for the given edge in the network. |
int |
AGOGFSpotCostStrategy.getEdgeWeight(NetworkEdge edge)
Returns the additional delay that would be incurred if the optimal spot release time of the last aircraft in the target node was calculated immediately after that of the source node in the optimization. |
void |
SpotCostStrategy.setOptimalValues(NetworkEdge edge,
int distance)
Sets the optimal distance from the beginning, the optimal previous node, and the optimal spot release time of the last aircraft in the target node. |
void |
RunwayCostStrategy.setOptimalValues(NetworkEdge edge,
int distance)
Sets the distance from the beginning and the optimal previous edge that allows this distance to be achieved. |
void |
OneGapForceSpotCostStrategy.setOptimalValues(NetworkEdge edge,
int distance)
Sets the optimal values for the node being solved for as well as its last aircraft. |
abstract void |
CostStrategy.setOptimalValues(NetworkEdge edge,
int distance)
Sets the optimal values of the node currently being solved, as well as for its last aircraft. |
void |
AllGapsForceSpotCostStrategy.setOptimalValues(NetworkEdge edge,
int distance)
Sets the optimal values for the current node and its last aircraft, and saves the spot release sequence that corresponds to those values to the node. |
java.util.ArrayList<Aircraft> |
OneGapSpotCostStrategy.sortedAlphasSoFar(NetworkEdge edge)
Returns a list of aircraft sorted in order of when they are predicted to take off, based on their optimal spot release times. |
java.util.ArrayList<Aircraft> |
OneGapForceSpotCostStrategy.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. |
Uses of NetworkEdge in edu.mit.ll.group43.surfaceoptimization.network |
---|
Methods in edu.mit.ll.group43.surfaceoptimization.network that return types with arguments of type NetworkEdge | |
---|---|
java.util.ArrayList<NetworkEdge> |
NetworkNode.getNextNodes()
Returns a list of edges that originate from this node. |
java.util.ArrayList<NetworkEdge> |
NetworkNode.getPrevNodes()
Returns a list of edges that point to this node. |
Method parameters in edu.mit.ll.group43.surfaceoptimization.network with type arguments of type NetworkEdge | |
---|---|
void |
NetworkNode.setNextNodes(java.util.ArrayList<NetworkEdge> nextNodes)
Sets this node's list of edges that originate from it. |
void |
NetworkNode.setPrevNodes(java.util.ArrayList<NetworkEdge> prevNodes)
Sets this node's list of edges that point to it. |
Uses of NetworkEdge in edu.mit.ll.group43.surfaceoptimization.network.dp |
---|
Methods in edu.mit.ll.group43.surfaceoptimization.network.dp that return NetworkEdge | |
---|---|
NetworkEdge |
CPSNetworkNode.getOptPrevNode()
Get this node's predecessor node that gives it its optimal distance from the start node. |
Methods in edu.mit.ll.group43.surfaceoptimization.network.dp that return types with arguments of type NetworkEdge | |
---|---|
java.util.ArrayList<NetworkEdge> |
SubsequenceGeneratorNode.getNextNodes()
|
java.util.ArrayList<NetworkEdge> |
CPSNetworkNode.getNextNodes()
|
java.util.ArrayList<NetworkEdge> |
SubsequenceGeneratorNode.getPrevNodes()
|
java.util.ArrayList<NetworkEdge> |
CPSNetworkNode.getPrevNodes()
|
Methods in edu.mit.ll.group43.surfaceoptimization.network.dp with parameters of type NetworkEdge | |
---|---|
void |
SubsequenceGeneratorNode.addNextNode(NetworkEdge nextNode)
|
void |
CPSNetworkNode.addNextNode(NetworkEdge nextNode)
Add a relationship to the given node where this node points to it. |
void |
SubsequenceGeneratorNode.addPrevNode(NetworkEdge prevNode)
|
void |
CPSNetworkNode.addPrevNode(NetworkEdge prevNode)
Add a relationship to the given node where this node is pointed to by it. |
void |
CPSNetworkNode.removeNextNode(NetworkEdge nextNode)
Remove the relationship between this node and the given node to which it points. |
void |
CPSNetworkNode.removePrevNode(NetworkEdge prevNode)
Remove the relationship between this node and the given node that points to it. |
void |
CPSNetworkNode.setOptPrevNode(NetworkEdge optPrevNode)
Set this node's predecessor node that gives it its optimal distance from the start node. |
Method parameters in edu.mit.ll.group43.surfaceoptimization.network.dp with type arguments of type NetworkEdge | |
---|---|
void |
SubsequenceGeneratorNode.setNextNodes(java.util.ArrayList<NetworkEdge> nextNodes)
|
void |
CPSNetworkNode.setNextNodes(java.util.ArrayList<NetworkEdge> nextNodes)
|
void |
SubsequenceGeneratorNode.setPrevNodes(java.util.ArrayList<NetworkEdge> prevNodes)
|
void |
CPSNetworkNode.setPrevNodes(java.util.ArrayList<NetworkEdge> prevNodes)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |