Package edu.mit.ll.group43.surfaceoptimization.dp.factory.cost

Class Summary
AGOGFSpotCostStrategy Solves for the shortest path in the CPS network by combining the One Gap Force and All Gaps algorithms.
AllGapsForceSpotCostStrategy Solves for the shortest path through the CPS network by implementing the All Gaps Force heuristic.
AllGapsForceSpotCostStrategyTest  
AllGapsSpotCostStrategy The spot cost strategy for the All Gaps algorithm.
CostStrategy This abstract class is extended by classes that act as edge cost strategies for the DPSequencer.
CostStrategyUtils A collection of utility methods for cost strategies.
CostStrategyUtilsTest  
LenientAllGapsForceSpotCostStrategy Cost strategy for the Lenient All Gaps Force algorithm.
OneGapForceSpotCostStrategy Spot cost strategy for the One Gap Force algorithm.
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.
RunwayCostStrategy Cost strategy for a dynamic programming sequencer that maximizes throughput at the runway.
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.
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.