政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/73707
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文笔数/总笔数 : 91913/122132 (75%)
造访人次 : 25833521      在线人数 : 200
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    政大機構典藏 > 商學院 > 企業管理學系 > 期刊論文 >  Item 140.119/73707


    请使用永久网址来引用或连结此文件: http://nccur.lib.nccu.edu.tw/handle/140.119/73707


    题名: Finding theKth shortest path in a time-schedule network
    作者: Tang, Kwei;Chen, Yen-Liang
    唐揆
    贡献者: 企管系
    关键词: 
    日期: 2005
    上传时间: 2015-03-09 16:18:11 (UTC+8)
    摘要: We consider the problem of finding the Kth shortest path for a time-schedule network, where each node in the network has a list of prespecified departure times, and departure from the node can take place only at one of these departure times. We develop a polynomial time algorithm independent of K for finding the Kth shortest path. The proposed algorithm constructs a map structure at each node in the network, using which we can directly find the Kth shortest path without having to enumerate the first K − 1 paths. Since the same map structure is used for different K values, it is not necessary to reconstruct the table for additional paths. Consequently, the algorithm is suitable for directly finding multiple shortest paths in the same network. Furthermore, the algorithm is modified slightly for enumerating the first K shortest paths and is shown to have the lowest possible time complexity under a condition that holds for most practical networks.
    關聯: Naval Research Logistics , 52(1), 93-102
    数据类型: article
    DOI 連結: http://dx.doi.org/10.1002/nav.20061
    DOI: 10.1002/nav.20061
    显示于类别:[企業管理學系] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML760检视/开启
    index.html0KbHTML924检视/开启


    在政大典藏中所有的数据项都受到原著作权保护.


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