Simulated Annealing and Genetic Algorithms for the Facility LayoutProblem: A Survey

Authors:
Thelma D. Mavridou;Panos M. Pardalos
Affiliations:
Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611-6595 USA/ E-mail: pardalos@ufl.edu;Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611-6595 USA/ E-mail: pardalos@ufl.edu
Venue:
Computational Optimization and Applications
Year:
1997

Citing 20
Cited 5

Numerical recipes: the art of scientific computing

Numerical recipes: the art of scientific computing
Optimization of control parameters for genetic algorithms

IEEE Transactions on Systems, Man and Cybernetics
Simulated annealing: theory and applications

Simulated annealing: theory and applications
Optimization by simulated annealing: an experimental evaluation. Part I, graph partitioning

Operations Research
A study of control parameters affecting online performance of genetic algorithms for function optimization

Proceedings of the third international conference on Genetic algorithms
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
A parallel heuristic for quadratic assignment problems

Computers and Operations Research
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Parallel biased search for combinatorial optimization: genetic algorithms and TABU

Microprocessors & Microsystems
Heuristic and exact algorithms for the quadratic assignment problem

Heuristic and exact algorithms for the quadratic assignment problem
An improvement-type layout algorithm for single and multiple-floor facilities

Management Science
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Parallel Processing of Discrete Optimization Problems: DIMACS Workshop April 28-29, 1994

Parallel Processing of Discrete Optimization Problems: DIMACS Workshop April 28-29, 1994
Job Shop Scheduling with Genetic Algorithms

Proceedings of the 1st International Conference on Genetic Algorithms
Genetic Algorithms for the Traveling Salesman Problem

Proceedings of the 1st International Conference on Genetic Algorithms
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP

IRREGULAR '95 Proceedings of the Second International Workshop on Parallel Algorithms for Irregularly Structured Problems
SCOOP: Solving Combinatorial Optimization Problems in Parallel

Solving Combinatorial Optimization Problems in Parallel - Methods and Techniques
Parallel Genetic Algorithms in Optimization

Physik und Informatik - Informatik und Physik, Arbeitsgespräch
Parallel Genetic Algorithms, Population Genetics, and Combinatorial Optimization

WOPPLOT '89 Workshop on Evolutionary Models and Strategies, Workshop on Parallel Processing: Logic, Organization, and Technology: Parallelism, Learning, Evolution
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)

Introduction to Global Optimization (Nonconvex Optimization and Its Applications)

Efficient Genetic Algorithms Using Simple Genes Exchange LocalSearch Policy for the Quadratic Assignment Problem

Computational Optimization and Applications
A New Mathematical-Programming Framework for Facility-Layout Design

INFORMS Journal on Computing
Scalability, generalization and coevolution -- experimental comparisons applied to automated facility layout planning

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Parameter setting for clonal selection algorithm in facility layout problems

ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
An integrated synthetic value of fuzzy judgments and nonlinear programming methodology for ranking the facility layout patterns

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

The facility layout problem (FLP) has many practical applications and is known to be NP-hard. During recent decades exact and heuristic approaches have been proposed in the literature to solve FLPs. In this paper we review the most recent developments regardingsimulated annealing and genetic algorithms for solvingfacility layout problems approximately.