Optimization Models for Shortest Path Problem with Stochastic Arc Lengths Taking Fuzzy Information

摘要

Shortest path problem is a fundamental problem in network optimization and combinational optimization. The existing literature mainly concerned with the problem in deterministic, stochastic or fuzzy environments by using different tools. Different from the existing works, we investigate shortest path problem by regard ing arc lengths as uncertain variables which are employed to describe the behavior of uncertain phenomena. According to different decision criteria, three concepts of path are proposed in uncertain environment, and three types of uncertain program ming models are formulated. Furthermore, these models are concerted into deter ministic optimization models in several special cases.