TRABALHOS FUTUROS

Com a conclusão desta dissertação, notou-se a possibilidade de tornar o modelo proposto ainda mais completo, inserindo na análise de prêmio e multa, o valor da receita portuária obtida com a operação de carregamento ou descarrega dos navios. Assim, ao priorizar um determinado navio, o embarcador visualizaria o resultado financeiro total e não apenas o resultado financeiro de prêmio e multa, situação esta, que aproximaria a ferramenta proposta da realidade comercial dos embarcadores. Outra possibilidade para trabalhos futuros é analisar a sequência de navios a serem atendidos pelo porto quando o modelo proposto for utilizado com a função objetivo para redução do tempo de atracação, comparando o resultado com tempo gerado pela regra FCFS.

Por fim, com o objetivo de alcançar resultados de grande escala, sugere-se o desenvolvimento de heurísticas e/ou meta-heurísticas, principalmente para portos maiores e instâncias com um número maior de berços ou navios.

REFERÊNCIAS

ANTAQ. Anuário 2014. 2015. Disponível em: <http://www.antaq.gov.br/anuario/> Acesso em: 07 jun. 2015.

ARABSHAHI, N.; SEYADALIZADEH GANJI, S. R.; BABAZADEH, A. Analysis of the

continuous berth allocation problem in container ports using a genetic algorithm. Sci Technol, 2010.

ASSIS, F.; Apostila Transporte Marítimo, UFRJ. Rio de Janeiro, 2010.

BARROS, V. H.; COSTA, T. S.; OLIVEIRA, A. C. M.; LORENA, L. A. N. Model and heuristic for berth allocation in tidal bulk ports with stock level constraints.

Computers and Industrial Engineering, v. 60, 2011. p. 606-613.

BIERWIRTH, C.; MEISEL, F. A survey of berth allocation and quay crane scheduling problems in contêiner terminals. European Journal of Operational Research, 202 (3), 2010. p. 615– 627.

BRIANO, C.; BRIANO, E.; BRUZZONE, A. G.; & REVETRIA, R. Models for support maritime logistics: a case study for improving terminal planning. In: 19th European

Conference on Modeling and Simulation, 2005.

BROWN, G. G.; LAWPHONGPANICH, S.; THURMAN, K. P. Optimizing ship berthing. Naval Research Logistics 41 (1), 1994. p. 1–15.

BROWN, G. G.; CORMICAN, K. J.; LAWPHONGPANICH, S.; WIDDIS, D. Optimizing submarine berthing with a persistence incentive. Naval Research Logistics 44 (4), 1997. p. 301–318.

BUHRKAL, K.; ZUGLIAN, S.; ROPKE, S.; LARSEN, J.; LUSBY, R. Models for the discrete berth allocation problem: A computational comparison. Transportation

Research Part E: Logistics and Transportation Review, 2011. p. 461–473.

CHANG, D.; YAN, W.; CHEN, C. H.; JIANG, Z. A berth allocation strategy using heuristics algorithm and simulation optimization. International Journal of Computer

Applications in Technology 32 (4), 2008. p. 272–281.

CHEN, C.Y.; HSIEH, T. W. A time-space network model for the berth allocation problem. In: 19th IFIP TC7 Conference on System Modeling and Optimization, Cambridge, 1999.

CHEONG, C. Y.; LIN, C. J.; TAN, K. C.; LIU, D. K. A multi-objective evolutionary algorithm for berth allocation in a container port. In: IEEE Congress on

Evolutionary Computation 2007 (CEC 2007). IEEE Computer Society, Washington

DC, 2007. p. 927–934.

CHEONG, C.; TAN, K.; LIU, D.; LIN, C. Multi-objective and prioritized berth allocation in container ports. Annals of Operations Research 180, 2010. p. 63–103.

CNT. Pesquisa CNT Aquaviária. 2006. Disponível em: < http://www.sistemacnt.org.br/pesquisacntaquaviaria/2006/arquivos/pdf/pesquisa_aqu aviaria_2006.pdf> Acesso em: 06 jun. 2015.

COLLYER, W. Sobreestadia de navios: a regra "once on demurrage, always on demurrage". Jus Navigandi, Teresina, ano 10, 2006. p. 1166.

CORDEAU, J. F.; LAPORTE, G.; LEGATO, P.; MOCCIA, L. Models and tabu search heuristics for the berth-allocation problem. Transportation Science, v.39, n.4, 2005. p. 526-538.

