Solid Waste Collection Routing Optimization using Hybridized Modified Discrete Firefly Algorithm and Simulated Annealing - A Case Study in Davao City, Philippines

Cinmayii Manliguez, Princess Cuabo, Ritchie Mae Gamot, Kim Dianne Ligue

Abstract

Modified Discrete Firefly - Simulated Annealing (MDF-SA) Algorithm was used to solve travelling salesman problem (TSP) using the tanh function for discretization. MDF-SA was tested on four (4) data instances from TSPLIB and the Davao City solid waste collection routing system. The objective of this study is to evaluate and compare MDF-SA with MDFA in terms of running time and solution quality. The data set selected from the TSPLIB are ST70, PR152, GR431, and TS225. The Davao City solid waste collection routing system is used in the hopes of finding a better solution from the current. Results show that MDF-SA and MDFA perform almost equally well on the data sets PR152 and GR43. MDFA performs better on using the TS225 data set, but MDF-SA performs much better on ST70. In general, the hybrid algorithm has produced better route system quality of the Davao City solid waste collection than the MDFA.

References

  1. Agha, S.R. 2006. Optimizing Routing of Municipal Solid. 6 September 2012.
  2. Awad, A.R., M.T. Aboul-Ela and R. Abu-Hassan. 2001. Development of a Simplified Procedure for Routing Solid Waste Collection. Scientia Iranica Publication. 6 September 2012. <http://www.scientiairanica.com/ PDF/ Articles/00000409/SI080109.pdf>.
  3. Belien, J., Boeck, L. D., and J. V. Ackere. 2011. Municipal Solid Waste Collection Problems:A Literature Review. Hub Research Papers.
  4. Bookstaber, D. 1997. Simulated Annealing for Traveling Salesman Problem. 11 September 2011. <http:// www.eit.1th.se/fileadmin/eit/courses/ets061/Material/2 012/SATSP.pdf>.
  5. Caliper Corporation. 2008. Automated Routing for Solid Waste Collection Software. 6 September 2012. <http://www.caliper.com/Press/pr990722.htm>.
  6. Carillo, C. A. 2016, February 15. Waste managementcompliant Davao City struggles with garbage segregation. Business World Online. Retrieved December 15, 2016, from http://www.bworldonline .com/content. php?section=Nation&title=wastemanagement-compliant-davao-city-struggles-withgarbage-segregation& id=123051
  7. City of Davao. 2011a. Davao City - Geographical Location. 11 September 2012. <http://www.davaocity.gov.ph/ davao/ profile.aspx?id=location>.
  8. City of Davao. 2011b. Demography - Environment. 2011. 11 September 2012. <http://www.davaocity.gov.ph/ davao/ demoenv.aspx>.
  9. Dantzig, G., R. Fulkerson, and S. Johnson. 1954. Solution of a large-scale traveling-salesman problem. Journal of the Operations Research Society of America. 2.4:393- 410.
  10. Dasgupta, S., C.H. Papadimitriou and U.V. Vazirani. 2006. Chapter 8: NP-complete Problems. 7 September 2012. <http://www.cs.berkeley.edu/vazirani/algorithms/cha p8.pdf>.
  11. Goossaert, E. 2010. Simulated annealing applied to the traveling salesman problem. 10 September 2010. <http://codecapsule.com/2010/04/06/simulatedannealing-traveling-salesman/>.
  12. Goyal, S. 2010. A Survey on Travelling Salesman Problem. 11 September 2012 <http://www.cs.uwec.edu/MICS/ papers/mics2010_submission_51.pdf>.
  13. Grom A. 2010. What is an NP-complete problem? 7 September 2012. <http://stackoverflow.com/questions/210829/ what-isan-np-complete-problem>.
  14. Hamdar, A. 2008. Simulated Annealing - Solving the Travelling Salesman Problem (TSP). 7 September 2012. <http://www.codeproject.com/Articles/26758/Simulat ed-Annealing-Solving-the-Travelling-Salesma>.
  15. Held M. and R. M. Karp. 1970. The traveling salesman problem and minimum spanning trees. Operations Research. 18.6:1132-1162.
  16. Jensen, F. R. 2010. Using the Traveling Salesman Problem in Bioinformatic Algorithms. 7 September 2012. <http://www.daimi.au.dk/cstorm/students/Rosenbech Jensen_Dec2010.pdf>.
  17. Kann, V. 2000. NPO Problems: Definitions and Preliminaries. 7 September 2012. <http://www.nada .kth.s/viggo/ wwwcompendium/node2.html>.
  18. Karadimas N.V., Papatzelou K., and V.G. Loumos. 2007. Genetic Algorithms for Municipal Solid Waste Collection and Routing Optimization. In: Boukis C., Pnevmatikakis A., Polymenakos L. (eds) Artificial Intelligence and Innovations 2007: from Theory to Applications. AIAI 2007. IFIP The International Federation for Information Processing, vol 247. Springer, Boston, MA.
  19. Kirkpatrick S., C.D. Gelatt Jr., and M.P. Vecchi. 1983. Optimization by simulated annealing. Science. 220.4598:671-680.
  20. Lee, J. 2011. Issues in designing hybrid algorithms. 7 August 2012. <http://arxiv.org/pdf/1111.2609v1.pdf>.
  21. Letchford, A. N. 2010. The Traveling Salesman Problem. 11 September 2011. <http://www.lancs.ac.uk/staff/ letchfoa/talks/TSP.pdf>.
  22. Lin, S. 1965. Computer Solutions of the Traveling Salesman Problem. 7 September 2012. <http://www.alcatel-lucent.com/bstj/vol44- 1965/articles/bstj44-10-2245.pdf>.
  23. Little, J.D.C., K. G. Murty, D. W. Sweeney, and C. Karel. 1963. An algorithm for the traveling salesman problem. Operations Research. 11.6:972-989.
  24. Luke, S. 2009. Essentials of Metaheuristics. Version 1.3. 7 August 2012. <http://cs.gu.edu/sean/book/ metaheuristics/Essentials.pdf>.
  25. Pabrua, L. D. B. 2011. Modified Discrete Firefly Algorithm With Mutation Operations as Local Search For Makespan Minimization of the Permutation Flowshop Scheduling Problem.
  26. Padberg, W. Manfred, and G. Rinaldi. 1987. Optimization of a 532-city symmetric traveling salesman problem by branch and cut. Operations Research Letters. 6.1:1-7.
  27. Pearl, J. 1983. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addision-Wesley, Michigan.
  28. Philippine Statistics Authority (PSA). 2015. Population of Region XI - Davao (Based on the 2015 Census of Population). Retrieved December 15, 2016, from https://psa.gov.ph/content/population-region-xi-davaobased-2015-census-population
  29. Poort, E.S.V.D. 1997. Aspects of Sensitivity Analysis for the Traveling Salesman Problem. 6 September 2012. <http://irs.ub.rug.nl/ppn/163665907>.
  30. Reinelt, G. 1994. The traveling salesman: computational solutions for TSP applications. Springer-Verlag, Berlin.
  31. Ruiz-Vanoye, J. A., Pérez-Ortega, J., R., R. A., Díaz-Parra, O., Frausto-Solís, J., Fraire-Huacuja, H. J. et al. 2011. Survey of Polynomial Transformations between NPComplete problems. Journal of Computational and Applied Mathematics, 235(16), 4851-4865.
  32. Sayadi, M., R. Ramezanian, and N. Ghaffari-Nasab. 2010. A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems. International Journal of Industrial Engineering Computations. 1.1:1-10.
  33. von Poser, I., M.K. Ingenierurtechnik and A.R.D. Awad. 2006. Optimal Routing for Solid Waste Collection in Cities by using Real Genetic Algorithm version 1. 6 September 2012.
  34. Wright, M. 2010. Automating Parameter Choice for Simulated Annealing. 5 August 2012. <http://www .research. lancs.ac.uk/portal/services/ downloadRegister/610492/Document.pdf>.
  35. Yang, X. 2010. Nature-inspired metaheuristic algorithms. Luniver press, United Kingdom.
  36. Zarei, B. and M.R. Meybodi. 2002. A Hybrid Method for Solving Traveling Salesman Problem. 7 September 2012. <http://ceit.aut.ac.ir/meybodi/paper/Zare-ConfPaper.pdf>.
