Genetic algorithms, function optimization, and facility layout design
European Journal of Operational ResearchPublished 1 December 1992
Kar Yan Tam
Citations204
SJR quartileQ1
SJR score2.24
SNIP2.62
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The results demonstrate that a genetic algorithm can be a viable tool to solve large scale layout problems and compared with a local search technique in solving problems with sizes ranging from 12 to 30 facilities.
Abstract
The use of genetic algorithms to solve function optimization problems requires a coding scheme that represents solutions as strings of finite length. In this paper, a coding scheme designed for facility layout is presented. A solution is represented by the postorder sequence of the nodes in a slicing tree. New solutions are generated by applying the various genetic operators in each generation. The genetic algorithm approach is compared with a local search technique in solving problems with sizes ranging from 12 to 30 facilities. The results demonstrate that a genetic algorithm can be a viable tool to solve large scale layout problems.
Keywords
Engineering
Choice Reviews OnlineGenetic algorithms in search, optimization, and machine learning
49,278 Citations1989
This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.
ScienceOptimization by Simulated Annealing
44,600 Citations1983Scott Kirkpatrick, C. D. Gelatt +1 more
A detailed analogy with annealing in solids provides a framework for optimization of the properties of very large and complex systems.
The Journal of Chemical PhysicsEquation of State Calculations by Fast Computing Machines
37,074 Citations1953N. Metropolis, Arianna W. Rosenbluth +3 more
The MIT Press eBooksAdaptation in Natural and Artificial Systems
35,568 Citations1992John H. Holland
Initially applying his concepts to simply defined artificial systems with limited numbers of parameters, Holland goes on to explore their use in the study of a wide range of complex, naturally occuring processes, concentrating on systems having multiple factors that interact in nonlinear ways.
Journal of the American Statistical AssociationHierarchical Grouping to Optimize an Objective Function
19,236 Citations1963Joe H. Ward
Mathematics and Computers in SimulationSimulated annealing: theory and applications.
3,005 Citations1988
IEEE Transactions on Systems Man and CyberneticsOptimization of Control Parameters for Genetic Algorithms
2,831 Citations1986John J. Grefenstette
GA's are shown to be effective for both levels of the systems optimization problem and are applied to the second level task of identifying efficient GA's for a set of numerical optimization problems.
Journal of the ACMP-Complete Approximation Problems
1,715 Citations1976Sartaj Sahni, Teofilo F. Gonzalez
For P- complete problems such as traveling salesperson, cycle covers, 0-1 integer programming, multicommodity network flows, quadratic assignment, etc., it is shown that the approximation problem is also P-complete.
Deep Blue (University of Michigan)An Analysis Of The Behavior Of A Class Of Genetic Adaptive Systems.
1,299 Citations1975Kenneth DeJong
SIAM Journal on ComputingGenetic Algorithms and the Optimal Allocation of Trials
1,201 Citations1973John H. Holland
This study gives a formal setting to the difficult optimization problems characterized by the conjunction of substantial complexity and initial uncertainty, and the necessity of acquiring new models to solve these problems.
Management ScienceA Heuristic Algorithm and Simulation Approach to Relative Location of Facilities
739 Citations1963Gordon C. Armour, Elwood S. Buffa
A computer program governed by an algorithm which determines how relative location patterns should be altered to obtain sequentially the most improved pattern with each change, commands their alteration, evaluates the results of alterations, and identifies the sub-optimum relative location patterns.
Operations ResearchAn Experimental Comparison of Techniques for the Assignment of Facilities to Locations
569 Citations1968Christopher E. Nugent, Thomas E. Vollmann +1 more
The new Biased Sampling procedure is seen to produce the best solutions but at relatively high computational cost, and the Hillier-Connors procedure is especially interesting because it is considerably faster than craft and BiASED Sampling and its solutions are only 2–6 per cent worse than BiasedSampling and only slightly worse than craft.
Machine LearningLearning with genetic algorithms: An overview
501 Citations1988Kenneth De Jong
This paper provides a brief overview of how one might use genetic algorithms as a key element in learning systems.
Kluwer international series in engineering and computer scienceThe Annealing Algorithm
406 Citations1989Ria Otten, L. P. P. P. van Ginneken
The Annealing Algorithm: A Preview is presented, with a focus on the implementation of the selection function, which addresses the challenge of determining the minimum number of iterations for a discrete-time algorithm.
Operations ResearchMachine Layout Problem in Flexible Manufacturing Systems
311 Citations1988Sunderesh S. Heragu, Andrew Kusiak
Two new construction algorithms are presented to solve the machine layout problem in FMS's and the triangle assignment algorithm TAA is found to give solutions of better quality than any other construction method published.
Naval Research Logistics QuarterlyUsing simulated annealing to solve routing and location problems
206 Citations1986Bruce Golden, Christopher C. Skiścim
This paper implements the analogy between the statistical mechanics of large multivariate physical systems and combinatorial optimization, applies it to the traveling salesman problem and the p‐median location problem, and test the approach extensively.
International Journal of Production ResearchA simulated annealing algorithm for allocating space to manufacturing cells
193 Citations1992Kar Yan Tam
International Journal of Production ResearchComputer aided facilities design : An international survey
53 Citations1974James M. Moore
It is apparent that computers are being used as design aids although few practitioners are willing to delegate the whole job to a computer at this time.