{'fraction_non_alphanumeric': 0.021454112038140644, 'fraction_numerical': 0.003575685339690107, 'mean_word_length': 5.222222222222222, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Modelling and solving a berth allocation problem in an automotive transshipment terminal

Abstract In this paper, we study a berth allocation problem (BAP) in the automotive transshipment (also called Ro-Ro) terminal of Le Havre seaport. Despite the vast literature on the BAP, very few work deals with automotive transshipment terminals. The main objective of the problem we consider is to define incoming ships berthing positions in the Ro-Ro terminal, for minimising the total handling time while considering several operational constraints. In particular, we introduce the BAP with car flow crossings. We discuss mathematical models for car flow crossings and present integer programming formulations of the problem with and without car flow crossings. Then, we solve the problem using CPLEX 12.5 and discuss some computational issues.