{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:51:57Z","timestamp":1760647917617,"version":"3.37.3"},"reference-count":44,"publisher":"Wiley","license":[{"start":{"date-parts":[[2023,10,6]],"date-time":"2023-10-06T00:00:00Z","timestamp":1696550400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006261","name":"Taif University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Computational Intelligence and Soft Computing"],"published-print":{"date-parts":[[2023,10,6]]},"abstract":"<jats:p>The solid waste collection problem refers to truck route optimisation to collect waste from containers across various locations. Recent concerns exist over the impact of solid waste management on the environment. Hence, it is necessary to find feasible routes while minimising operational costs and fuel consumption. In this paper, in order to reduce fuel consumption, the number of trucks used is considered in the objective function along with the waste load and the travelling time. With the current computational capabilities, finding an optimal solution is challenging. Thus, this study aims to investigate the effect of well-known metaheuristic methods on this problem\u2019s objective function and computational times. The routing solver in the Google OR-tools solver is utilised with three well-known metaheuristic methods for neighbourhood exploration: a guided local search (GLS), a tabu search (TS), and simulated annealing (SA), with two initialisation strategies, Clarke and Wright\u2019s algorithm and the nearest neighbour algorithm. Results showed that optimal solutions are found in faster computational times than using only an IP solver, especially for large instances. Local search methods, notably GLS, have significantly improved the route construction process. The nearest neighbour algorithm has often outperformed the Clarke and Wright's methods. The findings here can be applied to improve operations in Saudi Arabia\u2019s waste management sector.<\/jats:p>","DOI":"10.1155\/2023\/5398400","type":"journal-article","created":{"date-parts":[[2023,10,6]],"date-time":"2023-10-06T18:50:23Z","timestamp":1696618223000},"page":"1-11","source":"Crossref","is-referenced-by-count":3,"title":["Local Search-Based Metaheuristic Methods for the Solid Waste Collection Problem"],"prefix":"10.1155","volume":"2023","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7582-4480","authenticated-orcid":true,"given":"Haneen","family":"Algethami","sequence":"first","affiliation":[{"name":"Department of Computer Science, College of Computers and Information Technology, Taif University, P.O. Box 11099, Taif 21944, Saudi Arabia"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scs.2020.102393"},{"author":"B. Maina","key":"2","article-title":"The challenges of solid waste management in sustainable urban planning"},{"article-title":"Fast facts on transportation greenhouse gas emissions","year":"2023","author":"Epa","key":"3"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.3390\/logistics7030054"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.scs.2017.08.023"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-021-96210-0"},{"issue":"1","key":"7","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1137\/1024022","article-title":"Computers and intractability: a guide to the theory of np-completeness (michael r. garey and david s. johnson)","volume":"24","author":"J. Hartmanis","year":"1982","journal-title":"SIAM Review"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1090.0301"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2020.123557"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1030.0056"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.01.002"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.3390\/ijerph17144963"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.02.045"},{"first-page":"91","article-title":"Waste collection vehicle routing problem with time windows using multi-objective genetic algorithms","author":"B. M. Ombuki-Berman","key":"14"},{"key":"15","unstructured":"BenjaminA. M.Metaheuristics for the waste collection vehicle routing problem with time windows2011Uxbridge, UKBrunel University, School of Information Systems, Computing and MathematicsPh.D. thesis"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.sbspro.2012.03.105"},{"first-page":"774","article-title":"An ant colony optimization algorithm for waste collection vehicle routing with time windows, driver rest period and multiple disposal facilities","author":"R. Islam","key":"17"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2017.08.2051"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/j.scs.2019.101829"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/j.wasman.2017.10.019"},{"issue":"12","key":"21","first-page":"3020","article-title":"Vehicle routing problem with time windows for reducing fuel consumption","volume":"7","author":"L. Jin","year":"2012","journal-title":"Journal of Computers"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/s0377-2217(03)00031-6"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601163"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/4146362"},{"issue":"1","key":"25","first-page":"39","article-title":"Towards green pilgrimage: a framework for action in makkah, Saudi Arabia","volume":"9","author":"I. Elgammal","year":"2021","journal-title":"The international journal of religious tourism and pilgrimage"},{"article-title":"Population in makkah region by gender, age group, and nationality (saudi\/non-saudi)","year":"2018","author":"Azalghamdi","key":"26"},{"article-title":"Population-level and growth rate for the mecca, Saudi Arabia metro area from 1950 to 2023","year":"2023","author":"Macrotrends","key":"27"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.02.041"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.4.568"},{"key":"30","unstructured":"M\u00e4\u00e4tt\u00e4P.Comparison of solution methods for the dynamic pickup and delivery problem with time windows2021Aalto UniversityPh.D. thesis"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.4.4.387"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-011-9186-y"},{"key":"34","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-1665-5_11","volume-title":"Guided Local Search","author":"C. Voudouris","year":"2010"},{"key":"35","first-page":"473","article-title":"Guided local search for the vehicle routing problem with time windows","volume-title":"Meta-heuristics","author":"P. Kilby","year":"1999"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1287\/inte.20.4.74"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"article-title":"Gurobi 7.5 user\u2019s manual","year":"2017","author":"Gurobi","key":"38"},{"article-title":"Or-tools; google developers","year":"2023","author":"Google","key":"39"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110309"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.05.023"},{"key":"42","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.02.007"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.02.039"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.1590\/0101-7438.2016.036.01.0113"}],"container-title":["Applied Computational Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/acisc\/2023\/5398400.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/acisc\/2023\/5398400.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/acisc\/2023\/5398400.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,6]],"date-time":"2023-10-06T18:50:28Z","timestamp":1696618228000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/acisc\/2023\/5398400\/"}},"subtitle":[],"editor":[{"given":"Francesco Carlo","family":"Morabito","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2023,10,6]]},"references-count":44,"alternative-id":["5398400","5398400"],"URL":"https:\/\/doi.org\/10.1155\/2023\/5398400","relation":{},"ISSN":["1687-9732","1687-9724"],"issn-type":[{"type":"electronic","value":"1687-9732"},{"type":"print","value":"1687-9724"}],"subject":[],"published":{"date-parts":[[2023,10,6]]}}}