Experimental analysis of simulated annealing based algorithms for the layout problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3942888 (Why is no real title available?)
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- An improved annealing scheme for the QAP
- Assignment Problems and the Location of Economic Activities
- Efficient models for the facility layout problem
- Equation of state calculations by fast computing machines
- One-Dimensional Space Allocation: An Ordering Algorithm
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Quadratic assignment problems
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
- Simulated Annealing – An Annotated Bibliography
- Tabu Search Applied to the Quadratic Assignment Problem
- Tabu Search—Part I
- Tabu Search—Part II
- The facility layout problem
- Using simulated annealing to solve routing and location problems
Cited in
(51)- Probabilistic local search algorithms for concave cost transportation network problems
- Hybrid ant systems for the dynamic facility layout problem
- A Monte Carlo simulation based heuristic procedure for solving dynamic line layout problems for facilities using conventional material handling devices
- A new simulated annealing algorithm for the facility layout problem
- A GRASP algorithm for solving large-scale single row facility layout problems
- Solving the failure-to-fit problem for plant layout: By changing department shapes and sizes
- Machine layout problem in modern manufacturing facilities
- A practical method for design of hybrid-type production facilities
- Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry
- A neural network approach to facility layout problems
- Large-scale layout of facilities using a heuristic hybrid algorithm
- An improved tabu search heuristic for solving facility layout design problems
- Simulated annealing heuristics for managing resources during planned outages at electric power plants
- Layout designs in cellular manufacturing
- Fast local search for single row facility layout
- Insertion based Lin-Kernighan heuristic for single row facility layout
- Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations
- A computational study and survey of methods for the single-row facility layout problem
- Construction heuristics for the single row layout problem with machine-spanning clearances
- A modification of threshold accepting and its application to the quadratic assignment problem
- Integrated Facility Layout Design and Flow Assignment Problem Under Uncertainty
- Single row facility layout problem using a permutation-based genetic algorithm
- Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem
- scientific article; zbMATH DE number 7453722 (Why is no real title available?)
- Optimisation of a Simulated‐Annealing‐based Heuristic for Single Row Machine Layout Problem by Genetic Algorithm
- Location and layout planning. A survey
- Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm
- A new lower bound for the single row facility layout problem
- Recent models and techniques for solving the layout problem
- Effects of scatter plot initial solutions on regular grid facility layout algorithms in typical production models
- A simulated annealing algorithm based on a closed loop layout for facility layout design in flexible manufacturing systems
- Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities
- Simulated annealing heuristics for the dynamic facility layout problem
- Fast simulated annealing for single-row equidistant facility layout
- An ant algorithm for the single row layout problem in flexible manufacturing systems
- Global approaches for facility layout and VLSI floorplanning
- The single row facility layout problem: state of the art
- A heuristic procedure for the single-row facility layout problem
- Two-level modified simulated annealing based approach for solving facility layout problem
- Hope: A genetic algorithm for the unequal area facility layout problem.
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
- Metaheuristics: A bibliography
- An efficient tabu algorithm for the single row facility layout problem
- Optimal solutions for the double row layout problem
- Simulated annealing algorithm for solving the single machine early/tardy problem
- Layout design for flexible manufacturing systems considering single-loop directional flow patterns
- An efficient genetic algorithm for single row facility layout
- On the exact solution of a facility layout problem
- The constrained single-row facility layout problem with repairing mechanisms
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- Optimization of cube-per-order index warehouse layouts with zoning constraints
This page was built for publication: Experimental analysis of simulated annealing based algorithms for the layout problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197688)
