A risk-cost minimization model for catastrophe averse shipment of hazardous materials

Author

Nagae, Takeshi

Author_Institution

Grad. Sch. of Inf. Syst., Univ. of Electro-Commun., Chofu

fYear

2008

fDate

20-22 Aug. 2008

Firstpage

1165

Lastpage

1170

Abstract

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.

Keywords

catastrophe theory; convex programming; costing; hazardous materials; materials handling; minimisation; risk analysis; transportation; catastrophe averse shipment; hazardous materials; hazmats; maximin problem; mixed routing strategy; real-world large-scale networks; risk-cost minimization model; single-level convex programming problem; transportation cost; Costs; Electronic mail; Hazardous materials; Information systems; Large-scale systems; Minimization methods; Radioactive materials; Routing; Telecommunication traffic; Transportation; hazardous materials; logit traffic assignment; risk-averse routing;

fLanguage

English

Publisher

ieee

Conference_Titel

SICE Annual Conference, 2008

Conference_Location

Tokyo

Print_ISBN

978-4-907764-30-2

Electronic_ISBN

978-4-907764-29-6

Type

conf

DOI

10.1109/SICE.2008.4654836

Filename

4654836