首页 | 本学科首页   官方微博 | 高级检索  
     检索      

多目标最短路径模型及算法
引用本文:郝光,张殿业,冯勋省.多目标最短路径模型及算法[J].西南交通大学学报,2007,42(5):641-646.
作者姓名:郝光  张殿业  冯勋省
作者单位:1. 铁道部经济规划研究院,北京,100038;西南交通大学交通运输学院,四川,成都,610031
2. 西南交通大学物流学院,四川,成都,610031
3. 西南交通大学交通运输学院,四川,成都,610031
基金项目:西南交通大学交通运输工程研究生创新实践基地资助项目
摘    要:为获得满足决策者需要的多目标最短路径问题的有效路径,建立了多目标最短路径模型,并提出了综合k-最短路径算法和多目标格序决策方法的多项式算法.该算法根据决策者可以接受的各单目标的上限,用k-最短路径算法,分别确定各单目标的可行路径集及其交集.再用多目标格序决策方法,比较交集中的有效路径,最终获得决策者满意的路径.

关 键 词:多目标  有效路径  k-最短路径  格序决策  模型  算法
文章编号:0258-1724(2007)05-0641-06
修稿时间:2006-06-30

Model and Algorithm for Shortest Path of Multiple Objectives
HAO Guang,ZHANG Dianye,FENG Xunsheng.Model and Algorithm for Shortest Path of Multiple Objectives[J].Journal of Southwest Jiaotong University,2007,42(5):641-646.
Authors:HAO Guang  ZHANG Dianye  FENG Xunsheng
Institution:1. Economics and Planning Research Institute of the Ministry of Railway of China, Beijing 100038, China; 2. School of Traffic and Transp. , Southwest Jiaotong University, Chengdu 610031, China; 3. School of Logistics, Southwest Jiaotong University, Chengdu 610031, China
Abstract:To obtain acceptable shortest paths,which meet the decision-maker's requirements,for a multi-objective shortest path problem,a model and a polynomial algorithm were presented.The algorithm is a combination of a k-shortest path algorithm and a multi-objective lattice-order decision-making method.In the algorithm,a set of feasible paths for each objective is determined using the k-shortest path algorithm according to the acceptable upper limit for the objective,and the intersection of all the sets is obtained.Then efficient paths in the intersection are compared with each other by the method of multi-objective lattice-order decision-making,and the best one in the set is finally selected as the acceptable path.
Keywords:multi-objective  efficient path  k-shortest path  lattice-order decision-making  model  algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号