Vehicle routing with time windows: Two optimization algorithms

被引：102
作者：
Fisher, ML
Jornsten, KO
Madsen, OBG
机构：
[1] NORWEGIAN SCH ECON & BUSINESS ADM,DEPT FINANCE & MANAGEMENT SCI,N-5035 BERGEN,NORWAY
[2] TECH UNIV DENMARK,DEPT MATH MODELLING,DK-2800 LYNGBY,DENMARK
来源：
OPERATIONS RESEARCH | 1997年 / 45卷 / 03期
关键词：
D O I：
10.1287/opre.45.3.488
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
We describe two optimization methods for vehicle routing problems with time windows. These are a K-Tree relaxation with time windows added as side constraints and a Lagrangian decomposition in which variable splitting is used to divide the problem into two subproblems-a semi-assignment problem and a series of shortest path problems with time windows and capacity constraints. We present optimal solutions to problems with up to 100 customers.
引用
收藏
页码：488 / 492
页数：5
相关论文
共 16 条
[1]   STATE-SPACE RELAXATION PROCEDURES FOR THE COMPUTATION OF BOUNDS TO ROUTING-PROBLEMS [J].
CHRISTOFIDES, N ;
MINGOZZI, A ;
TOTH, P .
NETWORKS, 1981, 11 (02) :145-164
[2]  
DESROCHERS M, 1988, INFOR, V26, P191
[3]   A NEW OPTIMIZATION ALGORITHM FOR THE VEHICLE-ROUTING PROBLEM WITH TIME WINDOWS [J].
DESROCHERS, M ;
DESROSIERS, J ;
SOLOMON, M .
OPERATIONS RESEARCH, 1992, 40 (02) :342-354
[4]  
DESROCHERS M., 1988, VEHICLE ROUTING: METHOD AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS, P65
[5]   NOTE ON THE COMPLEXITY OF THE SHORTEST-PATH MODELS FOR COLUMN GENERATION IN VRPTW [J].
DROR, M .
OPERATIONS RESEARCH, 1994, 42 (05) :977-978
[6]   OPTIMAL SOLUTION OF VEHICLE-ROUTING PROBLEMS USING MINIMUM K-TREES [J].
FISHER, ML .
OPERATIONS RESEARCH, 1994, 42 (04) :626-642
[7]   LAGRANGEAN DECOMPOSITION - A MODEL YIELDING STRONGER LAGRANGEAN BOUNDS [J].
GUIGNARD, M ;
KIM, S .
MATHEMATICAL PROGRAMMING, 1987, 39 (02) :215-228
[8]  
HALSE K, 1992, THESIS TU DENMARK LY
[9]  
JORNSTEN K, 1986, K1986 IMSOR TU DENM
[10]  
JORNSTEN K, 1985, LITHMAT8504 DEP MAT
12