VEHICLE-ROUTING VIA COLUMN GENERATION

被引:8
作者
SKITT, RA
LEVARY, RR
机构
[1] MIT,OPERAT RES CTR,CAMBRIDGE,MA 02139
[2] ST LOUIS UNIV,DEPT MANAGEMENT SCI,ST LOUIS,MO 63108
关键词
MATHEMATICAL PROGRAMMING; LINEAR;
D O I
10.1016/0377-2217(85)90089-X
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper explores an approximate method for solving a routing problem in a four-level distribution which has 'double-ended' demand. Routes are represented as columns in a linear program and column generation is used to improve the solution by generating new routes. The generation of new routes is based on an LP sub-problem. Its solution is rounded down to integer values to insure its feasibility as a route for inclusion in the restricted master problem. Finally, an illustrative problem is solved.
引用
收藏
页码:65 / 76
页数:12
相关论文
共 21 条
[1]   ON INTEGER-PROGRAM FOR DELIVERY PROBLEM [J].
BALINSKI, ML ;
QUANDT, RE .
OPERATIONS RESEARCH, 1964, 12 (02) :300-&
[2]  
BODIN L, 1981, NETWORKS, V11, P79
[3]   EXACT ALGORITHMS FOR THE VEHICLE-ROUTING PROBLEM, BASED ON SPANNING TREE AND SHORTEST-PATH RELAXATIONS [J].
CHRISTOFIDES, N ;
MINGOZZI, A ;
TOTH, P .
MATHEMATICAL PROGRAMMING, 1981, 20 (03) :255-282
[4]   SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].
CLARKE, G ;
WRIGHT, JW .
OPERATIONS RESEARCH, 1964, 12 (04) :568-&
[5]   SET PARTITIONING BASED HEURISTICS FOR INTERACTIVE ROUTING [J].
CULLEN, FH ;
JARVIS, JJ ;
RATLIFF, HD .
NETWORKS, 1981, 11 (02) :125-143
[6]  
DANTZIG GB, 1961, ECONOMETRICA, V9
[7]  
Eilon S., 1971, DISTRIBUTION MANAGEM
[8]   A GENERALIZED ASSIGNMENT HEURISTIC FOR VEHICLE-ROUTING [J].
FISHER, ML ;
JAIKUMAR, R .
NETWORKS, 1981, 11 (02) :109-124
[9]   INTEGER PROGRAMMING APPROACH TO VEHICLE SCHEDULING PROBLEM [J].
FOSTER, BA ;
RYAN, DM .
OPERATIONAL RESEARCH QUARTERLY, 1976, 27 (02) :367-384
[10]  
GASKILL T, 1957, OPERATIONAL RES Q, V18, P281