Abstract
A dynamic programming model has been formulated to derive the minimal time sailing route for a vessel to sail from an origin to a destination, while passing n different segments in which deterministic wind conditions prevail. Turning times and crossing wind-lines were considered. A discrete computer solution procedure was programmed that had to cope with ranges of inadmissibility of the continuous decision variables caused by inability to sail at certain angles around a facing wind. Binary search method and iterative refinement schemes were applied to reduce calculation times to the order of magnitude of one minute, while obtaining sufficient accuracy. Numerical examples are provided. Sensitivity analysis has indicated robust behavior of the best derived solutions with respect to changes in the values of the different parameters. Despite of numerical validation the best derived solution is not termed optimal, as optimality was not been proven mathematically.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
