{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T19:30:33Z","timestamp":1773862233197,"version":"3.50.1"},"reference-count":42,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.ejor.2025.11.035","type":"journal-article","created":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T04:35:09Z","timestamp":1764390909000},"page":"443-456","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph partitioning-based matheuristic for residential waste collection problem with visual attractiveness and turn penalty"],"prefix":"10.1016","volume":"332","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2087-113X","authenticated-orcid":false,"given":"Seungyeop","family":"Lee","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0003-0153-3087","authenticated-orcid":false,"given":"Sangil","family":"Han","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4526-2509","authenticated-orcid":false,"given":"Byung-In","family":"Kim","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"10","key":"10.1016\/j.ejor.2025.11.035_bib0001","doi-asserted-by":"crossref","first-page":"12954","DOI":"10.1016\/j.eswa.2011.04.092","article-title":"The mixed capacitated general routing problem with turn penalties","volume":"38","author":"Br\u00e4ysy","year":"2011","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.035_bib0002","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1016\/j.ejor.2018.07.004","article-title":"A two-stage solution approach for the directed rural postman problem with turn penalties","volume":"272","author":"Cerrone","year":"2019","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.11.035_bib0003","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.106973","article-title":"Designing visually and operationally attractive routes to improve driver acceptance in road cleaning vehicle routing problem","volume":"177","author":"Chen","year":"2025","journal-title":"Computers and Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.035_bib0004","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/j.ejor.2015.01.042","article-title":"The mixed capacitated arc routing problem with non-overlapping routes","volume":"244","author":"Constantino","year":"2015","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.035_bib0005","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1287\/trsc.2017.0774","article-title":"The Chinese postman problem with load-dependent costs","volume":"52","author":"Corber\u00e1n","year":"2018","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.035_bib0006","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.21748","article-title":"Aesthetic considerations for the min-max K-Windy rural postman problem","volume":"70","author":"Corber\u00e1n","year":"2017","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2025.11.035_bib0007","series-title":"Arc routing: Problems, methods, and applications","author":"Corber\u00e1n","year":"2015"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.035_bib0008","doi-asserted-by":"crossref","first-page":"974","DOI":"10.1016\/j.wasman.2012.12.016","article-title":"Public perception of odour and environmental pollution attributed to MSW treatment and disposal facilities: A case study","volume":"33","author":"De Feo","year":"2013","journal-title":"Waste Management"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.035_bib0009","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1287\/trsc.2014.0579","article-title":"Customizable route planning in road networks","volume":"51","author":"Delling","year":"2017","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2025.11.035_bib0010","series-title":"2011 IEEE international parallel & distributed processing symposium","first-page":"1135","article-title":"Graph partitioning with natural cuts","author":"Delling","year":"2011"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.035_bib0011","first-page":"52","article-title":"Improved K-means algorithm for capacitated clustering problem","volume":"8","author":"Geetha","year":"2009","journal-title":"INFOCOMP Journal of Computer Science"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.035_bib0012","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1023\/B:JMMA.0000038618.37710.f8","article-title":"Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions","volume":"3","author":"Ghiani","year":"2004","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.035_bib0013","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1002\/net.3","article-title":"The capacitated arc routing problem with intermediate facilities","volume":"37","author":"Ghiani","year":"2001","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2025.11.035_bib0014","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105304","article-title":"A matheuristic for large-scale capacitated clustering","volume":"132","author":"Gn\u00e4gi","year":"2021","journal-title":"Computers and Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.035_bib0015","doi-asserted-by":"crossref","first-page":"958","DOI":"10.1016\/j.ejor.2024.02.029","article-title":"Optimizing location-routing and demand allocation in the household waste collection system using a branch-and-price algorithm","volume":"316","author":"Han","year":"2024","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"10.1016\/j.ejor.2025.11.035_bib0016","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1177\/03611981211030262","article-title":"An integrated territory planning and vehicle routing approach for a multi-objective residential waste collection problem","volume":"2675","author":"Hurkmans","year":"2021","journal-title":"Transportation Research Record"},{"key":"10.1016\/j.ejor.2025.11.035_bib0017","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105934","article-title":"Arc routing with trip-balancing and attractiveness measures \u2014 A waste collection case study","volume":"147","author":"Janela","year":"2022","journal-title":"Computers and Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.035_bib0018","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","article-title":"A fast and high quality multilevel scheme for partitioning irregular graphs","volume":"20","author":"Karypis","year":"1998","journal-title":"SIAM Journal of Scientific Computing"},{"issue":"12","key":"10.1016\/j.ejor.2025.11.035_bib0019","doi-asserted-by":"crossref","first-page":"3624","DOI":"10.1016\/j.cor.2005.02.045","article-title":"Waste collection vehicle routing problem with time windows","volume":"33","author":"Kim","year":"2006","journal-title":"Computers and Operations Research"},{"issue":"7","key":"10.1016\/j.ejor.2025.11.035_bib0020","doi-asserted-by":"crossref","first-page":"2320","DOI":"10.1016\/j.cor.2008.09.008","article-title":"Exploiting sparsity in pricing routines for the capacitated arc routing problem","volume":"36","author":"Letchford","year":"2009","journal-title":"Computers and Operations Research"},{"issue":"5","key":"10.1016\/j.ejor.2025.11.035_bib0021","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1177\/0734242X211003975","article-title":"Waste collection routing problem: A mini-review of recent heuristic approaches and applications","volume":"40","author":"Liang","year":"2021","journal-title":"Waste Management & Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.035_bib0022","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1002\/net.21730","article-title":"Partitioning a street network into compact, balanced, and visually appealing routes","volume":"69","author":"Lum","year":"2017","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2025.11.035_bib0023","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.wasman.2021.08.034","article-title":"A bi-level multi-objective location-routing model for municipal waste management with obnoxious effects","volume":"135","author":"Ma","year":"2021","journal-title":"Waste Management"},{"key":"10.1016\/j.ejor.2025.11.035_bib0024","article-title":"Multi-compartment waste collection vehicle routing problem with bin washer","volume":"189","author":"Masmoudi","year":"2024","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.035_bib0025","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1177\/0734242X18801186","article-title":"A multi-compartment capacitated arc routing problem with intermediate facilities for solid waste collection using hybrid adaptive large neighborhood search and whale algorithm","volume":"37","author":"Mofid-Nakhaee","year":"2019","journal-title":"Waste Management and Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.035_bib0026","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1016\/j.ejor.2008.04.025","article-title":"Heuristic methods for the sectoring arc routing problem","volume":"196","author":"Mour\u00e3o","year":"2009","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.035_bib0027","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/j.ejor.2024.09.043","article-title":"Divide-and-conquer initialization and mutation operators for the large-scale mixed capacitated arc routing problem","volume":"321","author":"Oliveira","year":"2025","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.035_bib0028","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02614365","article-title":"A polynomial time primal network simplex algorithm for minimum cost flows","volume":"78","author":"Orlin","year":"1997","journal-title":"Mathematical Programming"},{"issue":"5","key":"10.1016\/j.ejor.2025.11.035_bib0029","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10732-007-9050-2","article-title":"A variable neighborhood search for the capacitated arc routing problem with intermediate facilities","volume":"14","author":"Polacek","year":"2008","journal-title":"Journal of Heuristics"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.035_bib0030","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.21759","article-title":"Solving the large-scale min\u2013max K-rural postman problem for snow plowing","volume":"70","author":"Quirion-Blais","year":"2017","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2025.11.035_bib0031","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105507","article-title":"Visual attractiveness in vehicle routing via bi-objective optimization","volume":"137","author":"Rocha","year":"2022","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2025.11.035_bib0032","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.cor.2018.10.012","article-title":"Visual attractiveness in routing problems: A review","volume":"103","author":"Rossit","year":"2019","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2025.11.035_bib0033","series-title":"Experimental algorithms","first-page":"286","article-title":"On balanced separators in road networks","author":"Schild","year":"2015"},{"key":"10.1016\/j.ejor.2025.11.035_bib0034","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1177\/0361198106196400102","article-title":"Interactive heuristic for practical vehicle routing problem with solution shape constraints","volume":"1964","author":"Tang","year":"2006","journal-title":"Transportation Research Record"},{"key":"10.1016\/j.ejor.2025.11.035_bib0035","article-title":"Enhancing waste collection: A branch-and-cut-and-price approach for the periodic vehicle routing problem with intermediate facilities applied to a real-world case study","author":"Taverna","year":"2025","journal-title":"European Journal of Operational Research (In Press)"},{"issue":"1\u20132","key":"10.1016\/j.ejor.2025.11.035_bib0036","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10479-021-04486-2","article-title":"A novel model for sustainable waste collection arc routing problem: Pareto-based algorithms","volume":"324","author":"Tirkolaee","year":"2023","journal-title":"Annals of Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.035_bib0037","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1177\/0734242X19865782","article-title":"A hybrid augmented ant colony optimization for the multi-trip capacitated arc routing problem under fuzzy demands for urban solid waste management","volume":"38","author":"Tirkolaee","year":"2020","journal-title":"Waste Management and Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.035_bib0038","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1016\/j.ejor.2023.08.052","article-title":"Formulation and solution technique for agricultural waste collection and transport network design","volume":"313","author":"Tran","year":"2024","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.11.035_bib0039","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106671","article-title":"A multi-level capacitated arc routing problem with intermediate facilities in waste collection","volume":"167","author":"Wei","year":"2024","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2025.11.035_bib0040","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.cor.2015.10.010","article-title":"Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities","volume":"68","author":"Willemse","year":"2016","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2025.11.035_bib0041","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/j.cor.2019.02.002","article-title":"Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities","volume":"105","author":"Willemse","year":"2019","journal-title":"Computers and Operations Research"},{"issue":"9","key":"10.1016\/j.ejor.2025.11.035_bib0042","doi-asserted-by":"crossref","first-page":"9","DOI":"10.3390\/ijerph14091013","article-title":"Barriers to effective municipal solid waste management in a rapidly urbanizing area in Thailand","volume":"14","author":"Yukalang","year":"2017","journal-title":"International Journal of Environmental Research and Public Health"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725009634?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725009634?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T12:07:51Z","timestamp":1773835671000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221725009634"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["S0377221725009634"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2025.11.035","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Graph partitioning-based matheuristic for residential waste collection problem with visual attractiveness and turn penalty","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2025.11.035","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}