An Uncertain Goal Programming Approach for Shortest Path Problem under Uncertain Environment

摘要：

The shortest path problem aims at finding a path between two vertices such that the sum of the weights of its constituent edges is minimized. It is a fundamental problem in network optimization and combinational optimization. The existing works focused on the deterministic, random or fuzzy situations by assuming that arc lengths are deterministic, random or fuzzy variables. Different from these literature, this paper considers a shortest path problem by handling arc lengths as uncertain variables which are provided to describe the behavior of uncertain phenomena. An uncertain goal programming approach is employed to model this problem. Three goal programming models are formulated including expected value, chance-constrained programming and chance-dependent programming. Furthermore, we concert these models into deterministic cases for several special uncertain variables.

关键词： Goal programming Shortest path problem Uncertainty measure Uncertain variable

作者: Wei Liu Chengjing Yang Xinyan Guo Yu Zheng Linlin Zhang

作者单位: Economic and Management Department, Chengdu Sport University, Chengdu 610041, China

会议类型: 国际会议

会议名称: The Second International Conference on Uncertainty Theory(ICUT)(第二届不确定理论国际会议)

会议地点: 拉萨

会议语种:英文

页码: 153-157

在线出版日期: 2011-08-06（万方平台首次上网日期，不代表论文的发表时间）