An application of graph theory in block planning
A heuristic is an algorithm that more often than not gives nearly the right answer. This study presents three heuristics that are useful in constructing a planar adjacency graph. These are the Deltahedron Heuristic, an algorithm based on Relationship Diagramming Process and a proposed heuristic by t...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
2008
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/10132 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| Summary: | A heuristic is an algorithm that more often than not gives nearly the right answer. This study presents three heuristics that are useful in constructing a planar adjacency graph. These are the Deltahedron Heuristic, an algorithm based on Relationship Diagramming Process and a proposed heuristic by the researchers named as the RJ Heuristic. The three heuristics are then applied to come up with possible block plans for Phil-Top Industries Incorporated, a company that manufactures plastic housewares in the Philippines. Several articles were used as a basis for this thesis. Specifically the article by L.R. Foulds et. al. entitled Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics, which was published in the journal Operations Research, Volume 33 on September-October 1985, and the article Facilities Planning with Graph Theory by J. Seppanen and J. Moore, which was published on December 1970 in the journal Management Science, Volume 17 were used. Theoretical concepts and known results in graph theory, in particular regarding planarity of graphs are included in this study. |
|---|