Planning the berth allocation problem in developing countries with multiple cargos and cargo priority by a mathematical model and a clustering search metaheuristic

Rodrigo De Alvarenga Rosa, Glaydston Mattos Ribeiro, Geraldo Regis Mauri and Winnie Fracaroli

International Journal of Logistics Systems and Management, 2017, vol. 28, issue 4, 397-418

Abstract: Some Brazilian ports operate several different cargos. These ports were privatised, and to avoid the private companies to restrict their operations to some few profitable cargos, the Brazilian Government established rules, called cargo priorities, to ensure that all cargos are handled at the ports. These rules have a direct impact on port operations, especially when it comes to defining the allocation of berth space for vessels. Thus, this paper presents a mathematical model and a clustering search (CS) metaheuristic for the berth allocation problem with multiple cargos and cargo priorities, considering time and space constraints. The paper is motivated by a port terminal located in Brazil, which handles containers, granites and cars. CS solved both instances based on real data and instances created to test large problems. An extensive analysis of all the results is also presented.

Keywords: berth allocation problem; BAP; cargo priority; clustering search; CS; port planning. (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=87785 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijlsma:v:28:y:2017:i:4:p:397-418

Access Statistics for this article

More articles in International Journal of Logistics Systems and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().