A Genetic Algorithm with Boundary Search for The Facility Layout Problem

• Main Authors: Siao-Jheng Cai, 蔡曉政
• Other Authors: Chih-Ping Lin
• Format: Others
• Language: zh-TW
• Published: 2012
• Online Access: http://ndltd.ncl.edu.tw/handle/36mhu2

碩士 === 國立臺北科技大學 === 工業工程與管理系碩士班 === 100 === Facilities layout is a professional technique to assign departments to the appropriate location, and to reach the minimal handling cost and land cost for a system. In addition, an appropriate layout could improve the productivity, increase the production efficiency and cost down the operation expenses of a system. Many papers are published about continuous layout problem (CLP), CLP is to place the departments anywhere within a plant site without overlapping each others. CLP is base on two dimensions framework problem, however, to find the optimal layout cost of larger departments is too complexity and time-consuming. Boundary search heuristic (BSH) is a dimension schema for solving CLP, BSH could reduce the computing time and dealing with much more feasible for facilities layout problem. In order to eliminate redundant area and evaluate the layout cost of CLP, a factor of area utilization is considered in objective function of this research. Through BSH to define the correlation between the departments, and then generate the characteristics of layout design to encode. By Genetic Algorithms to achieve the improvement of BSH.