|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Uses of Aircraft in edu.mit.ll.group43.surfaceoptimization |
---|
Methods in edu.mit.ll.group43.surfaceoptimization that return types with arguments of type Aircraft | |
---|---|
static java.util.ArrayList<Aircraft> |
Driver.generateFcfsSequence(java.lang.String filename)
Use the FCFSReader to construct the FCFS list as an ArrayList of Aircraft |
java.util.ArrayList<Aircraft> |
FcfsSequencer.sequence(java.util.ArrayList<Aircraft> seq)
Simply sets the optimal release times of the aircraft in the given sequence to their respective spot ready times and return the sequence. |
static java.util.ArrayList<Aircraft> |
Driver.sequence(java.util.ArrayList<Aircraft> fcfs)
|
abstract java.util.ArrayList<Aircraft> |
Sequencer.sequence(java.util.ArrayList<Aircraft> seq)
Re-sequences the given FCFS sequence with respect to minimum separation requirements and CPS. |
java.util.ArrayList<Aircraft> |
LookAheadSequencer.sequence(java.util.ArrayList<Aircraft> seq)
|
Methods in edu.mit.ll.group43.surfaceoptimization with parameters of type Aircraft | |
---|---|
int |
LookAheadSequencer.bestStart(java.util.ArrayList<Aircraft> releaseSequence,
Aircraft leader,
Aircraft follower)
Best spot release time where follower is released and takes off after leader. |
boolean |
LookAheadSequencer.canFitBefore(int earlyReleaseBound,
Aircraft current,
Aircraft lastTakeOff)
|
int |
LookAheadSequencer.earliestReleaseAfter(Aircraft lastReleased,
Aircraft leader,
Aircraft follower)
|
int |
LookAheadSequencer.earliestReleaseBetween(Aircraft lastReleased,
Aircraft a,
Aircraft b,
Aircraft current)
|
void |
LookAheadSequencer.placeAircraft(java.util.ArrayList<Aircraft> releaseSequence,
Aircraft prev,
Aircraft first)
|
void |
LookAheadSequencer.placeAircraft(java.util.ArrayList<Aircraft> releaseSequence,
Aircraft prev,
Aircraft first,
Aircraft second)
|
int |
LookAheadSequencer.totalDelay(java.util.ArrayList<Aircraft> releaseSequence,
Aircraft lastRelease,
Aircraft leader,
Aircraft follower)
|
void |
LookAheadSequencer.updateSequence(java.util.ArrayList<Aircraft> seq,
Aircraft first,
Aircraft second)
|
Method parameters in edu.mit.ll.group43.surfaceoptimization with type arguments of type Aircraft | |
---|---|
int |
LookAheadSequencer.bestStart(java.util.ArrayList<Aircraft> releaseSequence,
Aircraft leader,
Aircraft follower)
Best spot release time where follower is released and takes off after leader. |
static void |
Driver.measureSequence(java.util.ArrayList<Aircraft> sequence)
|
static void |
Driver.outputMATLABCode(java.util.ArrayList<Aircraft> sequence)
|
void |
LookAheadSequencer.placeAircraft(java.util.ArrayList<Aircraft> releaseSequence,
Aircraft prev,
Aircraft first)
|
void |
LookAheadSequencer.placeAircraft(java.util.ArrayList<Aircraft> releaseSequence,
Aircraft prev,
Aircraft first,
Aircraft second)
|
java.util.ArrayList<Aircraft> |
FcfsSequencer.sequence(java.util.ArrayList<Aircraft> seq)
Simply sets the optimal release times of the aircraft in the given sequence to their respective spot ready times and return the sequence. |
static java.util.ArrayList<Aircraft> |
Driver.sequence(java.util.ArrayList<Aircraft> fcfs)
|
abstract java.util.ArrayList<Aircraft> |
Sequencer.sequence(java.util.ArrayList<Aircraft> seq)
Re-sequences the given FCFS sequence with respect to minimum separation requirements and CPS. |
java.util.ArrayList<Aircraft> |
LookAheadSequencer.sequence(java.util.ArrayList<Aircraft> seq)
|
int |
LookAheadSequencer.totalDelay(java.util.ArrayList<Aircraft> releaseSequence,
Aircraft lastRelease,
Aircraft leader,
Aircraft follower)
|
void |
LookAheadSequencer.updateSequence(java.util.ArrayList<Aircraft> seq,
Aircraft first,
Aircraft second)
|
static void |
Driver.validateSequence(java.util.ArrayList<Aircraft> sequence)
|
Uses of Aircraft in edu.mit.ll.group43.surfaceoptimization.aircraft |
---|
Methods in edu.mit.ll.group43.surfaceoptimization.aircraft that return Aircraft | |
---|---|
Aircraft |
Aircraft.clone()
|
Methods in edu.mit.ll.group43.surfaceoptimization.aircraft with parameters of type Aircraft | |
---|---|
int |
AircraftSpotReleaseComparator.compare(Aircraft a,
Aircraft b)
|
int |
AircraftSpotReadyComparator.compare(Aircraft a,
Aircraft b)
|
int |
AircraftFileIndexComparator.compare(Aircraft a,
Aircraft b)
|
int |
AircraftAlphaComparator.compare(Aircraft a,
Aircraft b)
|
int |
Aircraft.compareTo(Aircraft other)
|
Uses of Aircraft in edu.mit.ll.group43.surfaceoptimization.analysis |
---|
Method parameters in edu.mit.ll.group43.surfaceoptimization.analysis with type arguments of type Aircraft | |
---|---|
static void |
Logger.compareInvalids(java.util.ArrayList<Aircraft> a,
java.util.ArrayList<Aircraft> b)
|
static void |
Logger.compareInvalids(java.util.ArrayList<Aircraft> a,
java.util.ArrayList<Aircraft> b)
|
static boolean |
Logger.sameSchedule(java.util.ArrayList<Aircraft> a,
java.util.ArrayList<Aircraft> b)
|
static boolean |
Logger.sameSchedule(java.util.ArrayList<Aircraft> a,
java.util.ArrayList<Aircraft> b)
|
Uses of Aircraft in edu.mit.ll.group43.surfaceoptimization.dp |
---|
Methods in edu.mit.ll.group43.surfaceoptimization.dp that return types with arguments of type Aircraft | |
---|---|
java.util.ArrayList<Aircraft> |
DPSequencer.sequence(java.util.ArrayList<Aircraft> seq)
Optimally re-sequences the given FCFS sequence with respect to minimum separation times and CPS using Dynamic Programming. |
Method parameters in edu.mit.ll.group43.surfaceoptimization.dp with type arguments of type Aircraft | |
---|---|
java.util.ArrayList<Aircraft> |
DPSequencer.sequence(java.util.ArrayList<Aircraft> seq)
Optimally re-sequences the given FCFS sequence with respect to minimum separation times and CPS using Dynamic Programming. |
Uses of Aircraft in edu.mit.ll.group43.surfaceoptimization.dp.factory.cost |
---|
Methods in edu.mit.ll.group43.surfaceoptimization.dp.factory.cost that return Aircraft | |
---|---|
static Aircraft |
CostStrategyUtils.lastTakeOff(java.util.ArrayList<Aircraft> sequence)
Returns the aircraft that takes off last in the given sequence, which does not need to be sorted by takeoff times. |
Methods in edu.mit.ll.group43.surfaceoptimization.dp.factory.cost that return types with arguments of type Aircraft | |
---|---|
static java.util.ArrayList<Aircraft> |
CostStrategyUtils.cloneSequence(java.util.ArrayList<Aircraft> sequence)
Returns an ArrayList of clones of the aircraft in the given sequence. |
java.util.ArrayList<Aircraft> |
OneGapForceSpotCostStrategy.sortedAlphasSoFar(java.util.ArrayList<Aircraft> sequence)
Returns a list of aircraft cloned from the given release sequence, sorted by runway ready time. |
java.util.ArrayList<Aircraft> |
OneGapSpotCostStrategy.sortedAlphasSoFar(NetworkEdge edge)
Returns a list of aircraft sorted in order of when they are predicted to take off, based on their optimal spot release times. |
java.util.ArrayList<Aircraft> |
OneGapForceSpotCostStrategy.sortedAlphasSoFar(NetworkEdge edge)
Returns a list of aircraft cloned from the release sequence of the source node of the given edge, sorted by runway ready time. |
java.util.ArrayList<Aircraft> |
AllGapsForceSpotCostStrategy.sortedReleases(java.util.ArrayList<Aircraft> sequence)
Returns an ArrayList of cloned aircraft from the given sequence, sorted in order of their optimal spot release time. |
Methods in edu.mit.ll.group43.surfaceoptimization.dp.factory.cost with parameters of type Aircraft | |
---|---|
boolean |
OneGapSpotCostStrategy.canFitBefore(int earlyReleaseBound,
Aircraft lastReleased,
Aircraft lastTakeOff)
Determines if lastReleased can take off before lastTakeOff, given that it can leave the spot no earlier than earlyReleaseBound, without increasing the spot delay of lastTakeOff or incurring any delay at the runway. |
void |
AllGapsForceSpotCostStrategy.computeValues(Aircraft a,
Aircraft b,
Aircraft current,
java.util.ArrayList<Aircraft> takeOffSequence)
Considers what would happen if the current aircraft were scheduled to take off between aircraft a and b. |
int |
AllGapsForceSpotCostStrategy.earliestGap(java.util.ArrayList<Aircraft> releaseSequence,
Aircraft current,
int limit)
Returns the index of the earliest aircraft it should look at "forcing" (i.e. |
int |
SpotCostStrategy.earliestRelease(Aircraft leader,
Aircraft follower)
Returns the earliest time that the follower aircraft can leave at with the leader aircraft as its direct predecessor, while obeying all constraints. |
int |
SpotCostStrategy.earliestRelease(Aircraft leader,
Aircraft follower,
int predBound)
Returns the earliest time that the follower aircraft can leave at with the leader aircraft as its direct predecessor, while obeying all constraints. |
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.earliestReleaseAfter(int predBound,
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 given predecessor bound. |
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 |
OneGapSpotCostStrategy.earliestReleaseBetween(int predBound,
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 |
AllGapsForceSpotCostStrategy.normalSafePrevTimeBound(java.util.ArrayList<Aircraft> releases,
Aircraft current)
Calculates the "predecessor bound" that should be used when scheduling the current aircraft to take off last in the current projected takeoff sequence. |
int |
OneGapForceSpotCostStrategy.safePrevTimeBound(java.util.ArrayList<Aircraft> releaseSequence,
Aircraft current)
Computes the earliest time at which current can be released, with respect to its release sequence predecessors. |
static int |
CostStrategyUtils.safePrevTimeBound(java.util.ArrayList<Aircraft> releaseSequence,
Aircraft current,
int cps)
Calculates the earliest that the current aircraft should be released from the spot without violating constrained position shifting for the given release sequence. |
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. |
void |
LenientAllGapsForceSpotCostStrategy.scheduleCurrentAircraft(SmartCPSNetworkNode node,
Aircraft current)
Schedules the current aircraft and determines the best sequences that include it according to the best sequences saved in the previous node currently being considered. |
void |
AllGapsForceSpotCostStrategy.scheduleCurrentAircraft(SmartCPSNetworkNode node,
Aircraft current)
Solves for the best schedule where the current aircraft's optimal spot release time is the most recently calculated, when following the previous node currently being considered. |
void |
AllGapsForceSpotCostStrategy.updateScheduleForSequence(java.util.ArrayList<Aircraft> releases,
Aircraft current)
Solves for the best schedule where the current aircraft's optimal spot release time is the most recently calculated, when following the previous node currently being considered, when basing this optimal schedule on the one given. |
Method parameters in edu.mit.ll.group43.surfaceoptimization.dp.factory.cost with type arguments of type Aircraft | |
---|---|
int |
AllGapsForceSpotCostStrategy.adjustTakeOffs(java.util.ArrayList<Aircraft> takeOffSequence,
int startIndex,
int endIndex)
Modifies the given takeoff sequence to not have any conflicts at the runway, and returns the delay caused by this. |
static java.util.ArrayList<Aircraft> |
CostStrategyUtils.cloneSequence(java.util.ArrayList<Aircraft> sequence)
Returns an ArrayList of clones of the aircraft in the given sequence. |
void |
LenientAllGapsForceSpotCostStrategy.compareNormalApproach(java.util.ArrayList<Aircraft> normalSequence,
int normalDelay,
int normalRelease)
Compares scheduling the current aircraft to take off last to the sequences that involve forcing. |
void |
AllGapsForceSpotCostStrategy.compareNormalApproach(java.util.ArrayList<Aircraft> normalSequence,
int normalDelay,
int normalRelease)
Determines if the given "normal" sequence, which schedules the current aircraft to take off last, is better than any of the sequences that force gaps. |
void |
AllGapsForceSpotCostStrategy.computeValues(Aircraft a,
Aircraft b,
Aircraft current,
java.util.ArrayList<Aircraft> takeOffSequence)
Considers what would happen if the current aircraft were scheduled to take off between aircraft a and b. |
int |
AllGapsForceSpotCostStrategy.earliestGap(java.util.ArrayList<Aircraft> releaseSequence,
Aircraft current,
int limit)
Returns the index of the earliest aircraft it should look at "forcing" (i.e. |
int |
AllGapsSpotCostStrategy.earliestRelease(NetworkEdge edge,
java.util.ArrayList<Aircraft> sortedTakeOffs)
Determines the earliest time at which the last aircraft of the target node of the given network edge can be released from the spot. |
static Aircraft |
CostStrategyUtils.lastTakeOff(java.util.ArrayList<Aircraft> sequence)
Returns the aircraft that takes off last in the given sequence, which does not need to be sorted by takeoff times. |
int |
AllGapsForceSpotCostStrategy.normalSafePrevTimeBound(java.util.ArrayList<Aircraft> releases,
Aircraft current)
Calculates the "predecessor bound" that should be used when scheduling the current aircraft to take off last in the current projected takeoff sequence. |
int |
OneGapForceSpotCostStrategy.safePrevTimeBound(java.util.ArrayList<Aircraft> releaseSequence,
Aircraft current)
Computes the earliest time at which current can be released, with respect to its release sequence predecessors. |
static int |
CostStrategyUtils.safePrevTimeBound(java.util.ArrayList<Aircraft> releaseSequence,
Aircraft current,
int cps)
Calculates the earliest that the current aircraft should be released from the spot without violating constrained position shifting for the given release sequence. |
java.util.ArrayList<Aircraft> |
OneGapForceSpotCostStrategy.sortedAlphasSoFar(java.util.ArrayList<Aircraft> sequence)
Returns a list of aircraft cloned from the given release sequence, sorted by runway ready time. |
java.util.ArrayList<Aircraft> |
AllGapsForceSpotCostStrategy.sortedReleases(java.util.ArrayList<Aircraft> sequence)
Returns an ArrayList of cloned aircraft from the given sequence, sorted in order of their optimal spot release time. |
void |
LenientAllGapsForceSpotCostStrategy.updateCurrValues(java.util.ArrayList<Aircraft> sequence,
int totalDelay,
int release)
Tests the given sequence and its associated values against the best recorded values for the previous node currently under consideration. |
void |
AllGapsForceSpotCostStrategy.updateCurrValues(java.util.ArrayList<Aircraft> sequence,
int totalDelay,
int release)
Updates the best sequence found so far for this node and its associated values if the given sequence is valid and incurs less delay than the one currently saved, or if there is no currently saved best sequence for this node. |
void |
AllGapsForceSpotCostStrategy.updateScheduleForSequence(java.util.ArrayList<Aircraft> releases,
Aircraft current)
Solves for the best schedule where the current aircraft's optimal spot release time is the most recently calculated, when following the previous node currently being considered, when basing this optimal schedule on the one given. |
Uses of Aircraft in edu.mit.ll.group43.surfaceoptimization.dp.factory.netgen |
---|
Method parameters in edu.mit.ll.group43.surfaceoptimization.dp.factory.netgen with type arguments of type Aircraft | |
---|---|
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. |
Uses of Aircraft in edu.mit.ll.group43.surfaceoptimization.dp.factory.node |
---|
Method parameters in edu.mit.ll.group43.surfaceoptimization.dp.factory.node with type arguments of type Aircraft | |
---|---|
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 Aircraft in edu.mit.ll.group43.surfaceoptimization.dp.factory.sequencerecovery |
---|
Methods in edu.mit.ll.group43.surfaceoptimization.dp.factory.sequencerecovery that return types with arguments of type Aircraft | |
---|---|
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 Aircraft in edu.mit.ll.group43.surfaceoptimization.input |
---|
Methods in edu.mit.ll.group43.surfaceoptimization.input that return Aircraft | |
---|---|
Aircraft |
TextFCFSReader.nextAircraft()
Creates an Aircraft from the next line in the input file and returns it, or returns null if the end of the file has been reached. |
Aircraft |
FCFSReader.nextAircraft()
Returns the next Aircraft object created from reading the data file. |
Methods in edu.mit.ll.group43.surfaceoptimization.input that return types with arguments of type Aircraft | |
---|---|
java.util.ArrayList<Aircraft> |
Input.generateFcfsSequence(java.lang.String type,
java.lang.String filename)
|
Uses of Aircraft in edu.mit.ll.group43.surfaceoptimization.measurement |
---|
Methods in edu.mit.ll.group43.surfaceoptimization.measurement that return types with arguments of type Aircraft | |
---|---|
static java.util.ArrayList<Aircraft> |
MeasurementUtils.takeoffSequence(java.util.ArrayList<Aircraft> sequence)
Returns the given sequence of aircraft in order of when they will reach the runway based on their spot release times and unimpeded taxi times. |
Method parameters in edu.mit.ll.group43.surfaceoptimization.measurement with type arguments of type Aircraft | |
---|---|
int |
SpotSystemDelayMeasurer.measure(java.util.ArrayList<Aircraft> sequence)
|
int |
SpotMaxDelayMeasurer.measure(java.util.ArrayList<Aircraft> sequence)
|
int |
RunwaySystemDelayMeasurer.measure(java.util.ArrayList<Aircraft> sequence)
|
int |
RunwayMaxDelayMeasurer.measure(java.util.ArrayList<Aircraft> sequence)
|
int |
Measurer.measure(java.util.ArrayList<Aircraft> sequence)
Returns the calculated measure for this aircraft sequence based on what this measurer is measuring. |
int |
CPSDeviationMeasurer.measure(java.util.ArrayList<Aircraft> sequence)
|
static int |
CPSDeviationMeasurer.measure(java.util.ArrayList<Aircraft> sequence,
int cps)
|
static java.util.ArrayList<Aircraft> |
MeasurementUtils.takeoffSequence(java.util.ArrayList<Aircraft> sequence)
Returns the given sequence of aircraft in order of when they will reach the runway based on their spot release times and unimpeded taxi times. |
static int[] |
MeasurementUtils.takeoffTimes(java.util.ArrayList<Aircraft> sequence)
Calculates what the takeoff times will be for the given sequence with respect to minimum separation times being preserved, in order of takeoff. |
Uses of Aircraft in edu.mit.ll.group43.surfaceoptimization.network.dp |
---|
Methods in edu.mit.ll.group43.surfaceoptimization.network.dp that return Aircraft | |
---|---|
Aircraft |
CPSNetworkNode.getLastAircraft()
|
Methods in edu.mit.ll.group43.surfaceoptimization.network.dp that return types with arguments of type Aircraft | |
---|---|
Subsequence<Aircraft> |
CPSNetworkNode.getAircraft()
Get the subsequence of Aircraft this node represents |
java.util.ArrayList<Aircraft> |
LenientSmartCPSNetworkNode.getMostCorrectInvalidSequence()
|
java.util.ArrayList<Aircraft> |
LenientSmartCPSNetworkNode.getMostEfficientInvalidSequence()
|
java.util.ArrayList<Aircraft> |
SmartCPSNetworkNode.getReleaseSequence()
Returns this node's stored spot release sequence. |
Method parameters in edu.mit.ll.group43.surfaceoptimization.network.dp with type arguments of type Aircraft | |
---|---|
void |
LenientSmartCPSNetworkNode.setMostCorrectInvalidSequence(java.util.ArrayList<Aircraft> mostCorrectInvalidSequence)
|
void |
LenientSmartCPSNetworkNode.setMostEfficientInvalidSequence(java.util.ArrayList<Aircraft> mostEfficientInvalidSequence)
|
void |
SmartCPSNetworkNode.setReleaseSequence(java.util.ArrayList<Aircraft> releaseSequence)
Sets this node's spot release sequence. |
Constructor parameters in edu.mit.ll.group43.surfaceoptimization.network.dp with type arguments of type Aircraft | |
---|---|
CPSNetworkNode(Subsequence<Aircraft> aircraft)
Constructs a CPS network node from the given sequence of aircraft. |
|
LenientSmartCPSNetworkNode(Subsequence<Aircraft> aircraft)
|
|
SmartCPSNetworkNode(Subsequence<Aircraft> aircraft)
|
Uses of Aircraft in edu.mit.ll.group43.surfaceoptimization.output |
---|
Method parameters in edu.mit.ll.group43.surfaceoptimization.output with type arguments of type Aircraft | |
---|---|
int[] |
MatlabStochasticCodeOutput.getAircraftTypes(java.util.ArrayList<Aircraft> sequence)
|
int[] |
MatlabStochasticCodeOutput.getOptSpotLeaveTimes(java.util.ArrayList<Aircraft> sequence)
|
int[] |
MatlabStochasticCodeOutput.getOptTakeOffSeqIndexes(java.util.ArrayList<Aircraft> sequence)
|
int[] |
MatlabStochasticCodeOutput.getOptTakeOffTimes(java.util.ArrayList<Aircraft> sequence)
|
int[] |
MatlabStochasticCodeOutput.getOrigRunwayReadyTimes(java.util.ArrayList<Aircraft> sequence)
|
int[] |
MatlabStochasticCodeOutput.getSpotReadyTimes(java.util.ArrayList<Aircraft> sequence)
|
int[] |
MatlabStochasticCodeOutput.getUnimpTaxiTimes(java.util.ArrayList<Aircraft> sequence)
|
abstract void |
ResultsOutput.output(java.io.OutputStream os,
java.util.ArrayList<Aircraft> sequence)
|
void |
PlainTextOutput.output(java.io.OutputStream os,
java.util.ArrayList<Aircraft> sequence)
|
void |
MatlabStochasticCodeOutput.output(java.io.OutputStream os,
java.util.ArrayList<Aircraft> sequence)
|
void |
Output.output(java.io.OutputStream os,
java.util.ArrayList<Aircraft> sequence)
|
void |
MatlabStochasticCodeOutput.setOptTakeOffTimes(java.util.ArrayList<Aircraft> sequence)
|
Uses of Aircraft in edu.mit.ll.group43.surfaceoptimization.validator |
---|
Methods in edu.mit.ll.group43.surfaceoptimization.validator with parameters of type Aircraft | |
---|---|
boolean |
CPSValidator.validate(java.util.ArrayList<Aircraft> seq,
Aircraft start)
|
static boolean |
CPSValidator.validate(java.util.ArrayList<Aircraft> sequence,
Aircraft start,
int cps)
|
Method parameters in edu.mit.ll.group43.surfaceoptimization.validator with type arguments of type Aircraft | |
---|---|
boolean |
Validator.validate(java.util.ArrayList<Aircraft> seq)
Validates that the given sequence obeys the constraint of this Validator. |
boolean |
ReleasedWhenReadyValidator.validate(java.util.ArrayList<Aircraft> seq)
Validates that aircraft are not released from the spot until they are ready at the spot. |
boolean |
NoRepeatedAircraftValidator.validate(java.util.ArrayList<Aircraft> seq)
|
boolean |
CPSValidator.validate(java.util.ArrayList<Aircraft> seq)
Validates that the given sequence does not violate this Validator's CPS constraint. |
boolean |
CPSValidator.validate(java.util.ArrayList<Aircraft> seq,
Aircraft start)
|
static boolean |
CPSValidator.validate(java.util.ArrayList<Aircraft> sequence,
Aircraft start,
int cps)
|
static boolean |
CPSValidator.validate(java.util.ArrayList<Aircraft> sequence,
int cps)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |