Constructing a block layout by face area

被引:12
|
作者
Jokar, Mohammad Reza Akbari [1 ]
Sangchooli, Ali Shoja [1 ]
机构
[1] Sharif Univ Technol, Dept Ind Engn, Tehran, Iran
关键词
Facility layout; Graph theory; Block layout; Facility design; Graph theoretic facility layout problem; PLANAR GRAPH PROBLEM; FACILITIES LAYOUT; SEARCH PROCEDURE;
D O I
10.1007/s00170-010-2960-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Solving the facility layout problems by graph theory consists of two stages. In the first stage, a planar graph that specifies desired adjacencies is obtained and in the second stage, a block layout is achieved from the planar graph. In this paper, we introduce face area as a new concept for constructing a block layout. Based on this idea, we present a new algorithm for constructing block layout from a maximal planar graph (MPG). This MPG must be generated from deltahedron heuristic. Constructed block layout by this algorithm satisfies all of adjacency and area requirements.
引用
收藏
页码:801 / 809
页数:9
相关论文
共 50 条