Thèse de Doctorat
DOI
https://doi.org/10.11606/T.3.2021.tde-01062021-090708
Document
Auteur
Nom complet
Luísa Brandão Cavalcanti
Unité de l'USP
Domain de Connaissance
Date de Soutenance
Editeur
São Paulo, 2021
Directeur
Jury
Mendes, André Bergsten (Président)
Junqueira, Leonardo
Leite, Laura Silvia Bahiense da Silva
Ribas, Paulo Cesar
Santoro, Miguel Cezar
Titre en portugais
Roteirização de rebocadores para atendimento de plataformas offshore,  com operações sincronizadas e janelas de tempo.
Mots-clés en portugais
Estruturas offshore
Heurística
Programação matemática
Roteirização
Resumé en portugais
Titre en anglais
Routing anchor handling tug supply vessels for executing services at offshore oil platforms, with synchronized operations and time windows.
Mots-clés en anglais
Anchor handling tug supply vessels
Heuristics
Mathematical programming
Offshore structures
Routing
Resumé en anglais
Offshore oil extraction depends on productive resources that must be moved and allocated to the platforms by special tug vessels, known as Anchor Handling Tug Supply (AHTS), often requiring the simultaneous operation of more than one vessel. If, on the one hand, AHTS chartering is expensive, on the other hand, the nonattendance of a required service can cause interruption in the activities of a platform, generating prohibitive economic loss. Thus, it is necessary to efficiently manage the tugboat fleet, by scheduling activities planned for short to medium terms. In this work, the Operational Research (OR) methodology is used to propose a mathematical optimization model, capable of designating the vessels that must perform each service required and creating routes, by defining not only the sequence of tasks performed by each tug, but also the start date of each activity, in order to minimize the total cost of the program. The problem addressed differs from classic routing problems with time windows, in that there are multiple modes to perform each task and some of these tasks require multiple, synchronized resources. As the formulated model generalizes a problem known to be NP-hard, the solution methods proposed in this work are based on meta-heuristics and their performance is tested on a set of instances, which are also proposed here. Among the contributions of this thesis to the OR, the following stand out: presentation of a mathematical model for a new routing problem, whose modeling strategy proved to be more efficient than traditional formulations; and development of a new movement that inserts a given task at intermediate positions of a set of routes, which is essential to the application of meta-heuristics to solve synchronized routing problems. Although this type of movement is usual in routing problems, this is the first application to a problem with synchronized operations, due to the high complexity generated by the interdependence between the routes

AVERTISSEMENT - Regarde ce document est soumise à votre acceptation des conditions d'utilisation suivantes:
Ce document est uniquement à des fins privées pour la recherche et l'enseignement. Reproduction à des fins commerciales est interdite. Cette droits couvrent l'ensemble des données sur ce document ainsi que son contenu. Toute utilisation ou de copie de ce document, en totalité ou en partie, doit inclure le nom de l'auteur.
Date de Publication
2021-06-01

AVERTISSEMENT: Apprenez ce que sont des œvres dérivées cliquant ici.
Tous droits de la thèse/dissertation appartiennent aux auteurs
CeTI-SC/STI
Bibliothèque Numérique de Thèses et Mémoires de l'USP. Copyright © 2001-2021. Tous droits réservés.