Facilities layout generalized model solved by n-boundary shortest path heuristics
✍ Scribed by J.W. Giffin; L.R. Foulds
- Book ID
- 104339244
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 662 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
✦ Synopsis
This paper extends previous work on the development of graph theoretic heuristics for facilities layout. A number of such methods have been shown to be useful for the problem of deciding which pairs of facilities should be adjacent. The heuristics have been designed for a model which assumes that trips are saved if facilities are located adjacently, but no credit is given for nearly-adjacent location. We extend the model to allow for a relaxation of this assumption, and show how two existing heuristics for the former model may be modified to embody this extension. Computational experience is reported and is encouraging.