|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use CostStrategy | |
---|---|
edu.mit.ll.group43.surfaceoptimization.dp.factory | |
edu.mit.ll.group43.surfaceoptimization.dp.factory.cost |
Uses of CostStrategy in edu.mit.ll.group43.surfaceoptimization.dp.factory |
---|
Methods in edu.mit.ll.group43.surfaceoptimization.dp.factory that return CostStrategy | |
---|---|
CostStrategy |
AGOGFSpotDPSequencerFactory.getCostStrategy()
|
CostStrategy |
OneGapSpotDPSequencerFactory.getCostStrategy()
|
CostStrategy |
OneGapForceSpotDPSequencerFactory.getCostStrategy()
|
CostStrategy |
SimpleSpotDPSequencerFactory.getCostStrategy()
|
abstract CostStrategy |
DPSequencerFactory.getCostStrategy()
|
CostStrategy |
AllGapsSpotDPSequencerFactory.getCostStrategy()
|
CostStrategy |
RunwayDPSequencerFactory.getCostStrategy()
|
CostStrategy |
AllGapsForceSpotDPSequencerFactory.getCostStrategy()
|
CostStrategy |
LenientAllGapsForceSpotDPSequencerFactory.getCostStrategy()
|
Uses of CostStrategy in edu.mit.ll.group43.surfaceoptimization.dp.factory.cost |
---|
Subclasses of CostStrategy in edu.mit.ll.group43.surfaceoptimization.dp.factory.cost | |
---|---|
class |
AGOGFSpotCostStrategy
Solves for the shortest path in the CPS network by combining the One Gap Force and All Gaps algorithms. |
class |
AllGapsForceSpotCostStrategy
Solves for the shortest path through the CPS network by implementing the All Gaps Force heuristic. |
class |
AllGapsSpotCostStrategy
The spot cost strategy for the All Gaps algorithm. |
class |
LenientAllGapsForceSpotCostStrategy
Cost strategy for the Lenient All Gaps Force algorithm. |
class |
OneGapForceSpotCostStrategy
Spot cost strategy for the One Gap Force algorithm. |
class |
OneGapSpotCostStrategy
The spot cost strategy for the One Gap algorithm, which compares scheduling the current aircraft to take off between the last two projected takeoffs, if it can fit, against scheduling it to take off last. |
class |
RunwayCostStrategy
Cost strategy for a dynamic programming sequencer that maximizes throughput at the runway. |
class |
SmartAllGapsSpotCostStrategy
Spot cost strategy for All Gaps that considers an entire spot release sequence when determining the predecessor bound rather than just the optimal spot release time of the last released aircraft. |
class |
SpotCostStrategy
Cost strategy for optimizing at the spot by setting the optimal spot release times, in addition to the total distance from the start and the optimal previous node. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |