A microsimulation based analysis of exact solution of dynamic vehicle routing with soft time windows

被引：14

作者：

Qureshi, Ali Gul ^{[1
]}

Taniguchi, Eiichi ^{[1
]}

Yamada, Tadashi ^{[1
]}

机构：

[1] Kyoto Univ, Dept Urban Management, Nishikyo Ku, Kyoto 6158540, Japan

来源：

SEVENTH INTERNATIONAL CONFERENCE ON CITY LOGISTICS | 2012年 / 39卷

关键词：

City logistics; vehicle routing; soft time windows; microsimulation; SHORTEST-PATH PROBLEM; RESOURCE CONSTRAINTS; SCHEDULING PROBLEMS; ALGORITHM; GENERATION;

D O I：

10.1016/j.sbspro.2012.03.102

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper presents a microsimulation-based evaluation of an exact solution approach for the soft time windows variant of the Vehicle Routing Problem (VRP) that also considers penalties on the late arrival. The exact solution approach of the Dynamic Vehicle Routing and scheduling Problem with Soft Time Windows (D-VRPSTW) is based on the column generation (Dantzig-Wolfe decomposition) scheme; whereas VISSIM has been used to simulate the traffic network under normal as well as under traffic incident conditions. Evaluations shows that the D-VRPSTW helps in avoiding additional cost as well as lateness for the freight carriers, caused due to an unexpected change in travel times along the roads. (C) 2012 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of 7th International Conference on City Logistics

引用

页码：205 / 216

页数：12

共 40 条

[1] Travel time reliability in vehicle routing and scheduling with time windows [J].

Ando, Naoki ;

Taniguchi, Eiichi .

NETWORKS & SPATIAL ECONOMICS, 2006, 6 (3-4) :293-311

[2]

BALAKRISHNAN N, 1993, J OPER RES SOC, V44, P279

[3] Simulation laboratory for evaluating dynamic traffic management systems [J].

BenAkiva, ME ;

Koutsopoulos, HN ;

Mishalani, RG ;

Yang, Q .

JOURNAL OF TRANSPORTATION ENGINEERING-ASCE, 1997, 123 (04) :283-289

[4] Adaptive granular local search heuristic for a dynamic vehicle routing problem [J].

Branchini, Rodrigo Moretti ;

Armentano, Vinicius Amaral ;

Lokketangen, Arne .

COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (11) :2955-2968

[5]

Bureau of Industrial and Labor Affairs in Tokyo Metropolitan Government, 2009, IND EMPL TOK GRAPH O

[6]

Burris MW, 1996, ITE J, V66, P21

[7] Dynamic column generation for dynamic vehicle routing with time windows [J].

Chen, ZL ;

Xu, H .

TRANSPORTATION SCIENCE, 2006, 40 (01) :74-88

[8] A NEW OPTIMIZATION ALGORITHM FOR THE VEHICLE-ROUTING PROBLEM WITH TIME WINDOWS [J].

DESROCHERS, M ;

DESROSIERS, J ;

SOLOMON, M .

OPERATIONS RESEARCH, 1992, 40 (02) :342-354

[9] OPTIMIZING THE SCHEDULE FOR A FIXED VEHICLE PATH WITH CONVEX INCONVENIENCE COSTS [J].

DUMAS, Y ;

SOUMIS, F ;

DESROSIERS, J .

TRANSPORTATION SCIENCE, 1990, 24 (02) :145-152

[10] An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems [J].

Feillet, D ;

Dejax, P ;

Gendreau, M ;

Gueguen, C .

NETWORKS, 2004, 44 (03) :216-229

← 1 2 3 4 →