ABSTRACT
Nowadays, the problems of search and foraging are studied in several ›elds of applied mathematics, in computer science, and in mathematical biology. In applied mathematics and mathematical biology, this problem is mainly considered as a problem of search for hidden static or dynamic object and is formulated in the probabilistic terms; in computer science, in contrast, it addresses combinatorial search in arrays of data (Knuth, 1998) and ›nding the shortest paths in the networks (Russell & Norvig, 2010).
