.png){kind=icon}
返回
The constrained shortest path tour problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2016.04.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we study the constrained shortest path tour problem. Given a directed graph with non negative arc lengths, the aim is to find a single-origin single-destination shortest path, which needs to cross a sequence of node subsets that are given in a fixed order. The subsets are disjoint and may be of different size. In addition, it is required that the path does not include repeated arcs. Theoretical properties of the problem are studied, proving that it belongs to the complexity class NP-complete. To exactly solve it, a Branch & Bound method is proposed. Given the problem hardness, a Greedy Randomized Adaptive Search Procedure is also developed to find near-optimal solutions for medium to large scale instances. Extensive computational experiments, on a significant set of test problems, are carried out in order to empirically evaluate the performance of the proposed approaches. The computational results show that the Greedy Randomized Adaptive Search Procedure is effective in finding optimal or near optimal solutions in very limited computational time. (C) 2016 Elsevier Ltd. All rights reserved.
Keyword:
Shortest path problems
Network flow problems
Combinatorial optimization
Branch & Bound
GRASP
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Reduced white matter microstructural integrity correlates with cognitive deficits in minimal hepatic encephalopathy轻度肝性脑病中白质微结构完整性降低与认知缺陷相关.png)
Gut
GutIF0
PREAI
分享收藏
分享收藏Construction of Seamless English Language Learning Cyberspace via Interactive Text Messaging Tool
OAAI
OAAI分享收藏
查看更多内容