Design of supply-chain logistics system considering service level

被引:70
作者
Hwang, HS [1 ]
机构
[1] Dongeui Univ, Dept Ind Engn, Pusanjin Ku, Pusan 614714, South Korea
关键词
logistics system design; stochastic set-covering problem; vehicle routing problem;
D O I
10.1016/S0360-8352(02)00075-X
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This research is concerned with an logistics system design which optimizes the performance of logistics system subject to required service levels both in the number of warehouse or distribution centers (W/D) and vehicle routing schedule. In this paper, the logistics system includes plants, W/D and customers. First, we formulated this problem using stochastic set-covering problem to determine the minimum number of W/D centers among a discrete set of location sites so that the probability of each customer to be covered is not less than a critical service level and solved this problem using 0-1 programming method. Then, we formulated a vehicle routing problem using an improved genetic algorithm and developed GUI-type programming based on three-step approaches such as: (1) clustering module which converges multi-supply center problem into single supply center problems, (2) improved vehicle routing, VRP module, and (3) GA-TSP module. For the users' conveniences, the sample results have been compared with those of existing methods. This research is strongly application oriented and the proposed model can be used to real world problems with some improvements. (C) 2002 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:283 / 297
页数:15
相关论文
共 10 条
[1]   SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].
CLARKE, G ;
WRIGHT, JW .
OPERATIONS RESEARCH, 1964, 12 (04) :568-&
[2]  
DOR ML, 1989, TRANSPORT SCI, V23, P166
[3]  
FISHER ML, 1995, VEHICLE ROUTING HDB
[4]   Stochastic vehicle routing [J].
Gendreau, M ;
Laporte, G ;
Seguin, R .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 88 (01) :3-12
[5]   HEURISTIC ALGORITHM FOR VEHICLE-DISPATCH PROBLEM [J].
GILLETT, BE ;
MILLER, LR .
OPERATIONS RESEARCH, 1974, 22 (02) :340-349
[6]  
Grefenstette J., 1995, P INT C GEN ALG THEI, P160
[7]  
Kuhn HW., 1973, MATH PROGRAM, V4, P98, DOI DOI 10.1007/BF01584648
[8]  
KUREICHICK VM, 1996, P ACEEDC 96, P1
[9]   EFFECTIVE HEURISTIC ALGORITHM FOR TRAVELING-SALESMAN PROBLEM [J].
LIN, S ;
KERNIGHAN, BW .
OPERATIONS RESEARCH, 1973, 21 (02) :498-516
[10]  
SUGAL, 1995, GENETIC ALGORITHM PA