Airspace configuration model using swarm intelligence based graph partitioning

Sheetal N. Ghorpade

2016 · 13 citations · 13 references

Concepts

Abstract

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.

References

13