Fast simulated annealing for single-row equidistant facility layout
From MaRDI portal
Recommendations
- A new simulated annealing algorithm for the facility layout problem
- A branch-and-bound algorithm for the single-row equidistant facility layout problem
- Simulated annealing heuristics for the dynamic facility layout problem
- A simulated annealing heuristic for the facility location problem
- Fast local search for single row facility layout
- Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing
- Provably near-optimal solutions for very large single-row facility layout problems
- SIMULATED ANNEALING SCHEME INCORPORATING MOVE DESIRABILITY TABLE FOR SOLUTION OF FACILITY LAYOUT PROBLEMS
- The single row facility layout problem: state of the art
Cites work
- scientific article; zbMATH DE number 4043771 (Why is no real title available?)
- A branch-and-bound algorithm for the single-row equidistant facility layout problem
- A computational study and survey of methods for the single-row facility layout problem
- A cooperative parallel tabu search algorithm for the quadratic assignment problem
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- A new heuristic for the linear placement problem
- A survey for the quadratic assignment problem
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
- Assignment Problems
- Assignment Problems and the Location of Economic Activities
- Breakout local search for the quadratic assignment problem
- Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
- Directional decomposition heuristic for a linear machine-cell location problem.
- Experimental analysis of simulated annealing based algorithms for the layout problem
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
- Finite-State Processes and Dynamic Programming
- Graph minimum linear arrangement by multilevel weighted edge contractions
- Linear placement algorithms and applications to VLSI design
- Locating cells with bottleneck machines in cellular manufacturing systems
- On the One-Dimensional Space Allocation Problem
- One-dimensional machine location problems in a multi-product flowline with equidistant locations
- Provably near-optimal solutions for very large single-row facility layout problems
- Simulated annealing and genetic algorithms for the facility layout problem: A survey
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem
- Tabu Search Applied to the Quadratic Assignment Problem
- Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances
- The corridor allocation problem
- The single row facility layout problem: state of the art
Cited in
(5)- Decorous combinatorial lower bounds for row layout problems
- Enhanced simulated annealing technique for the single-row routing problem
- Fast local search for single row facility layout
- Construction heuristics for the single row layout problem with machine-spanning clearances
- A branch-and-bound algorithm for the single-row equidistant facility layout problem
This page was built for publication: Fast simulated annealing for single-row equidistant facility layout
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1663580)
