English  |  正體中文  |  简体中文  |  Items with full text/Total items : 67783/67783 (100%) Visitors : 23029970      Online Users : 262
 Scope All of NCUIR 工學院    土木工程學系碩士在職專班       --博碩士論文 Tips: please add "double quotation mark" for query phrases to get precise resultsplease goto advance search for comprehansive author search Adv. Search
 NCU Institutional Repository > 工學院 > 土木工程學系碩士在職專班 > 博碩士論文 >  Item 987654321/1374

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

 Title: 模板工程設計最佳化;DESIGN OPTIMIZATION OF CONCRETE FORMS Authors: 朱煌林;Huang-Lin Chu Contributors: 土木工程學系碩士在職專班 Keywords: 模板工程;最佳化;Concrete formwork;LINGO Date: 2001-06-13 Issue Date: 2009-09-21 09:27:58 (UTC+8) Publisher: 國立中央大學圖書館 Abstract: 本研究在發展最佳化模式，用來幫助營造業節省模板施工費用，目前傳統木模板實際施工情形是沒效率且不安全，時常發生工安意外造成損失。學術界曾利用窮舉法求解模板最佳化設計的組合，唯此法是一種沒有效率且費時冗長的計算方式，而所得的結果又未必真正達到最佳化。本研究為改善以往的問題在安全性及經濟性的原則下發展最佳化模式，其範圍包括柱、牆、版模板應力分析與設計。 本研究自行發展二種模式(1)非線性整數規劃模式；本模式屬於NP-hard問題，利用LINGO程式可求解出局部最佳解，如與窮舉法比較時具有實用及快速求解等優點。(2)動態規劃模式；此啟發解法是由動態規劃觀念發展而成，如與窮舉法比較可以快速收斂節省不必要的運算過程。在實際測試中此二種模式所獲得的成果幾乎一致 This paper presents a designed optimal method to reduce cost for Concrete formwork. The traditional construction industry has been inefficient and unsafe, therefore many accidents occurred from time to time to cause a great amount of damage. The enumerative algorithm has been used by academies as the optimal designed combination for the formwork. However, the formula is considered as inefficient and time consuming; furthermore, the result couldn’t guarantee to achieve the best result. The main goal of this research is to improve the existing problems regarding safety and cost to have the best model. The model includes the analyze and design of the column, wall, and the slab formwork system. The research of this paper has developed into two models (1) Integer nonlinear program model – NP-hard problems. We can use LINGO to solve local optimum. In comparison with enumerative algorithm, the above model is more practical, easy, and efficient. (2) Dynamic program model – an heuristic algorithm developed from dynamic program concept. In comparison with the enumerative algorithm, the above model can save a lot of time in unnecessary calculation procedure. In reality test for two models nearly obtain to same results. Appears in Collections: [土木工程學系碩士在職專班] 博碩士論文

Files in This Item:

File SizeFormat
0KbUnknown2208View/Open