ON THE VEHICLE ROUTING PROBLEM

被引：0

作者：

Netusil, Zdenek ^{[1
]}

机构：

[1] Brno Univ Technol, Inst Automat & Comp Sci, Fac Mech Engn, Brno 61669, Czech Republic

来源：

APLIMAT 2007 - 6TH INTERNATIONAL CONFERENCE, PT I | 2007年

关键词：

vehicle routing problem; heuristics; scheduling; distribution;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

This paper discusses the Vehicle Routing Problem (VRP). VRP is a name given to the family of problems consisting of finding optimal vehicle routes (i.e., minimizing costs) for serving the customers with their known demands. Furthermore, some extensions to the problem as well as the solution techniques are involved.

引用

页码：95 / 100

页数：6

共 11 条

[1] Christofides N., 1979, Combinatorial optimization, P315
[2] SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS
CLARKE, G
WRIGHT, JW
[J]. OPERATIONS RESEARCH, 1964, 12 (04) : 568 - &
[3] Cordeau JF, 2002, J OPER RES SOC, V53, P512, DOI [10.1057/palgrave/jors/2601319, 10.1057/palgrave.jors.2601319]
[4] THE TRUCK DISPATCHING PROBLEM
DANTZIG, GB
RAMSER, JH
[J]. MANAGEMENT SCIENCE, 1959, 6 (01) : 80 - 91
[5] A GENERALIZED ASSIGNMENT HEURISTIC FOR VEHICLE-ROUTING
FISHER, ML
JAIKUMAR, R
[J]. NETWORKS, 1981, 11 (02) : 109 - 124
[6] HEURISTIC ALGORITHM FOR VEHICLE-DISPATCH PROBLEM
GILLETT, BE
MILLER, LR
[J]. OPERATIONS RESEARCH, 1974, 22 (02) : 340 - 349
[7] Gross J., 1999, CRC DISCR MATH APPL
[8] Pardalos P.M., 2002, HDB APPL OPTIMIZATIO
[9] COMPUTER SCHEDULING OF VEHICLES FROM ONE OR MORE DEPOTS TO A NUMBER OF DELIVERY POINTS
WREN, A
HOLLIDAY, A
[J]. OPERATIONAL RESEARCH QUARTERLY, 1972, 23 (03) : 333 - &
[10] Wren A., 1971, COMPUTERS TRANSPORT

← 1 2 →