{'fraction_non_alphanumeric': 0.02181818181818182, 'fraction_numerical': 0.0, 'mean_word_length': 5.482352941176471, '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}}
A risk-cost minimization model for catastrophe averse shipment of hazardous materials

This article provides a quantitative method for estimating mixed routing strategies for catastrophe averse shipment of hazardous materials (hazmats), taking into account of both transportation cost and risk. The mixed routing problem is first formulate as a maximin problem and then is reduced to a single-level convex programming problem (CP). This CP reduction enables us to develop an efficient solution algorithm applicable to real-world large-scale networks.