Planning an airborne search for a relocatable target involves minimizing the riskto the crew while maximizing the estimated likelihood of finding targets. When the number of potential sites is small, the problem reduces to finding the best (usually the shortest) route connecting them. When the number of sites is larger, however, the planner must also decide which of them are to be visited. This report presents a genetic algorithm f or selecting both an appropriate set of sites to visit and an appropriate routing pattern. The procedure also accounts for the finite turning radius of the aircraft. Constrained optimization, Routing, Covering Salesman Problem, Spacefilling Curve, Genetic Algorithm, Traveling Salesman Problem.
展开▼
