The berth allocation problem with stochastic vessel handling times

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

Full description

Saved in:
Bibliographic Details
Published in:International journal of advanced manufacturing technology 2013-03, Vol.65 (1-4), p.473-484
Main Authors: Karafa, Jeffery, Golias, Mihalis M., Ivey, Stephanie, Saharidis, Georgios K. D., Leonardos, Nikolaos
Format: Article
Language:English
Subjects:
CAE) and Design
Computer simulation
Computer-Aided Engineering (CAD
Economic models
Engineering
Evolutionary algorithms
Handling
Industrial and Production Engineering
Mechanical Engineering
Media Management
Original Article
Pruning
Vessels
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0268-3768
1433-3015
DOI:10.1007/s00170-012-4186-0