A GRASP algorithm for solving large-scale single row facility layout problems
From MaRDI portal
Publication:1734823
DOI10.1016/j.cor.2019.02.009zbMath1458.90424OpenAlexW2916003475WikidataQ128388782 ScholiaQ128388782MaRDI QIDQ1734823
G. L. Cravo, André R. S. Amaral
Publication date: 27 March 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2019.02.009
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (4)
Decorous combinatorial lower bounds for row layout problems ⋮ A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem ⋮ A decomposition-based algorithm for the double row layout problem ⋮ Exact approaches for the combined cell layout problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Fast local search for single row facility layout
- Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem
- 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
- A new lower bound for the single row facility layout problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- Greedy randomized adaptive search procedures
- An ant algorithm for the single row layout problem in flexible manufacturing systems
- The single row facility layout problem: state of the art
- Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
- 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
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- One-Dimensional Space Allocation: An Ordering Algorithm
This page was built for publication: A GRASP algorithm for solving large-scale single row facility layout problems
