{'fraction_non_alphanumeric': 0.014627659574468085, 'fraction_numerical': 0.0, 'mean_word_length': 5.783783783783784, '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}}
Parametric Analysis for Multiobjective Hazardous Materials Routing Problem

This paper presents an efficient parametric routing analysis method for the bi-objective hazardous materials routing problem. The core process is a bounded greedy single-objective shortest path approximation algorithm. This method avoids the computationally intensive dominance check with labeling methods and overcomes the deficiency with existing parametric methods that can only find extreme nondominated paths. Moreover, we propose a decomposition scheme to convert a multiobjective routing problem into a number of bi-objective problems. All these algorithmic advances are illustrated by a case study of routing hazardous materials in a U.S. northeastern highway network.