Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 陳昱皓 | en_US |
dc.contributor.author | 張永佳 | en_US |
dc.date.accessioned | 2014-12-12T02:58:34Z | - |
dc.date.available | 2014-12-12T02:58:34Z | - |
dc.date.issued | 2005 | en_US |
dc.identifier.uri | http://140.113.39.130/cdrfb3/record/nctu/#GT009333540 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/79501 | - |
dc.description.abstract | 供應鏈強調整體效益之觀念日益受到重視,然而不同的階段追求的目標函數不同,會造成供應鏈彼此間上下游的利益衝突,因而無法達到整體效益的最佳化。本研究以供應鏈中最為重要的兩個階段產品製造與物流配送為問題主軸,利用非等效平行機台(unrelated parallel machine)模擬產品製造和車輛途程問題(vehicle routing problem,VRP)模擬物流配送,同時考慮此兩階段的目標函數,以整體最佳化為目的。但由於非等效平行機台與車輛途程問題皆被證明為未定多項式難度(NP-Hard),因此整合此兩階段之問題的複雜度至少也為未定多項式難度,即當問題規模大到一定程度時,無法在合理時間內求得最佳解。本研究採用巨集式啟發式演算法(meta-heuristic)中的塔布搜尋法(tabu search)求解上述兩階段問題,以最小化總成本為目的。並使用國際題庫與模擬資料測試所開發出之塔布搜尋法的穩定度及有效性,期以有效率的方式找出供應鏈中整合產品製造與物流配送兩階段問題的最適解。 | zh_TW |
dc.language.iso | zh_TW | en_US |
dc.subject | 非等效平行機台 | zh_TW |
dc.subject | 車輛途程問題 | zh_TW |
dc.subject | 未定多項式難度 | zh_TW |
dc.subject | 巨集式啟發式演算法 | zh_TW |
dc.subject | 塔布搜尋法 | zh_TW |
dc.subject | unrelated parallel machine scheduling | en_US |
dc.subject | vehicle routing problem | en_US |
dc.subject | NP-Hard | en_US |
dc.subject | meta heuristic | en_US |
dc.subject | tabu search algorithm | en_US |
dc.title | 應用塔布搜尋法於求解供應鏈中整合生產排程與成品配送兩階段問題 | zh_TW |
dc.title | Solving A Two-Stage Problem with Scheduling and Delivery in Supply Chain by Tabu Search Algorithm | en_US |
dc.type | Thesis | en_US |
dc.contributor.department | 工業工程與管理學系 | zh_TW |
Appears in Collections: | Thesis |
Files in This Item:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.