FIGUEIREDO, G. S. O Papel dos Portos Concentradores na Cadeia Logística Global. Anais do XXI Encontro Nacional de Engenharia de Produção, Bahia, 2001.

GAREY, M. R.; & JOHNSON, D. S. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W. H. Freeman,1979.

GOH, K. S.; LIM, A. Combining various algorithms to solve the ship berthing problem.

In: Proceedings of the 12th IEEE International Conference on Tools with

Artificial Intelligence (ICTAI’00). IEEE Computer Society, Los Alamitos, CA, 2000.

p. 370–373.

GOLIAS, M.; BOILE, M.; THEOFANIS, S. The berth allocation problem: a formulation reflecting time window service deadlines. In: Proceedings of the 48th

Transportation Research Forum Annual Meeting. Boston (MA): Transportation

Research Forum. 2006.

GOLIAS, M. The discrete and continuous berth allocation problem: Models and

algorithms. Tese (Doctor of Philosophy Graduate Program in Civil and

Environmental Engineering). The State University of New Jersey, New Brunswick, 2007.

GOLIAS, M.; BOILE, M.; THEOFANIS, S.; EFSTATHIOU, C. The Berth-Scheduling Problem. Transportation Research Record: Journal of the Transportation

Research Board, v. 2166, n. -1, 2010. p. 20-27.

GOMES, C. M. N. Análise do Desempenho Operacional de Pátios Ferroviários. Dissertação de Mestrado. Rio de Janeiro: Instituto Militar de Engenharia, 1982.

GUAN, Y.; XIAO, W. Q.; CHEUNG, R. K.; Li, C. L. A multiprocessor task-scheduling model for berth allocation: heuristic and worst case analysis. Operations Research

Letters, v. 30, 2002. p. 343-350.

GUAN, Y.; CHEUNG, R. K. The berth allocation problem: models and solution methods. OR Spectrum 26 (1), 2004. p. 75–92.

HAN, M.; LI, P.; SUN, J. The algorithm for berth scheduling problem by the hybrid optimization strategy GASA. In: Proceedings of the Ninth International

Conference on Control, Automation, Robotics and Vision (ICARCV’06). IEEE

Computer Society, Washington DC, 2006. p. 1–4.

HAN, X.; LU, Z.; XI, L. A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time. European Journal of

Operational Research, 207 (3) 2010. p. 1327 – 1340.

HANSEN, P.; OGUZ, C. A note on formulations of static and dynamic berth allocation problems. Les Cahiers du GERAD 30, 2003. p. 1–17.

HANSEN, P.; OGUZ, C.; MLADENOVIĆ, N. Variable neighborhood search for minimum cost berth allocation. European Journal of Operational Research, v. 191, n. 3, 2008. p. 636-649.

HOFFARTH, L.; VOB, S. Berth allocation in a container terminal – development of a decision support system (in German). In: Dyckhoff, H., Derigs, U., Salomon, M., Tijms, H.C. (Eds.). Operations Research Proceedings 1993. Springer, Berlin et al., 1994. p. 89–95.

IMAI, A.; NAGAIWA, K.; TAT, C. W. Efficient planning of berth allocation for container terminals in Asia. Journal of Advanced Transportation, v. 31, n. 1, 1997. p. 75-94. IMAI, A; NISHIMURA, E; PAPADIMITRIOU, S. The dynamic berth allocation problem for a container port. Transportation Research Part B: Methodological, v. 35, n. 4, 2001. p. 401-417.

IMAI, A.; NISHIMURA, E.; PAPADIMITRIOU, S. Berth allocation with service priority.

Transportation Research Part B: Methodological, v. 37, n. 5, 2003. p. 437-457.

IMAI, A.; SUN, X.; NISHIMURA, E.; PAPADIMITRIOU, S. Berth allocation in a contêiner port: using a continuous location space approach. Transportation

Research Part B: Methodological, v. 39, n. 3, 2005. p. 199-221.

IMAI, A.; ZHANG, J. T.; NISHIMURA, E.; PAPADIMITRIOU, S. The berth allocation problem with service time and delay time objectives. Maritime Economics &

Logistics, v. 9, n. 4, 2007. p. 269-290.

IMAI, A.; NISHIMURA, E.; PAPADIMITRIOU, S. Berthing ships at a multi-user contêiner terminal with a limited quay capacity. Transportation Research Part E:

