|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use edu.mit.ll.group43.surfaceoptimization.dp.factory.cost | |
---|---|
edu.mit.ll.group43.surfaceoptimization.dp.factory | |
edu.mit.ll.group43.surfaceoptimization.dp.factory.cost |
Classes in edu.mit.ll.group43.surfaceoptimization.dp.factory.cost used by edu.mit.ll.group43.surfaceoptimization.dp.factory | |
---|---|
CostStrategy
This abstract class is extended by classes that act as edge cost strategies for the DPSequencer. |
Classes in edu.mit.ll.group43.surfaceoptimization.dp.factory.cost used by edu.mit.ll.group43.surfaceoptimization.dp.factory.cost | |
---|---|
AllGapsForceSpotCostStrategy
Solves for the shortest path through the CPS network by implementing the All Gaps Force heuristic. |
|
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. |
|
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. |
|
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 |