Post-Pareto Analysis Approach for Discrete and Dynamic Multiobjective Berth Allocation Problem

The berth allocation problem can be simply described as the problem of allocating berth space for vessels in a container terminal. Several issues arise when defining the best vessel berth allocation schedule for each port operator. Container terminal operators set several objectives when defining berth schedules, which ideally need to be optimized simultaneously. These multiple objectives are often non-commensurable and gaining an improvement on one objective often causes degrading performance on the other objectives. In this paper we study the multi-objective berth allocation problem and present an approach that allows the port operator to select a subset of solutions over the entire solution space of berth schedules by ranking non-numerically, in order of relative importance the objective functions, without having to select specific weight values.