|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Uses of CPSNetworkNode in edu.mit.ll.group43.surfaceoptimization.dp |
---|
Methods in edu.mit.ll.group43.surfaceoptimization.dp that return types with arguments of type CPSNetworkNode | |
---|---|
java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> |
DPSequencer.removeNextNodes(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> network)
|
Method parameters in edu.mit.ll.group43.surfaceoptimization.dp with type arguments of type CPSNetworkNode | |
---|---|
void |
DPSequencer.printCPSNodes(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> stages)
Test method. |
java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> |
DPSequencer.removeNextNodes(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> network)
|
Uses of CPSNetworkNode in edu.mit.ll.group43.surfaceoptimization.dp.factory.cost |
---|
Methods in edu.mit.ll.group43.surfaceoptimization.dp.factory.cost with parameters of type CPSNetworkNode | |
---|---|
int |
OneGapSpotCostStrategy.earliestReleaseAfter(CPSNetworkNode optPrevNode,
Aircraft leader,
Aircraft follower)
Determines the earliest time at which follower can be released so that it takes off after leader without incurring any runway delay, with respect to the predecessor bound according to the given previous node. |
int |
OneGapSpotCostStrategy.earliestReleaseBetween(CPSNetworkNode optPrevNode,
Aircraft a,
Aircraft b,
Aircraft lastReleased)
Determines the earliest time at which lastReleased can be released from the spot to take off between aircraft a and b without increasing the spot delay of b or incurring any delay at the runway. |
int |
SmartAllGapsSpotCostStrategy.safePrevTimeBound(CPSNetworkNode prevNode,
Aircraft current)
Computes the earliest time at which current can be released, with respect to its release sequence predecessors. |
int |
OneGapForceSpotCostStrategy.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. |
int |
LenientAllGapsForceSpotCostStrategy.safePrevTimeBound(CPSNetworkNode optPrevNode,
Aircraft current)
Returns zero as the "predecessor bound" since setting it the same way that other forcing algorithms set it would limit the invalid sequences that it considers. |
int |
AllGapsSpotCostStrategy.safePrevTimeBound(CPSNetworkNode prevNode,
Aircraft current)
Returns the "predecessor bound" for the current aircraft. |
Method parameters in edu.mit.ll.group43.surfaceoptimization.dp.factory.cost with type arguments of type CPSNetworkNode | |
---|---|
void |
SpotCostStrategy.initializeFirstStage(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> network)
Initializes all nodes in the first stage of the network to have a distance of zero from the beginning, no previous node, and for their last aircraft to have an optimal spot release time equal to that of their spot ready time. |
void |
RunwayCostStrategy.initializeFirstStage(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> network)
Initializes all nodes in the first stage of the network to have zero distance from the beginning and to have a null previous node. |
void |
OneGapForceSpotCostStrategy.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. |
abstract void |
CostStrategy.initializeFirstStage(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> network)
Initializes the first stage of the CPS network so that subsequent stages may be solved for. |
Uses of CPSNetworkNode in edu.mit.ll.group43.surfaceoptimization.dp.factory.edge |
---|
Methods in edu.mit.ll.group43.surfaceoptimization.dp.factory.edge with parameters of type CPSNetworkNode | |
---|---|
void |
ZeroEdgeValueStrategy.insertEdge(CPSNetworkNode a,
CPSNetworkNode b)
Inserts an edge of weight 0 between a and b since edge weights are computed as the network is solved using this strategy. |
void |
MinSeparationEdgeValueStrategy.insertEdge(CPSNetworkNode a,
CPSNetworkNode b)
Inserts an edge between a and b, with a weight equal to the minimum separation time between a and b. |
abstract void |
EdgeValueStrategy.insertEdge(CPSNetworkNode a,
CPSNetworkNode b)
Inserts an edge between nodes a and b in the network and assigns it a value. |
Uses of CPSNetworkNode in edu.mit.ll.group43.surfaceoptimization.dp.factory.netgen |
---|
Methods in edu.mit.ll.group43.surfaceoptimization.dp.factory.netgen that return types with arguments of type CPSNetworkNode | |
---|---|
java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> |
CPSNetworkGenerator.generateCPSNetworkNodeRelationships(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> network)
Adds valid relationships (edges) between the nodes in the given CPS network. |
java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> |
IterativeCPSNetworkGenerator.generateCPSNetworkNodes(java.util.ArrayList<Aircraft> fcfs)
|
java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> |
GeneratorNetworkCPSNetworkGenerator.generateCPSNetworkNodes(java.util.ArrayList<Aircraft> fcfs)
|
abstract java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> |
CPSNetworkGenerator.generateCPSNetworkNodes(java.util.ArrayList<Aircraft> fcfs)
|
java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> |
CPSNetworkGenerator.generateNetwork(java.util.ArrayList<Aircraft> fcfs)
Generates the CPS network on which the Dynamic Programming algorithm will run to find the shortest path and therefore optimal sequence. |
java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> |
CPSNetworkGenerator.markDeadEnds(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> network)
Marks all nodes that can't be visited from either (or both) of the starting or ending nodes. |
java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> |
CPSNetworkGenerator.prune(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> network)
Takes in a marked network and removes all nodes and associated edges that have been marked for removal. |
java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> |
CPSNetworkGenerator.pruneNetwork(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> network)
Applies marking and pruning operations to the given network, then returns it. |
Method parameters in edu.mit.ll.group43.surfaceoptimization.dp.factory.netgen with type arguments of type CPSNetworkNode | |
---|---|
java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> |
CPSNetworkGenerator.generateCPSNetworkNodeRelationships(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> network)
Adds valid relationships (edges) between the nodes in the given CPS network. |
java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> |
CPSNetworkGenerator.markDeadEnds(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> network)
Marks all nodes that can't be visited from either (or both) of the starting or ending nodes. |
java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> |
CPSNetworkGenerator.prune(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> network)
Takes in a marked network and removes all nodes and associated edges that have been marked for removal. |
java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> |
CPSNetworkGenerator.pruneNetwork(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> network)
Applies marking and pruning operations to the given network, then returns it. |
Uses of CPSNetworkNode in edu.mit.ll.group43.surfaceoptimization.dp.factory.node |
---|
Methods in edu.mit.ll.group43.surfaceoptimization.dp.factory.node that return CPSNetworkNode | |
---|---|
CPSNetworkNode |
SmartCPSNetworkNodeFactory.getCPSNetworkNode(Subsequence<Aircraft> seq)
|
CPSNetworkNode |
LenientSmartCPSNetworkNodeFactory.getCPSNetworkNode(Subsequence<Aircraft> seq)
|
CPSNetworkNode |
DefaultCPSNetworkNodeFactory.getCPSNetworkNode(Subsequence<Aircraft> seq)
|
CPSNetworkNode |
CPSNetworkNodeFactory.getCPSNetworkNode(Subsequence<Aircraft> seq)
Creates and returns a CPSNetworkNode that represents the given subsequence of Aircraft. |
Uses of CPSNetworkNode in edu.mit.ll.group43.surfaceoptimization.dp.factory.sequencerecovery |
---|
Methods in edu.mit.ll.group43.surfaceoptimization.dp.factory.sequencerecovery with parameters of type CPSNetworkNode | |
---|---|
void |
SequenceRecoveryStrategy.processPrevNodes(CPSNetworkNode node)
|
void |
NodeContainedSequenceRecoveryStrategy.processPrevNodes(CPSNetworkNode node)
|
void |
BacktrackSequenceRecoveryStrategy.processPrevNodes(CPSNetworkNode node)
|
java.util.ArrayList<Aircraft> |
SequenceRecoveryStrategy.recoverSequence(CPSNetworkNode optEnd)
Recovers the optimal spot release sequence given the final stage node with the shortest path length from the start of the network. |
java.util.ArrayList<Aircraft> |
NodeContainedSequenceRecoveryStrategy.recoverSequence(CPSNetworkNode optEnd)
|
java.util.ArrayList<Aircraft> |
BacktrackSequenceRecoveryStrategy.recoverSequence(CPSNetworkNode optEnd)
|
Uses of CPSNetworkNode in edu.mit.ll.group43.surfaceoptimization.network.dp |
---|
Subclasses of CPSNetworkNode in edu.mit.ll.group43.surfaceoptimization.network.dp | |
---|---|
class |
LenientSmartCPSNetworkNode
|
class |
SmartCPSNetworkNode
A variant of a CPS network node that keeps track of the optimal release sequence that is unique to its optimal release time. |
Methods in edu.mit.ll.group43.surfaceoptimization.network.dp with parameters of type CPSNetworkNode | |
---|---|
int |
CPSNetworkNode.compareTo(CPSNetworkNode other)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |