Fast simulated annealing for single-row equidistant facility layout
From MaRDI portal
Publication:1663580
DOI10.1016/j.amc.2015.04.073zbMath1410.90119OpenAlexW280719629MaRDI QIDQ1663580
Publication date: 21 August 2018
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.04.073
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Related Items (3)
Construction heuristics for the single row layout problem with machine-spanning clearances ⋮ Fast local search for single row facility layout ⋮ Decorous combinatorial lower bounds for row layout problems
Cites Work
- Unnamed Item
- Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances
- The corridor allocation problem
- A computational study and survey of methods for the single-row facility layout problem
- A branch-and-bound algorithm for the single-row equidistant facility layout problem
- Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- A survey for the quadratic assignment problem
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- One-dimensional machine location problems in a multi-product flowline with equidistant locations
- Simulated annealing and genetic algorithms for the facility layout problem: A survey
- Directional decomposition heuristic for a linear machine-cell location problem.
- The single row facility layout problem: state of the art
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem
- A new heuristic for the linear placement problem
- Breakout local search for the quadratic assignment problem
- A cooperative parallel tabu search algorithm for the quadratic assignment problem
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
- A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem
- Assignment Problems and the Location of Economic Activities
- Provably near-optimal solutions for very large single-row facility layout problems
- Assignment Problems
- Linear placement algorithms and applications to VLSI design
- On the One-Dimensional Space Allocation Problem
- Tabu Search Applied to the Quadratic Assignment Problem
- Locating cells with bottleneck machines in cellular manufacturing systems
- Graph minimum linear arrangement by multilevel weighted edge contractions
- Finite-State Processes and Dynamic Programming
This page was built for publication: Fast simulated annealing for single-row equidistant facility layout
