English
| 正體中文 |
简体中文
|
全文筆數/總筆數 : 2928/5721 (51%)
造訪人次 : 374393 線上人數 : 978
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by
NTU Library IR team.
搜尋範圍
全部NCUTIR
管理學院
工業工程與管理系(所)
--【工業工程與管理系所】期刊論文
查詢小技巧:
您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
進階搜尋
主頁
‧
登入
‧
上傳
‧
說明
‧
關於NCUTIR
‧
管理
勤益科大機構典藏
>
管理學院
>
工業工程與管理系(所)
>
【工業工程與管理系所】期刊論文
>
Item 987654321/6830
資料載入中.....
書目資料匯出
Endnote RIS 格式資料匯出
Bibtex 格式資料匯出
引文資訊
資料載入中.....
資料載入中.....
請使用永久網址來引用或連結此文件:
http://ir.lib.ncut.edu.tw/handle/987654321/6830
題名:
Simulated annealing based parallel genetic algorithm for facility layout problem
作者:
古美玉
貢獻者:
工業工程與(工程)管理系
日期:
2011-03
上傳時間:
2017-12-17 10:41:46 (UTC+8)
摘要:
The facility layout problem (FLP), a typical combinational optimisation problem, is addressed in this paper by implementing parallel simulated annealing (SA) and genetic algorithms (GAs) based on a coarse-grained model to derive solutions for solving the static FLP with rectangle shape areas. Based on the consideration of minimising the material flow factor cost (MFFC), shape ratio factor (SRF) and area utilisation factor (AUF), a total layout cost (TLC) function is derived by conducting a weighted summation of MFFC, SRF and AUF. The evolution operations (including crossover, mutation, and selection) of GA provide a population-based global search in the space of possible solutions, and the SA algorithm can lead to an efficient local search near the optimal solution. By combing the characteristics of GA and SA, better solutions will be obtained. Moreover, the parallel implementation of simulated annealing based genetic algorithm (SAGA) enables a quick search for the optimal solution. The proposed method is tested by performing a case study simulation and the results confirm its feasibility and superiority to other approaches for solving FLP. © 2011 Taylor & Francis. (28 refs)
關聯:
International Journal of Production Research
顯示於類別:
[工業工程與管理系(所)] 【工業工程與管理系所】期刊論文
文件中的檔案:
沒有與此文件相關的檔案.
檢視Licence
在NCUTIR中所有的資料項目都受到原著作權保護.
DSpace Software
Copyright © 2002-2004
MIT
&
Hewlett-Packard
/
Enhanced by
NTU Library IR team
Copyright ©
-
回饋