The Shortest Road Algorithm Approach In Determining The Route Of Solid Waste Collection Vehicles: The Case Of Manisa 75. Yıl Neighborhood

Abstract

Many studies have been conducted in recent years to solve the Shortest Route Problem, and the solutions produced as a result of these studies are used in all aspects of everyday life. Package distribution of cargo companies, school services leaving students home, bank branches collecting money and forwarding it to the central bank, municipalities collecting wastes, and bread companies distributing bread to bakery markets, and similar transportation services in which vehicle routing is needed make use of these solutions. Some algorithms related to the Shortest Route Problem were examined in this article, and among these, the Dijkstra Algorithm was applied to a real example problem. In this example, 75. Yıl Neighborhood of Yunus Emre District of Manisa Province was modeled with the Graph Data Model, and the best road destination for solid waste collection vehicles was determined. Based on the results obtained, it was determined that the Dijkstra Algorithm identified the shortest route successfully.

Keywords

• shortest road,vehicle routing,shortest path algorithm,graph model

References

1. [1] Rohila K, Gouthami P, Priya M. Dijkstra’s shortest path algorithm. International Journal of Innovative Research in Computerand Communication Engineering 2014; 2(10): 6139-6144.
2. [2] Kalkancı Ç. The organization of emergency response teams fighting against winter conditions of natural disaster management. Istanbul University Institute of Science, PhD Thesis, 2014
3. [3] Bayzan Ş. Determination of vehicle routes by using the shortest road algorithms and simulation in the .net environment. Pamukkale University Institute of science, Master Thesis, 2005
4. [4] Desa A, Abd Kadir N, Yusooff F. Environmental awareness and education: A key approach to solid waste management (SWM) – A case study of a University in Malaysia. Waste Management - An Integrated Vision 2012; pp.101-111.
5. [5] Fazeli A, Bakhtar F, Jahanshaloo L, Che Sidik N, Esfandyari B A. Malaysia's stand on municipal solid waste conversion to energy: A review. Renewable and Sustainable Energy Reviews 2016; 58: 1007-1016
6. [6] Ma J, Hipel K. Exploring social dimensions of municipal solid waste management around the globe - A systematic literature review. Waste Management 2016; pp.1-10
7. [7] Norhafezah K, Nurfadzliana A. H, Megawati O. Simulation of municipal solid waste route optimization by Dijkstra’s algorithm. Journal of Fundamental and Applied Sciences 2017; ISSN 1112-9867.
8. [8] Çakır M.E, Yetiş A, Yeşilçınar M, Ulukavak M. Determination of the optimum routes and performing of the spatial distribution maps for solid waste using GIS: A case of study from Suruç (Şanlıurfa), BEU Journal of Science 2019; 8 (2), 595-603.

9. [9] Billa L, Pradhan B, Yakuup A. GIS routing and modelling of residential waste collection for operational management and cost optimization. Pertanika Journal Science & Technology 2014; 22(1): 193-211.
10. [10] Dijkstra E.W, A Note on two problems in connection with graphs. Numerische Mathematik 1959; 1(1): 269–271.
11. [11] Bellman E. On a routing problem. Appl.Math. 1958; Vol 16: 87–90
12. [12] Floyd R.W. Algorithm 97: Shortest Path. Communications of the ACM 1962; 5(6): p.345
13. [13] Johnson D. B. Efficient algorithms for shortest paths in sparse networks. Journal of the ACM 1977; 24(1)
14. [14] Martins E. D. Q. V, Dos Santos J. L. E. The labelling algorithm for the multiobjective shortest path problem. Technical Report, Departamento de Matematica, Universidade de Coimbra, Portugal 1999; 1-24
15. [15] Bhandari R. Optimal physical diversity algorithms and survivable networks, In Proceedings Second IEEE Symposium on Computer and Communications, 1997; pp. 433–441.
16. [16] Dreyfus S. An appraisal of some shortest path algorithms”, Operations Research 1969; 17(3): 395–412.
17. [17] Wook C, Ramakrishna R.S. A Genetic algorithm for shortest path routing problem and the sizing of populations, IEEE Transactions on Evolutionary Computation 2002; 6(6): 566-579.
18. [18] Singh G, Singh B, Rathi S, Haris S. Solid waste management using shortest path algorithm. International Journal of Engineering Science Invention Research & Development 2014; 1(2), e-ISSN: 2349-6185.
19. [19] Büke C.O, Erturaç M.K. Network analysis method investigation of Sakarya University Campus Esentepe and web-based report. Nature Sciences (NWSANS) 2016; 11(4): 14-25.
20. [20] Selim S. Modeling of hiking routes using the least cost path algorithm. Süleyman Demirel University Journal of Natural and Applied Sciences 2019; 23(2): 617-624.
21. [21] Gen M, Lin L. A New approach for shortest path routing problem by random key- based GA. Genetic and Evolutionary Computation Conference 2006; Vol 1 and 2 , 1411–1412.
22. [22] Tomis R, Martinovič J, Slaninová K, Rapant L, Vondrák I. Time-Dependent route planning for the highways in the Czech Republic. 14th Computer Information Systems and Industrial Management (CISIM), Sep 2015, Warsaw, Poland. pp.145-153.
23. [23] Cooke K.L, Halsey E. The shortest route through a network with time-dependent ınternodal transit times. Journal of Mathematical Analysis and Applications 1966; 14(3): 493–498.
24. [24] Cowen D.J, Jensen J.R, Hendrix C, Hodgson M, Schill S.R. A GIS assisted rail construction econometric model that incorporates LIDAR data. Photogrammetric Engineering and Remote Sensing 2000; 66(11): 1323-1328.
25. [25] Christofides N. Graph theory an algorithmic approach. Acadeınic Press, London, 1986
26. [26] http://www.manisa.gov.tr/yunusemre (16.01.2020)