A VEHICLE-ROUTING IMPROVEMENT ALGORITHM COMPARISON OF A GREEDY AND A MATCHING IMPLEMENTATION FOR INVENTORY ROUTING

被引：59

作者：

DROR, M ^{[1
]}

LEVY, L ^{[1
]}

机构：

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

来源：

COMPUTERS & OPERATIONS RESEARCH | 1986年 / 13卷 / 01期

关键词：

TRANSPORTATION - Operations Research;

D O I：

10.1016/0305-0548(86)90062-6

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Given an initial solution to a vehicle routing problem - (VRP) - we present three heuristic route improvement schemes based on the concept of node interchange between different routes. Three algorithms are presented together with their computational performance when applied to an inventory routing problem for 12 consecutive weekly periods. All three procedures improve the initial solution constructed by a modified Clark and Wright algorithm by over 50% as measured by the change in the value of the objective function. In two of the algorithms a minimum weight matching problem is solved repetitively.

引用

页码：33 / 45

页数：13

共 13 条

[1] ASSAD A, OCT P SE TIMS M, V82, P315
[2] Assad A.A., 1983, P 1983 SE TIMS C, P153
[3] AN ANALYSIS OF ALTERNATIVE STRATEGIES FOR IMPLEMENTING MATCHING ALGORITHMS
BALL, MO
DERIGS, U
[J]. NETWORKS, 1983, 13 (04) : 517 - 549
[4] BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8
[5] ALGORITHMS FOR LARGE-SCALE TRAVELLING SALESMAN PROBLEMS
CHRISTOFIDES, N
EILON, S
[J]. OPERATIONAL RESEARCH QUARTERLY, 1972, 23 (04) : 511 - +
[6] DROR M, 1984, UNPUB INVENTORY ROUT
[7] DROR M, 1984, PUBLICATION U MONTRE, V354
[8] Dror M., 1983, THESIS U MARYLAND CO
[9] A COMBINED VEHICLE-ROUTING AND INVENTORY ALLOCATION PROBLEM
FEDERGRUEN, A
ZIPKIN, P
[J]. OPERATIONS RESEARCH, 1984, 32 (05) : 1019 - 1037
[10] FISHER M, 1981, OCT P ANN M NCPDM

← 1 2 →