Volume 32 Issue 3
Jan.  2018
Article Contents
Article Navigation >  Journal of University of Electronic Science and Technology of China  > 2003  >  32(3): 267-271

Wang Hong, Wang Sheng, Li Lemin. Algorithm for Shortest Path Problem with Complex Constraints[J]. Journal of University of Electronic Science and Technology of China, 2003, 32(3): 267-271.
Citation: Wang Hong, Wang Sheng, Li Lemin. Algorithm for Shortest Path Problem with Complex Constraints[J]. Journal of University of Electronic Science and Technology of China, 2003, 32(3): 267-271.
shu

Algorithm for Shortest Path Problem with Complex Constraints

  • 1.

    State Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks,UEST of China Chengdu 610054

  • Received Date: 2002-11-25
  • Publish Date: 2003-06-15
  • The shortest path problem with complex constraints is described, and the application of deviation algorithm, a kind of k shortest paths algorithms, to this problem is introduced. The factors that affect the efficiency of the algorithm are analyzed, and an enhancement to the algorithm is proposed to improve the efficiency. Simulation results show that this enhancement is very efficient.
  • 加载中
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索
Get Citation
PDF
XML

Article Metrics

Article views(3506) PDF downloads(63) Cited by()

Related
Proportional views

Algorithm for Shortest Path Problem with Complex Constraints

  • 1. State Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks,UEST of China Chengdu 610054
  • Received Date: 2002-11-25
  • Publish Date: 2003-06-15

Abstract: The shortest path problem with complex constraints is described, and the application of deviation algorithm, a kind of k shortest paths algorithms, to this problem is introduced. The factors that affect the efficiency of the algorithm are analyzed, and an enhancement to the algorithm is proposed to improve the efficiency. Simulation results show that this enhancement is very efficient.

Wang Hong, Wang Sheng, Li Lemin. Algorithm for Shortest Path Problem with Complex Constraints[J]. Journal of University of Electronic Science and Technology of China, 2003, 32(3): 267-271.
Citation: Wang Hong, Wang Sheng, Li Lemin. Algorithm for Shortest Path Problem with Complex Constraints[J]. Journal of University of Electronic Science and Technology of China, 2003, 32(3): 267-271.
shu

    HTML

Catalog

    Journal Online

    Author's Notes

    Links

    Copyright © 《电子科技大学学报》编辑部

    Address: Room 350, central building, University of Electronic Science and Technology, No.4, Section 2, Jianshe North Road, Chengdu Tel: 028-83202308,83207559 Email: xuebao@uestc.edu.cn

    本系统由 北京仁和汇智信息技术有限公司 开发 

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return