Abstract
In this paper, we address a difficult combinatorial problem that arises in designing fixed-path material handling systems, where handling occurs over a pre-defined and fixed route which connects various "sites" that are represented by a unique set of pickup and deposit points. Examples of such systems include power-and-free conveyors, monorails, in-floor towline conveyors, and automated guided vehicle systems. The objective of this study is to determine an efficient system design by simultaneously considering the configuration of the fixed path and the layout, i.e., the processor (or machine) assigned to each site. Past studies in this area have focused either on optimizing the path configuration for a given layout or on optimizing the layout for a simple path configuration. In this study, we show how simulated annealing can be applied to obtain good solutions to the problem when both the path configuration and the processor locations are determined concurrently. Since the above two problems are closely related, significant savings can be achieved by considering them simultaneously.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K.S. Al-Sultan, A simulated annealing algorithm for the Multiple Choice Knapsack problem, presented at the ORSA/TIMS Joint Spring Meeting, Nashville, TN, May 1991.
K.S. Al-Sultan, Efficient global algorithms for hard and fuzzy clustering, unpublished M.S. Thesis, King Fahd University of Petroleum and Minerals, Saudi Arabia, 1987.
Ö. Bakkalbaşi and L.F. McGinnis, private communication.
M.S. Bazaraa, and J.J. Jarvis, Linear Programming and Network Flows, Wiley, New York, 1977.
Y.A. Bozer and S. Rim, Exact solution procedures for the circular layout problem, Technical Report 89-33, Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, MI 48109, 1989.
Y.A. Bozer and S. Rim, A branch and bound method for solving the bidirectional circular layout problem, Applied Mathematical Modelling 20(1996) 342 - 351.
V. Cerny, Thermodynamical approach to the Traveling Salesman Problem: An efficient simulation algorithm, Journal of Optimization Theory and Applications 45(1985)41- 51.
G.W. Evans, M.R. Wilhelm and J.S. Usher, A modular algorithm for pre-simulation design of Automatic Guided Vehicle systems, Proceedings of the 1990 Material Handling Research Colloquium, Hebron, KY, June 19 - 21, 1990, pp. 333 - 340.
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
R.J. Gaskins and J.M.A. Tanchoco, Flow path design for Automated Guided Vehicle systems, International Journal of Production Research 25(1987)667 -676.
W.G. Goetz, Jr. and P.J. Egbelu, Guide path design and location of pick-upydrop-off points for an Automated Guided Vehicle system, International Journal of Production Research 28(1990)927- 942.
B. Hajek, Cooling schedules for optimal annealing, Mathematics of Operations Research 13(1988)311 - 329.
S.S. Heragu and A. Kusiak, Machine layout problem in flexible manufacturing systems, Operations Research 36(1988)258 - 268.
M. Kaspi and J.M.A. Tanchoco, Optimal flow path design of unidirectional AGV systems, International Journal of Production Research 28(1990)1023 - 1030.
A.S. Kiran, A.T. Unal and S. Karabati, A location problem on unicyclic networks: Balanced case, Working Paper 89-11, Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, 1989.
S. Kirkpatrick, C. Gelatt and M. Vecchi, Optimization by simulated annealing, Science 20(1983)671 -680.
P. Kouvelis and M.W. Kim, Unidirectional loop network layout problem in automated manufacturing systems, Operations Research 40(1992)533 - 550.
P. Kouvelis and W.C. Chiang, Linear single-row machine layout in automated manufacturing systems, Working Paper 89/90-4-3, Department of Management, The University of Texas at Austin, 1989.
J. Leung, A graph-theoretic heuristic for designing loop-layout manufacturing systems, Technical Report 90-12, Department of Operations Research, Yale University, New Haven, CT 06511, 1990.
M. Lundy and A, Mees, Convergence of an annealing algorithm, Mathematical Programming 34 (1986)111 - 124.
N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth and A.H. Teller, Equation of state calculation by fast computing machines, The Journal of Chemical Physics 21(1953)1087 - 1092.
J.C. Picard and M. Queyranne, On the one-dimensional space allocation problem, Operations Research 29(1981)371 - 391.
F. Romeo and A. Sangiovanni-Vincentelli, Probabilistic hill climbing algorithms: Properties and applications, Memorandum No. UCB/ERL M84/34, UC Berkeley, March 1984.
R. Tarjan, Depth-first search and linear graph algorithms, SIAM Jour. Comput. 1(1972)146 - 160.
J.A. Tompkins, J.A. White, Y.A. Bozer, E.H. Frazelle, J.M.A. Tanchoco and J. Trevino, Facilities Planning, 2nd ed., Wiley, 1996.
M.R. Wilhelm and T.L. Ward, Solving quadratic assignment problems by simulated annealing, IIE Transactions 19(1987)107 - 119.
J.Y. Yen, An algorithm for finding shortest routes from all source nodes to a given destination in general networks, Quarterly of Applied Mathematics 27(1969)526 - 530.
Rights and permissions
About this article
Cite this article
Al-Sultan, K.S., Bozer, Y.A. Network configuration and machine layout in fixed-path material handling systems. Annals of Operations Research 76, 21–54 (1998). https://doi.org/10.1023/A:1018944520967
Issue Date:
DOI: https://doi.org/10.1023/A:1018944520967