Strategic Launch Pad Positioning: Optimizing Drone Path Planning Through Genetic Algorithms

Multi-drone operations face significant efficiency challenges when launch pad locations are predetermined without optimization, leading to suboptimal route configurations and increased travel distances. This research addresses launch pad positioning as a continuous planar location-routing problem (PLRP), developing a genetic algorithm framework integrated with multiple Traveling Salesman Problem (mTSP) solvers to optimize launch pad coordinates within operational areas. The methodology was evaluated through extensive experimentation involving over 17 million test executions across varying problem complexities and compared against brute-force optimization, Particle Swarm Optimization (PSO), and simulated annealing (SA) approaches. The results demonstrate that the genetic algorithm achieves 97–100% solution accuracy relative to exhaustive search methods while reducing computational requirements by four orders of magnitude, requiring an average of 527 iterations compared to 30,000 for PSO and 1000 for SA. Smart initialization strategies and adaptive termination criteria provide additional performance enhancements, reducing computational effort by 94% while maintaining 98.8% solution quality. Statistical validation confirms systematic improvements across all tested scenarios. This research establishes a validated methodological framework for continuous launch pad optimization in UAV operations, providing practical insights for real-world applications where both solution quality and computational efficiency are critical operational factors while acknowledging the simplified energy model limitations that warrant future research into more complex operational dynamics.