The periodic vehicle routing problem with intermediate facilities

被引：139

作者：

Angelelli, E ^{[1
]}

Speranza, MG ^{[1
]}

机构：

[1] Univ Brescia, Dept Quantitat Methods, I-25122 Brescia, Italy

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2002年 / 137卷 / 02期

关键词：

periodic vehicle routing; intermediate facilities; renewable capacity; heuristics; tabu search;

D O I：

10.1016/S0377-2217(01)00206-5

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper, we study an extension of the PVRP where the vehicles can renew their capacity at some intermediate facilities. Each vehicle returns to the depot only when its work shift is over. For this problem we propose a tabu search (TS) algorithm and present computational results on a set of randomly generated instances and on a set of PVRP instances taken from the literature. (C) 2002 Elsevier Science B.V. All rights reserved.

引用

页码：233 / 247

页数：15

共 18 条

[1]

AARTS E, 1997, LOCAL SEARCH COMBINA

[2]

Beltrami E.L., 1974, Networks, V4, P65, DOI DOI 10.1002/NET3230040106

[3]

BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8

[4] AN IMPROVED HEURISTIC FOR THE PERIOD VEHICLE-ROUTING PROBLEM [J].

CHAO, IM ;

GOLDEN, BL ;

WASIL, E .

NETWORKS, 1995, 26 (01) :25-44

[5] THE PERIOD ROUTING PROBLEM [J].

CHRISTOFIDES, N ;

BEASLEY, JE .

NETWORKS, 1984, 14 (02) :237-256

[6]

Cordeau JF, 1997, NETWORKS, V30, P105, DOI 10.1002/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO

[7]

2-G

[8]

FISHER M, 1995, NETWORK ROUTING HDB, V8

[9] A GENERALIZED ASSIGNMENT HEURISTIC FOR VEHICLE-ROUTING [J].

FISHER, ML ;

JAIKUMAR, R .

NETWORKS, 1981, 11 (02) :109-124

[10] A HEURISTIC FOR THE PERIODIC VEHICLE-ROUTING PROBLEM [J].

GAUDIOSO, M ;

PALETTA, G .

TRANSPORTATION SCIENCE, 1992, 26 (02) :86-92

← 1 2 →