The berth allocation problem with stochastic vessel handling times

Authors

Jeffery Karafa, University of MemphisFollow
Mihalis M. Golias, University of MemphisFollow
Stephanie Ivey, University of MemphisFollow
Georgios K.D. Saharidis, University of Thessaly
Nikolaos Leonardos, Rutgers University–New Brunswick

Abstract

In this paper, the berth allocation problem with stochastic vessel handling times is formulated as a bi-objective problem. To solve the resulting problem, an evolutionary algorithm-based heuristic and a simulation-based Pareto front pruning algorithm is proposed. Computational examples show that the proposed approach provides solutions superior to the ones where the expected value of the vessel handling times is used. © 2012 Springer-Verlag London Limited.

Publication Title

International Journal of Advanced Manufacturing Technology

Recommended Citation

Karafa, J., Golias, M., Ivey, S., Saharidis, G., & Leonardos, N. (2013). The berth allocation problem with stochastic vessel handling times. International Journal of Advanced Manufacturing Technology, 65 (1-4), 473-484. https://doi.org/10.1007/s00170-012-4186-0