Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
    • 指導教授
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 工學院
  3. 工業工程學研究所
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/36228
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor楊烽正
dc.contributor.authorHong-Wen Changen
dc.contributor.author張宏文zh_TW
dc.date.accessioned2021-06-13T07:54:21Z-
dc.date.available2010-07-27
dc.date.copyright2005-07-27
dc.date.issued2005
dc.date.submitted2005-07-24
dc.identifier.citation1. Huang, H.J., Xu, G., 1995, “Aggregate scheduling and network solving of multi-stage and multi-item manufacturing systems”, European Journal of Operational Research, 105, pp. 52-65.
2. Drissi-Kaitouni, O., and Hameda-Benchekroun, A., 1992, “A dynamic traffic assignment model and a solution algorithm”, Transportation Science, 26, pp. 119-128.
3. Drissi-Kaitouni, O., 1993, “A variational inequality formulation of the dynamic traffic assignment problem”, European Journal of Operational Research, 71, pp. 188-204.
4. Gabby, H., 1979, “Multi-stage production planning”, Management Science, 25, pp. 1138-1148.
5. Huang, H.J., 1994, “An aggregation scheduling model and network algorithm in multi-stage and multi-item dynamic manufacturing systems”, Unpublished Working Paper, School of Management, Beijing University of Aeronautics and Astronautics.
6. Lam, W.H.K., and Huang, H.J., 1992, “A combined trip distribution and assignment model for multiple user classes”, Transportation Research, 26B, pp. 275-287.
7. Larsson, T., and Patriksson, M., 1992, “Simplicial decompositions with disaggregated representation for the traffic assignment problem”, Transportation Science, 26, pp.4-17.
8. Larsson, T., and Patriksson, M., 1995, “An augmented Lagrangean dual algorithm for link capacity side constrained traffic assignment problems”, Transportation Research, 29B, pp.433-455.
9. Srinivasan, A., 1989, “Congestion, control and pricing in traffic and management systems”, Ph.D. Dissertation, School of Urban and Public Affairs, Carnegie-Mellon University.
10. Zahorik, A., Thomas, L.J., and Trigeiro, W.W., 1984, “Network programming models for production scheduling in multi-stage, multi-item capacitated systems”, Management Science, 30, pp.308-325.
11. Zawack, D.J., and Thompson, G.L., 1987, “A dynamic space-time network flow model for city traffic congestion”, Transportation Science, 21, pp.153-162.
12. Jiménez, F., Verdegay J.L., 1998, “Uncertain solid transportation problems”, Fuzzy Sets and Systems, 100, pp.45-57.
13. Tzeng, G.H., Dušan Teodorović, and Hwang, M.J., 1996, “Fuzzy bicriteria multi-index transportation problems for coal allocationplanning of Taipower”, European Journal of Operational Research, 95, pp.62-72.
14. Buyang Cao and Götz Uebe, 1995, “SOLVING TRANSPORTATION PROBLEMS WITH NONLINEAR SIDE CONSTRAINTS WITH TABU SEARCH”, Computers Ops Res. Vol.22, No.6, pp.593-603.
15. Gen, M. and Li, Y., 1999, “Spanning Tree-based Genetic Algorithm for the Bicriteria Fixed Charge Transportation Problem”, IEEE, pp.2265-2771.
16. Jens Gottlieb and Lutz Paulmann, 1998, “Genetic Algorithms for the Fixed Charge Transportation Problem”, IEEE, pp.330-335.
17. Gen, M., Ida, K., Li, Y. and Kubota, E., 1995, “Solving Bicriteria Solid Transportation Problem with Fuzzy Numbers by A Genetic Algorithm”, Computers ind. Engng Vol. 29, No. 1-4, pp.537-541.
18. Kim, J.U., Kim Y.D., and Shim S.O., 2002, “Heuristic algorithms for a multi-period multi-stop transportation planning problem”, Journal of the Operational Research Society, 53, pp.1027-1037.
19. Frederick, S. and Gerald, J., 1996, “Introduction to Operations Research”.
20. 林慈傑,2002,「以遺傳演算法求解類運輸問題模式化的多廠訂單分配問題」,碩士論文,台灣大學工業工程學研究所。
21. 賴士葆,1995,生產作業管理-理論與實務,華泰書局。
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/36228-
dc.description.abstract本研究以典型運輸問題(Traditional Transportation Problem)為基,考量多個期間的供需變化情形並結合中期生產計畫(Aggregate Planning)的動態運輸問題,透過時空網路擴張方法(Space-Time Network Expansion Method)的概念發展多期運輸規劃問題(Multi-period Transportation Programming Model)並建立數學模式。
研究內容將提出多期運輸規劃問題的數學模式,並且以線性和簡單非線性規劃作為多期運輸規劃問題的求解法。此外將探討工廠產能預備水準、運輸途徑可供選擇的種類以及各期差異的運輸成本,如何影響多期運輸規劃的求解結果。最後就不同需求分布狀況為主題,探討決策者如何在生產成本、運輸成本、貨物滯留產生的資金成本之間取捨,以決定最適合的產能預備水準和運輸方案。
zh_TW
dc.description.abstractThe research of transportation problems with time-varying demand patterns are less to present in the past. This thesis proposes a new problem, which called multi-period transportation planning model, basing on traditional transportation problems and the concepts of aggregate planning, and presents the use of space-time network expansion method, which could transform the dynamic networks to time-independent ones.
According to the model, a linear and a simple non-linear programming methods are proposed to solve this problem with the support of LINGO tool. In addition, three computational studies on capacity reserving levels, amount of transportation varieties, and transportation costs varying between routes, are performed, evaluating how these factors changes overall costs in planning results. Due to the fact that changing demands may drive the performance of multi-period transportation planning model, 23 kinds of demand patterns are presented and solved, with analysis results demonstrating the effectiveness of the MPTP model at each time-varying demand modes, to offer information and suggestions for decision makers that devoted to down-costing through trading-off between production costs, transportation costs, and interests within inventories and quantities-on-routes.
en
dc.description.provenanceMade available in DSpace on 2021-06-13T07:54:21Z (GMT). No. of bitstreams: 1
ntu-94-R90546002-1.pdf: 1132457 bytes, checksum: 8c1e077c7009655be41ea04872d4bc55 (MD5)
Previous issue date: 2005
en
dc.description.tableofcontents誌謝 i
摘要 ii
Abstract iii
目錄 iv
圖目錄 vi
表目錄 ix
中英對照表 xii
符號列表 xiii
第一章 緒論 1
1.1 研究背景與研究動機 1
1.2 研究目的 4
1.3 研究流程 5
1.4 研究範疇與限制 6
第二章 文獻探討 7
2.1 網路尋優問題(Network Optimization Problem) 7
2.2 運輸問題(Transportation Problem, TP) 12
2.3 動態最大流量問題與時空網路擴張方法(Dynamic Maximal Flow Problem & Space-Time Expanded Network Approach) 16
第三章 多期運輸規劃問題模式與求解過程 21
3.1 SYN公司範例問題 21
3.2 多期運輸規劃問題求解流程 23
3.3 多期運輸規劃問題數學模式 25
3.4 展示以LINGO規劃工具求解多期運輸規劃問題的過程 31
3.4.1 設置資料區域 31
3.4.2 進行求解 38
第四章 實例測試及結果分析 44
4.1 SYN03原始資料 44
4.2 變動要因實驗與結果分析 49
4.2.1 產能預備率實驗與分析 49
4.2.2 最大運輸途徑數實驗與分析 52
4.3 探討運輸成本計價方式 55
4.4 探討需求分佈對於多期運輸規劃模式的影響 63
4.4.1 SYN05原始資料 63
4.4.2 需求分布型態與分類 68
4.4.3 需求分布型態實驗 73
4.5 小結 81
第五章 結論與未來研究建議 83
5.1 結論 83
5.2 未來研究建議 83
參考文獻 85
附錄A SYN05需求分布型態範例 87
附錄B 例題LGEX03所使用的LINGO程序代碼 112
dc.language.isozh-TW
dc.subject時空網路擴張方法zh_TW
dc.subject多期運輸規劃問題zh_TW
dc.subject運輸問題zh_TW
dc.subject中期生產規劃zh_TW
dc.subjecttransportation problemsen
dc.subjectspace-time network expansion methoden
dc.subjectaggregate planningen
dc.subjectmulti-period transportation programming modelsen
dc.title多期運輸規劃問題zh_TW
dc.titleMulti-period Transportation Planning Modelsen
dc.typeThesis
dc.date.schoolyear93-2
dc.description.degree碩士
dc.contributor.oralexamcommittee楊維寧,歐陽超,鍾雲恭
dc.subject.keyword多期運輸規劃問題,運輸問題,中期生產規劃,時空網路擴張方法,zh_TW
dc.subject.keywordmulti-period transportation programming models,transportation problems,aggregate planning,space-time network expansion method,en
dc.relation.page113
dc.rights.note有償授權
dc.date.accepted2005-07-25
dc.contributor.author-college工學院zh_TW
dc.contributor.author-dept工業工程學研究所zh_TW
顯示於系所單位:工業工程學研究所

文件中的檔案:
檔案 大小格式 
ntu-94-1.pdf
  未授權公開取用
1.11 MBAdobe PDF
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved