Using Graph-Pairs and MIP-Models to Solve Unequal Area Facility Layout Problems

碩士 === 國立中央大學 === 工業管理研究所 === 99 === Koopmans and Beckmann (1957) have proposed facility layout planning problem for 50 years and it played an important role in both academia and industry. For the industry, the more efficient facilities layout planning, the lower material handling of total productio...

Full description

Bibliographic Details
Main Authors: Pei-shan Hsieh, 謝佩珊
Other Authors: Chi-tai Wang
Format: Others
Language:en_US
Published: 2011
Online Access:http://ndltd.ncl.edu.tw/handle/55067947092913365026
Description
Summary:碩士 === 國立中央大學 === 工業管理研究所 === 99 === Koopmans and Beckmann (1957) have proposed facility layout planning problem for 50 years and it played an important role in both academia and industry. For the industry, the more efficient facilities layout planning, the lower material handling of total production cost. For the academics, many researchers still use different heuristic method and try to solve the difficult facility layout problems recently. Therefore, the facilities layout planning for the production issue is very important. Many researchers have developed heuristic algorithm to help solving unequal area facility layout problems (UA-FLPs); for example, simulated annealing algorithms (SA), genetic algorithms, ant colony optimization (ACO), and so on. This research propose a hybrid of SA and ACO which combines graph-pairs to represent the value of the binary variables with Montreuil’s (1990) mix-integer programming (MIP) models to solve UA-FLPs. We hope to obtain better solutions via SA and ACO procedures, that is, generate lower flow and material costs.