Abstract
The adjacency problem is an important subproblem in facility layout planning. It is known to be NP-complete, so heuristics are required to solve “large” problem instances. In this paper two new heuristics for the adjacency problem are introduced which belong to a special class of constructive methods called Triangulation Expansion Heuristics. Extensive numerical experiments have been carried out in order to evaluate the proposed methods in terms of computing times and solution quality. It has been found that at least one method is clearly superior to the best methods proposed in the literature so far (Eades et al. 1982, Leung 1992).
Zusammenfassung
Das Nachbarschaftsproblem bildet ein zentrales Problem der innerbetrieblichen Standortplanung. Da es sich um ein NP-vollständiges Problem handelt, sind Heuristiken erforderlich, um große Problemausprägungen zu behandeln. In der vorliegenden Arbeit werden zwei neue Heuristiken für das Nachbarschaftsproblem vorgestellt, die zu einer speziellen Klasse von Eröffnungsverfahren, den sog. Triangulation Expansion Heuristics, gehören. Die Lösungsqualität und der Rechenzeitbedarf der Verfahren werden auf der Grundlage umfangreicher numerischer Experimente untersucht. Dabei erweist sich eine Heuristik gegenüber den bisher besten in der Literatur beschriebenen Verfahren (Eades et al. 1982, Leung 1992) als überlegen.
Similar content being viewed by others
References
Al-Hakim LA (1991) Two Graph-Theoretic Procedures for an Improved Solution to the Facilities Layout Problem. International Journal of Production Research 29:1701–1718
Boswell SG (1992) TESSA — A New Greedy Heuristic for the Facility Layout Planning. International Journal of Production Research 30:1957–1968
Domschke W, Drexl A (1985) Location and Layout Planning: An International Bibliography. Springer, Berlin Heidelberg New York
Domschke W, Drexl A (1996) Logistik: Standorte. 4th ed., Oldenbourg, München Wien
Eades P, Foulds LR, Giffin JW (1982) An Efficient Heuristic of Identifying a Maximum Weight Planar Subgraph. In: Billington EJ et al. (eds) Combinatorial Mathematics IX. Springer, Berlin Heidelberg New York, pp 239–251
Foulds LR, Gibbons PB, Giffin JW (1985) Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics. Operations Research 33:1091–1106
Foulds LR, Robinson DF (1978) Graph Theoretic Heuristics for the Plant Location Problem. International Journal of Production Research 16:27–37
Giffin JW (1984) Graph Theoretic Techniques for Facilities Layout. Ph. D. Thesis, University of Canterbury, New Zealand
Giffin JW, Foulds LR, Cameron DC (1986) Drawing a Block Plan from a REL-Chart with Graph Theory and a Microcomputer. Computers and Industrial Engineering 10:109–115
Glover F, Pesch E (1994) Efficient Facility Layout Planning. Working Paper, College of Business and Administration and Graduate School of Business Administration, University of Colorado, Boulder
Harary F (1969) Graph Theory. Addison-Wesley, Reading
Hasan M, Osman IH (1995) Local Search Algorithms for the Maximal Planar Layout Problem. International Transactions in Operational Research 2:89–106
Hassan MMD, Hogg GL (1991) On Constructing a Block Layout by Graph Theory. International Journal of Production Research 29:1263–1278
Leung JA (1992) New Graph Theoretic Heuristic for Facility Layout. Management Science 38:554–605
Rinsma F, Giffin JW, Robinson DF (1990) Orthogonal Floorplans from Maximal Planar Graphs. Environment and Planning B: Planning and Design 17:57–71
Seppänen JJ, Moore JM (1970) Facilities Planning with Graph Theory. Management Science 17:242–253
Wäscher G (1993) Logistikorientiertes Layout von Fertigungssystemen. In: Milling P, Zäpfel G (eds) Betriebswirtschaftliche Grundlagen moderner Produktionsstrukturen. Neue Wirtschaftsbriefe, Herne Berlin, pp 77–104
Wäscher G (1994) Layoutplanung für Produktionssysteme. In: Isermann H (ed) Logistik — Beschaffung, Produktion, Distribution. Moderne Industrie, Landsberg/Lech, pp 249–264
Wäscher G, Merker J (1997) A Comparative Evaluation of Heuristics for the Adjacency Problem in Facility Layout Planning. International Journal of Production Research 35:447–466
Welgama PS, Gibson PR, Al-Hakim LAR (1994) Facilities Layout: A Knowledge-Based Approach for Converting a Dual Graph into a Black Layout. International Journal of Production Economics 33:17–30
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Merker, J., Wäscher, G. Two new heuristic algorithms for the maximal planar layout problem. OR Spektrum 19, 131–137 (1997). https://doi.org/10.1007/BF01545513
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01545513