Fast local search for single row facility layout
From MaRDI portal
Recommendations
- Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
- Insertion based Lin-Kernighan heuristic for single row facility layout
- The single row facility layout problem: state of the art
- Fast simulated annealing for single-row equidistant facility layout
- A computational study and survey of methods for the single-row facility layout problem
Cites work
- 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 new lower bound for the single row facility layout problem
- A polyhedral approach to the single row facility layout problem
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- An Exact Approach to the One-Dimensional Facility Layout Problem
- An ant algorithm for the single row layout problem in flexible manufacturing systems
- An efficient genetic algorithm for single row facility layout
- An efficient tabu algorithm for the single row facility layout problem
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
- Efficient models for the facility layout problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- Fast simulated annealing for single-row equidistant facility layout
- Global approaches for facility layout and VLSI floorplanning
- Insertion based Lin-Kernighan heuristic for single row facility layout
- Methods for the one-dimensional space allocation problem
- On the One-Dimensional Space Allocation Problem
- On the exact solution of a facility layout problem
- One-Dimensional Space Allocation: An Ordering Algorithm
- Provably near-optimal solutions for very large single-row facility layout problems
- Single row facility layout problem using a permutation-based genetic algorithm
- Single row layout models
- Tabu Search Applied to the Quadratic Assignment Problem
- Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
- The single row facility layout problem: state of the art
- Variable neighborhood search: Principles and applications
- Variable neighbourhood search: Methods and applications
- Variable neighbourhood search: methods and applications
Cited in
(13)- Exact approaches for the combined cell layout problem
- A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem
- A GRASP algorithm for solving large-scale single row facility layout problems
- Decorous combinatorial lower bounds for row layout problems
- New exact approaches to row layout problems
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization
- An efficient variable neighborhood search for the space-free multi-row facility layout problem
- Insertion based Lin-Kernighan heuristic for single row facility layout
- Construction heuristics for the single row layout problem with machine-spanning clearances
- A variable neighborhood search and simulated annealing hybrid for the profile minimization problem
- Fast simulated annealing for single-row equidistant facility layout
- Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
- Design and evaluation of layout alternatives to enhance the performance of industry
This page was built for publication: Fast local search for single row facility layout
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319872)
