{'fraction_non_alphanumeric': 0.01639344262295082, 'fraction_numerical': 0.0, 'mean_word_length': 5.0, '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}}
HEURISTIC-BASED MODEL FOR CONTAINER STACKING PROBLEM

The paper presents a container stacking model that simulates, solves and optimizes the container stacking activity within a fluvial or maritime port. This activity constitutes a real world problem that is omnipresent in logistic and transportation domain. Given container arrivals in a container port terminal, the objective is to assign a slot to each one in a storage area at least cost with respect to pre-defined constraints. The cost is expressed in term of expected relocation movement number. The constraints to respect are stack height, stack number, and departure dates. The aim of the proposed model is to help operative management personnel by giving a stacking plan for each container. To this end, two centralized algorithms were presented: the first is an uninformed search algorithm and the second is an informed search algorithm based on heuristics. By comparing them, it is shown that the latter performs much better than the former thanks to the adopted heuristics.