{'fraction_non_alphanumeric': 0.018963337547408345, 'fraction_numerical': 0.0, 'mean_word_length': 4.781021897810219, '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}}
Mathematical Model and Solution Approach for Berth Allocation Problem in Tidal Bulk Ports with Different Vessel Draft Requirements

In this paper, we study a problem of berth allocation for vessels in tidal bulk port terminals. The difference with other studies is that we consider the type of vessels. To the best of our knowledge, we are the first to take the different drafts of different types of vessels, and the terminal constraints into account. Some goods cannot be loaded or unloaded at a certain terminal. For instance, some vessels are full of cargo when arriving at terminals and empty when departing or opposite. For this problem, we provide a mathematical formulation, which is solved by a commercial solver and a Genetic Algorithm (GA). We also conduct a numerical experiment.