請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/49581完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 黃奎隆(Kwei-Long Huang) | |
| dc.contributor.author | Che-Ming Kuo | en |
| dc.contributor.author | 郭哲銘 | zh_TW |
| dc.date.accessioned | 2021-06-15T11:35:55Z | - |
| dc.date.available | 2021-08-25 | |
| dc.date.copyright | 2016-08-25 | |
| dc.date.issued | 2016 | |
| dc.date.submitted | 2016-08-15 | |
| dc.identifier.citation | 參考文獻
1. 蔡致榮 , 邱相文, 荷蘭與日本植物工廠最新發展. 2. 方煒, 話說植物工廠. 農業推廣手冊67輯. 3. 方煒, 以植物工廠生產農作物與綠能產業研究發展. 2010. 4. 鄔家琪, 現代農園產品—植物工廠的作物. 2013. 5. 魏勤韶, 考慮植物生長體積變化之訂單式植物工廠排程演算法, 國立台灣大學碩博士論文. 2015. 6. Hung, Y.-F. and C.-Y. Hung, Using Heuristic Search Methods to Solve Resource Constrained Project Scheduling. 2009. 7. Ioslovich, I. and P.-O. Gutman, Optimal control of crop spacing in a plant factory. Automatica, 2000. 36(11): p. 1665-1668. 8. 陳世銘, 方煒, 羅筱鳳, 曹幸之, 張耀乾, 廖國基, 顏炳郎, 蔡兆胤, 台灣植物工廠現況與發展策略之分析. 2011. 9. 全中和, 天生好野菜--山萵苣. 2009. 10. 慶聲科技, 植物工廠大展. 2013. 11. 黃怡菁, 山葵植物工廠之研發. 2012. 12. 謝博偉, 以排序最佳化模擬為基礎的半導體生產排程法則快速選取方法之設計, 國立台灣大學碩博士論文. 2002. 13. 吳政翰, DHC 系統之任務指派與排程的新型基因演算法, 國立交通大學碩博士論文. 2006. 14. Moreira, M.C.O. and A.M. Costa, Hybrid heuristics for planning job rotation schedules in assembly lines with heterogeneous workers. International Journal of Production Economics, 2013. 141(2): p. 552-560. 15. Kantorovich, L., Mathematical methods of organizing and planning production. 1960. 16. Detlefsen, N.K. and A.L. Jensen, Modelling optimal crop sequences using network flows. Agricultural Systems, 2007. 94(2): p. 566-572. 17. Costa, A.M., L.M.R. dos Santos, D.J. Alem, and R.H.S. Santos, Sustainable vegetable crop supply problem with perishable stocks. Annals of Operations Research, 2011. 219: p. 265-283. 18. 高德錚, 臺灣發展蔬菜植物工廠之契機. 2010. 19. 黃信傑, 植物工廠多作物排程之研究, 國立台灣科技大學碩博士論文. 2012. 20. dos Santos, L.M.R., A.M. Costa, M.N. Arenales, and R.H.S. Santos, Sustainable vegetable crop supply problem. European Journal of Operational Research, 2010. 204(3): p. 639-647. 21. Ferrer, J.-C., A. Mac Cawley, S. Maturana, S. Toloza, and J. Vera, An optimization approach for scheduling wine grape harvest operations. International Journal of Production Economics, 2008. 112(2): p. 985-999. 22. Könnyű, N. and S.F. Tóth, A cutting plane method for solving harvest scheduling models with area restrictions. European Journal of Operational Research, 2013. 228(1): p. 236-248. 23. Range, T.M., R.M. Lusby, and J. Larsen, A column generation approach for solving the patient admission scheduling problem. European Journal of Operational Research, 2014. 235(1): p. 252-264. 24. Alfandari, L., J. Sadki, A. Plateau, and A. Nagih, Hybrid column generation for large-size Covering Integer Programs: Application to transportation planning. Computers & Operations Research, 2013. 40(8): p. 1938-1946. 25. 洪崇元, 混合式生產策略下之供應鏈存貨模式, 中原大學碩博士論文. 2003. 26. 張明毅, 精緻農業－植物工廠的經營. 2012. 27. 楊曉芳, 羅信沂LED照出冰花奇蹟. 2013. 28. Kantorovich, L.V., Mathematical methods of organizing and planning production. Management Science, 1960. 6(4): p. 366-422. 29. Biswas, A. and B.B. Pal, Application of fuzzy goal programming technique to land use planning in agricultural system. Omega, 2005. 33(5): p. 391-398. 30. Haneveld, W.K.K. and A.W. Stegeman, Crop succession requirements in agricultural production planning. European Journal of Operational Research, 2005. 166(2): p. 406-429. 31. Bohle, C., S. Maturana, and J. Vera, A robust optimization approach to wine grape harvesting scheduling. European Journal of Operational Research, 2010. 200(1): p. 245-252. 32. Pochet, Y. and F. Warichet, A tighter continuous time formulation for the cyclic scheduling of a mixed plant. Computers & Chemical Engineering, 2008. 32(11): p. 2723-2744. 33. Hartmann, S., A competitive genetic algorithm for resource‐constrained project scheduling. Naval Research Logistics (NRL), 1998. 45(7): p. 733-750. 34. Hu, M.-C., Y.-H. Chen, and L.-C. Huang, A sustainable vegetable supply chain using plant factories in Taiwanese markets: A Nash–Cournot model. International Journal of Production Economics, 2014. 152: p. 49-56. 35. Hari, Y., Multiple-Crop Scheduling for Plant Factory. National Taiwan University of Science and Technology, 2012. 36. Govindakrishnan, P.M., S. Rawat, S.K. Pandey, J.P. Singh, S.S. Lal, and V.K. Dua, Computer Aided Advisory System for Potato Crop Scheduling (Caasps) - a Decision Support Tool for Potato Planting Strategies. International Journal of Agricultural and Statistical Sciences, 2011. 7(2): p. 571-577. 37. Salassi, M.E., M.A. Deliberto, and K.M. Guidry, Economically optimal crop sequences using risk-adjusted network flows: Modeling cotton crop rotations in the southeastern United States. Agricultural Systems, 2013. 118: p. 33-40. 38. Rădulescu, M., C.Z. Rădulescu, and G. Zbăganu, A portfolio theory approach to crop planning under environmental constraints. Annals of Operations Research, 2011. 219(1): p. 243-264. 39. Liao, D.-Y. and Y.-T. Yang, Imaging Order Scheduling of an Earth Observation Satellite. Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on, 2007. 37(5): p. 794-802. 40. Borodin, V., J. Bourtembourg, F. Hnaien, and N. Labadie, A quality risk management problem: case of annual crop harvest scheduling. International Journal of Production Research, 2014. 52(9): p. 2682-2695. 41. Alfandari, L., J. Lemalade, A. Nagih, and G. Plateau, A MIP flow model for crop-rotation planning in a context of forest sustainable development. 2011. 42. Santos, L.M.R., P. Munari, A.M. Costa, and R.H.S. Santos, A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes. European Journal of Operational Research, 2015. 245(2): p. 581-590. 43. Alfandari, L., J.L. Lemalade, A. Nagih, and G. Plateau, A MIP flow model for crop-rotation planning in a context of forest sustainable development. Annals of Operations Research, 2009. 190(1): p. 149-164. 44. Gliessman, S.R., Agroecology: Ecological Processes in Sustainable Agriculture. 2000. 45. Tillman, D., K.G. Cassman, P.A. Matson, R. Naylor, and S. Polask, Agricultural sustainability and intensive production practices. 2002. 46. dos Santos, L.M.R., P. Michelon, M.N. Arenales, and R.H.S. Santos, Crop rotation scheduling with adjacency constraints. Annals of Operations Research, 2008. 190(1): p. 165-180. 47. Luh, P.B. and D.J. Hoitomt, Scheduling of Manufacturing Systems Using the Lagrangian Relaxation Technique. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1993. 48. Zhao, X., P.B. Luh, and J. Wang, Surrogate Gradient Algorithm for Lagrangian Relaxation. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1999. 49. 盧華安, 因應班機延遲之最佳化即時機門指派, 交通部運輸研究所. 2001. 50. Bragin, M.A., P.B. Luh, J.H. Yan, N. Yu, and G.A. Stern, Convergence of the Surrogate Lagrangian Relaxation Method. Journal of Optimization Theory and Applications, 2014. 164(1): p. 173-201. 51. Fisher, M.L., The Lagrangian Relaxation Method for Solving Integer Programming Problems. Management Science, 2004. 50(12_supplement): p. 1861-1871. 52. 郭逸銘, 考量區域涵蓋限制之運輸計劃選擇問題, 國立交通大學碩博士論文. 2012. 53. K.Lin, C., J.Y. Wang, and A.S. Wang, 台灣地區汽車客運多場站車輛排程問題之研究, 交通部運輸研究所. 2009. 54. Gualandi, S. and F. Malucelli, Constraint programming-based column generation. 4or-a Quarterly Journal of Operations Research, 2009. 7(2): p. 113-137. 55. 葉珮婷, 應用變數產生法求解有時間窗限制的收送貨問題, 國立交通大學碩博士論文. 2008. 56. 鄒筱薇, 數量受限制之多尺寸材料切割問題, 國立成功大學碩博士論文. 2010. 57. Wolosewicz, C., S. Dauzère-Pérès, and R. Aggoune, A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem. European Journal of Operational Research, 2015. 244(1): p. 3-12. 58. Fu, Y.-M. and A. Diabat, A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem. Applied Mathematical Modelling, 2015. 39(3-4): p. 1194-1201. 59. 古宇翔, 台鐵列車服務計畫之研究, 國立成功大學碩博士論文. 2012. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/49581 | - |
| dc.description.abstract | 植物工廠（Plant Factory）產業為一新型作物耕種模式，透過自動控制系統對耕種環境，如溫度、濕度、光源、水分及營養物的自動管控，達到提升作物品質及增加產量等目標。植物工廠相較於傳統農業營運成本高出許多。一般來說，作物之體積會隨時間而增長，然而廠區內的栽培室空間是有限的，故如何有效利用空間即為相當重要的議題；此外，植物工廠所種植之作物許多皆具可多期收成及異質環境產量差異等特性，若能有效考量這些特性，將可以使植物工廠之種植排程規劃更有效率，以彌補成本過高的劣勢。
本研究之探討目標為植物工廠的排程問題，藉由參考傳統農地耕種規劃之線性規劃模型，提出一個整數規劃模型以描述完全人工控制型植物工廠之可多期收成作物耕種決策，並在遵循植物生長之特性之限制下，以總收入最大化為目標求解排程規劃。本研究使用IBM ILOG CPLEX套件求算最佳解，然而，隨著問題以及規劃期數的增加，欲求解之問題以及所需之求解時間將快速成長，使得求解效率不彰。本研究將應用啟發式演算法（LRBPFA）對此模型進行求解，以期在有限的時間內有效求得品質不錯的解。在此演算法之實證研究時，本研究將三個因子分別設定不同之水準，包括(1)作物種類、(2)規劃期數以及(3)栽培室間數等，且由數值分析可看出本研究應用之拉氏鬆弛法在較大之問題規模時仍能保持不錯的求解品質。如此一來，本研究可根據此解得一最適作物排程規劃策略，以做為植物工廠產業做決策時的考量依據，讓有限資源得到更充分的運用。 | zh_TW |
| dc.description.abstract | Plant factory is an environmental controlled facility which can sustain the stable crop cultivation with fast production and better quality by setting temperature, humidity, lighting, nutrient supply and other cultivating factors. In this study, we focus on the crop-scheduling problem for a plant factory and consider the special property of crops which can be harvested multiple times. This scheduling problem is formulated as a mixed integer programming (MIP) problem. The objective function is defined as to find the maximum revenue for the plant factory under the consider of different practical condition including types of crops, cultivation room number, cultivation room space, heterogeneous harvesting amount among different environment of cultivation room and multiple harvesting period. This study develops a heuristic algorithm method (Lagrangian relaxation method) to solve problem in a large scale for searching a good solution in an effective way. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-15T11:35:55Z (GMT). No. of bitstreams: 1 ntu-105-R03546050-1.pdf: 1984497 bytes, checksum: ca96368518bced7a0b87c2cb241973bb (MD5) Previous issue date: 2016 | en |
| dc.description.tableofcontents | 目錄
口試委員會審定書 i 致謝 ii 中文摘要 iii ABSTRACT iv 圖目錄 vii 表目錄 viii 第一章 緒論 1 1.1 植物工廠 1 1.2 植物工廠適合之作物 2 1.3 植物之特性 2 1.4 研究背景與動機 5 1.5 研究目的與方法 6 第二章 文獻探討 7 2.1 計畫性生產 7 2.2 農業規劃與耕地排程 8 2.3 永續蔬菜作物供應問題 10 2.4 整數規劃求解算法 12 2.5.1 拉氏鬆弛法 12 2.5.2 變數產生法 13 第三章 問題描述與模型 15 3.1 問題描述 15 3.2 問題基本假設與限制 16 3.3 數學整數規劃模型 17 第四章 啟發式演算法 29 4.1 LRBPFA求解流程 30 4.2 LRBPFA演算範例 35 第五章 數值分析 44 5.1 情境說明以及參數設定 44 5.1.1 農作物生長資訊 44 5.1.2 植物工廠環境之設定 45 5.1.3 作物價格資訊 46 5.1.4 執行環境 46 5.1.5 實驗設計 46 5.2 實驗結果與說明 48 第六章 結論 53 6.1 研究總結 53 6.2 未來展望 54 參考文獻 55 附錄一、 農產品交易價格表 59 | |
| dc.language.iso | zh-TW | |
| dc.subject | 混合整數規劃 | zh_TW |
| dc.subject | 農作物排程 | zh_TW |
| dc.subject | 植物工廠 | zh_TW |
| dc.subject | 啟發式演算法 | zh_TW |
| dc.subject | 拉氏鬆弛法 | zh_TW |
| dc.subject | mixed integer programming | en |
| dc.subject | crop scheduling problem | en |
| dc.subject | Lagrangian relaxation method | en |
| dc.subject | plant factory | en |
| dc.subject | heuristic algorithm method | en |
| dc.title | 考量栽種具多期採收特性作物之植物工廠排程研究 | zh_TW |
| dc.title | A Scheduling Research in Plant Factory with Considering Multi-Period Harvest | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 104-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 余峻瑜(Jiun-Yu Yu),楊朝龍(Chao-Lung Yang) | |
| dc.subject.keyword | 植物工廠,農作物排程,混合整數規劃,啟發式演算法,拉氏鬆弛法, | zh_TW |
| dc.subject.keyword | plant factory,crop scheduling problem,mixed integer programming,heuristic algorithm method,Lagrangian relaxation method, | en |
| dc.relation.page | 59 | |
| dc.identifier.doi | 10.6342/NTU201602750 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2016-08-16 | |
| dc.contributor.author-college | 工學院 | zh_TW |
| dc.contributor.author-dept | 工業工程學研究所 | zh_TW |
| 顯示於系所單位： | 工業工程學研究所 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-105-1.pdf 未授權公開取用 | 1.94 MB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。