Facilities layout generalized model solved by n-boundary shortest path heuristics
type: Item
instance of: scholarly article
title: Facilities layout generalized model solved by n-boundary shortest path heuristics
zbMATH Open document ID: 0614.90029
DOI: 10.1016/S0377-2217(87)80181-9
author: J. W. Giffin
author: Les R. Foulds
published in: European Journal of Operational Research
publication date: 1987-01-01T00:00:00Z
review text: Classical plant layout problems consist in finding the adjacency graph of several facilities which maximizes the benefit obtained, by accounting all the effective adjacencies. In this paper this simple view is extended in the following manner: for each pair of facilities and each natural number k, the benefit in {\$} is supposed to be known of having a shortest path of length k between both facilities. One then asks for the adjacency graph which maximizes the total benefit, taking into account all the shortest path distances between any pair of facilities. In this paper two heuristics for the classical plant layout problem, Deltahedron and Greedy [see \textit{L. R. Foulds}, Oper. Res. 33, 1091-1106 (1985)], are modified so as to solve - suboptimally - the generalized problem. Some computational results show the effectiveness of the proposed schemes.
reviewed by: Frank Plastria
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 3995407
zbMATH Keywords: facility location
zbMATH Keywords: plant layout
zbMATH Keywords: adjacency graph
zbMATH Keywords: computational results
describes a project that uses: Algorithm 97
MaRDI profile type: Publication
cites work: Q3283487
cites work: A Note on the Generation of Random Normal Deviates
cites work: Graph Property Update Algorithms and Their Appligation to Distance Matrices
cites work: Q5583695
cites work: A Depth-First-Search Characterization of Planarity
cites work: Q5335885
cites work: An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
cites work: Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent
cites work: Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics
cites work: Q3338271
cites work: Q5547252
cites work: Parallel concepts in graph theory
cites work: Efficient Planarity Testing
cites work: Approximative Algorithms for Discrete Optimization Problems
cites work: Gauss codes, planar hamiltonian graphs, and stack-sortable permutations
cites work: Q3912613
cites work: A Theorem on Boolean Matrices
full work available at URL: s0377-2217(87)80181-9
OpenAlex ID: W2003065298
Recommended article: A hybrid heuristic for the facilities layout problem
Recommended article: Efficient models for the facility layout problem
Recommended article: Heuristic approach for solving the multi-objective facility layout problem
Recommended article: A New Graph-Theoretic Heuristic for Facility Layout
Recommended article: On the exact solution of a facility layout problem
Recommended article: Constructing an optimal facility layout to maximize adjacency as a function of common boundary length
Recommended article: Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics
Recommended article: A comparative evaluation of heuristics forthe adjacency problem in facility layout planning
Recommended article: An improved heuristic approach for multi-objective facility layout problem
description: scientific article; zbMATH DE number 3995407