DYNAMIC PROGRAMMING APPLIED TO OCEANOGRAPHIC CAMPAIGN PLANNING
ISBN 978-85-88783-11-9
Authors
1Pessôa, L.A.M.; 2Collazo, R.A.; 3Estellita Lins, M.P.; 4Bahiense, L.; 5de Arruda, E.F.
1CASNAV Email: lampessoa@terra.com.br
2CASNAV Email: rodrigocollazo@gmail.com
3COPPE/UFRJ Email: marcos.estellita.lins@gmail.com
4COPPE/UFRJ Email: laura.bahiense@gmail.com
5COPPE/UFRJ Email: efarruda@pep.ufrj.br
Abstract
Hydrographic and oceanographic surveys usually involve many material, financial and human resources. For this reason it is important to reduce the survey time and thus to use efficiently the corresponding resources. In this case the survey vessel must pass through a set of locations at sea, taking the shortest possible route and visiting each location a single time before returning to its initial departure harbour. This problem is very similar to the Traveling Salesman Problem. However there are some specific operational conditions that require us to develop a customised mathematical formulation to solve it. In this paper we propose a model that is optimally solved by a dynamic programming algorithm.