87 lines
4.0 KiB
Python
87 lines
4.0 KiB
Python
#!/usr/bin/env python
|
|
|
|
from datetime import datetime, timedelta
|
|
|
|
from aman.sys.aco.Configuration import Configuration
|
|
from aman.sys.aco.Constraints import SpacingConstraints
|
|
from aman.sys.aco.Node import Node
|
|
|
|
class RunwayManager:
|
|
def __init__(self, configuration : Configuration):
|
|
self.Spacings = SpacingConstraints()
|
|
self.Configuration = configuration
|
|
|
|
# initialize the tracker which inbound arrives at which runway
|
|
self.RunwayInbounds = {}
|
|
if None != configuration.PreceedingInbounds:
|
|
for runway in configuration.PreceedingInbounds:
|
|
self.RunwayInbounds[runway] = configuration.PreceedingInbounds[runway]
|
|
for runway in configuration.RunwayConstraints.ActiveArrivalRunways:
|
|
if not runway.Runway.Name in self.RunwayInbounds:
|
|
self.RunwayInbounds[runway.Runway.Name] = None
|
|
|
|
def calculateEarliestArrivalTime(self, runway : str, node : Node, useETA : bool, earliestArrivalTime : datetime):
|
|
constrainedETA = None
|
|
|
|
if None != self.RunwayInbounds[runway]:
|
|
# get the WTC based ETA
|
|
if None == self.RunwayInbounds[runway].Inbound.WTC or None == node.Inbound.WTC:
|
|
spacingWTC = 3
|
|
else:
|
|
spacingWTC = self.Spacings[self.RunwayInbounds[runway].Inbound.WTC][node.Inbound.WTC]
|
|
|
|
# get the runway time spacing
|
|
spacingRunway = self.Configuration.RunwayConstraints.findRunway(runway).Spacing
|
|
constrainedETA = self.RunwayInbounds[runway].Inbound.PlannedArrivalTime + timedelta(minutes = max(spacingWTC, spacingRunway) / (node.Inbound.PerformanceData.SpeedApproach / 60))
|
|
|
|
# calculate the arrival times for the dependent inbounds
|
|
for dependentRunway in self.Configuration.RunwayConstraints.findDependentRunways(runway):
|
|
if None != self.RunwayInbounds[dependentRunway.Runway.Name]:
|
|
# TODO staggered spacing variabel
|
|
candidate = self.RunwayInbounds[dependentRunway.Runway.Name].Inbound.PlannedArrivalTime + timedelta(minutes = 3 / (node.Inbound.PerformanceData.SpeedApproach / 60))
|
|
if None == constrainedETA or candidate > constrainedETA:
|
|
constrainedETA = candidate
|
|
|
|
# get the arrival time on the runway of the inbound
|
|
if True == useETA:
|
|
arrivalTime = node.ArrivalCandidates[runway].EarliestArrivalTime
|
|
else:
|
|
arrivalTime = node.ArrivalCandidates[runway].InitialArrivalTime
|
|
|
|
if None == constrainedETA:
|
|
return max(arrivalTime, earliestArrivalTime), timedelta(seconds = 0)
|
|
else:
|
|
eta = max(constrainedETA, earliestArrivalTime)
|
|
if eta < arrivalTime:
|
|
return arrivalTime, arrivalTime - eta
|
|
else:
|
|
return eta, timedelta(seconds = 0)
|
|
|
|
def selectArrivalRunway(self, node : Node, useETA : bool, earliestArrivalTime : datetime):
|
|
availableRunways = self.Configuration.RunwayConstraints.ActiveArrivalRunways
|
|
|
|
#if 1 < len(availableRunways):
|
|
# TODO filter based on type
|
|
# TODO filter based on airline
|
|
# ensure that at least one runway is available
|
|
|
|
# fallback to check if we have available runways
|
|
if 0 == len(availableRunways):
|
|
runway = self.Configuration.RunwayConstraints.ActiveArrivalRunways[0]
|
|
return runway, self.calculateEarliestArrivalTime(runway.Runway.Name, node, useETA, earliestArrivalTime)
|
|
|
|
# start with the beginning
|
|
selectedRunway = None
|
|
lostTime = None
|
|
eta = None
|
|
|
|
# get the runway with the earliest ETA
|
|
for runway in availableRunways:
|
|
candidate, delta = self.calculateEarliestArrivalTime(runway.Runway.Name, node, useETA, earliestArrivalTime)
|
|
if None == eta or eta > candidate:
|
|
selectedRunway = runway.Runway
|
|
lostTime = delta
|
|
eta = candidate
|
|
|
|
return selectedRunway, eta, lostTime
|