以圖對為基礎之啟發式演算法，求解動態設施規劃問題 ; Solving the Dynamic Facility Layout Problem with graph pair-based heuristics

NCUIR > School of Management at National Central University > Graduate Institute of Industrial Management > Electronic Thesis & Dissertation > Item 987654321/44016

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/44016

Title:	以圖對為基礎之啟發式演算法，求解動態設施規劃問題;Solving the Dynamic Facility Layout Problem with graph pair-based heuristics
Authors:	謝祥凡;Hsiang-fan Hsieh
Contributors:	工業管理研究所
Keywords:	廠房佈置;模擬退火法;混合整數規劃、圖對;動態設施規劃;simulated annealing;facilities layout planning;dynamic facility layout problem
Date:	2010-07-16
Issue Date:	2010-12-08 14:46:00 (UTC+8)
Publisher:	國立中央大學
Abstract:	近年來，隨著科技技術日新月異，企業間競爭力不斷增長，公司內廠房佈置顯得特別重要，且會影響特定空間之整體作業效率。許多製造組織因企業環境天性，對部門配置進行週期性調整，因此，設施佈置也應擬訂相關動態設施佈置計劃，以配合不同的生產策略。相較之下，傳統單期設施規劃著重於單一時間之廠房佈置，且未考慮長期性之廠房規劃，以致於廠房將因應需求，對廠房佈置進行設施重置時，額外支出多餘成本及規劃時間。因此，本研究將提出一套動態啟發式演算法，求解動態設施規劃問題，以提供一套考慮多時期之設施佈置方案。而動態指部門位置於下一期之需求產生變動，其需求可能為部門面積改變、部門邊長比例大小、變動部門位移成本、部門間物流量及成本及廠房面積。因此，本研究致力於發展彈性化設施佈置，運用靜態設施規劃問題及圖對為方法基礎，其包括以圖對表示部門間相對位置、混合整數規劃模型及靜態啟發式演算法，以發展一套動態啟發式演算法。Recently, competitions among companies have been increased by advanced technology. Therefore, the facility layout of corporation will play an important role in the future and it will have influence on operational efficiency. In the past, traditional facilities planning always focused on the single-period. Because it did not consider the long-term layout planning for the future, it should pay extra cost and time when it need to re-layout. Basically, manufacturing organizations often adjust and vary layout periodically for the business strategy. For example, expanding, shrinking and moving the departments. Dynamic strategy is adjusting design of moving materials, varying space of departments via planning periods, to design and arrange the most efficient facility layout. But it will produce some relocation costs since change the layout from certain period to the next. However, we proposed a heuristic algorithm to minimize both material handling costs and relocation costs. Assuming all the departments are rectangular in shape, varying departments in area, given facility in area and planning period. We operate graph-pair to control the location of departments in layout. Solving the dynamic facility layout by a mixed-integer programming and dynamic heuristic algorithm.
Appears in Collections:	[Graduate Institute of Industrial Management] Electronic Thesis & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	853	View/Open

社群 sharing

Loading...