Time-dependent routing problems: A review

被引：188

作者：

Gendreau, Michel ^{[1
,2
]}

Ghiani, Gianpaolo ^{[2
,3
]}

Guerriero, Emanuela ^{[3
]}

机构：

[1] Interuniv Res Ctr Enterprise Networks Logist & Tr, Montreal, PQ H3C 3A7, Canada

[2] Ecole Polytech, Dept Math & Ind Engn, Montreal, PQ H3C 3A7, Canada

[3] Univ Salento, Dipartimento Ingn Innovaz, I-73100 Lecce, Italy

来源：

COMPUTERS & OPERATIONS RESEARCH | 2015年 / 64卷

关键词：

Travel time models; Quickest path problem; Vehicle routing problem; TRAVELING SALESMAN PROBLEM; SHORTEST-PATH PROBLEM; MINIMUM-COST-PATH; TRANSPORTATION NETWORKS; SEARCH APPROACH; ANT COLONY; VEHICLE; ALGORITHM; WINDOWS; FORMULATIONS;

D O I：

10.1016/j.cor.2015.06.001

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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.

引用

页码：189 / 197

页数：9

共 98 条

[1] VEHICLE-ROUTEING WITH TIME WINDOWS AND TIME-VARYING CONGESTION [J].