.

Authors

  • Hugo Leonardo Louzada Vervloet UFES-Universidade Federal do Espírito Santo
  • Rodrigo Alvarenga Rosa UFES-Universidade Federal do Espírito Santo

DOI:

https://doi.org/10.14295/transportes.v24i1.976

Keywords:

Berth Allocation Problem (BAP), Charter Party, Port Logistics, Bulk Ports.

Abstract

Bulk cargo ships are usually contracted under the Charter Party contract between the owner and the shipper. This contract establishes a time limit for vessel to stay at port. If the vessel is below this time the shipper receives a financial award and, if not, pay a fine to the owner. After the literature review, no articles were found on the Berth Allocation Problem (BAP) that addressed the issues related to premium and fine from the perspective of Charter Party contract in order to maximize the financial result of the shipper, calculated as a reward less fine. Thus, a mathematical model is proposed for the BAP with consideration of the Charter Party, and instances based in the Port of Tubarão were developed and implemented in CPLEX 12.6. The results showed the applicability of the model in the scheduling of ships and also guidelines to support the negotiation of this type of contract.

Downloads

Download data is not yet available.

Author Biographies

Hugo Leonardo Louzada Vervloet, UFES-Universidade Federal do Espírito Santo

Mestre em Engenharia Civil - Área Transportes - Economista da Vale S/A.

Rodrigo Alvarenga Rosa, UFES-Universidade Federal do Espírito Santo

Pesquisador de Pós Doutorado no Programa de Engenharia de Transportes (PET) na COPPE/UFRJ. Bolsista de Produtividade da Fundação de Amparo à Pesquisa do Espírito Santo (FAPES) recebendo a bolsa Pesquisador Capixaba (2013-2016). Doutor em Engenharia Elétrica pela Universidade Federal do Espírito Santo (UFES), Planejamento Portuário utilizando Inteligência Artificial Distribuída (2006). Mestre em Informática pela UFES, Roteirização de Veículos (1996). Graduado em Engenharia Civil pela UFES (1989). Professor adjunto no Depart. Eng. Produção da UFES Pesquisador de modelos matemáticos aplicados às áreas: planejamento da operação portuária, planejamento da operação ferroviária, planejamento logístico e roteirização de veículos. 

References

Banos, R. S., Rosa, R. A., Mauri, G.R., Ribeiro, G.M. (2016). Modelo matemático e meta-heurística Simulated Annealing para oproblema de alocação de berços com múltiplas cargas. Transportes, no prelo.

Bierwirth, C.; Meisel, F. (2010). A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research, v. 202, n. 3, p. 615– 627. DOI: 10.1016/j.ejor.2009.05.031

Buhrkal, K., Zuglian, S., Ropke, S., Larsen, J., Lusby, R. (2011) Models for the discrete berth allocation problem: A computational comparison. Transportation Research Part E: Logistics and Transportation Review, p. 461–473. DOI: 10.1016/j.tre.2010.11.016

CollyeR, W. (2006) Sobreestadia de navios: a regra once on demurrage, always on demurrage. Jus Navigandi, 1166.

Cordeau, J.F., Laporte, G., Legato, P., Moccia, L. (2005). Models and tabu search heuristics for the berth-allocation problem. Transportation Science, v. 39, n. 4, p. 526– 538. DOI: 10.1287/trsc.1050.0120

Golias, M., Boile, M., Theofanis, S. (2006). The berth allocation problem: a formulation reflecting time window service deadlines. In: Proceedings of the 48thTransportation Research Forum Annual Meeting. Transportation Research Forum, Boston.

Golias, M. (2007). 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.

Golias, M., Boile, M., Theofanis, S., Efstathiou, C. (2010). The Berth-Scheduling Problem. Transportation Research Record: Journal of the Transportation Research Board, v. 2166 , n. 1, p. 20-27.

Han, M., Li, P., Sun, J. (2006). 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, p. 1–4.

Han, X., Lu, Z., Xi, L. (2010). A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time. European Journal of Operational Research, v. 207, n. 3, p. 1327 – 1340. DOI: 10.1016/j.ejor.2010.07.018

Hansen, P., Oguz, C. (2003). A note on formulations of static and dynamic berth allocation problems. Les Cahiers du GERAD, 30, p.1–17.

Imai, A., Nishimura, E., Papadimitriou, S. (2001). The dynamic berth allocation problem for a container port. Transportation Research Part B, v. 35, n. 4, p. 401–417. DOI: 10.1016/S0191-2615(99)00057-0

Imai, A., Nishimura, E., Papadimitriou, S. (2003). Berth allocation with service priority. Transportation Research Part B. v.37, n. 5, p. 437–457. DOI: 10.1016/S0191-2615(02)00023-1.

Imai, A., Sun, X., Nishimura, E., Papadimitriou, S. (2005). Berth allocation in a container port: using a continuous location space approach. Transportation Research Part B, v. 39, n. 3, p. 199–221. DOI: 10.1016/j.trb.2004.04.004

Imai, A., Nishimura, E., Papadimitriou, S. (2008). Berthing ships at a multi-user container terminal with a limited quay capacity. Transportation Research Part E, v. 44, n, 1, p. 136–151. DOI: 10.1016/j.tre.2007.03.003

Lorenzoni, L. L.; Ahonen, H.; Alvarenga, A. G. (2006). A multi-mode resource-constrained scheduling problem in the context of port operations. Computers & Industrial Engineering, v. 50, n. 1, p.55-65. DOI: 10.1016/j.cie.2005.11.001.

Mauri, G.R., Oliveira, A.C.M., Lorena, L.A.N. (2008). A hybrid column generation approach for the berth allocation problem. In: van Hemert, J., Cotta, C. (Eds.). Eighth european conference on evolutionary computation in combinatorial optimisation, v. 4972, p.110– 122. DOI: 10.1007/978-3-540-78604-7_10

