An Intermodal Network Design of Dangerous Goods Considering Capacity Limit of Terminals

Abstract

Increasing amount of dangerous goods has been shipping nowadays with the intensification of industrialization. This article proposes a bi-level programming model where the upper-level (government) minimizes the total risk by closing certain terminals for hazmat transporting while the lower-level (carriers) explores the minimum-cost routines of the given network. At the same time, considering the regional positioning and throughput of different ports, this paper adds limits to the amount of transshipment in the bi-level model. And this paper solves the dynamic decision-making process by using the improved greedy algorithm. The two levels choose the optimal planning network based on their own optimal planning strategy to obtain the optimal planning network. Through the exchange of upper and lower levels, when the planning network no longer changes and the final target network is obtained. Finally, case study based on a given network shows the effectiveness of the policy and algorithm.