A comparative analysis of meta-heuristic approaches for facility layout design problem: a case study for an elevator manufacturer

2011 ◽  
Vol 24 (2) ◽  
pp. 357-372 ◽  
Author(s):  
Gülfem Tuzkaya ◽  
Bahadır Gülsün ◽  
Umut R. Tuzkaya ◽  
Semih Onut ◽  
Ender Bildik
2015 ◽  
Vol 2 (1) ◽  
pp. 8
Author(s):  
Yaya S. Kusumah

The facility layout design problem is concerned with determining the location of a number of facilities which optimises a prescribed objective such as profit, cost, or distance. This problem arises in many applications; for example, in design of buildings and in plant layout design. Most approaches for solving this problem are heuristic in nature and based on graph theoretic concepts. Graph theoretically, when the objective is to maximize profit, the facility layout design problem is to determine, in a given edge weighted graph G, a maximum weight planar sub graph. In this paper, a new heuristic based on graph theoretic concepts is presented. A comparative analysis based on 3600 random test problems demonstrates the value of this algorithm. Key words:  Heuristic, maximum planar graph, computer, facility layout design.


Sign in / Sign up

Export Citation Format

Share Document