×

A simulated annealing methodology to distribution network design and management. (English) Zbl 1012.90531

Summary: 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.

MSC:

90B50 Management decision making, including multiple objectives
90B10 Deterministic network models in operations research
90C59 Approximation methods and heuristics in mathematical programming
90C11 Mixed integer programming
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Abramson, D., Constructing school timetables using simulated annealing: sequential and parallel algorithms, Management science, 37, 98-113, (1991)
[2] Bailey, R.; Garner, K.; Hobbs, M., Using simulated annealing and genetic algorithms to solve staff-scheduling problems, Asia-Pacific journal of operational research, 14, 2, 27-43, (1997) · Zbl 0909.90170
[3] Barcelo, J.; Casanova, J., A heuristic Lagrangian algorithm for the capacitated plant location problem, European journal of operational research, 15, 212-226, (1984) · Zbl 0544.90025
[4] Bolte, A.; Thonemann, U., Optimizing simulated annealing schedules with genetic programming, European journal of operational research, 92, 402-416, (1996) · Zbl 0912.90235
[5] Brandeau, M.; Chiu, S., An overview of representative problems in location research, Management science, 35, 645-673, (1989) · Zbl 0669.90040
[6] Campbell, K., Fedex generates bid lines using simulated annealing, Interfaces, 27, 2, 1-17, (1997)
[7] Carter, J.; Ferrin, B.G., The impact of transportation costs on supply chain management, Journal of business logistics, 16, 189-212, (1995)
[8] Eglese, R., Simulated annealing: A tool for operational research, European journal of operational research, 46, 271-281, (1990) · Zbl 0699.90080
[9] Ellram, L., Supply chain management: the industrial organization perspective, International journal of physical distribution and logistics, 21, 13-22, (1991)
[10] Feterolf, P.; Anandanlingham, G., Optimizing interconnections of local area networks: an approach using simulated annealing, ORSA journal of computing, 3, 4, 275-287, (1991) · Zbl 0775.90162
[11] Francis, R.L.; McGinnis, L.F.; White, J.A., Facility location and layout: an analytical approach, (1992), Prentice-Hall Englewoods Cliffs, NJ
[12] Foerster, P.; Hildegard, Simple conditions for order spread minimizing in sequencing cutting patterns, European journal of operational research, 110, 2, 272-281, (1998) · Zbl 0948.90066
[13] Foerster, H.; Wascher, G., Simulated annealing for order spread minimizing in sequencing cutting patterns, European journal of operational research, 110, 2, 272-281, (1998) · Zbl 0948.90066
[14] Gemmill, D., Using a simulated annealing algorithm to schedule activities of resource-constrained projects, Project management journal, 28, 4, 8-20, (1997)
[15] Hakimi, S.L., Optimum distribution of switching centers in a communication network and some related graph theoretic problems, Operations research, 13, 462-475, (1965) · Zbl 0135.20501
[16] Jayaraman, V., An efficient heuristic procedure for practical-sized capacitated warehouse design and management, Decision sciences journal, 29, 3, 729-745, (1998)
[17] Klincewicz, J.; Luss, H., A Lagrangian relaxation heuristic for capacitated facility location with single-source constraints, Journal of operational research society, 37, 495-500, (1986) · Zbl 0588.90025
[18] Lai, K., Developing a simulated annealing algorithm for the cutting stock problem, Computers and industrial engineering, 32, 1, 115-127, (1997)
[19] Leonardo, C., A solution to the facility location problem using simulated annealing, Computers in industry, 36, 2, 125-132, (1998)
[20] Lockwood, C.; Moore, T., Harvest scheduling with spatial constraints: A simulated annealing approach, Canadian journal of forest research, 23, 468-478, (1993)
[21] Marin, A.; Salmeron, J., Tactical design of rail freight networks. part II: local search methods with statistical analysis, European journal of operational research, 94, 43-53, (1996) · Zbl 0944.90006
[22] Metropolis, A.; Rosenbluth, A.; Rosenbluth, W.; Teller, E., Equation of state calculations by fast computing machines, Journal of chemical physics, 21, 1087-1092, (1953)
[23] Mirchandani, P.B.; Francis, R.L., Discrete location theory, (1990), Wiley New York · Zbl 0718.00021
[24] Pirkul, H., Efficient algorithms for the capacitated concentrator location problem, Computers and operations research, 197-208, (1987) · Zbl 0617.90019
[25] Revelle, C.; Laporte, G., The plant location problem: new models and research prospects, Operations research, 44, 864-874, (1996) · Zbl 0879.90130
[26] Robinson, E.; Swink, M., Reason-based solutions and the complexity of distribution network design problems, European journal of operational research, 76, 393-409, (1994) · Zbl 0925.90167
[27] Robinson, E.; Swink, M., A comparative model of facility network design methodologies, Journal of operations management, 13, 169-181, (1995)
[28] Ross, A., A two-phased approach to the supply network reconfiguration problem, European journal of operational research, 122, 18-30, (2000) · Zbl 0968.90015
[29] Schilling, D.; Jayaraman, V.; Barkhi, R., A review of covering problems in location analysis, Location science, 1, 25-55, (1993) · Zbl 0923.90108
[30] Sridharan, R., A heuristic Lagrangian algorithm for the capacitated plant location problem - A comment, European journal of operational research, 23, 264-265, (1993) · Zbl 0577.90019
[31] Stalk, G.; Evans, P.; Shulman, L., Competing on capabilities: the new rules of corporate strategy, Harvard business review, March-April, 57-69, (1992)
[32] Tan, K.C., Minimizing tardiness on a single processor with sequence-dependent setup times: A simulated annealing approach, Omega, 25, 6, 619-631, (1997)
[33] Thompson, J.; Dowsland, K., A robust simulated annealing based examination timetabling system, Computers and operations research, 25, 637-648, (1998) · Zbl 1042.90568
[34] Vernekar, A.; Anandanlingham, G.; Dorny, C., Optimization of resource locations in hierarchical computer networks, Computers and operations research, 17, 375-388, (1990) · Zbl 0692.68044
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.