Full text
| |
| Author(s): |
Bruno Luís Hönigmann Cereser
Total Authors: 1
|
| Document type: | Master's Dissertation |
| Press: | Campinas, SP. |
| Institution: | Universidade Estadual de Campinas (UNICAMP). Instituto de Matemática, Estatística e Computação Científica |
| Defense date: | 2013-09-30 |
| Examining board members: |
Luiz Leduino de Salles Neto;
Aurelio Ribeiro Leite de Oliveira;
Anibal Tavares de Azevedo
|
| Advisor: | Luiz Leduino de Salles Neto; Antonio Carlos Moretti |
| Abstract | |
The maritime transportation is essential to global companies. In 2009 80% of global trade was made by maritime transportation, and over the year this number has raised. Because of this high flux, the BAP (Berth Allocation Problem) arose. The BAP have intent to discovery the vessel allocation sequence in every berth with the minimum total wait time. In this work, the berths of BAP will be considered dependents, we also considered the division of portuary machines between consecutive berths. The objective of this work is the mathematical representation of the terminals Produtos Diversos and Praia Mole of the Tubarão port. For this reasons we propose here unprecedented mathematical models (AU) | |
| FAPESP's process: | 11/14062-2 - Transport optimization in ship planning |
| Grantee: | Bruno Luis Honigmann Cereser |
| Support Opportunities: | Scholarships in Brazil - Master |