Logistics and Transportation Review, v. 44, n. 1, 2008. p. 136-151.

KAO, C.; LEE, H. T. Coordinated dock operations: Integrating dock arrangement with ship discharging. Computers in Industry, v. 28, 1995. p. 113-122.

KIM, K. H.; MOON, K. C. Berth scheduling by simulated annealing. Transportation

LEE, Y.; CHEN, C. Y. An optimization heuristic for the berth scheduling problem.

European Journal of Operational Research 196 (2), 2008. p. 500–508.

LI, C L.; CAI, X.; LEE, C Y. Scheduling with multiple-job-on-one-processor pattern. IIE Transactions, v. 30, 1998. p. 433-445.

LIM, A. The berth planning problem. Operations Research Letters, v. 22, 1998. p. 105-110.

LIM, A. An effective ship berthing algorithm. In: Thomas, D. (Ed.), Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99-vol-1). Morgan Kaufmann Publishers, San Francisco, 1999. p. 594–599.

LORENZONI, L. L.; AHONEN, H.; ALVARENGA, A. G. A multi-mode resource- constrained scheduling problem in the context of port operations. Computers & Industrial Engineering, v. 50, n. 1, 2006. p. 55-65.

MAURI, G. R.; OLIVEIRA, A. C. M.; LORENA, L. A. N. A hybrid column generation approach for the berth allocation problem. In: VAN EMERT, J.; COTTA, C. (Eds.), EvoCOP 2008, Lecture Notes in Computer Science, v. 4972, Springer, 2008. p. 110-122.

MAURI, G. R.; OLIVEIRA, A. C. M.; LORENA, L. A. N. Resolução do Problema de Alocação de Berços Através de Uma Técnica de Geração de Colunas, Pesquisa Operacional, v. 30, n.3, 2010. p. 547– 562.

MEERSMANS, P. J. M.; DEKKER, R. Operations research supports container handling. Econometric Institute Report 234, Erasmus University Rotterdam. 2001. MONACO, M. F.; SAMMARRA, M. The berth allocation problem: A Strong formulation solved by a lagrangean approach. Transportation Science, v. 41, n. 2, 2007. p. 265-280.

MOON, K. A mathematical model and a heuristic algorithm for berth planning. Ph.D. Thesis, Pusan National University, Pusan, 2000.

MOORTHY, R.; TEO, C. P. Berth management in container terminal: the template design problem. OR Spectrum, v. 28, n. 4, 2006. p. 495-518.

NISHIMURA, E.; IMAI, A.; PAPADIMITRIOU, S. Berth allocation planning in the public berth system by genetic algorithms. European Journal of Operational Research, v. 131, 2001. p. 282-292.

OLIVEIRA, R. M.; MAURI, G. R.; LORENA, L. A. N. Clustering search heuristics for solving a continuous berth allocation problem. Lecture Notes in Computer Science, v. 7245, 2012. p. 49-62.

PAQUETTE, R. J.; ASHFORD, N. J.; WRIGHT, P. H. Transportation engineering: planning and design. 2. ed. John Wiley & Sons, Inc., 1982.

PARK, K. T.; KIM, K. H. Berth scheduling for container terminals by using a sub- gradient optimization technique. Journal of the Operational Research Society, v. 53, 2002. p. 1054-1062.

PARK, Y. M.; KIM, K. H. A scheduling method for berth and quay cranes. Operations Research Spectrum, v. 25, 2003. p. 1-23.

PERINI, C. A. Estudo do sistema de gestão de limpeza industrial no Porto de Tubarão. Monografia do Curso de Pós-Graduação em Engenharia Portuária da Escola Politécnica da Universidade Federal do Rio de Janeiro – UFRJ. Vitória, 2010. RASHIDI, H.; TSANG, E. Novel constraints satisfaction models for optimization problems in container terminals. Applied Mathematical Modelling, 37, 2013. p. 3601–3634.

PRATICAGEM ES. Disponível em: <www.praticagem.org.br> Acesso em: 03 de jun. 2015.

RONEN, D. Cargo Ships Routiong and Scheduling: Survey of Models and Problems. In: BROOKS, M. R.; BUTTON, K; NIJKAMP, P. (eds) Maritime Transport: Classics in Transport Analysis, vol. 1. Edward Elgar Publishing. Cheltenham, United Kingdom, 2002.

