AN IMPROVED HEURISTIC FOR THE PERIOD VEHICLE-ROUTING PROBLEM

被引：80

作者：

CHAO, IM

GOLDEN, BL

WASIL, E

机构：

[1] UNIV MARYLAND,COLL BUSINESS & MANAGEMENT,COLLEGE PK,MD 20742

[2] AMERICAN UNIV,KOGOD COLL BUSINESS ADM,WASHINGTON,DC 20016

来源：

NETWORKS | 1995年 / 26卷 / 01期

关键词：

D O I：

10.1002/net.3230260104

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

In the period vehicle routing problem, each customer requires a certain number of deliveries per week. Given these frequency requirements, customers must be allocated to days. A vehicle routing problem is solved over each day. We have improved upon best-known solutions to problems from the literature using a new heuristic procedure. The heuristic also works well on 19 newly generated test problems. (C) 1995 John Wiley and Sons, Inc.

引用

页码：25 / 44

页数：20

共 18 条

[1]

BALL M, 1988, VEHICLE ROUTING METH

[2]

Beltrami EJ, 1974, NETWORKS, V4, P65, DOI DOI 10.1002/NET.3230040106

[3]

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

[4]

CHAO I, 1993, THESIS U MARYLAND CO

[5] THE PERIOD ROUTING PROBLEM [J].

CHRISTOFIDES, N ;

BEASLEY, JE .

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

[6]

DROR M, 1987, NAV RES LOG, V34, P891, DOI 10.1002/1520-6750(198712)34:6<891::AID-NAV3220340613>3.0.CO

[7]

2-J

[8]

Dueck G., 1990, NEW OPTIMIZATION HEU

[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 →