Multiobjective Path Finding in Stochastic Dynamic Networks, with Application to Routing Hazardous Materials Shipments

摘要

We describe a method for finding nondominated paths for multiple routing objectives in networks where the routing attributes are uncertain, and the probability distributions that describe those attributes vary by time of day. This problem is particularly important in routing and scheduling of shipments of very hazardous materials. Our method extends and integrates the work of several previous authors, resulting in a new algorithm that propagates means and variances of the uncertain attributes along paths and compares partial paths that arrive at a given node within a user-specified time window. The comparison uses an approximate stochastic dominance criterion. We illustrate the effects of changing primary parameters of the algorithm using a small test network, and we show how the nondominated solution set achieved is larger than the set that would be identified if the uncertainty in routing attributes were ignored. We then demonstrate how the algorithm creates an effective solution set in a case study using a large network.