Loading...

A Facilities Layout Algorithm for Maximizing Adjacency Score

Shoja Sangchooli, Ali | 2009

752 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 40073 (01)
  4. University: Sharif University of Technology
  5. Department: Industrial Engineering
  6. Advisor(s): Akbari, Mohammad Reza
  7. Abstract:
  8. Facility layout is one of the most important problems in industrial engineering and Operation Research. Facility layout problem is concerned with the determination of the most effective arrangement and configuration of physical facilities. The most successful heuristic approaches are based on graph theoretic concepts. solving facility layout problem by graph theory consists of two stages. In the first stage a planar graph which specifies desired adjacencies is obtained and in the second stage a Block layout is achieved from the planar graph which satisfies adjacency and area requirements. In this Research, a branch and bound algorithm will be suggested for WMPG Problem. The algorithm can solve problem whit 11 facilities, in a reasonable time. Also, an algorithm will be suggested for constructing Block layout from a maximal planar graph that generated by deltahedron heuristic. Constructed block layout by this algorithm satisfies all of adjacency and area requirements, and a Facility shape at worst case is equivalent to a T-shape. a software named ‘Graph-Based Layout’ developed from this algorithm that can be used for facility design and facility layout Problems. In the last section of this thesis, an algorithm will be suggested for constructing Block layout from all type of maximal planar graphs. All facilities shapes are rectangular and have user-specified dimensions. Also this algorithm can be used for minimizing Transportation cost. The presented test problem includes one large size problem. It has 50 facilities of unequal areas. The results indicate that the Computational cost is relatively low. The technique has an improvement over PLANOPT (a facility layout optimization program). Software named ‘Planopt Beater’ developed from this algorithm. ‘Planopt Beater’ can be used in real world facility layout Problems.

  9. Keywords:
  10. Location ; Graph Theory ; Adjacency Matrix ; Facility Layout ; Facilities Layout

 Digital Object List

  • محتواي پايان نامه
  •   view

 Bookmark