Abstract
Waste companies need to reduce the cost of collection of the municipal waste, to increase the separation rate of different types of waste, or site of waste source. The collection of waste is an important logistic activity within any city. In this paper, we mainly focus on the daily commercial waste collection problem. One of the approaches for how to resolve this problem is to use optimization algorithms. Ant colony optimisation metaheuristic algorithm (ACO) was used to solve the problem in this paper. This algorithm was adapted for a real data set (Waste Collection). The aim of this paper is to adapt the ACO algorithm and run it on HPC infrastructure to resolve the waste collection problem. We used High-End Application Execution Middleware (HEAppE), that provides smart access to the supercomputing infrastructure (in our case Salomon cluster operated by IT4Innovations National Supercomputing Centre in the Czech Republic). The results showed that the paralelisation of the algorithm is beneficial and brings together with the supercomputing power the possibility to solve larger problems of this type.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
HEAppE middleware: http://heappe.eu.
- 2.
Mono platform: https://www.mono-project.com/.
References
Ministry of the Environment of the Czech Republic (2017). https://www.mzp.cz/cz/news/. Accessed 17 Oct
Kulcar, T.: Optimizing solid waste collection in Brussels. Eur. J. Oper. Res. 90(1), 71–77 (1996)
Tung, V.D., Pinnoi, A.: Vehicle routing-scheduling for waste collection in Hanoi. Eur. J. Oper. Res. 125(3), 449–468 (2000)
Faccio, M., Persona, A., Zanin, G.: Waste collection multi objective model with real time traceability data. Waste Manag. 31(12), 2391–2405 (2011)
Bautista, J., Pereira, J.: Modeling the problem of locating collection areas for urban waste management. An application to the metropolitan area of Barcelona. Omega 34(6), 617–629 (2006)
Son, L.H.: Optimizing Municipal Solid Waste collection using Chaotic Particle Swarm Optimization in GIS based environments: a case study at Danang city. Expert. Syst. Appl. 41(18), 8062–8074 (2014)
Dantzig, G., Ramser, R.: The truck dispatching problem. Manag. Sci. 6, 80–91 (1959)
Kuan, M.K.: Graphic programming using odd or even points. Chin. Math., 237–277 (1962)
Corbern, Á., Laporte, G.: Arc Routing Problem, Methods and Applications. MOS-SIAM Series on Optimization. SIAM, Philadelphia (2014)
Buhrkal, K., Larsen, A., Popke, S.: The waste collection vehicle routing problem with time windows in a city logistics context. Procedia Soc. Behav. Sci. 39, 241254 (2012)
Kim, B.-I., Kim, S., Sahoo, S.: Waste collection vehicle routing problem with time windows. J. Comput. Oper. Res. 33(12), 3624–3642 (2006)
Wy, J., Kinm, B.-I., Kim, S., Sahoo, S.: Rollon-rolloff vehicle routing problem in the waste collection industry. In: The 11th Asia Pacific Industrial Engineering and Management Systems Conference, Melaka (2010)
Ombuki-Berman, B.M., Runka, A., Hanshar, F.T.: Waste collection vehicle routing problem with time windows using multi-objective genetic algorithms. In: Andonie, B.R. (ed.) Presented at Computational Intelligence, Proceedings of Computational Intelligence, Calgary, Canada, pp. 91–97. Acta Press (2007)
Benjamin, A.M., Beasley, J.E.: Meta heuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities. Comput. Oper. Res. 37, 2270–2280 (2010)
Islam, R., Rahman, M.: An ant colony optimization algorithm for waste collection vehicle routing with time windows, driver rest period and multiple disposal facilities. In: Conference: Informatics, Electronics and Vision (ICIEV) (2012)
Liu, J., He, Y.: Ant Colony Algorithm for waste collection vehicle arc routing with turn constraints. IEEE (2013)
Ismail, Z., Loh, S.L.: Ant colony optimization for solving solid waste collection scheduling problem. J. Math. Stat. 5(3), 199–205 (2009)
Bautista, J., Pereira, J.: Ant algorithms for urban waste collection routing. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 302–309. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-28646-2_28
Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: an autocatalytic optimizing process. Technical report, 91–016 (1991)
Colorni, A., Dorigo, M., Maniezzo, V.: Distributed optimization by ant colonies. In: Toward a Practice of Autonomous Systems: Proceedings of the First European Conference on Artificial Life, p. 134. MIT Press (1992)
Vargovský, J.: Ant Colony Optimization algorithm for vehicle routing problem (2017). http://hdl.handle.net/10084/118964
Hanzelka, J., Dvorský, J.: Flexible neural trees—parallel learning on HPC. In: Chaki, R., Saeed, K., Cortesi, A., Chaki, N. (eds.) Advanced Computing and Systems for Security. AISC, vol. 568, pp. 67–77. Springer, Singapore (2017). https://doi.org/10.1007/978-981-10-3391-9_4
Cima, V., et al.: HyperLoom: a platform for defining and executing scientific pipelines in distributed environments. In: Proceedings of the 9th Workshop and 7th Workshop on Parallel Programming and RunTime Management Techniques for Manycore Architectures and Design Tools and Architectures for Multicore Embedded Computing Platforms, pp. 1–6 (2018)
Abouelfarag, A.A., Aly, W.M., Elbialy, A.G.: Performance analysis and tuning for parallelization of ant colony optimization by using OpenMP. In: Saeed, K., Homenda, W. (eds.) CISIM 2015. LNCS, vol. 9339, pp. 73–85. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-24369-6_6
Zhou, Y., He, F., Hou, N., Qiu, Y.: Parallel ant colony optimization on multi-core SIMD CPUs. Futur. Gener. Comput. Syst. 79(2), 473–487 (2018)
Acknowledgments
This work was supported by The Ministry of Education, Youth and Sports from the National Programme of Sustainability (NPS II) project ‘IT4Innovations excellence in science - LQ1602’ and by the IT4Innovations infrastructure which is supported from the Large Infrastructures for Research, Experimental Development and Innovations project ‘IT4Innovations National Supercomputing Center LM2015070’, partially supported by the SGS grant No. SP2018/173 ‘Dynamic Systems Problems and their Implementation on HPC’, VŠB - Technical University of Ostrava, Czech Republic.This work was partially supported by the TAČR GAMA PP1 No. G PP1 20 ‘Raising the Waste Recycling Rate with Lowering the Costs of Waste Collection’, VŠB - Technical University of Ostrava, Czech Republic.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Grakova, E., Slaninová, K., Martinovič, J., Křenek, J., Hanzelka, J., Svatoň, V. (2018). Waste Collection Vehicle Routing Problem on HPC Infrastructure. In: Saeed, K., Homenda, W. (eds) Computer Information Systems and Industrial Management. CISIM 2018. Lecture Notes in Computer Science(), vol 11127. Springer, Cham. https://doi.org/10.1007/978-3-319-99954-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-99954-8_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-99953-1
Online ISBN: 978-3-319-99954-8
eBook Packages: Computer ScienceComputer Science (R0)