Publisher Summary According to the US Department of Transportation (US DOT), a
hazardous material is defined as any substance or material capable of causing harm to …

The paper presents a structured overview of the literature on the hazardous material
(hazmat) transportation problem of the last 45 years. Additionally, a detailed classification for …

We give algorithms for finding the k shortest paths (not required to be simple) connecting a
pair of vertices in a digraph. Our algorithms output an implicit representation of these paths …

Given a transportation network, this paper considers the problem of finding a number of
spatially dissimilar paths between an origin and a destination. A number of dissimilar paths …

Online Social networks have provided the infrastructure for a number of emerging
applications in recent years, eg, for the recommendation of service providers or the …

A new algorithm to compute the K shortest paths (in order of increasing length) between a
given pair of nodes in a digraph with n nodes and m arcs is presented. The algorithm …

The people living and working around the roads used for hazardous material (hazmat)
shipments face the risk of suffering undesirable consequences of an accident. The main …

In this article, we present an efficient computational implementation of an algorithm for
finding the K shortest simple paths connecting a pair of vertices in an undirected graph with …

We consider the problem of enumerating, in order of increasing length, the K shortest paths
between a given pair of nodes in a weighted digraph G with n nodes and m arcs. To solve …

This paper considers integrated location and routing models for minimizing the expected
number of hazardous material transport accidents. Two different routing policies are …