Parametric Analysis for Multiobjective Hazardous Materials Routing Problem

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