.png){kind=icon}
返回
On an exact method for the constrained shortest path problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2012.07.008.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The constrained shortest path (CSP) is a well known NP-Hard problem. Besides from its straightforward application as a network problem, the CSP is also used as a building block under column-generation solution methods for crew scheduling and crew rostering problems. We propose an exact solution method for the CSP capable of handling large-scale networks in a reasonable amount of time. We compared our approach with three different state-of-the-art algorithms for the CSP and found optimal solutions on networks with up to 40,000 nodes and 800,000 arcs. We extended the algorithm to effectively solve the auxiliary problems of a multi-activity shift scheduling problem and a bus rapid transit route design problem tackled with column generation. We obtained significant speedups against alternative column generation schemes that solve the auxiliary problem with state-of-the-art commercial (linear) optimizers. We also present a first parallel version of our algorithm that shows promising results. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Constrained shortest path
Shortest path problem
Column generation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Constrained network-based column generation for the multi-activity shift scheduling problem多活动班次调度问题的基于约束网络的列生成
PREAI
分享收藏
A weighted cooperative spectrum sensing framework for infrastructure-based cognitive radio networks
PREAI
分享收藏
查看更多内容