EconPapers    
Economics at your fingertips  
 

GRAPH THEORY AND ENVIRONMENTAL ALGORITHMIC SOLUTIONS TO ASSIGN VEHICLES APPLICATION TO GARBAGE COLLECTION IN VIETNAM

Buu-Chau Truong, Kim-Hung Pho, Nguyen Van-Buol, Bui Anh Tuan and Wing-Keung Wong ()
Additional contact information
Buu-Chau Truong: Faculty of Mathematics and Statistics, Ton Duc Thang University, Ho Chi Minh City, Vietnam
Kim-Hung Pho: Fractional Calculus, Optimization and Algebra Research Group, Faculty of Mathematics and Statistics, Ton Duc Thang University, Ho Chi Minh City, Vietnam
Nguyen Van-Buol: General Faculty, Binh Duong Economics & Technology University, Binh Duong City, Vietnam
Bui Anh Tuan: Department of Mathematics Education, Teachers College, Can Tho University, Vietnam

Advances in Decision Sciences, 2019, vol. 23, issue 3, 1-35

Abstract: The problem of finding the shortest path including garbage collection is one of the most important problems in environmental research and public health. Usually, the road map has been modeled by a connected undirected graph with the edge representing the path, the weight being the length of the road, and the vertex being the intersection of edges. Hence, the initial problem becomes a problem finding the shortest path on the simulated graph. Although the shortest path problem has been extensively researched and widely applied in miscellaneous disciplines all over the world and for many years, as far as we know, there is no study to apply graph theory to solve the shortest path problem and provide solution to the problem of "assigning vehicles to collect garbage" in Vietnam. Thus, to bridge the gap in the literature of environmental research and public health. We utilize three algorithms including Fleury, Floyd, and Greedy algorithms to analyze to the problem of "assigning vehicles to collect garbage" in District 5, Ho Chi Minh City, Vietnam. We then apply the approach to draw the road guide for the vehicle to run in District 5 of Ho Chi Minh city. To do so, we first draw a small part of the map and then draw the entire road map of District 5 in Ho Chi Minh city. The approach recommended in our paper is reliable and useful for managers in environmental research and public health to use our approach to get the optimal cost and travelling time.

Keywords: Fleury algorithm; Floyd algorithm; Greedy algorithm; shortest path (search for similar items in EconPapers)
JEL-codes: A11 G02 G30 O35 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed

Downloads: (external link)
http://journal.asia.edu.tw/ADS/wp-content/uploads/ ... ction-in-Vietnam.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:aag:wpaper:v:23:y:2019:i:3:p:1-35

Access Statistics for this article

More articles in Advances in Decision Sciences from Asia University, Taiwan Contact information at EDIRC.
Bibliographic data for series maintained by Vincent Pan ().

 
Page updated 2019-10-21
Handle: RePEc:aag:wpaper:v:23:y:2019:i:3:p:1-35