A new simulated annealing algorithm for the facility layout problem

DOI10.1080/00207549608904990zbMath0927.90037OpenAlexW2034799097MaRDI QIDQ4230174

Yavuz A. Bozer, Russell D. Meller

Publication date: 1 March 1999

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207549608904990

zbMATH Keywords

simulated annealingfacility layoutsteepest-descentrandomized approaches

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Production models (90B30) Combinatorial optimization (90C27)

Related Items (24)

Strong mixed-integer formulations for the floor layout problem ⋮ Layout design for flexible manufacturing systems considering single-loop directional flow patterns ⋮ Detailed layout planning for irregularly-shaped machines with transportation path design ⋮ A new mixed integer programming formulation for facility layout design using flexible bays ⋮ Location and layout planning. A survey ⋮ A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover ⋮ Two-level modified simulated annealing based approach for solving facility layout problem ⋮ Hope: A genetic algorithm for the unequal area facility layout problem. ⋮ A graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem ⋮ FACOPT: A user friendly FACility layout OPTimization system. ⋮ A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays ⋮ A genetic algorithm for facility layout ⋮ An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages ⋮ A class of genetic algorithms for multiple-level warehouse layout problems ⋮ An integrated approach to the facilities and material handling system design ⋮ An integrated approach for the concurrent determination of the block layout and the input and output point locations based on the contour distance ⋮ A convex optimisation framework for the unequal-areas facility layout problem ⋮ Mitigation of risk in facility layout design for single and multi-period problems ⋮ An efficient multiple-stage mathematical programming method for advanced single and multi-floor facility layout problems ⋮ A model to design recreational boat mooring fields ⋮ Solving the failure-to-fit problem for plant layout: By changing department shapes and sizes ⋮ Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem ⋮ A continuous approach to considering uncertainty in facility design ⋮ An improved genetic algorithm for facility layout problems having inner structure walls and passages

Cites Work

• Optimization by Simulated Annealing
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• Efficient models for the facility layout problem
• A heuristic method for the multi-story layout problem
• Experimental analysis of simulated annealing based algorithms for the layout problem
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Using simulated annealing to solve routing and location problems
• Simulated Annealing – An Annotated Bibliography
• A simulated annealing algorithm for allocating space to manufacturing cells
• CLASS: Computerized LAyout Solutions using Simulated annealing
• An Improvement-Type Layout Algorithm for Single and Multiple-Floor Facilities
• The Efficiency of Computer Algorithms for Plant Layout

This page was built for publication: A new simulated annealing algorithm for the facility layout problem