{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T05:38:28Z","timestamp":1781674708385,"version":"3.54.5"},"reference-count":27,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2016,3]]},"abstract":"<jats:p>In this paper, we consider the waste collection problem from customers\u2019 location with assumptions that are closer to real life applications of the problem. The fleet of vehicles is heterogeneous and vehicles have separated compartments, namely they have different capacity for each type of waste. Also, the vehicles have different traveling time limitation and different variable and fixed cost according to their types. As well as, the multi-depot vehicle routing problem and the mixed close-open vehicle routing problem are combined together. The objective of the problem is minimizing the cost of servicing to customers with respect to customers\u2019 demands and available constraints. A new mathematical MIP model is proposed and to deal with this problem, three meta-heuristic algorithms are investigated and the results are compared with the results of CPLEX solver. The results of experiments show that the proposed Meta-heuristic algorithms are able to produce satisfied solutions with regard to the MIP solver CPLEX.<\/jats:p>","DOI":"10.3233\/ifs-151893","type":"journal-article","created":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T10:49:58Z","timestamp":1456829398000},"page":"1817-1830","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":28,"title":["A hybrid genetic algorithm for waste collection problem by heterogeneous fleet of\u00a0vehicles with multiple separated compartments"],"prefix":"10.1177","volume":"30","author":[{"given":"Masoud","family":"Rabbani","sequence":"first","affiliation":[{"name":"School of Industrial &amp; Systems Engineering, College of Engineering, University of Tehran, Tehran, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hamed","family":"Farrokhi-asl","sequence":"additional","affiliation":[{"name":"School of Industrial &amp; Systems Engineering, College of Engineering, University of Tehran, Tehran, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hamed","family":"Rafiei","sequence":"additional","affiliation":[{"name":"School of Industrial &amp; Systems Engineering, College of Engineering, University of Tehran, Tehran, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"179","published-online":{"date-parts":[[2016,3]]},"reference":[{"issue":"5","key":"e_1_3_1_2_2","doi-asserted-by":"crossref","first-page":"1406","DOI":"10.1016\/j.cor.2005.06.012","article-title":"A new model for the hazardous waste location-routing problem","volume":"34","author":"Alumur S.","year":"2007","unstructured":"AlumurS. and KaraB.Y., A new model for the hazardous waste location-routing problem, Computers & Operations Research 34(5) (2007), 1406\u20131423.","journal-title":"Computers & Operations Research"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.06.034"},{"issue":"12","key":"e_1_3_1_4_2","doi-asserted-by":"crossref","first-page":"2270","DOI":"10.1016\/j.cor.2010.03.019","article-title":"Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities","volume":"37","author":"Benjamin A.","year":"2010","unstructured":"BenjaminA. and BeasleyJ., Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities, Computers & Operations Research 37(12) (2010), 2270\u20132280.","journal-title":"Computers & Operations Research"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.3233\/IFS-130821"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.6.1.80"},{"issue":"2","key":"e_1_3_1_7_2","first-page":"143","article-title":"Multiple criteria optimization based on unsupervised learning and fuzzy inference applied to the vehicle routing problem","volume":"13","author":"de CT Gomes L.","year":"2002","unstructured":"de CT GomesL. and Von Zuben F.J., Multiple criteria optimization based on unsupervised learning and fuzzy inference applied to the vehicle routing problem, Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology 13(2-4) (2002), 143\u2013154.","journal-title":"Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology"},{"issue":"1","key":"e_1_3_1_8_2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","article-title":"Improvements and extensions to the miller-tucker-zemlin subtour elimination constraints","volume":"10","author":"Desrochers M.","year":"1991","unstructured":"DesrochersM. and LaporteG., Improvements and extensions to the miller-tucker-zemlin subtour elimination constraints, Operations Research Letters 10(1) (1991), 27\u201336.","journal-title":"Operations Research Letters"},{"issue":"3","key":"e_1_3_1_9_2","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1016\/j.ejor.2007.06.064","article-title":"A variable neighbourhood search algorithm for the open vehicle routing problem","volume":"195","author":"Fleszar K.","year":"2009","unstructured":"FleszarK., OsmanI.H. and HindiK.S., A variable neighbourhood search algorithm for the open vehicle routing problem, European Journal of Operational Research 195(3) (2009), 803\u2013809.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"e_1_3_1_10_2","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1016\/j.cie.2004.12.012","article-title":"Hybrid genetic algorithm for multi-time period production\/distribution planning","volume":"48","author":"Gen M.","year":"2005","unstructured":"GenM. and SyarifA., Hybrid genetic algorithm for multi-time period production\/distribution planning, Computers & Industrial Engineering 48(4) (2005), 799\u2013809.","journal-title":"Computers & Industrial Engineering"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022602019183"},{"issue":"4","key":"e_1_3_1_12_2","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1016\/j.engappai.2007.06.001","article-title":"A hybrid genetic algorithm for the multi-depot vehicle routing problem","volume":"21","author":"Ho W.","year":"2008","unstructured":"HoW., HoG.T., JiP. and LauH.C., A hybrid genetic algorithm for the multi-depot vehicle routing problem, Engineering Applications of Artificial Intelligence 21(4) (2008), 548\u2013557.","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"14","key":"e_1_3_1_13_2","doi-asserted-by":"crossref","first-page":"2175","DOI":"10.1016\/S0305-0548(02)00129-6","article-title":"Component scheduling for chip shooter machines: A hybrid genetic algorithm approach","volume":"30","author":"Ho W.","year":"2003","unstructured":"HoW. and JiP., Component scheduling for chip shooter machines: A hybrid genetic algorithm approach, Computers & Operations Research 30(14) (2003), 2175\u20132189.","journal-title":"Computers & Operations Research"},{"key":"e_1_3_1_14_2","unstructured":"HollandJ.H. Adaptation in natural and artificial systems: An introductory analysis with applications to biology control and artificial intelligence U Michigan Press 1975."},{"issue":"1","key":"e_1_3_1_15_2","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.ejor.2004.01.027","article-title":"A two-phase hybrid metaheuristic for the vehicle routing problem with time windows","volume":"162","author":"Homberger J.","year":"2005","unstructured":"HombergerJ. and GehringH., A two-phase hybrid metaheuristic for the vehicle routing problem with time windows, European Journal of Operational Research 162(1) (2005), 220\u2013238.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"e_1_3_1_16_2","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1016\/S0377-2217(03)00377-1","article-title":"A note on the lifted miller\u2013tucker\u2013zemlin subtour elimination constraints for the capacitated vehicle routing problem","volume":"158","author":"Kara I.","year":"2004","unstructured":"KaraI., LaporteG. and BektasT., A note on the lifted miller\u2013tucker\u2013zemlin subtour elimination constraints for the capacitated vehicle routing problem, European Journal of Operational Research 158(3) (2004), 793\u2013795.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"e_1_3_1_17_2","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/j.ejor.2004.04.021","article-title":"Evolutionary algorithms for periodic arc routing problems","volume":"165","author":"Lacomme P.","year":"2005","unstructured":"LacommeP., PrinsC. and Ramdane-CherifW., Evolutionary algorithms for periodic arc routing problems, European Journal of Operational Research 165(2) (2005), 535\u2013553.","journal-title":"European Journal of Operational Research"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.11.018"},{"issue":"2","key":"e_1_3_1_19_2","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.ejor.2012.01.061","article-title":"The close\u2013open mixed vehicle routing problem","volume":"220","author":"Liu R.","year":"2012","unstructured":"LiuR. and JiangZ., The close\u2013open mixed vehicle routing problem, European Journal of Operational Research 220(2) (2012), 349\u2013360.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"e_1_3_1_20_2","doi-asserted-by":"crossref","first-page":"1446","DOI":"10.1016\/j.eswa.2009.06.085","article-title":"A hybrid genetic\u2013particle swarm optimization algorithm for the vehicle routing problem","volume":"37","author":"Marinakis Y.","year":"2010","unstructured":"MarinakisY. and MarinakiM., A hybrid genetic\u2013particle swarm optimization algorithm for the vehicle routing problem, Expert Systems with Applications 37(2) (2010), 1446\u20131455.","journal-title":"Expert Systems with Applications"},{"key":"e_1_3_1_21_2","volume-title":"In Genetic algorithms and their applications: Proceedings of the second International Conference on Genetic Algorithms: July 28-31, 1987 at the Massachusetts Institute of Technology","author":"Oliver I.","year":"1987","unstructured":"OliverI., SmithD. and HollandJ.R., Study of permutation crossover operators on the traveling salesman problem. In Genetic algorithms and their applications: Proceedings of the second International Conference on Genetic Algorithms: July 28-31, 1987 at the Massachusetts Institute of Technology, Cambridge, MA, 1987."},{"issue":"3","key":"e_1_3_1_22_2","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/j.cor.2008.11.003","article-title":"A hybrid evolution strategy for the open vehicle routing problem","volume":"37","author":"Repoussis P.P.","year":"2010","unstructured":"RepoussisP.P., TarantilisC.D., Br\u00e4ysyO. and IoannouG., A hybrid evolution strategy for the open vehicle routing problem, Computers & Operations Research 37(3) (2010), 443\u2013455.","journal-title":"Computers & Operations Research"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(90)90057-I"},{"key":"e_1_3_1_24_2","article-title":"The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation","author":"Salhi S.","year":"2013","unstructured":"SalhiS., ImranA. and WassanN.A., The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation, Computers & Operations Research (2013).","journal-title":"Computers & Operations Research"},{"key":"e_1_3_1_25_2","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1057\/palgrave.jors.2600924","article-title":"A heuristic method for the open vehicle routing problem","author":"Sariklis D.","year":"2000","unstructured":"SariklisD. and PowellS., A heuristic method for the open vehicle routing problem, Journal of the Operational Research Society (2000), 564\u2013573.","journal-title":"Journal of the Operational Research Society"},{"issue":"10","key":"e_1_3_1_26_2","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1016\/0305-0548(94)00083-K","article-title":"A heuristic and lower bound for a multi-depot routing problem","volume":"22","author":"Sumichras R.T.","year":"1995","unstructured":"SumichrasR.T. and MarkhamI.S., A heuristic and lower bound for a multi-depot routing problem, Computers & Operations Research 22(10) (1995), 1047\u20131056.","journal-title":"Computers & Operations Research"},{"key":"e_1_3_1_27_2","unstructured":"TothP. and VigoD. The vehicle routing problem Siam 2001."},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2013.03.006"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/IFS-151893","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/IFS-151893","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/IFS-151893","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:39:34Z","timestamp":1777455574000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/IFS-151893"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["10.3233\/IFS-151893"],"URL":"https:\/\/doi.org\/10.3233\/ifs-151893","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3]]}}}