Abstract
In this paper, a new Vehicle Routing Problem is studied. An unmanned aerial vehicle (UAV) is considered to handle the process of collecting hazardous waste from different sites. New constraints related to flying and weight capacities of the UAV are set. The goal is to collect the waste from the different sites within the shortest time. This paper includes four main contributions: (i) A proof of the strongly NP-hardness of the problem. (ii) A new linear program to optimally solve the problem for small-sized instances. (iii) An efficient 2-phase approach, called Maximum Waste in a Minimum Time during each Trip (MWMTT). (iv) A new tight lower bound to validate MWMTT. Phase 1 of MWMTT generates trips with maximum collected waste within the shortest time. Phase 2 uses a linear program to assign the trips generated in phase 1 into different groups in a way that the trips of the same group are performed by the UAV without the need to recharge it. An exhaustive experimental study was conducted using three randomly generated data sets for each of two experiments. In the first experiment, 16 small scale instances with number of sites varying from 10 to 40 are used. Whereas in the second experiment, 48 medium and large scale instances of 41 to 981 sites are considered. The results obtained by MWMTT in the small scale instances experiment are compared with the lower bound and the linear program. On the other hand, the results obtained by MWMTT in medium and large scale instances experiment are compared with only the lower bound. The obtained results show that MWMTT has a very promising performance. For small instances the average of the optimality gap between the result of the approach and the optimal solution (linear program) is less than 10\(\%\). For the medium and large instances, the gap moves almost in a steady state for every data set and the behavior of MWMTT is similar to the behavior of the lower bound.
Similar content being viewed by others
References
Ahuja RK, Ergun Ö, Orlin JB, Punnen AP (2002) A survey of very large-scale neighborhood search techniques. Discrete Appl Math 123(1–3):75–102
Akhtar M, Hannan M, Begum RA, Basri H, Scavino E (2017) Backtracking search algorithm in CVRP models for efficient solid waste collection and route optimization. Waste Manag 61:117–128
Alguliyev RM, Aliguliyev RM, Sukhostat LV (2020) Efficient algorithm for big data clustering on single machine. CAAI Trans Intell Technol 5(1):9–14
Applegate DL, Bixby RE, Chvatal V, Cook WJ (2006) The traveling salesman problem: a computational study. Princeton University Press, Princeton
Bektas T (2006) The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3):209–219
Berger J, Barkaoui M (2003) A hybrid genetic algorithm for the capacitated vehicle routing problem. In: Genetic and evolutionary computation conference. Springer, Berlin, pp 646–656
Bilò V, Caragiannis I, Kaklamanis C, Kanellopoulos P (2005) Geometric clustering to minimize the sum of cluster sizes. In: European symposium on algorithms. Springer, Berlin, pp 460–471
Bujel K, Lai F, Szczecinski M, So W, Fernandez M (2018) Solving high volume capacitated vehicle routing problem with time windows using recursive-dbscan clustering algorithm. arXiv preprint arXiv:1812.02300
Cárdenas-Barrón LE, González-Velarde JL, Treviño-Garza G, Garza-Nuñez D (2019) Heuristic algorithm based on reduce and optimize approach for a selective and periodic inventory routing problem in a waste vegetable oil collection environment. Int J Prod Econ 211:44–59
Cattaruzza D, Absi N, Feillet D (2016) Vehicle routing problems with multiple trips. 4OR 14(3):223–259
Chbichib A, Mellouli R, Chabchoub H (2012) Profitable vehicle routing problem with multiple trips: modeling and variable neighborhood descent algorithm. Am J Oper Res 2(6):104–119
Cheng C, Adulyasak Y, Rousseau LM (2018) Formulations and exact algorithms for drone routing problem. CIRRELT, Centre interuniversitaire de recherche sur les réseaux d’entreprise
De Bruecker P, Beliën J, De Boeck L, De Jaeger S, Demeulemeester E (2018) A model enhancement approach for optimizing the integrated shift scheduling and vehicle routing problem in waste collection. Eur J Oper Res 266(1):278–290
Drones E (2020) How drones are helping with waste management. https://www.equinoxsdrones.com/blog/
Faccio M, Persona A, Zanin G (2011) Waste collection multi objective model with real time traceability data. Waste Manage 31(12):2391–2405
Fooladi S, Fazlollahtabar H, Mahdavi I (2013) Waste collection vehicle routing problem considering similarity pattern of trashcan and garbage unloading. Int J Eng Technol 5:187–198
GAOTek (2022) Drone-applications-in-waste-management. https://gaotek.com/drone-applications-in-waste-management/
Gonzalez TF (1985) Clustering to minimize the maximum intercluster distance. Theor Comput Sci 38:293–306
Ha QM, Deville Y, Pham QD, Hà MH (2020) A hybrid genetic algorithm for the traveling salesman problem with drone. J Heurist 26(2):219–247
Hannan M, Akhtar M, Begum RA, Basri H, Hussain A, Scavino E (2018) Capacitated vehicle-routing problem model for scheduled solid waste collection and route optimization using PSO algorithm. Waste Manage 71:31–41
Hassanalian M, Abdelkefi A (2017) Classifications, applications, and design challenges of drones: a review. Prog Aerosp Sci 91:99–131
Huang SH, Lin PC (2015) Vehicle routing-scheduling for municipal waste collection system under the “keep trash off the ground’’ policy. Omega 55:24–37
Insights C (2020) Ways drones will impact society: from fighting war to forecasting weather UAVs change everything. https://bit.ly/3kTEDR8
Jwad Z, Talib H (2019) An optimization approach to model the waste collection process. Int J Eng Technol 8(1.5):151–157
Khoufi I, Laouiti A, Adjih C (2019) A survey of recent extended variants of the traveling salesman and vehicle routing problems for unmanned aerial vehicles. Drones 3(3):66
Korte B, Vygen J, Korte B, Vygen J (2012) Combinatorial optimization, vol 2. Springer, Berlin
Lee C, Lee K, Park S (2012) Robust vehicle routing problem with deadlines and travel time/demand uncertainty. J Oper Res Soc 63(9):1294–1306
Leizer K, Károly G (2018) Possible areas of application of drones in waste management during rail accidents and disasters. Interdiscipl Descr Complex Syst INDECS 16(3-A):360–368
MacQueen J (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, Oakland, CA, USA, vol 1, pp 281–297
Mes M, Schutten M, Rivera AP (2014) Inventory routing for dynamic waste collection. Waste Manag 34(9):1564–1576
Moghdani R, Salimifard K, Demir E, Benyettou A (2020) The green vehicle routing problem: a systematic literature review. J Cleaner Prod 123691
Mu Q, Fu Z, Lysgaard J, Eglese R (2011) Disruption management of the vehicle routing problem with vehicle breakdown. J Oper Res Soc 62(4):742–749
Nowakowski P (2017) A proposal to improve e-waste collection efficiency in urban mining: container loading and vehicle routing problems-a case study of poland. Waste Manag 60:494–504
Nowakowski P, Szwarc K, Boryczka U (2018) Vehicle route planning in e-waste mobile collection on demand supported by artificial intelligence algorithms. Transp Res Part D Transp Environ 63:1–22
Pisinger D, Ropke S (2010) Large neighborhood search. In: Handbook of metaheuristics. Springer, Berlin, pp 399–419
Poikonen S, Golden B (2020) Multi-visit drone routing problem. Comput Oper Res 113(104):802
Rabbani M, Heidari R, Farrokhi-Asl H, Rahimi N (2018) Using metaheuristic algorithms to solve a multi-objective industrial hazardous waste location-routing problem considering incompatible waste types. J Clean Prod 170:227–241
Rabbani M, Heidari R, Yazdanparast R (2019) A stochastic multi-period industrial hazardous waste location-routing problem: integrating NSGA-II and Monte Carlo simulation. Eur J Oper Res 272(3):945–961
Ramos TRP, de Morais CS, Barbosa-Póvoa AP (2018) The smart waste collection routing problem: alternative operational management approaches. Expert Syst Appl 103:146–158
Sacramento D, Pisinger D, Ropke S (2019) An adaptive large neighborhood search metaheuristic for the vehicle routing problem with drones. Transp Res Part C Emerg Technol 102:289–315
Sungur I, Ordónez F, Dessouky M (2008) A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty. IIE Trans 40(5):509–523
Tirkolaee EB, Alinaghian M, Hosseinabadi AAR, Sasi MB, Sangaiah AK (2019) An improved ant colony optimization for the multi-trip capacitated arc routing problem. Comput Electr Eng 77:457–470
Vecchi TP, Surco DF, Constantino AA, Steiner MT, Jorge LM, Ravagnani MA, Paraíso PR (2016) A sequential approach for the optimization of truck routes for solid waste collection. Process Saf Environ Prot 102:238–250
Wei Q, Guo Z, Lau HC, He Z (2019) An artificial bee colony-based hybrid approach for waste collection problem with midway disposal pattern. Appl Soft Comput 76:629–637
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Kaabi, J., Harrath, Y., Mahjoub, A. et al. A 2-phase approach for planning of hazardous waste collection using an unmanned aerial vehicle. 4OR-Q J Oper Res 21, 585–608 (2023). https://doi.org/10.1007/s10288-022-00526-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-022-00526-0