2016 · 13 citations · 13 references
ComputingAerospace EngineeringMathematicsAircraft DesignFlight MechanicsOptimizationCell DecompositionCombinatorial OptimizationGraph AlgorithmsGraph AnalyticsGraph MiningVoronoi DiagramsAir Transportation NetworksAirspace ConstraintsConfiguration ModelGraph PartitioningGraph-based PartitioningParticle Swarm OptimizationVoronoi Diagram DecompositionWeighted Graph Representations
In this paper dynamic airspace configuration model based on weighted graphs is proposed. Initially weighted graph is set up to describe given airspace using its structure information and traffic data. It includes air routes, airports, way points and crossing points in which air routes is represented by edges and others as vertices of the graph. Workload metric is considered as aircraft count and balanced workload indicates equalize aircraft count among the sectors. Vertices are used as sites of Voronoi diagram to divide the airspace into cells. Accordingly airspace configuration problem is described as weighted graph partitioning problem with objective as minimization of workload by proper sectorization. To solve the problem, graph partitioning algorithm based multilevel method and discrete particle swarm optimization is used. Simulation results show that the sectors generated by proposed method satisfy workload balancing, minimum distance as well as connectivity constraint.
13
A discrete binary version of the particle swarm algorithm
James Kennedy, R.C. Eberhart · 2002 · 4.7K citations
Initial Concepts for Dynamic Airspace Configuration
Parimal Kopardekar, Karl Bilimoria, Banavar Sridhar · 7th AIAA ATIO Conf, 2nd CEIAT Int'l Conf on Innov and Integr in Aero Sciences,17th LTA Systems Tech Conf; followed by 2nd TEOS Forum · 2007 · 105 citations
Engineering, Aerospace Engineering, Transportation Planning +11
Airspace sectoring by evolutionary computation
Daniel Delahaye, Marc Schoenauer, Jean‐Marc Alliot · 2002 · 83 citations · Full text