Sailboat routing consists in computing the best route for a sailboat taking into account the characteristics of the ship and environmental data such as weather forecast. In the context of sailing races, the best route computation is usually based on the isochrone algorithm, a sub-optimal solution to optimize the time to destination (TtD) criterion by computing a route as a sequence of waypoints. In this paper, we propose to compute a set of possible routes by considering two criteria: the time to destination and the stress. The time to destination is evaluated according to weather forecast and boat polar diagrams. The stress function is a combination of human and environmental factors. The set of possible routes are then obtained by using an iterative multiple objective optimization algorithm. Isochrone algorithm is used for initializing the set of routes. Then mutation operators are used to explore alternative solutions. Applied to realistic test cases, our search strategy allows to obtain routes with very different characteristics in terms of time to destination and stress values, asserted by experimented sailors. Concerning the main objective of minimizing time to destination, we are competitive with commercial software such as MaxSea or Adrena.
Sailboat Routing with Multiple Objectives for Sailing Races
- Share Icon Share
- Search Site
Guillou, Goulven, Lemarchand, Laurent, and Jean-Philippe Babau. "Sailboat Routing with Multiple Objectives for Sailing Races." Paper presented at the SNAME 23rd Chesapeake Sailing Yacht Symposium, Annapolis, Maryland, USA, March 2019.
Download citation file: