Berth allocation in an ore terminal with demurrage, despatch and maintenance

Glaydston Mattos Ribeiro, Geraldo Regis Mauri, Saulo De Castro Beluco, Luiz Antonio Nogueira Lorena, Gilbert Laporte

Research output: Contribution to journalArticlepeer-review

19 Citations (SciVal)


This paper presents a Berth Allocation Problem (BAP) encountered in an ore terminal located in a Brazilian port. The BAP consists of assigning ships to berthing positions along a quay in a port. In the Brazilian port considered here, maintenance activities have to be performed at the berths and extra fees (demurrage) or rewards (despatch) for the port administrator are incurred. We propose a mixed integer linear programming model for the problem and a set of instances based on real data in order to validate the model. An adaptive large neighborhood search (ALNS) heuristic is applied to solve the instances and computational experiments are performed. The results indicate that the ALNS heuristic yields good solutions on all instances.

Original languageEnglish
Pages (from-to)8-15
Number of pages8
JournalComputers and Industrial Engineering
Publication statusPublished - Jun 2016


  • Adaptive large neighborhood search
  • Berth allocation problem
  • Brazilian port
  • Solid bulk

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)


Dive into the research topics of 'Berth allocation in an ore terminal with demurrage, despatch and maintenance'. Together they form a unique fingerprint.

Cite this