English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 80990/80990 (100%)
造訪人次 : 42801631      線上人數 : 1068
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/49827


    題名: Practical optimization of group piles using discrete Lagrange multiplier method
    作者: Hwang,JH;Chung,MC;Juang,DS;Lyu,YD;Juang,CH
    貢獻者: 土木工程學系
    關鍵詞: FOUNDATIONS;DESIGN
    日期: 2011
    上傳時間: 2012-03-27 16:17:55 (UTC+8)
    出版者: 國立中央大學
    摘要: This paper presents a practical methodology for designing group piles of a bridge foundation that can minimize the construction cost. The constraint functions for the designed pile group are constructed according to the design code currently adopted in local engineering practice. A new procedure based on the discrete Lagrange multiplier (DLM) method is proposed for searching the optimal solution. Seven real-world design cases are used to test the validity and the performance of the proposed procedure and algorithm, in which the DLM solutions are compared with the global optimum solutions obtained by the exhaustive searching method (ESM). Vast improvement in the computational efficiency is achieved, as the DLM method can find local minimum solutions in less than 2.0 to 4.0 minutes whereas the time required with the ESM is 10,000 to 25,000 times longer. In the case studies presented, the construction costs in conjunction with the use of the DLM method differ from the global minimum costs by less than 6.0%, but the savings over the original designs can be as high as 13% to 56%.
    關聯: OPTIMIZATION AND ENGINEERING
    顯示於類別:[土木工程學系 ] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML476檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明