A graph-theoretic heuristic for minimizing total transport cost in facilities layout

1 November 1985

journal article
research article
Published by Taylor & Francis in International Journal of Production Research

Vol. 23 (6) , 1247-1257
https://doi.org/10.1080/00207548508904779

Abstract

Existing graph-theoretic heuristics for block plan design attempt to maximize the sum of the REL chart seores of adjacent pairs of facilities. A new graph-theoretic heuristic is presented which has the aim of minimizing total transport ation cost instead. This has the advantage of giving credit in the objective function to pairs of facilities which are somewhat near but not actually adjacent. Reported computational experience with the method is encouraging.

Keywords

This publication has 6 references indexed in Scilit:

Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent
Management Science, 1983
Graph theoretic heuristics for the plant layout problem
International Journal of Production Research, 1978
Facilities design with graph theory and strings
Omega, 1976
Computer-aided plant layout
Computer-Aided Design, 1969
GRAPH THEORY
Published by Defense Technical Information Center (DTIC) ,1969
A Note on the Generation of Random Normal Deviates
The Annals of Mathematical Statistics, 1958