Mauri, G.R., Oliveira, A.C.M., Lorena, L.A.N. (2010). 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, p. 547– 562. DOI: 10.1590/S0101-74382010000300003

Meersmans, P.J.M., Dekker, R. (2001). Operations research supports container handling. Econometric Institute Report 234, Erasmus University Rotterdam.

Monaco, M.F., Sammarra, M. (2007). The berth allocation problem: a strong formulation solved by a Lagrangean approach. Transportation Science, v. 41, n. 2, p. 265–280. DOI: 10.1287/trsc.1060.0171

Nishimura, E., Imai, A., Papadimitriou, S. (2001). Berth allocation planning in the public berth system by genetic algorithms. European Journal of Operational Research, v. 131, n.2, p. 282–292. DOI: 10.1016/S0377-2217(00)00128-4

Praticagem ES (2015). Praticagem, o que é?. Disponível em: . Acesso em: 03 jun. 2015.

Rashidi, H., Tsang, E. (2013). Novel constraints satisfaction models for optimization problems in container terminals. Applied Mathematical Modelling, 37, p. 3601–3634. DOI: 10.1016/j.apm.2012.07.042

Rodrigues, P. H.; Rosa, R. A.; Arpini, B. P.; Bissoli, A. L.; Ribeiro, G. M. (2015). Planejamento de atracação de navios por meio de um modelo matemático para o problema de alocação de berços contínuos com descontinuidade do cais. Transportes, v. 23, n. 1, p. 37-46. DOI: 10.4237/transportes.v23i1.681

Rosa, R. A., Resendo, L. C., Lopes, F. T. (2013). 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: CNT Confederação Nacional do Transporte. (Org.). Transporte em Transformação XVII. 1. ed. Brasília: Positiva, v. 1, p. 133-150.

Stahlbock, R., Voß, S. (2008). Operations research at container terminals: a literature update. OR Spectrum, v. 30, n .1, p. 1–52. DOI: 10.1007/s00291-007-0100-9

Steenken, D., Voß, S., Stahlbock, R. (2004). Container terminal operation and operations research: a classification and literature review. OR Spectrum, v. 26, n. 1, p. 3–49. DOI: 10.1007/s00291-003-0157-z

Stopford, M. (1997). Maritime economics. London: Routledge.

Teixeira, R. B.; Cunha, C. B. (2012). Modelo integrado para seleção de cargas e reposicionamento de contêineres vazios no transporte marítimo. Transportes, v. 20, n. 1, p. 59-70. DOI: 10.4237/transportes.v20i1.442

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

Ting, C. J.; Lin, S. W.; Wu, K. C. (2013). The Continuous Berth Allocation Problem by Simulated Annealing. In: APIEMS Conference 2013. Proceedings, Cebu, Philippines.

UNCTAD. United Nations Conference on Trade and Development (2014). Review of maritime transport 2014. New York: United Nations. p. 5. Disponível em: <http://unctad.org/en/PublicationsLibrary/rmt2014_en.pdf >. Acesso: 29 dez. 2015.

Vacca, I., Bierlaire, M., Salani, M. (2007). Optimization at container terminals: status, trends and perspectives. In: Proceedings of the swiss transport research conference (STRC). Monte Veritá/Ascona, p. 1–21.

Vale (2015). Memorial descritivo do terminal de Tubarão. Disponível em: < http://www.vale.com/pt/business/logistics/ports-terminals/documents/pdf/memorial_descritivo_ terminal_tubarao.pdf >. Acesso em: 08 jul. 2015.

VIS, I.F.A., DE KOSTER, R. (2003) Transshipment of containers at a container terminal: an overview. European Journal of Operational Research, v. 147, n. 1, p. 1–16.DOI: 10.1016/S0377-2217(02)00293X

Wilson, J. F. (1988). Carriage of goods by sea. London: Pitman. p. 456.

Zhou, P., Kang, H., Lin L. (2006) A dynamic berth allocation model based on stochastic consideration. In: Proceedings of the Sixth World Congress on Intelligent Control and Automation (WCICA 2006), v. 2. IEEE Computer Society, Washington DC, p.7297–7301.

Zhou, P., Kang, H. (2008). Study on berth and quay-crane allocation under stochastic environments in container terminal. Systems Engineering - Theory & Practice, v. 28, n. 1, p. 161- 169.

Downloads

Published

2016-04-21

How to Cite

Vervloet, H. L. L., & Rosa, R. A. (2016). TRANSPORTES, 24(1), 84–94. https://doi.org/10.14295/transportes.v24i1.976

Issue

Vol. 24 No. 1 (2016)

Section

Artigos

License

Authors who submit papers for publication by TRANSPORTES agree to the following terms:

  1. Authors retain copyright and grant TRANSPORTES the right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

  2. Authors may enter into separate, additional contractual arrangements for the non-exclusive distribution of this journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in TRANSPORTES.

  3. Authors are allowed and encouraged to post their work online (e.g., in institutional repositories or on their website) after publication of the article. Authors are encouraged to use links to TRANSPORTES (e.g., DOIs or direct links) when posting the article online, as TRANSPORTES is freely available to all readers.

  4. Authors have secured all necessary clearances and written permissions to published the work and grant copyright under the terms of this agreement. Furthermore, the authors assume full responsibility for any copyright infringements related to the article, exonerating ANPET and TRANSPORTES of any responsibility regarding copyright infringement.

  5. Authors assume full responsibility for the contents of the article submitted for review, including all necessary clearances for divulgation of data and results, exonerating ANPET and TRANSPORTES of any responsibility regarding to this aspect.