{'fraction_non_alphanumeric': 0.01809598741148702, 'fraction_numerical': 0.0023603461841070024, 'mean_word_length': 5.73015873015873, '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}}
Multi-Port Stowage Planning for Inland Container Liner Shipping Considering Weight Uncertainties

The multi-port stowage planning problem investigates the ship’s whole route to make the stowage plans for multiple ports. This paper formulates the multi-port stowage planning problem for inland container liner shipping on the Yangtze River that hedges against container weight uncertainties. A mathematical formulation based on stochastic programming of this problem is presented. Three solution approaches, which include an exact approach based on robust optimization, an exact approach based on stochastic chance-constrained programming, and a hybrid neighborhood search algorithm based on heuristics are presented. Experimental results showed that the exact approaches and hybrid neighborhood search algorithm could robustly solve the problem. With increasing ship size, numbers of operational ports, and vessel loading rates, the exact approaches cannot guarantee the solutions for some large-scale experiments within the time limit. The hybrid neighborhood search algorithm finds solutions for all the instances with an average gap 1.67 %, and it outperforms the exact approaches with respect to calculation time and solution quantity for the large-scale experiments.