Skip to content
Advances in Decision Sciences (ADS)

Advances in Decision Sciences (ADS)

Published by Asia University, Taiwan; Scientific and Business World

  • About This Journal
    • Aim and Scope
    • Abstracting and Indexing
    • Editorial Board
    • Editorial Workflow
    • Publication Ethics
    • Paper Submission
    • Manuscript Format
    • Manuscript FAQ
    • Subscription Information
  • Editors Menu
    • Editors’ Roles and Responsibilities
    • Handling a Manuscript
    • Peer Review at ADS@AU
    • English Editing
  • Special Issues
    • About Special Issues
    • Editorial Board Special Issues
    • Preparing a Call for Papers
    • Promoting a Call for Papers
    • Special Invitation
    • Special Issues FAQ
    • Published Special Issues
  • Table of Contents
    • Table of Contents for Year 2024
    • Table of Contents for Year 2023
    • Table of Contents for Year 2022
    • Table of Contents for Year 2021
    • Table of Contents for Year 2020
    • Table of Contents for Year 2019
    • Table of Contents for Year 2018
    • Archive Contents for Year 1997 to 2017
      • Table of Contents for Year 2017
      • Table of Contents for Year 2016
      • Table of Contents for Year 2015
      • Table of Contents for Year 2014
      • Table of Contents for Year 2013
      • Table of Contents for Year 2012
      • Table of Contents for Year 2011
      • Table of Contents for Year 2010
      • Table of Contents for Year 2009
      • Table of Contents for Year 2008
      • Table of Contents for Year 2007
      • Table of Contents for Year 2006
      • Table of Contents for Year 2005
      • Table of Contents for Year 2004
      • Table of Contents for Year 2003
      • Table of Contents for Year 2002
      • Table of Contents for Year 2001
      • Table of Contents for Year 2000
      • Table of Contents for Year 1999
      • Table of Contents for Year 1998
      • Table of Contents for Year 1997
  • Contact Us
  • Home

Graph Theory and Environmental Algorithmic Solutions to Assign Vehicles Application to Garbage Collection in Vietnam

Graph Theory and Environmental Algorithmic Solutions to Assign Vehicles Application to Garbage Collection in Vietnam

Title

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

Authors

  • 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)
  • Van-Buol Nguyen
    (General Faculty, Binh Duong Economics & Technology University, Binh Duong City, Vietnam)
  • Bui Anh Tuan
    (Department of Mathematics Education, Teachers College, Can Tho University, Vietnam)
  • Wing-Keung Wong
    (Department of Finance, Fintech Center, Big Data Research Center, Asia University, Taiwan)

Abstract

The problem of finding the shortest path including garbage collection is one of the mostimportant 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

Classification-JEL

A11, G02, G30, O35

Pages

1-35

https://doi.org/10.47654/v23y2019i3p1-35

Post navigation

Previous PostGraph Theory and Environmental Algorithmic Solutions to Assign Vehicles Application to Garbage Collection in Vietnam

Submit Paper

Register / Submit




Special Issue Information

About Special Issues

Categories

ISSN 2090-3359 (Print)
ISSN 2090-3367 (Online)

Asia University, Taiwan

Scientific and Business World

4.7
2023CiteScore
 
86th percentile
Powered by  Scopus
SCImago Journal & Country Rank
Q2 in Scopus
CiteScore 2023 = 4.7
CiteScoreTracker 2024 = 8.5
SNIP 2023 = 0.799
SJR Quartile = Q1
SJR 2024 = 0.814
H-Index = 20

Flag Counter
Since July 28, 2021

Powered by Headline WordPress Theme
Go to mobile version