{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T14:36:03Z","timestamp":1773758163169,"version":"3.50.1"},"reference-count":30,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100002701","name":"Korea Ministry of Education","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002701","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers and Electrical Engineering"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.compeleceng.2026.111105","type":"journal-article","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T11:58:40Z","timestamp":1773748720000},"page":"111105","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Solving large instances of multiple traveling repairman problem with profits: A greedy hyper-heuristic approach"],"prefix":"10.1016","volume":"134","author":[{"given":"Kasi Viswanath","family":"Dasari","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3585-4957","authenticated-orcid":false,"given":"Alok","family":"Singh","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9071-1145","authenticated-orcid":false,"given":"Rammohan","family":"Mallipeddi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.compeleceng.2026.111105_b1","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.engappai.2019.01.014","article-title":"Memetic algorithm for the multiple traveling repairman problem with profits","volume":"80","author":"Lu","year":"2019","journal-title":"Eng Appl Artif Intell"},{"key":"10.1016\/j.compeleceng.2026.111105_b2","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/j.cor.2019.07.012","article-title":"An adaptive large neighborhood search approach for multiple traveling repairman problem with profits","volume":"111","author":"Avci","year":"2019","journal-title":"Comput Oper Res"},{"issue":"7","key":"10.1016\/j.compeleceng.2026.111105_b3","doi-asserted-by":"crossref","first-page":"1700","DOI":"10.1016\/j.cor.2013.01.003","article-title":"Heuristics for the traveling repairman problem with profits","volume":"40","author":"Dewilde","year":"2013","journal-title":"Comput Oper Res"},{"issue":"2","key":"10.1016\/j.compeleceng.2026.111105_b4","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/j.ejor.2022.04.007","article-title":"An effective hybrid search algorithm for the multiple traveling repairman problem with profits","volume":"304","author":"Ren","year":"2023","journal-title":"European J Oper Res"},{"key":"10.1016\/j.compeleceng.2026.111105_b5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.cie.2017.09.032","article-title":"A GRASP with iterated local search for the traveling repairman problem with profits","volume":"113","author":"Avci","year":"2017","journal-title":"Comput Ind Eng"},{"key":"10.1016\/j.compeleceng.2026.111105_b6","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.ins.2019.05.075","article-title":"Hybrid evolutionary search for the traveling repairman problem with profits","volume":"502","author":"Lu","year":"2019","journal-title":"Inform Sci"},{"key":"10.1016\/j.compeleceng.2026.111105_b7","series-title":"Soft computing for problem solving: proceedings of the SocProS 2022","first-page":"501","article-title":"A hyper-heuristic method for the traveling repairman problem with profits","author":"Dasari","year":"2023"},{"key":"10.1016\/j.compeleceng.2026.111105_b8","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.ins.2019.08.017","article-title":"Solving the traveling repairman problem with profits: A novel variable neighborhood search approach","volume":"507","author":"Pei","year":"2020","journal-title":"Inform Sci"},{"key":"10.1016\/j.compeleceng.2026.111105_b9","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105034","article-title":"A hybrid adaptive large neighborhood search heuristic for the team orienteering problem","volume":"123","author":"Hammami","year":"2020","journal-title":"Comput Oper Res"},{"key":"10.1016\/j.compeleceng.2026.111105_b10","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1016\/j.asoc.2019.04.038","article-title":"A similarity hybrid harmony search algorithm for the team orienteering problem","volume":"80","author":"Tsakirakis","year":"2019","journal-title":"Appl Soft Comput"},{"key":"10.1016\/j.compeleceng.2026.111105_b11","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10288-008-0094-4","article-title":"A memetic algorithm for the team orienteering problem","volume":"8","author":"Bouly","year":"2010","journal-title":"4OR"},{"issue":"2","key":"10.1016\/j.compeleceng.2026.111105_b12","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/j.ejor.2013.02.049","article-title":"An effective PSO-inspired algorithm for the team orienteering problem","volume":"229","author":"Dang","year":"2013","journal-title":"European J Oper Res"},{"key":"10.1016\/j.compeleceng.2026.111105_b13","series-title":"10th workshop on algorithmic approaches for transportation modelling, optimization, and systems (ATMOS\u201910)","first-page":"142","article-title":"The team orienteering problem: Formulations and branch-cut and price","author":"Poggi","year":"2010"},{"issue":"2","key":"10.1016\/j.compeleceng.2026.111105_b14","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1111\/itor.12422","article-title":"A branch-and-cut algorithm for the team orienteering problem","volume":"25","author":"Bianchessi","year":"2018","journal-title":"Int Trans Oper Res"},{"issue":"11","key":"10.1016\/j.compeleceng.2026.111105_b15","doi-asserted-by":"crossref","first-page":"1877","DOI":"10.1016\/j.cor.2009.06.014","article-title":"An effective memetic algorithm for the cumulative capacitated vehicle routing problem","volume":"37","author":"Ngueveu","year":"2010","journal-title":"Comput Oper Res"},{"issue":"3","key":"10.1016\/j.compeleceng.2026.111105_b16","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1016\/j.cor.2011.05.005","article-title":"An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem","volume":"39","author":"Ribeiro","year":"2012","journal-title":"Comput Oper Res"},{"key":"10.1016\/j.compeleceng.2026.111105_b17","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.eswa.2018.07.025","article-title":"The cumulative capacitated vehicle routing problem: New formulations and iterated greedy algorithms","volume":"113","author":"Nucamendi-Guill\u00e9n","year":"2018","journal-title":"Expert Syst Appl"},{"key":"10.1016\/j.compeleceng.2026.111105_b18","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.compeleceng.2018.05.016","article-title":"A computational intelligence approach to improve the efficiency of repair services in the smart grid context","volume":"70","author":"Garcia","year":"2018","journal-title":"Comput Electr Eng"},{"key":"10.1016\/j.compeleceng.2026.111105_b19","series-title":"3rd international conference on the practice and theory of automated timetabling (PATAT 2000)","first-page":"176","article-title":"A hyperheuristic approach to scheduling a sales summit","author":"Cowling","year":"2000"},{"issue":"4","key":"10.1016\/j.compeleceng.2026.111105_b20","first-page":"1","article-title":"A selection hyper-heuristic based on Q-learning for school bus routing problem","volume":"52","author":"Hou","year":"2022","journal-title":"IAENG Int J Appl Math"},{"key":"10.1016\/j.compeleceng.2026.111105_b21","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/j.ins.2018.06.027","article-title":"A hyper-heuristic based artificial bee colony algorithm for k-interconnected multi-depot multi-traveling salesman problem","volume":"463","author":"Pandiri","year":"2018","journal-title":"Inform Sci"},{"key":"10.1016\/j.compeleceng.2026.111105_b22","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.120003","article-title":"Two heuristic approaches for clustered traveling salesman problem with d-relaxed priority rule","volume":"224","author":"Dasari","year":"2023","journal-title":"Expert Syst Appl"},{"key":"10.1016\/j.compeleceng.2026.111105_b23","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2021.100985","article-title":"Multi-objective Q-learning-based hyper-heuristic with bi-criteria selection for energy-aware mixed shop scheduling","volume":"69","author":"Cheng","year":"2022","journal-title":"Swarm Evol Comput"},{"issue":"2","key":"10.1016\/j.compeleceng.2026.111105_b24","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1016\/j.ejor.2019.09.021","article-title":"Stochastic mixed-model assembly line sequencing problem: Mathematical modeling and Q-learning based simulated annealing hyper-heuristics","volume":"282","author":"Mosadegh","year":"2020","journal-title":"European J Oper Res"},{"key":"10.1016\/j.compeleceng.2026.111105_b25","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.115978","article-title":"Semiconductor final testing scheduling using Q-learning based hyper-heuristic","volume":"187","author":"Lin","year":"2022","journal-title":"Expert Syst Appl"},{"issue":"3","key":"10.1016\/j.compeleceng.2026.111105_b26","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1080\/00207543.2021.2017056","article-title":"A novel hybrid-load AGV for JIT-based sustainable material handling scheduling with time window in mixed-model assembly line","volume":"61","author":"Zhou","year":"2023","journal-title":"Int J Prod Res"},{"key":"10.1016\/j.compeleceng.2026.111105_b27","series-title":"Handbook of metaheuristics","first-page":"449","article-title":"A classification of hyper-heuristic approaches","author":"Burke","year":"2010"},{"issue":"12","key":"10.1016\/j.compeleceng.2026.111105_b28","doi-asserted-by":"crossref","first-page":"1695","DOI":"10.1057\/jors.2013.71","article-title":"Hyper-heuristics: A survey of the state of the art","volume":"64","author":"Burke","year":"2013","journal-title":"J Oper Res Soc"},{"issue":"2","key":"10.1016\/j.compeleceng.2026.111105_b29","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/j.ejor.2019.07.073","article-title":"Recent advances in selection hyper-heuristics","volume":"285","author":"Drake","year":"2020","journal-title":"European J Oper Res"},{"key":"10.1016\/j.compeleceng.2026.111105_b30","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","article-title":"A method for solving traveling salesman problems","volume":"6","author":"Croes","year":"1958","journal-title":"Oper Res"}],"container-title":["Computers and Electrical Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0045790626001771?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0045790626001771?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T11:58:45Z","timestamp":1773748725000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0045790626001771"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":30,"alternative-id":["S0045790626001771"],"URL":"https:\/\/doi.org\/10.1016\/j.compeleceng.2026.111105","relation":{},"ISSN":["0045-7906"],"issn-type":[{"value":"0045-7906","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Solving large instances of multiple traveling repairman problem with profits: A greedy hyper-heuristic approach","name":"articletitle","label":"Article Title"},{"value":"Computers and Electrical Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.compeleceng.2026.111105","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"111105"}}