  In this paper, we present a novel algorithm called the Hybrid Search
algorithm that integrates the Zermelo's Navigation Initial Value Problem with
the Ferraro-Mart\'in de Diego-Almagro algorithm to find the optimal route for a
vessel to reach its destination. Our algorithm is designed to work in both
Euclidean and spherical spaces and utilizes a heuristic that allows the vessel
to move forward while remaining within a predetermined search cone centred
around the destination. This approach not only improves efficiency but also
includes obstacle avoidance, making it well-suited for real-world applications.
We evaluate the performance of the Hybrid Search algorithm on synthetic vector
fields and real ocean currents data, demonstrating its effectiveness and
performance.
