The Study of Using Big Data to Solve Medical Volunteer Problem

CCUR > College of Natural Science and Engineering > College of Engineering > Department of Computer Science and Information Engineering > journal articles > Item 987654321/30608

Please use this identifier to cite or link to this item: https://irlib.pccu.edu.tw/handle/987654321/30608

Title:	The Study of Using Big Data to Solve Medical Volunteer Problem
Authors:	Liu, Chung-Hsin Trung, Le Le
Contributors:	Dept Comp Sci & Informat Engn
Keywords:	Transport problem Linear programming Medical volunteer problem (MVP)
Date:	2015-05
Issue Date:	2015-10-23 14:16:20 (UTC+8)
Abstract:	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.
Relation:	JOURNAL OF INTERNET TECHNOLOGY 卷: 16 期: 3 頁碼: 415-430
Appears in Collections:	[Department of Computer Science and Information Engineering] journal articles

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	453	View/Open

View Licence

Loading...