zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
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.

90B06Transportation, logistics
90C35Programming involving graphs or networks
Full Text: DOI
[1] ALK Associates, ALK’s PC\astHazRoute (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, No. 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, No. 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, No. 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