The problem of searching for a walker that wants to be found, when the walker moves toward the helicopter when it can hear it, is an example of a two sided search problem which is intrinsically difficult to solve. Thomas et al  considered the effectiveness of three standard NATO search paths  for this type of problem. In this paper a genetic algorithm is used to show that more effective search paths exist. In addition it is shown that genetic algorithms can be effective in finding a near optimal path of length 196 when searching a 14×14 cell area, that is a search space of 10100. . . .
Genetic Algorithm Search Space Operational Research Administrative Data Optimal Path
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.
Thomas, L.C., Hulme, P.B.: Searching for targets who want to be found. Journal of the Operational Research Society 48 (1997) 44–52zbMATHCrossRefGoogle Scholar
N.A.T.O.: Manual on Search and Rescue, ATP-10(C), Annex H of Chapter 6. NATO: Brussels (1988)Google Scholar