Efficient Airspace Scheduling for Military Exercises: A 3D Bin Packing Approach
Main Article Content
Research
3D Bin Packing Problem, Airspace Allocation, Scheduling Optimization
Abstract
Emerald Flag is a military exercise hosted by the 96th Test Wing at Eglin Air Force Base, FL. In its latest iteration, 10 aircraft platforms flew 26 total missions over two days. The current manual airspace allocation process is not only highly time-consuming but also growing exponentially in complexity as more participants join. Our project aims to minimize time dedicated to scheduling by developing a 3D Bin Packing Problem (3D-BPP) model limited by unique airspace assignment constraints. Our model's objective is to maximize the number of missions per day while adhering to safety requirements. Utilizing scheduling requests crafted by the 96th, we find the model generates a feasible schedule in 80 fewer work-hours than current processes and increases daily mission capacity by 18 missions while maintaining operational safety. In conclusion, the 3D-BPP model is a flexible, efficient solution for military test range scheduling that is easily adaptable for similar exercises.