資料包絡分析於休閒農業資訊分享熱線的應用

Abstract

本論文主要的目的在解決休閒農業的三大挑戰。首先，地方政府必須呈送許多待處理的複雜文件至農委會以建立休閒農業發展計畫的方案。然而，如何建立一個有效率的處理文件傳遞方法是第一大挑戰。透過IDEF1X的技術，建立一個稱為以網路導向的電子文件處理系統的建設休閒農業資訊分享熱線（ELFISH）可以解決第一個問題。所有需要處理的電子文件資料都儲存於休閒農業資訊分享熱線的資料庫與資料倉儲之中。第二個挑戰為如何在短時間內將休閒農業資訊分享熱線專案完成。本文提出延伸階層轉換法來解決此問題。此方法先將休閒農業資訊分享熱線的建置工作流程以IDEF0圖表示；然後將IDEF0圖轉換為裴氏圖以達成模擬的目的；最後，利用計畫評核術（PERT）調整各項資源的分配使計畫能在時限內完成。如何評估不同休閒農業發展計畫的績效則是最後一項挑戰。利用資料包絡分析（DEA）解決績效評估問題。資料包絡分析所需要的資料由建設休閒農業資訊分享熱線取得，工程資訊由資料庫取得而統計資訊則由資料倉儲取得。到目前為止，休閒農業資訊分享熱線的建置已經解決長久以來困擾休閒農業相關人員的三大問題。

The goal of this thesis is to solve three challengeable problems in leisure farms. First many complicate documents from local governments to the council of agriculture will be processed for building a new leisure farm project. However, how to process the documents in an efficient way is always a challenge. Through IDEF1X techniques, an Internet-based electronic documents processing system entitled Established Leisure Farms Information Sharing Hotline (ELFISH) is constructed for solving this problem. All processed data of electronic documents are stored in the database and the data warehouse of the ELFISH. Second how to complete the ELFISH project within a short time is another challenge. An extended Hierarchy Transformation Method (HTM) is proposed to solve this problem. This new method is to represent the work flows of constructing the ELFISH using IDEF0 diagrams initially; then the IDEF0 diagrams are transformed into Petri nets for simulation purpose; finally Program Evaluation and Review Technique (PERT) is used to adjust resources for completing the project within the time limit. Third how to evaluate the performance among different leisure farm projects is the last challenge. Data Envelope Analysis (DEA) is used for solving this evaluation problem. The input data of DEA come from the ELFISH, particularly the engineering data from the database and statistic data from the data warehouse. So far as we know, the construction of the ELFISH has solved the three problems which trouble the people in leisure farms for a long time.