A simulated annealing methodology to distribution network design and management

被引:215
作者
Jayaraman, V
Ross, A
机构
[1] Univ Miami, Sch Business Adm, Dept Management, Coral Gables, FL 33124 USA
[2] Michigan State Univ, Eli Broad Grad Sch Management, Dept Mkt & Supply Chain Management, E Lansing, MI 48824 USA
关键词
supply chain management; cross-docking; mixed-integer model; heuristics;
D O I
10.1016/S0377-2217(02)00153-4
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper describes the PLOT (Production, Logistics, Outbound, Transportation) design system. The system addresses a class of distribution network design problems, which is characterized by multiple product families, a central manufacturing plant site, multiple distribution center and cross-docking sites, and retail outlets (customer zones) which demand multiple units of several commodities. The resulting system focuses on two key stages: the planning stage where we incorporate a strategic based decision-making process of selecting the "best" set of distribution centers and cross-docks to operate. The second phase consists of the execution stage that includes an operational based decision-making process. In this phase, the model decides the required quantity of product families that need to be transported from the plant to distribution centers and transshipped to cross-docks from warehouses, and later distributed to customer outlets. The distribution system design considered here is derived from current operations of a major retailing organization that manages products for nationwide distribution. The PLOT system developed to implement the model provides for a high degree of user interaction in the generation of solutions. The overall system generates globally feasible, near optimal distribution system design and utilization strategies utilizing the simulated annealing (SA) methodology. This study makes two important contributions to the SA literature, First, we extend the breadth of applications by studying a new combinatorial problem that incorporates cross-docking in a supply chain environment. Second, we systematically evaluate the computational performance under a variety of problem scenarios and SA control parameter settings. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:629 / 645
页数:17
相关论文
共 33 条
[21]   EQUATION OF STATE CALCULATIONS BY FAST COMPUTING MACHINES [J].
METROPOLIS, N ;
ROSENBLUTH, AW ;
ROSENBLUTH, MN ;
TELLER, AH ;
TELLER, E .
JOURNAL OF CHEMICAL PHYSICS, 1953, 21 (06) :1087-1092
[22]  
Mirchandani P.B., 1990, DISCRETE LOCATION TH
[23]   EFFICIENT ALGORITHMS FOR THE CAPACITATED CONCENTRATOR LOCATION PROBLEM [J].
PIRKUL, H .
COMPUTERS & OPERATIONS RESEARCH, 1987, 14 (03) :197-208
[24]   The plant location problem: New models and research prospects [J].
Revelle, CS ;
Laporte, G .
OPERATIONS RESEARCH, 1996, 44 (06) :864-874
[25]  
Robinson E. P. Jr., 1995, Journal of Operations Management, V13, P169, DOI 10.1016/0272-6963(95)00027-P
[26]   REASON BASED SOLUTIONS AND THE COMPLEXITY OF DISTRIBUTION NETWORK DESIGN-PROBLEMS [J].
ROBINSON, EP ;
SWINK, M .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 76 (03) :393-409
[27]   A two-phased approach to the supply network reconfiguration problem [J].
Ross, AD .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 122 (01) :18-30
[28]  
Schilling D. A., 1993, Location Science, V1, P25
[29]   A HEURISTIC LAGRANGEAN ALGORITHM FOR THE CAPACITATED PLANT LOCATION PROBLEM - A COMMENT [J].
SRIDHARAN, R .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1986, 23 (02) :264-265
[30]  
STALK G, 1992, HARVARD BUSINESS MAR, P57