An efficient genetic algorithm for single row facility layout
From MaRDI portal
Publication:2448146
DOI10.1007/s11590-012-0605-2zbMath1294.90052OpenAlexW2083537405MaRDI QIDQ2448146
Publication date: 30 April 2014
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-012-0605-2
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Construction heuristics for the single row layout problem with machine-spanning clearances ⋮ Single row layout models ⋮ Fast local search for single row facility layout ⋮ Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem ⋮ New exact approaches to row layout problems
Cites Work
- Unnamed Item
- Unnamed Item
- A computational study and survey of methods for the single-row facility layout problem
- A polyhedral approach to the single row facility layout problem
- Single row facility layout problem using a permutation-based genetic algorithm
- Efficient models for the facility layout problem
- Methods for the one-dimensional space allocation problem
- A new lower bound for the single row facility layout problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- A heuristic procedure for the single-row facility layout problem
- An ant algorithm for the single row layout problem in flexible manufacturing systems
- An efficient tabu algorithm for the single row facility layout problem
- On the exact solution of a facility layout problem
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
- An Exact Approach to the One-Dimensional Facility Layout Problem
- Provably near-optimal solutions for very large single-row facility layout problems
- On the One-Dimensional Space Allocation Problem
- Deux problèmes d'affectation non linéaires
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- One-Dimensional Space Allocation: An Ordering Algorithm
