Finding An Alternative Routing For Solid Waste Management
Finding the shortest route for transferring solid waste is one of the biggest challenges for every solid waste management organization. Globally, waste collection process represents 74% of operating costs, yet it has been given minor attention. In this research, Dijkstra Algorithm and Travelling Sal...
Saved in:
Main Author: | Manoharam, Gaeithry |
---|---|
Format: | Thesis |
Language: | English |
Published: |
Pusat Pengajian Sains Matematik
2020
|
Subjects: | |
Online Access: | http://eprints.usm.my/52557/1/Pages%20from%20Full%20thesis%20after.pdf http://eprints.usm.my/52557/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Capacitated arc routing problem with time window in solid waste operation
by: Ismail, Zuhaimy, et al.
Published: (2008) -
Using graph algorithm and classification technique for finding an optimal bus route in time-dependent travel times
by: Deelertmongkolchai, Satjayod, et al.
Published: (2016) -
Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks
by: Ghathwan, Khalil Ibrahim
Published: (2016) -
Sustainable decision-making model for municipal solid-waste management: bifuzzy approach
by: Termudi, Zamali, et al.
Published: (2012) -
Metaheuristics for the waste collection vehicle
routing problem with time windows
by: Benjamin, Aida Mauziah, et al.
Published: (2010)