Download


Paper Citation


in Harvard Style

Manliguez C., Cuabo P., Gamot R. and Ligue K. (2017). Solid Waste Collection Routing Optimization using Hybridized Modified Discrete Firefly Algorithm and Simulated Annealing - A Case Study in Davao City, Philippines . In Proceedings of the 3rd International Conference on Geographical Information Systems Theory, Applications and Management - Volume 1: GISTAM, ISBN 978-989-758-252-3, pages 50-61. DOI: 10.5220/0006322500500061


in Bibtex Style

@conference{gistam17,
author={Cinmayii Manliguez and Princess Cuabo and Ritchie Mae Gamot and Kim Diane Ligue},
title={Solid Waste Collection Routing Optimization using Hybridized Modified Discrete Firefly Algorithm and Simulated Annealing - A Case Study in Davao City, Philippines},
booktitle={Proceedings of the 3rd International Conference on Geographical Information Systems Theory, Applications and Management - Volume 1: GISTAM,},
year={2017},
pages={50-61},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006322500500061},
isbn={978-989-758-252-3},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Geographical Information Systems Theory, Applications and Management - Volume 1: GISTAM,
TI - Solid Waste Collection Routing Optimization using Hybridized Modified Discrete Firefly Algorithm and Simulated Annealing - A Case Study in Davao City, Philippines
SN - 978-989-758-252-3
AU - Manliguez C.
AU - Cuabo P.
AU - Gamot R.
AU - Ligue K.
PY - 2017
SP - 50
EP - 61
DO - 10.5220/0006322500500061