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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.