An Efficient Algorithm for the Shortest Path Problem with Forbidden Paths

被引：0

作者：

Hsu, Chiun-Chieh ^{[1
]}

Chen, Da-Ren ^{[2
]}

Ding, Hua-Yuan ^{[1
]}

机构：

[1] Natl Taiwan Univ Sci & Technol, Dept Informat Management, 43,Sec 4,Keelung Rd, Taipei 106, Taiwan

[2] Hwa Hsia Univ Technol, Dept Informat & Management, Taipei, Taiwan

来源：

ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PROCEEDINGS | 2009年 / 5574卷

关键词：

Shortest paths; Forbidden paths; Labeling algorithm; Network flows; LOOPING PATHS; RANKING; TIME;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper, we discuss the shortest path problem with forbidden paths (SPPFP), where the constraints come from a set of forbidden paths (arc sequences) that cannot be part of any feasible solution. SPPFP can be used to solve the problems with hard-to-modeled path constraints or to implement exact branching scheme. The method proposed by Villeneuve and Desaulmers first transfer the SPPFP problem to the k-shortest paths problem. We propose an algorithm which reduces execution time of solving the SPPFP problem via a nodes combination process. It improves the approach proposed by Villeneuve and Desaulniers. In addition, their algorithm for generating augmented paths could cause the inconsistency in particular situations. The proposed method also improves the weakness without increasing its time complexity.

引用

页码：638 / +

页数：3

共 50 条

[31] An Encoding Algorithm Based on the Shortest Path Problem
Liu, Fanghan
Tang, Xiaobing
Yang, Zhaohui
2018 14TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), 2018, : 35 - 39
[32] An exact algorithm for the statistical shortest path problem*
Deng, Liang
Wong, Martin D. F.
ASP-DAC 2006: 11TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, PROCEEDINGS, 2006, : 965 - 970
[33] Rapid Physarum Algorithm for shortest path problem
Zhang, Xiaoge
Zhang, Yajuan
Zhang, Zili
Mahadevan, Sankaran
Adamatzky, Andrew
Deng, Yong
APPLIED SOFT COMPUTING, 2014, 23 : 19 - 26
[34] A new algorithm for the shortest-path problem
Elmasry, Amr
Shokry, Ahmed
NETWORKS, 2019, 74 (01) : 16 - 39
[35] Research on algorithm for K shortest path problem
Zhang, Yongmei
Han, Yan
Bo, Chengwei
Journal of Information and Computational Science, 2004, 1 (03): : 435 - 439
[36] Solving a shortest path problem by ant algorithm
Fan, H
Hua, Z
Li, JJ
Yuan, D
PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2004, : 3174 - 3177
[37] An Efficient Algorithm for the Shortest Vector Problem
Chuang, Yu-Lun
Fan, Chun-, I
Tseng, Yi-Fan
IEEE ACCESS, 2018, 6 : 61478 - 61487
[38] A multi label algorithm for k shortest paths problem
Paluch, Stanislav
Communications - Scientific Letters of the University of Žilina, 2009, 11 (03): : 11 - 14
[39] An efficient distributed algorithm reconstructing the shortest path
Park, JH
Yoon, SH
Lee, CS
Lee, JB
Choi, SH
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, 2000, : 2833 - 2838
[40] An efficient algorithm for shortest paths in vertical and horizontal segments
Eppstein, D
Hart, DW
ALGORITHMS AND DATA STRUCTURES, 1997, 1272 : 234 - 247

← 1 2 3 4 5 →