姓名 |
蕭博文(Po-Wen
Hsaio) |
電子郵件信箱 |
dean-55@yahoo.com.tw |
畢業系所 |
營建工程系碩士班(Department
and Graduate Institute of Constrction Engineering) |
畢業學位 |
碩士(Master) |
畢業時期 |
90學年第2學期 |
論文名稱(中) |
應用禁忌搜尋法求解營建工程專案多重資源排程最佳化之研究 |
論文名稱(英) |
A study on
multi-resources scheduling optimization using tabu search method. |
檔案 |
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。 請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
|
論文使用權限 |
校內外完全公開 |
論文語文/頁數 |
中文/75 |
摘要(中) |
摘要 營建工程專案資源排程之主要目標有三:(1)使所有施工作業項目均能適時獲得資源供應開始施作,在預定工期內完成作業施作項目;(2)當資源受到限制時,能最充份有限的利用資源分配給予各項施工作業,使工期延誤之可能降到最低;(3)有效的運用施工資源以得到較佳之工程財務管理,進而增加收益。 由於營建工程專案規模日益龐大,在考慮有限資源的情況下,使資源排程相對的更加複雜。若是以傳統的計算模式來求解這類問題,雖然可以求得最佳解,但繁複的過程以及求解效率不彰為其缺點。所以綜觀前人的研究均提出新的演算法來改善求解效率,如啟發式演算法、基因演算法等。禁忌搜尋法在工業工程領域已廣泛的應用於求解各種組合最佳化問題,且已有不錯的成效。其原理是應用其特有的彈性記憶架構以及凌駕準則,擴大搜尋鄰近之範圍,以導引搜尋法跳離區域最佳解之陷阱。本研究在考量資源限制的情況下,利用禁忌搜尋法建立新的演算模式,應用禁忌搜尋法所建構之演算模式分析求解多重資源排程問題,並改善傳統計算模式的缺點,使得求解品質佳且效率更高。 |
摘要(英) |
Abstract There
are three objectives on the construction project resource scheduling:
(1) to let all of the activities get their resources and then complete
the works before the required finish date; (2) to make resource
allocation and utilization efficiently to reduce the delay possibility
of the works when the capacity; (3) to utilize there sources more
effectively to get the better financial management performance and also
increase our revenue. Considering the conditions of the constrained
resources, resources scheduling become more difficult as of the scope of
construction engineering projects become larger and more complex.
Although using traditional models to solve this sort of problems could
obtain the optimal solution, the process of evaluation will be complex
and inefficiency. In the previous studies, most of the studies focus on
finding a new algorithm such as genetic algorithm to improve the speed
of searching feasible solutions. The research uses a new algorithm,
namely Tabu search, to solve the problem of resource scheduling which
are constrained. Tabu search method was widely applied to solve the
various kinds of combinatorial optimization problems in the industrial
engineering area and got distinguished results. It is based on
introducing flexible memory structures in conjunction with strategic
restrictions and aspiration levels as a means for exploiting search
spaces. The research will explore the feasibility of this algorithm and
implements the concept of tabu search method to set up a new model
considering constrained resources. The research found using this new
model built by tabu search could solve the multi-resources problems of
construction project, but also provide a precise solutions in some
cases, Furthermore, this model also makes improvement on the
disadvantages of traditional models and both make the better solution
quality and higher efficiency of evaluation. |
關鍵字(中) |
禁忌搜尋法
限制資源
資源排程 |
關鍵字(英) |
tabu search
resources scheduling
limited resources
|
指導教授 |
潘乃欣
|