A solution to the facility layout problem using simulated annealing
Computers in IndustryPublished 1 April 1998
Leonardo Chwif, Marcos Ribeiro Pereira Barretto, Lucas Antônio Moscato
Citations102
SJR quartileQ1
SJR score2.21
SNIP3.09
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
This approach is based on Simulated Annealing (SA), a relatively recent algorithm for solving hard combinatorial optimization problems, like FLP, and has been applied to real-life situations with useful results, indicating the effectiveness of this approach.
Abstract
In this paper a solution in the continual plane to the Facility Layout Problem (FLP) is presented. It is based on Simulated Annealing (SA), a relatively recent algorithm for solving hard combinatorial optimization problems, like FLP. This approach may be applied either in General Facility Layout Problems (GFLP) considering facilities areas, shapes and orientations or in Machine Layout problems (MLP) considering machine's pick-up and drop-off points. It has been applied to real-life situations with useful results, indicating the effectiveness of this approach.
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.
Mathematics and Computers in SimulationSimulated annealing: theory and applications.
3,005 Citations1988
Simulated Annealing: Theory and Applications
2,372 Citations1987Peter J. M. van Laarhoven, Emile Aarts
Performance of the simulated annealing algorithm and the relation with statistical physics and asymptotic convergence results are presented.
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.
Operations ResearchOptimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
1,468 Citations1989David S. Johnson, C. Aragon +2 more
This paper discusses annealing and its parameterized generic implementation, describes how this generic algorithm was adapted to the graph partitioning problem, and reports how well it compared to standard algorithms like the Kernighan-Lin algorithm.
European Journal of Operational ResearchThe facility layout problem
603 Citations1987Andrew Kusiak, Sunderesh S. Heragu
Various formulations of the facility layout problem and the algorithms for solving this problem are presented and Twelve heuristic algorithms are compared on the basis of their performance with respect to eight test problems commonly used in the literature.
Journal of Applied ProbabilityOptimality of the shortest line discipline
505 Citations1977Wayne L. Winston
Journal of the Society for Industrial and Applied MathematicsOptimal and Suboptimal Algorithms for the Quadratic Assignment Problem
441 Citations1962Paul C. Gilmore
IIE TransactionsSolving Quadratic Assignment Problems by ‘Simulated Annealing’
319 Citations1987Mickey R. Wilhelm, Thomas L. Ward
An application of the simulated annealing method to solve the quadratic assignment problem (QAP) is presented, which uses Monte Carlo sampling to occasionally accept solutions to discrete optimization problems which increase rather than decrease the objective function value.
European Journal of Operational ResearchEfficient models for the facility layout problem
292 Citations1991Sunderesh S. Heragu, Andrew Kusiak
Management ScienceQuadratic Assignment Problem Algorithms and the Location of Indivisible Facilities
230 Citations1966Frederick S. Hillier, Michael M. Connors
European Journal of Operational ResearchExperimental analysis of simulated annealing based algorithms for the layout problem
207 Citations1992Sunderesh S. Heragu, Attahiru Sule Alfa
European Journal of Operational ResearchGenetic algorithms, function optimization, and facility layout design
204 Citations1992Kar Yan Tam
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.
European Journal of Operational ResearchAlgorithms for robust single and multiple period layout planning for manufacturing systems
198 Citations1992Panos Kouvelis, Abbas A. Kurawarwala +1 more
The robustness approach to the layout decision making can be applied to single and multiple period problems in the presence of considerable uncertainty, both in terms of products to be produced as well as their production volumes.
International Journal of Production ResearchA simulated annealing algorithm for allocating space to manufacturing cells
193 Citations1992Kar Yan Tam
International Journal of Production ResearchCLASS: Computerized LAyout Solutions using Simulated annealing
111 Citations1992Satish K. Jajodia, Ioannis Minis +2 more
A new method that considers the inter-cell and intra-cell layout problems in a cellular manufacturing environment is presented, which addresses the relative placement of equidimensional manufacturing entities within a discrete solution space in an attempt to minimize the total material flow between these entities.
International Journal of Production ResearchA hierarchical approach to the facility layout problem
86 Citations1991Kar Yan Tam, SHIH GONG LI
European Journal of Operational ResearchAn interactive layout heuristic based on hexagonal adjacency graphs
82 Citations1992Marc Goetschalckx
An efficient and interactive two-stage heuristic for the generation of block layouts is presented, which generates a hexagonal and maximum weight planar adjacency subgraph, which incorporates relationships with the outside of the layout in a consistent manner.
European Journal of Operational ResearchRecent models and techniques for solving the layout problem
81 Citations1992Sunderesh S. Heragu
Seven heuristic algorithms for solving the models for the layout problem are listed and briefly compared and certain issues that need to be addressed while solving the layouts problem are mentioned.
IIE TransactionsUtilizing Cut Trees as Design Skeletons for Facility Layout
71 Citations1989Benoît Montreuil, H. Donald Ratliff
A cut tree is proposed here as the design skeleton for a family of facility layouts, which has some very attractive properties when used as part of an interactive system to support the designer in the analysis, construction and improvement of facility layout.
Management ScienceThe Quadratic Assignment Problem: An Experimental Evaluation of Solution Strategies
69 Citations1981Robin Liggett
International Journal of Production EconomicsMultiobjective facility layout using simulated annealing
67 Citations1993G. Suresh, Sumanta Kumar Sahu
The simulated annealing algorithm which has now become a very useful tool in solving a variety of combinatorial optimization problems is made use of here and solutions obtained using the proposed algorithm compare favourably with the best known results.
European Journal of Operational ResearchSimulated annealing for machine layout problems in the presence of zoning constraints
62 Citations1992Panagiotis Kouvelis, Wen‐Chyuan Chiang +1 more
Computational results indicate that imposing cleverly generated restrictions on SA procedures for QAP formulations can significantly improve the solution effectiveness of the SA algorithm for such problems.
Computers & Industrial EngineeringFacilities layout—A survey of solution procedures
56 Citations1985Reuven R. Levary, Sylvia Kalchik
European Journal of Operational ResearchFlow network design for manufacturing systems layout
55 Citations1992Dilip Chhajed, Benoît Montreuil +1 more
In this paper a shortest rectilinear flow network problem is defined and formulated as an optimization problem, and a Lagrangean relaxation of the problem gives separable, linear-time solvable, shortest-path problems.
International Journal of Production ResearchA modelling of interactive facilities layout designer reasoning using qualitative patterns
51 Citations1992Pallavi Banerjee, Benoît Montreuil +2 more
A modelling of interactive facilities layout designer reasoning for the purpose of improving the quality of solution currently available in the layout literature, and an automated interface of the reasoning process and linear optimization is developed to solve the layout problem.
International Journal of Production ResearchA construction algorithm for the machine layout problem with fixed pick-up and drop-off points
47 Citations1993Palitha Welgama, Peter R. Gibson
A construction algorithm which considers some practical aspects of the machine layout problem, and a bi-criterion optimization approach is proposed to overcome one of the weaknesses inherited by construction procedures.
International Journal of Production ResearchAn AI-search technique-based layout planning method
7 Citations1992Li Chung Shih, Takao Enkawa +1 more
This paper presents a facility layout planning method based on Al search techniques and on a set of rules and criteria called AILAY, and presents the main test results and conclusions about the performance and robustness of this method.
A Knowledge-Based System for Production Equipment Selection and Layout
5 Citations1989Andrew Kusiak, Sunderesh S. Heragu
A knowledge-based system (KBSMD) for selection of machines and material handling equipment and determining a layout is discussed, which utilizes the optimization and knowledge- based approaches to solve the manufacturing system design problem.