A Shortest Path Algorithm with Constraints in Networks

被引：0
|
作者：
He, Fanguo [1 ]
Dai, Kuobin [1 ]
机构：
[1] Huanggang Normal Univ, Coll Math & Informat Sci, Huanggang, Peoples R China
来源：
APPLIED INFORMATICS AND COMMUNICATION, PT 4 | 2011年 / 227卷
关键词：
Lagrange relaxation; shortest path problem;
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
The paper deals with the shortest path problem with Constraints, and it is NP-complete problem. The problem is formulated as an optimization model. To solve this model Lagrangean relaxation algorithm is adopted. For the solution of the dual problem a subgradient method is used. The general algorithm steps for our problem are presented, and a numerical example on communication network is given to illustrate the effectiveness of the algorithm.
引用
收藏
页码：598 / 604
页数：7
相关论文
共 50 条
  • [1] A Shortest Path Algorithm with Constraints in Networks
    He, Fanguo
    Dai, Kuobin
    [J]. 2010 THE 3RD INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND INDUSTRIAL APPLICATION (PACIIA2010), VOL IV, 2010, : 373 - 376
  • [2] A heuristic algorithm for shortest path with multiple constraints
    Wang, ZY
    Wang, TC
    [J]. 2003 INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY, VOL 1 AND 2, PROCEEDINGS, 2003, : 482 - 486
  • [3] A new algorithm for the shortest path problem with constraints
    Leng, Hong-ze
    Xie, Zheng
    Chen, Zhi
    Xu, Zhen
    [J]. PROCEEDINGS OF FIRST INTERNATIONAL CONFERENCE OF MODELLING AND SIMULATION, VOL II: MATHEMATICAL MODELLING, 2008, : 320 - 325
  • [4] Shortest viable path algorithm in multimodal networks
    Lozano, A
    Storchi, G
    [J]. TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 2001, 35 (03) : 225 - 241
  • [5] Path selection algorithm for shortest path bridging in access networks
    Nakayama, Yu
    Oota, Noriyuki
    [J]. IEICE COMMUNICATIONS EXPRESS, 2013, 2 (10): : 396 - 401
  • [6] Approach to the Shortest Path with Fuzzy Constraints by Simulated Annealing Algorithm
    Su, Jie
    Li, Aihua
    [J]. PROCEEDINGS OF THE 2009 WRI GLOBAL CONGRESS ON INTELLIGENT SYSTEMS, VOL I, 2009, : 516 - 520
  • [7] An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints
    Lozano, Leonardo
    Duque, Daniel
    Medaglia, Andres L.
    [J]. TRANSPORTATION SCIENCE, 2016, 50 (01) : 348 - 357
  • [8] An Algorithm to Find the kth shortest Path in Halin Networks
    Lu, Yunting
    Li, Zhenjun
    [J]. 2008 INTERNATIONAL SYMPOSIUM ON INTELLIGENT INFORMATION TECHNOLOGY APPLICATION WORKSHOP: IITA 2008 WORKSHOPS, PROCEEDINGS, 2008, : 698 - +
  • [9] STRING ALGORITHM FOR SHORTEST-PATH IN DIRECTED NETWORKS
    KLEE, V
    [J]. OPERATIONS RESEARCH, 1964, 12 (03) : 428 - &
  • [10] Modified Dijkstra Shortest Path Algorithm for SD Networks
    Abdelghany, Haitham M.
    Zaki, Fayez W.
    Ashour, Mohammed M.
    [J]. INTERNATIONAL JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING SYSTEMS, 2022, 13 (03) : 203 - 208
12345