Relative Entropy Model of Uncertain Random Shortest Path

The shortest path problem is one of network optimization problems. This paper considers a shortest path problem under the situation where lengths of arcs in a network include both uncertainty and randomness, and focuses on the case that the lengths of arcs are expressed by uncertain random variables. This paper presents a new type of model: relative entropy model of shortest path. By the definition of relative entropy of the uncertain random variables, relative entropy model of shortest path problem is proposed to find the shortest path which fully reflects uncertain and random information. This model is formulated to find a shortest path whose chance distribution minimizes the difference from the ideal one. A numerical example is given to illustrate the model's effectiveness.