A GRASP algorithm for solving large-scale single row facility layout problems
type: Item
instance of: scholarly article
title: A GRASP algorithm for solving large-scale single row facility layout problems
zbMATH Open document ID: 1458.90424
author: G. L. Cravo
author: André R. S. Amaral
published in: Computers \& Operations Research
publication date: 2019-03-27T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7043520
zbMATH Keywords: GRASP
zbMATH Keywords: facility layout
zbMATH Keywords: manufacturing optimization
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.cor.2019.02.009
OpenAlex ID: W2916003475
cites work: On the exact solution of a facility layout problem
cites work: An Exact Approach to the One-Dimensional Facility Layout Problem
cites work: A new lower bound for the single row facility layout problem
cites work: A polyhedral approach to the single row facility layout problem
cites work: A semidefinite optimization approach for the single-row layout problem with unequal dimensions
cites work: Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
cites work: Provably near-optimal solutions for very large single-row facility layout problems
cites work: Single row facility layout problem using a permutation-based genetic algorithm
cites work: Greedy randomized adaptive search procedures
cites work: Q4354785
cites work: Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem
cites work: Experimental analysis of simulated annealing based algorithms for the layout problem
cites work: Efficient models for the facility layout problem
cites work: A computational study and survey of methods for the single-row facility layout problem
cites work: The single row facility layout problem: state of the art
cites work: Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
cites work: On Solving A One-Dimensional Space Allocation Problem With Integer Programming
cites work: Fast local search for single row facility layout
cites work: On the One-Dimensional Space Allocation Problem
cites work: Q4452897
cites work: An efficient tabu algorithm for the single row facility layout problem
cites work: One-Dimensional Space Allocation: An Ordering Algorithm
cites work: An ant algorithm for the single row layout problem in flexible manufacturing systems
Wikidata QID: Q128388782
DOI: 10.1016/J.COR.2019.02.009
Recommended article: The single row facility layout problem: state of the art
Recommended article: A computational study and survey of methods for the single-row facility layout problem
Recommended article: Provably near-optimal solutions for very large single-row facility layout problems
Recommended article: A polyhedral approach to the single row facility layout problem
Recommended article: A heuristic procedure for the single-row facility layout problem
Recommended article: A new lower bound for the single row facility layout problem
Recommended article: An efficient tabu algorithm for the single row facility layout problem
Recommended article: A branch-and-bound algorithm for the single-row equidistant facility layout problem
Recommended article: Optimisation of complex and large-sized single-row facility layout problems with a unique hybrid meta-heuristic framework
description: scientific article; zbMATH DE number 7043520