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

doi:10.1016/j.cie.2016.03.005

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 journal › Article › peer-review

24 Citations (SciVal)

Abstract

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 language	English
Pages (from-to)	8-15
Number of pages	8
Journal	Computers and Industrial Engineering
Volume	96
DOIs	https://doi.org/10.1016/j.cie.2016.03.005
Publication status	Published - Jun 2016

Keywords

Adaptive large neighborhood search
Berth allocation problem
Brazilian port
Solid bulk

ASJC Scopus subject areas

General Computer Science
General Engineering

Access to Document

10.1016/j.cie.2016.03.005

Cite this

@article{d51cb64d20644eb59ceedaf93862dcd2,

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

abstract = "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.",

keywords = "Adaptive large neighborhood search, Berth allocation problem, Brazilian port, Solid bulk",

author = "Ribeiro, {Glaydston Mattos} and Mauri, {Geraldo Regis} and {De Castro Beluco}, Saulo and Lorena, {Luiz Antonio Nogueira} and Gilbert Laporte",

year = "2016",

month = jun,

doi = "10.1016/j.cie.2016.03.005",

language = "English",

volume = "96",

pages = "8--15",

journal = "Computers and Industrial Engineering",

issn = "0360-8352",

publisher = "Elsevier",

}

TY - JOUR

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

AU - Ribeiro, Glaydston Mattos

AU - Mauri, Geraldo Regis

AU - De Castro Beluco, Saulo

AU - Lorena, Luiz Antonio Nogueira

AU - Laporte, Gilbert

PY - 2016/6

Y1 - 2016/6

N2 - 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.

AB - 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.

KW - Adaptive large neighborhood search

KW - Berth allocation problem

KW - Brazilian port

KW - Solid bulk

UR - http://www.scopus.com/inward/record.url?scp=84962106956&partnerID=8YFLogxK

U2 - 10.1016/j.cie.2016.03.005

DO - 10.1016/j.cie.2016.03.005

M3 - Article

AN - SCOPUS:84962106956

SN - 0360-8352

VL - 96

SP - 8

EP - 15

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this