VEHICLE-ROUTING WITH TIME WINDOWS

被引：144

作者：

KOLEN, AWJ

KAN, AHGR

TRIENEKENS, HWJM

机构：

[1] ERASMUS UNIV, INST ECONOMETRIC, 3000 DR ROTTERDAM, NETHERLANDS

[2] ERASMUS UNIV, DEPT COMP SCI, 3000 DR ROTTERDAM, NETHERLANDS

来源：

OPERATIONS RESEARCH | 1987年 / 35卷 / 02期

关键词：

SCHEDULING - Mathematical Models - TECHNOLOGICAL FORECASTING;

D O I：

10.1287/opre.35.2.266

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In vehicle routing problems with time windows, a fixed fleet of vehicles of limited capacity is available at a depot to serve a set of clients with given demands. Each client must be visited within a given time window. We describe a branch-and-bound method that minimizes the total route length, and present some computational results.

引用

页码：266 / 273

页数：8

共 13 条

[1] AN EXACT ALGORITHM FOR THE TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM
BAKER, EK
[J]. OPERATIONS RESEARCH, 1983, 31 (05) : 938 - 945
[2] BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8
[3] EXACT ALGORITHMS FOR THE VEHICLE-ROUTING PROBLEM, BASED ON SPANNING TREE AND SHORTEST-PATH RELAXATIONS
CHRISTOFIDES, N
MINGOZZI, A
TOTH, P
[J]. MATHEMATICAL PROGRAMMING, 1981, 20 (03) : 255 - 282
[4] STATE-SPACE RELAXATION PROCEDURES FOR THE COMPUTATION OF BOUNDS TO ROUTING-PROBLEMS
CHRISTOFIDES, N
MINGOZZI, A
TOTH, P
[J]. NETWORKS, 1981, 11 (02) : 145 - 164
[5] CHRISTOFIDES N, 1981, ALGORITHM TIME CONST
[6] DESROCHERS M, 1985, 394A CTR RECH TRANSP
[7] DESROSIERS J, 1984, 68413 EC HAUT ET COM
[8] DESROSIERS J, 1985, 396 CTR RECH TRANSP
[9] Eilon S., 1971, DISTRIBUTION MANAGEM
[10] THE LAGRANGIAN-RELAXATION METHOD FOR SOLVING INTEGER PROGRAMMING-PROBLEMS
FISHER, ML
[J]. MANAGEMENT SCIENCE, 1981, 27 (01) : 1 - 18

← 1 2 →