A new simulated annealing algorithm for the facility layout problem
From MaRDI portal
Publication:4230174
Recommendations
- SIMULATED ANNEALING SCHEME INCORPORATING MOVE DESIRABILITY TABLE FOR SOLUTION OF FACILITY LAYOUT PROBLEMS
- Simulated annealing for manufacturing systems layout design
- Simulated annealing and genetic algorithms for the facility layout problem: A survey
- A two-stage simulated annealing procedure for block layout problems
Cites work
- A heuristic method for the multi-story layout problem
- A simulated annealing algorithm for allocating space to manufacturing cells
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- An Improvement-Type Layout Algorithm for Single and Multiple-Floor Facilities
- CLASS: Computerized LAyout Solutions using Simulated annealing
- Efficient models for the facility layout problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- Optimization by simulated annealing
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Simulated Annealing – An Annotated Bibliography
- The Efficiency of Computer Algorithms for Plant Layout
- Using simulated annealing to solve routing and location problems
Cited in
(41)- Solving the failure-to-fit problem for plant layout: By changing department shapes and sizes
- Simulated annealing and genetic algorithms for the facility layout problem: A survey
- Location and layout planning. A survey
- Simulated annealing for manufacturing systems layout design
- A simulated annealing-based algorithm using hierarchical models for general three-dimensional component layout.
- Hope: A genetic algorithm for the unequal area facility layout problem.
- FACOPT: A user friendly FACility layout OPTimization system.
- Solving multi objective facility layout problem by modified simulated annealing
- Fast simulated annealing for single-row equidistant facility layout
- A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover
- An improved genetic algorithm for facility layout problems having inner structure walls and passages
- Location of facility based on simulated annealing and ``ZKW algorithms
- A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays
- A convex optimisation framework for the unequal-areas facility layout problem
- An efficient multiple-stage mathematical programming method for advanced single and multi-floor facility layout problems
- Layout design for flexible manufacturing systems considering single-loop directional flow patterns
- A simulated annealing heuristic for the facility location problem
- Simulated annealing heuristics for the dynamic facility layout problem
- Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem
- A continuous approach to considering uncertainty in facility design
- Mitigation of risk in facility layout design for single and multi-period problems
- A two-stage simulated annealing procedure for block layout problems
- Two-level modified simulated annealing based approach for solving facility layout problem
- A study on the spine layout for semiconductor manufacturing facility using simulated annealing
- A model to design recreational boat mooring fields
- An Improvement-Type Layout Algorithm for Single and Multiple-Floor Facilities
- Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing
- A graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem
- A genetic algorithm for facility layout
- An integrated approach to the facilities and material handling system design
- A class of genetic algorithms for multiple-level warehouse layout problems
- An integrated approach for the concurrent determination of the block layout and the input and output point locations based on the contour distance
- SIMULATED ANNEALING SCHEME INCORPORATING MOVE DESIRABILITY TABLE FOR SOLUTION OF FACILITY LAYOUT PROBLEMS
- Strong mixed-integer formulations for the floor layout problem
- A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem: a robust optimization approach
- A simulated annealing algorithm for dynamic layout problem
- Great Deluge-based metaheuristic incorporating integer nonlinear programming for modeling and solving dynamic capability-based machine layout problem
- Customized simulated annealing based decision algorithms for combinatorial optimization in VLSI floorplanning problem
- An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages
- Detailed layout planning for irregularly-shaped machines with transportation path design
- A new mixed integer programming formulation for facility layout design using flexible bays
This page was built for publication: A new simulated annealing algorithm for the facility layout problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4230174)
