| 姓名 | 李建漳(Chien-Chang Li) | 電子郵件信箱 | E-mail 資料不公開 | |
| 畢業系所 | 營建工程系碩士班(Department and Graduate Institute of Constrction Engineering) | |||
| 畢業學位 | 碩士(Master) | 畢業時期 | 91學年第2學期 | |
| 論文名稱(中) | 以禁忌搜尋法應用於專案工期/成本權衡問題最佳化之研究 | |||
| 論文名稱(英) | A study of the project time/cost tradeoff problem optimization using Tabu search algorithm | |||
| 檔案 |
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。 |
論文使用權限 | 校內外均一年後公開 | |
| 論文語文/頁數 | 中文/59 | |||
| 摘要(中) | 資源排程為一種組合最佳化的問題，早期在求解資源排程最佳化問題中大多利用傳統數學計算模式，是採取逐一分析求解方式，進而造成大量計算，雖可求得最佳解，但其最大的缺點為求解效率不彰，因此近年來有許多在資源排程的相關研究中提出新的計算模式。而在考慮資源的排程問題方面的研究，大多只針對資源限制問題、或工期/成本權衡等單一問題進行研究，因此本研究的目的在於建立一個整合性的營建工程專案資源排程最佳化模式。 禁忌搜尋法是一種求解組合最佳化問題的鄰近搜尋法，其基本概念在使演算法具有短期記憶能力。因利用鄰近搜尋法的求解過程中，常常會有陷入區域最佳解的問題，一個不具有任何記憶能力的演算法經常會重複搜尋已經檢視過的可行解，或是在同一個區域裡長時間逗留。為此，禁忌搜尋法利用記憶架構，引導搜尋法跳離掉近區域最佳化之陷阱中，使得演算效率提高。 本研究以禁忌搜尋法建構一個整合工期/成本權衡問題、資源限制排程問題之資源排程最佳化模式，並透過多目標規劃方法：逼近法(TOPSIS)，求解工期/成本權衡問題，並計算出一個工期較短、成本較低，且滿足資源限制的最佳排程方案，提供排程規劃的一個建議解，且經由實例驗證後，證明禁忌搜尋法應用在本研究中，可以在較短的時間內，有效地求得近似最佳解，或最佳解。 | |||
| 摘要(英) | There are two
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 considering cost problem;(2) to make
resource allocation and utilization efficiently to reduce the delay
possibility of the works when the capacity; For achieving the objectives
on construction project resource scheduling and cost minimization, this
research offers a new model to solve the problems above. The traditional
models still have many problems to solve this sort of problems.(i.e the
speed of searching feasible solutions, etc,. ). Consequently, In this
research we propose a model for solving project time/cost tradeoff
problem under the constraint of limited resources using tabu search
algorithm and makes some improvement on the disadvantages of traditional
models in my study. Furthermore, this model will be more stable and
efficient than the studies did before. The study implements the concept
of Tabu Search algorithms(TS) to build a new model considering time/cost
tradeoff problem. TS method achieves superior results compared to the other methods because it is based on introducing flexible memory structures in conjunction with strategic restrictions and aspiration rules as a means for exploiting search spaces. After the experimental test of the model the research propose, the result of the test compared the similar studies is good. | |||
| 關鍵字(中) |
|
關鍵字(英) |
| |
| 指導教授 |
| |||