ROSA, R. A.; RESENDO, L. C.; LOPES, F. T. Proposta de um modelo matemático para o problema de alocação de berços para múltiplas cargas (PAB-MC) com restrições temporais e espaciais. In: XXVI Congresso nacional de Ensino e Pesquisa em Transporte – ANPET. Joinville, 2012.

SILVEIRA, M. M. Guia Para Afretamento de Embarcações. 1º ed. – Niterói/RJ: Edição do Autor, 2013. 49 p.

STAHLBOCK, R.; VOSS, S. Operations research at container terminals: a literature update. OR Spectrum 30 (1), 2008. p. 1–52.

STEENKEN, D.; VOSS, S.; STAHLBOCK, R. Container terminal operation and operations research – a classification and literature review. OR Spectrum 26 (1), S004. p. 3–49.

STOPFORD, M. Maritime economics. London: Routledge ,1997.

THEOFANIS, S.; BOILE, M.; GOLIAS, M. An optimization based genetic algorithm heuristic for the berth allocation problem. IEEE Congress on Evolutionary Computation 2007 (CEC 2007). IEEE Computer Society, Washington DC, 2007. p. 4439–4445.

TING, C. J.; LIN, S. W.; WU, K. C. The Continuous Berth Allocation Problem by Simulated Annealing. In: APIEMS Conference 2013 Proceedings, Cebu, Philippines, 2013.

TONG, C. J.; LAU, H. C.; LIM, A. Ant colony optimization for the ship berthing problem. In: THIAGARAJAN, P.S.; Yap, R. (Eds.), Fifth Asian Computing Science Conference (ASIAN’99), Lecture Notes in Computer Science, v.1742, Springer, 1999. p. 359-370.

UMANG, N.; BIERLAIRE, M.; VACCA, I. Exact and heuristic approach methods to solve berth allocation problem in bulk ports. Technical Report, TRANSP-OR, Ecole Polytechnique Federale De Lausanne, 2012.

UNCTAD, United Nations Conference of Trade and Development; APEC, Antwerp for Engineering and Consulting. Seminar on Container Terminal Management

Antwerp, Bélgica, 1983.

UNCTAD, United Nations Conference on Trade and Development. Review of

Maritime Transport 2014. New York: United Nations, 2014. p. 5.

VACCA, I.; BIERLAIRE, M.; SALANI, M. Optimization at container terminals: Status, trends and perspectives. In: Proceedings of the Swiss Transport Research

Conference (STRC). Monte Veritá/Ascona, 2007. pp. 1–21.

VALE S/A. http://www.vale.com/PT/business/logistics/ports- terminals/Documents/pdf/memorial_descritivo_terminal_tubarao.pdf. Acessado em: 08/07/2015 (a).

VALE S/A. http://www.vale.com/brasil/PT/aboutvale/news/Paginas/certificacao- internacional-reconhece-trabalho-engenharia-confiabilidade-porto-tubarao.aspx. Acessado em: 01/07/2015 (b).

VERGARA, S. C. Projetos e relatórios de pesquisa em administração. 13. ed. São Paulo: Atlas, 2011.

VIS, I.F.A.; KOSTER, R. Transshipment of containers at a container terminal: an overview. European Journal of Operational Research 147 (1), 2003.

p. 1–16.

WANG, F.; LIM, A. A stochastic beam search for the berth allocation problem.

Decision Support Systems 42 (4), 2007. p. 2186–2196.

WILSON, J. F. Carriage of Goods by Sea. London: Pitman. 1988. p. 456.

XU, Y.; CHEN, Q.; QUAN, X. Robust berth scheduling with uncertain vessel delay and handling time. Annals of Operations Research, v. 192, n.1, 2012. p. 123-140. ZHOU, P.; KANG, H.; LIN, L. A dynamic berth allocation model based on stochastic consideration. In: Proceedings of the Sixth World Congress on Intelligent

Control and Automation (WCICA 2006), vol. 2. IEEE Computer Society,

ZHOU, P.; KANG, H. Study on berth and quay-crane allocation under stochastic environments in container terminal. In: Systems Engineering - Theory & Practice, 28 (1) 2008. p. 161 –169.

ZOCK, Anthony N. Charter Parties in Relation to Cargo.Tul. L. Rev., v. 45, 1970. p. 733.

ZOGAHIB, M. Introdução ao Shipping. Fundação de Estudos do Mar – FEMAR. Rio de Janeiro, 2008.