A Layout Technique of Three Dimensions for Unequal Area and Shape Departments

Hideo Taniguchi; Toshihiko Murofushi; Takashi Irohara; Kazuho Yoshimoto

doi:10.1299/kikaic.65.3869

A Layout Technique of Three Dimensions for Unequal Area and Shape Departments

Hideo Taniguchi, Toshihiko Murofushi, Takashi Irohara, Kazuho Yoshimoto^*

^*Corresponding author for this work

School of Creative Science and Engineering

Research output: Contribution to journal › Article › peer-review

Abstract

The facility layout problem can be formulated as a combinatorial optimization problem to minimize the total cost owing to material flow. Most of the paper is focusing on such a layout problem in two-dimensions. However it would be better to treat the layout problem in three-dimension (3 D) in order to minimize the distance between equipment and the land area. For bin-packing problem, there are some papers in 3 D, but in those model flow between bin is not considered. That’s why this paper proposed a 3 D-layout technique for unequal shape and area departments. Computational experiments are suggesting that proposed algorithm will produce better solution than plain layout which is the result of previous algorithm.

Original language	English
Pages (from-to)	3869-3875
Number of pages	7
Journal	Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C
Volume	65
Issue number	637
DOIs	https://doi.org/10.1299/kikaic.65.3869
Publication status	Published - 1999

Keywords

CAD
Facility Design
Layout Planning
Producing System
Production Planning
Simulated Annealing
Three Dimensions (3-D)

ASJC Scopus subject areas

Mechanics of Materials
Mechanical Engineering
Industrial and Manufacturing Engineering

Access to Document

10.1299/kikaic.65.3869

Cite this

A Layout Technique of Three Dimensions for Unequal Area and Shape Departments. / Taniguchi, Hideo; Murofushi, Toshihiko; Irohara, Takashi; Yoshimoto, Kazuho.

In: Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C, Vol. 65, No. 637, 1999, p. 3869-3875.

Research output: Contribution to journal › Article › peer-review

@article{3ad7e76a8b3c4339ab3cb8f6cf5b979a,

title = "A Layout Technique of Three Dimensions for Unequal Area and Shape Departments",

abstract = "The facility layout problem can be formulated as a combinatorial optimization problem to minimize the total cost owing to material flow. Most of the paper is focusing on such a layout problem in two-dimensions. However it would be better to treat the layout problem in three-dimension (3 D) in order to minimize the distance between equipment and the land area. For bin-packing problem, there are some papers in 3 D, but in those model flow between bin is not considered. That{\textquoteright}s why this paper proposed a 3 D-layout technique for unequal shape and area departments. Computational experiments are suggesting that proposed algorithm will produce better solution than plain layout which is the result of previous algorithm.",

keywords = "CAD, Facility Design, Layout Planning, Producing System, Production Planning, Simulated Annealing, Three Dimensions (3-D)",

author = "Hideo Taniguchi and Toshihiko Murofushi and Takashi Irohara and Kazuho Yoshimoto",

year = "1999",

doi = "10.1299/kikaic.65.3869",

language = "English",

volume = "65",

pages = "3869--3875",

journal = "Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C",

issn = "0387-5024",

publisher = "Japan Society of Mechanical Engineers",

number = "637",

}

TY - JOUR

T1 - A Layout Technique of Three Dimensions for Unequal Area and Shape Departments

AU - Taniguchi, Hideo

AU - Murofushi, Toshihiko

AU - Irohara, Takashi

AU - Yoshimoto, Kazuho

PY - 1999

Y1 - 1999

N2 - The facility layout problem can be formulated as a combinatorial optimization problem to minimize the total cost owing to material flow. Most of the paper is focusing on such a layout problem in two-dimensions. However it would be better to treat the layout problem in three-dimension (3 D) in order to minimize the distance between equipment and the land area. For bin-packing problem, there are some papers in 3 D, but in those model flow between bin is not considered. That’s why this paper proposed a 3 D-layout technique for unequal shape and area departments. Computational experiments are suggesting that proposed algorithm will produce better solution than plain layout which is the result of previous algorithm.

AB - The facility layout problem can be formulated as a combinatorial optimization problem to minimize the total cost owing to material flow. Most of the paper is focusing on such a layout problem in two-dimensions. However it would be better to treat the layout problem in three-dimension (3 D) in order to minimize the distance between equipment and the land area. For bin-packing problem, there are some papers in 3 D, but in those model flow between bin is not considered. That’s why this paper proposed a 3 D-layout technique for unequal shape and area departments. Computational experiments are suggesting that proposed algorithm will produce better solution than plain layout which is the result of previous algorithm.

KW - CAD

KW - Facility Design

KW - Layout Planning

KW - Producing System

KW - Production Planning

KW - Simulated Annealing

KW - Three Dimensions (3-D)

UR - http://www.scopus.com/inward/record.url?scp=85024456060&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85024456060&partnerID=8YFLogxK

U2 - 10.1299/kikaic.65.3869

DO - 10.1299/kikaic.65.3869

M3 - Article

AN - SCOPUS:85024456060

VL - 65

SP - 3869

EP - 3875

JO - Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C

JF - Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C

SN - 0387-5024

IS - 637

ER -

A Layout Technique of Three Dimensions for Unequal Area and Shape Departments

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this