检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]长沙理工大学交通运输工程学院,湖南长沙410114
出 处:《交通科学与工程》2017年第4期77-81,共5页Journal of Transport Science and Engineering
基 金:国家自然科学基金项目(51178061)
摘 要:将最短路径问题与区间分析方法结合起来,采用区间值衡量路段阻抗,并将阻抗下界值作为路段非延误状态下的阻抗,阻抗上界值与下界值的差作为路段阻抗的最大延误,建立了区间不确定阻抗下的可靠最短路径模型。将阻抗的上界值、下界值以及二者之差作为参数,采用超星算法,求解可靠最短路径模型,得到超路径集合和多条可靠最短路径。通过求解可靠最短路径的实例,验证了本研究所提出的模型及其算法的合理性和有效性。Combined with the shortest path problem and the interval analysis method, the interval value is used to measure the impedance, and the lower bound value of the impedance is taken as the link impedance under the condition of non-delay. The difference between upper bound value and lower bound value of the impedance is the maxi- mum delay of link impedance, an reliable shortest paths model with interval uncertain impedance is built. The upper bound value and the lower bound value of impedance and the difference between them are taken as parameters. Hyperstar algorithm is used to solve the reliable shortest paths model,which can get a set of Hyperpath including multiple reliable shortest paths. Two reliable shortest paths are solved through an example, which verifies the rationality and validity of the model and algorithm proposed.
关 键 词:区间阻抗 可靠最短路径 鲁棒优化 A星算法 超星算法
分 类 号:U491.14[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117