Content area
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.
Details
Title
The berth allocation problem with stochastic vessel handling times
Author
Karafa, Jeffery 1 ; Golias, Mihalis M 1 ; Ivey, Stephanie 1 ; Saharidis, Georgios K D 2 ; Leonardos, Nikolaos 3
1 Department of Civil Engineering, University of Memphis, Memphis, TN, USA
2 Mechanical Engineering Department, University of Thessaly, Volos, Greece; Kathikas Institute of Research and Technology, Paphos, Cyprus
3 Department of Computer Science, Rutgers University, Piscataway, NJ, USA
1 Department of Civil Engineering, University of Memphis, Memphis, TN, USA
2 Mechanical Engineering Department, University of Thessaly, Volos, Greece; Kathikas Institute of Research and Technology, Paphos, Cyprus
3 Department of Computer Science, Rutgers University, Piscataway, NJ, USA
Pages
473-484
Publication year
2013
Publication date
Mar 2013
ISSN
02683768
e-ISSN
14333015
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
2262369352
Copyright
The International Journal of Advanced Manufacturing Technology is a copyright of Springer, (2012). All Rights Reserved.