Uses of Class
edu.mit.ll.group43.surfaceoptimization.dp.factory.cost.SpotCostStrategy

Packages that use SpotCostStrategy
edu.mit.ll.group43.surfaceoptimization.dp.factory.cost   
 

Uses of SpotCostStrategy in edu.mit.ll.group43.surfaceoptimization.dp.factory.cost
 

Subclasses of SpotCostStrategy 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 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.