Study of Evolutionary Algorithms for Solving Facility Layout Problems
| Project/Area Number |
18510129
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Social systems engineering/Safety system
|
|---|
| Research Institution | Hirosaki University (2007)
Tokyo Metropolitan University (2006) |
|---|
Principal Investigator |
SUZUKI Atsushi Hirosaki University, Hirosaki University, Faculty of Humanities, Associate Professor (30249742)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
YAMAMOTO Hisashi Tokyo Metropolitan University, Graduate School of System Design, Associate Professor (60231677)
KAINUMA Yasutaka Tokyo Metropolitan University, Faculty of System Design, Associate Professor (90204312)
TSUJIMURA Yasuhiro Nippon Institute of Technology, Faculty of Engineering, Associate Professor (80240977)
|
|---|
| Project Period (FY) |
2006 – 2007
|
| Project Status |
Completed (Fiscal Year 2007)
|
| Budget Amount *help |
¥3,410,000 (Direct Cost: ¥2,900,000、Indirect Cost: ¥510,000)
Fiscal Year 2007: ¥2,210,000 (Direct Cost: ¥1,700,000、Indirect Cost: ¥510,000)
Fiscal Year 2006: ¥1,200,000 (Direct Cost: ¥1,200,000)
|
|---|
| Keywords | facility layout / algorithm / 進化的計算法 |
|---|
| Research Abstract |
In many plants or factories, the location of facilities and the configuration between facilities are related to the effectiveness of material handling and other operational issues. In this study, the problem of deciding spatial location of facilities is called as facility layout problem. In this research project, we focused on operational and other requirements as well as material handling, and considered adjacency preference between facilities. By using adjacency preference, preferable configuration of facilities can be considered minutely. However the problem is complicated because the satisfaction of adjacency preference items is represented to 0 or 1 discrete value of binary variables. We classified layout problems into some types with the problem size. In the case of the number of facilities less than or equal to 14, the problem is regarded as the small size problem, and we developed a new algorithm based on branch and bound method for solving such problems. In the case of the num
… More
ber is greater than 14, the problem is regarded as large size one, we developed evolutionary algorithms based on simulated annealing technique, genetic algorithms and tabu search method. We compared those algorithms by experiments using numerical examples, and got information of effectiveness of searching and data structure of problems. Moreover, far solving very large scale problem of single floor facility layout; a new algorithm combined simulated annealing and the original neighborhood search method is developed. By using our algorithm on recent personal computers, for large size problem that it is not possible to find the optimum or semi-optimum in practical computation time, it became to be able to find the optimum or the excellent solution. For solving multi floor facility layout problems, we proposed an algorithm based on branch and bound method in the case of small problem, and considering of symmetry layout and other algorithm based on simulated annealing technique to solve large problems. Less
|
Report
(3 results)
Research Products
(18 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] 隣接選好順位を利用した設備配置問題の解法2007
Author(s)
今剛士, 鈴木淳, 福士達也, 山本久志
Organizer
平成19年度日本設備管理学会春季研究発表大会
Place of Presentation
青山学院大学
Year and Date
2007-06-07
Description
「研究成果報告書概要(和文)」より
Related Report
-
-
-
