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
来源：
2010 THE 3RD INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND INDUSTRIAL APPLICATION (PACIIA2010), VOL IV | 2010年
关键词：
Lagrange relaxation; shortest path problem;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
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.
引用
收藏
页码：373 / 376
页数：4
相关论文
共 50 条
  • [41] An exact algorithm for minimum CDS with shortest path constraint in wireless networks
    Ding, Ling
    Gao, Xiaofeng
    Wu, Weili
    Lee, Wonjun
    Zhu, Xu
    Du, Ding-Zhu
    OPTIMIZATION LETTERS, 2011, 5 (02) : 297 - 306
  • [42] Shorter path constraints for the resource constrained shortest path problem
    Gellermann, T
    Sellmann, M
    Wright, R
    INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING FOR COMBINATORIAL OPTIMIZATION PROBLEMS, 2005, 3524 : 201 - 216
  • [43] Stochastic Shortest Path with Energy Constraints in POMDPs
    Brazdil, Tomas
    Chatterjee, Krishnendu
    Chmelik, Martin
    Gupta, Anchit
    Novotny, Petr
    AAMAS'16: PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS, 2016, : 1465 - 1466
  • [44] A shortest-path routing algorithm for incomplete WK-recursive networks
    Su, MY
    Chen, GH
    Duh, DR
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1997, 8 (04) : 367 - 379
  • [45] An algorithm for single source shortest path in networks using depth first search
    Zhuang Ming
    Yang Xiao
    ADVANCED COMPUTER TECHNOLOGY, NEW EDUCATION, PROCEEDINGS, 2007, : 322 - 326
  • [46] A Novel Shortest Path Routing Algorithm for Wireless Data Collection in Transportation Networks
    Senturk, Izzet Fatih
    Kebe, Gaoussou Youssouf
    2019 4TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND ENGINEERING (UBMK), 2019, : 280 - 284
  • [47] A loop-free shortest-path routing algorithm for dynamic networks
    D'Angelo, Gianlorenzo
    D'Emidio, Mattia
    Frigioni, Daniele
    THEORETICAL COMPUTER SCIENCE, 2014, 516 : 1 - 19
  • [48] An oblivious shortest-path routing algorithm for fully connected cubic networks
    Yang, Xiaofan
    Megson, Graham M.
    Evans, David J.
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2006, 66 (10) : 1294 - 1303
  • [49] A Routing Algorithm with Candidate Shortest Path
    潘启敬
    Journal of Computer Science and Technology, 1986, (03) : 33 - 52
  • [50] An Improved Multiobjective Shortest Path Algorithm
    de las Casas, Pedro Maristany
    Sedeno-Noda, Antonio
    Borndoerfer, Ralf
    COMPUTERS & OPERATIONS RESEARCH, 2021, 135
12345