.png){kind=icon}
返回
Time-dependent routing problems: A review
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2015.06.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Time-dependent routing amounts to design best routes in a graph in which arc traversal times may vary over the planning horizon. In the last decade, a number of technological advances have stimulated an increased interest in this field. We survey the research in the area and present a comprehensive review of travel time modelling, applications and solution methods. In particular, we make a first classification in point-to-point and multiple-point problems. A second major classification is then performed with respect to the quality and evolution of information. Other criteria included: (i) node, arc or general routing; (ii) the possibility to choose the vehicle speed. (C) 2015 Published by Elsevier Ltd.
Keyword:
Travel time models
Quickest path problem
Vehicle routing problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏The electrosorption of imidazole on a gold electrode as studied with spectroelectrochemical methods
PREAI
分享收藏
查看更多内容