On Underwater Vehicle Routing Problem

In the paper we consider a problem of underwater vehicle routing (also called path planning) which can be described as follows: Given positions under water have to be inspected by the mobile robot taking under consideration water currents, minimizing the total time of the inspection. Two elements of such an approach are described here: vehicle positioning method and routing algorithm. We proposed to apply tabu search and dynasearch metaheuristics as routing alogrithms. As efficient metaheuristics, proposed algorithms allows us to determine good solutions (paths) in a very short time.