Алгоритмы Оптимизации Маршрутов Движения с Учетом Погодных Условий

The problem of optimal weather routing is considered. The purpose is to find an admissible route providing minimal voyage time or minimal fuel consumptions. The route is accepted as admissible if it allows to avoid static and dynamic alarm zones. Static zones include, for example, coastlines, different forbidden areas and shallow waters. Dynamic zones is the moving areas with a bad weather conditions, for example, strong wind. The proposed computational algorithm is based on a threedimensional representation of the problem, where third dimension is a time axis. In this case the initial task is transformed to a problem of path finding in 3D-space, which avoid obstacles and finish with a minimal value of third coordinate. The results of the simulation experiments for a given weather forecast and alarm zones are presented.