zbMATH — the first resource for mathematics

Accurate calculation of hazardous materials transport risks. (English) Zbl 1041.90003
Summary: We propose two path-selection algorithms for the transport of hazardous materials. The algorithms can deal with link impedances that are path-dependent. This approach is superior to the use of a standard shortest path algorithm, common in the literature and practice, which results in inaccuracies.

90B06 Transportation, logistics and supply chain management
90C35 Programming involving graphs or networks
Full Text: DOI
[1] ALK Associates, ALK’s PC∗HazRoute (Version 2.0), ALK Associates, Inc., 1000 Herrontown Road, Princeton, NJ, USA, 1994.
[2] Dijkstra, E., A note on two problems in connection with graphs, Numer. math., 1, 269-271, (1959) · Zbl 0092.16002
[3] Dreyfus, S.E., An appraisal of some shortest-path algorithms, Oper. res., 17, 395-412, (1969) · Zbl 0172.44202
[4] Erkut, E.; Verter, V., Modeling of transport risk for hazardous materials, Oper. res., 46, 5, 625-642, (1998) · Zbl 0987.90529
[5] ESRI, ArcView 3.1, ESRI Inc., 380 New York Street, Redlands, CA, USA, 1996.
[6] Namkoong, S.; Rho, J.H.; Choi, J.U., Development of the tree-based link labeling algorithm for optimal path-finding in urban transportation networks, Math. comput. modelling, 27, 9-11, 51-65, (1998) · Zbl 1001.90502
[7] ReVelle, C.; Cohon, J.; Shobrys, D., Simultaneous siting and routing in the disposal of hazardous wastes, Transp. sci., 25, 2, 138-145, (1991)
[8] Saccomanno, F.F.; Chan, A., Economic evaluation of routing strategies for hazardous road shipments, Transp. res. record, 1020, 12-18, (1985)
[9] Sung, K.; Bell, M.G.H.; Seong, M.; Park, S., Shortest paths in a network with time dependent flow speeds, Eur. J. oper. res., 121, 32-39, (2000) · Zbl 0959.90009
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.