• JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
 
  Bookmark and Share
 
 
Master's Dissertation
DOI
10.11606/D.3.2016.tde-07032016-115426
Document
Author
Full name
Thabiani Cristine Aradi
E-mail
Institute/School/College
Knowledge Area
Date of Defense
Published
São Paulo, 2015
Supervisor
Committee
Mendes, André Bergsten (President)
Brinati, Marco Antonio
Seixas, Michel Povlovitsch
Title in Portuguese
Planejamento de operações de manutenção submarina.
Keywords in Portuguese
Heurísticas
Manutenção submarina
Modelagem matemática
Otimização
Simulação
Abstract in Portuguese
A presente pesquisa buscou resolver o problema de planejamento de operações submarinas através das perspectivas de programação de tarefas e dimensionamento de frota. O problema consistiu em estabelecer a melhor sequência de tarefas a serem atendidas por embarcações levando em consideração sua compatibilidade, regras de sequenciamento e o tamanho da frota. O problema é uma extensão do modelo clássico de roteirização com janelas de tempo com o objetivo de minimizar os custos associados à roteirização e as perdas econômicas associadas às interrupções de produção. A resolução do trabalho concentrou-se no curto e longo prazo, utilizando como principal método de solução a heurística Simulated Anneling por meio de um algoritmo de simulação-otimização.
Title in English
Planning problem of offshore maintenance.
Keywords in English
Heuristics
Mathematical modelling
Optimization
Simulation
Undersea maintenance
Abstract in English
This research aimed at solving the problem of planning underwater operations that involves job scheduling and fleet sizing decisions. The problem consisted in establish the best sequence of tasks to be atended by vessels taking into account compatibility constraints, sequencing rules and the size of the fleet. The problem is an extension of the classical vehicle routing problem with time windows. The objective is to minimize the routing costs and the economic losses associated with production losses. The solution procedure focused on short and long-term decisions based on the heuristic Simulated Anneling through a simulation-optimization algorithm.
 
WARNING - Viewing this document is conditioned on your acceptance of the following terms of use:
This document is only for private use for research and teaching activities. Reproduction for commercial use is forbidden. This rights cover the whole data about this document as well as its contents. Any uses or copies of this document in whole or in part must include the author's name.
Publishing Date
2016-03-14
 
WARNING: Learn what derived works are clicking here.
All rights of the thesis/dissertation are from the authors
CeTI-SC/STI
Digital Library of Theses and Dissertations of USP. Copyright © 2001-2020. All rights reserved.