English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 46833/50693 (92%)
造訪人次 : 11846075      線上人數 : 418
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    主頁登入上傳說明關於CCUR管理 到手機版


    請使用永久網址來引用或連結此文件: https://irlib.pccu.edu.tw/handle/987654321/30608


    題名: The Study of Using Big Data to Solve Medical Volunteer Problem
    作者: Liu, Chung-Hsin
    Trung, Le Le
    貢獻者: Dept Comp Sci & Informat Engn
    關鍵詞: Transport problem
    Linear programming
    Medical volunteer problem (MVP)
    日期: 2015-05
    上傳時間: 2015-10-23 14:16:20 (UTC+8)
    摘要: Every year, on the world there are many people that can not afford to treat diseases or they have intractable diseases. Then, it appears some organizations for medical volunteers. They will travel the globe to provide health care and health education to thousands of children, women and families every year. Sacrificing time away from their families, hard-earned vacation days and even their own funds, volunteers selflessly give their expertise, health care, to the people who need it most. The main purpose of this paper is the study of using Big data to solve Medical volunteer problem (MVP) so that all hospitals are treated diseases and total travel costs are minimal. This paper introduces six methods can be used to solve MVP is (1) Northwest corner method (2) Minimum cost method (3) Vogel's approximation method (4) Row minimum Method (5) Column minimum Method (6) Russell's approximation method. After reviewing the main literature in this area, Mathematical model of the MVP, Big data, this paper presents some examples is solved by six methods. This paper introduces some methods to improve the results from the methods that gave suboptimal results. Those methods are (I) Stepping stone method (2) Modified distribution method. Finally, the paper compares different situation of the examples and propose a comparison table to know which methods in different situation is the best. In six methods, the table shows that most results of Vogel's approximation method and Russell's approximation method give optimal results. In six methods, they are accepted to be the best methods; Minimum cost method, Row minimum method and Column minimum method are second methods and finally Northwest corner method gives an initial solution very far from the optimal solutions.
    關聯: JOURNAL OF INTERNET TECHNOLOGY 卷: 16 期: 3 頁碼: 415-430
    顯示於類別:[資訊工程學系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML432檢視/開啟


    在CCUR中所有的資料項目都受到原著作權保護.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