{'fraction_non_alphanumeric': 0.01195814648729447, 'fraction_numerical': 0.0, 'mean_word_length': 5.320754716981132, '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}}
Optimization of Containership Stowage in Circular Route Based on Greedy Algorithm

This paper studies the Containership Stowage Stack Minimization Problem(CSSMP) under a circular route so as to obtain the containership stowage plan for each port. This paper analyzes the process of multi-port containership stowage problem under the circular route, taking into consideration the sequence of port of call and container information of each port. A greedy algorithm is designed to solve the problem. The efficiency of the algorithm is verified by analyzing the results of the instances and therefore some rules can be obtained to provide reference for subsequent research.