{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T19:30:50Z","timestamp":1780515050834,"version":"3.54.1"},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100004564","name":"Ministarstvo Prosvete, Nauke i Tehnolo\u0161kog Razvoja","doi-asserted-by":"publisher","award":["174010"],"award-info":[{"award-number":["174010"]}],"id":[{"id":"10.13039\/501100004564","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004564","name":"Ministarstvo Prosvete, Nauke i Tehnolo\u0161kog Razvoja","doi-asserted-by":"publisher","award":["044006"],"award-info":[{"award-number":["044006"]}],"id":[{"id":"10.13039\/501100004564","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71601065"],"award-info":[{"award-number":["71601065"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71871080"],"award-info":[{"award-number":["71871080"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71690235"],"award-info":[{"award-number":["71690235"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71521001"],"award-info":[{"award-number":["71521001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["BR05236839"],"award-info":[{"award-number":["BR05236839"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1016\/j.ins.2019.08.017","type":"journal-article","created":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T11:03:43Z","timestamp":1565003023000},"page":"108-123","update-policy":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":45,"special_numbering":"C","title":["Solving the traveling repairman problem with profits: A Novel variable neighborhood search approach"],"prefix":"10.1016","volume":"507","author":[{"given":"Jun","family":"Pei","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dragan","family":"Uro\u0161evi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jack","family":"Brimberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinbao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.ins.2019.08.017_bib0001","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1051\/ita\/1986200100791","article-title":"The complexity of the traveling repairman problem","volume":"20","author":"Afrati","year":"1986","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"10.1016\/j.ins.2019.08.017_bib0002","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. Engineering"},{"key":"10.1016\/j.ins.2019.08.017_bib0003","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1287\/trsc.1100.0352","article-title":"Formulations and branch-and-cut algorithms for the generalized vehicle routing problem","volume":"45","author":"Bekta\u015f","year":"2011","journal-title":"Transp. Sci."},{"issue":"9","key":"10.1016\/j.ins.2019.08.017_bib0004","doi-asserted-by":"crossref","first-page":"2979","DOI":"10.1007\/s00500-018-3660-5","article-title":"The risk-averse traveling repairman problem with profits","volume":"23","author":"Beraldi","year":"2019","journal-title":"Soft Comput."},{"key":"10.1016\/j.ins.2019.08.017_bib0005","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.ins.2016.12.021","article-title":"Less is more: solving the max-mean diversity problem with variable neighborhood search","volume":"382","author":"Brimberg","year":"2017","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2019.08.017_bib0006","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1287\/trsc.1070.0209","article-title":"Routing for relief efforts","volume":"42","author":"Campbell","year":"1994","journal-title":"Transp. Sci."},{"issue":"3","key":"10.1016\/j.ins.2019.08.017_bib0007","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/j.orl.2007.11.001","article-title":"Profit-based latency problems on the line","volume":"36","author":"Coene","year":"2008","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.ins.2019.08.017_bib0008","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.ins.2017.06.019","article-title":"Less is more: basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering","volume":"415","author":"Costa","year":"2017","journal-title":"Inf. Sci."},{"issue":"7","key":"10.1016\/j.ins.2019.08.017_bib0009","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."},{"key":"10.1016\/j.ins.2019.08.017_bib0010","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/trsc.1030.0079","article-title":"Traveling salesman problems with profits","volume":"39","author":"Feillet","year":"2005","journal-title":"Transp. Sci."},{"issue":"4","key":"10.1016\/j.ins.2019.08.017_bib0011","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1287\/trsc.1040.0106","article-title":"The profitable arc tour problem: solution with a branch-and-price algorithm","volume":"39","author":"Feillet","year":"2005","journal-title":"Transp. Sci."},{"key":"10.1016\/j.ins.2019.08.017_bib0012","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1287\/trsc.1050.0140","article-title":"The period vehicle routing problem with service choice","volume":"40","author":"Francis","year":"2006","journal-title":"Transp. Sci."},{"issue":"1\u20132","key":"10.1016\/j.ins.2019.08.017_bib0013","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01585867","article-title":"An improved approximation ratio for the minimum latency problem","volume":"82","author":"Goemans","year":"1998","journal-title":"Math. Program."},{"key":"10.1016\/j.ins.2019.08.017_bib0014","series-title":"The Traveling Salesman Problem and Its Variations","author":"Gutin","year":"2007"},{"key":"10.1016\/j.ins.2019.08.017_bib0015","doi-asserted-by":"crossref","first-page":"343","DOI":"10.2298\/YJOR140219014H","article-title":"New VNS based 0\u20131\u202fMIP heuristics","volume":"25","author":"Hanafi","year":"2015","journal-title":"Yugoslav J. Oper. Res."},{"key":"10.1016\/j.ins.2019.08.017_bib0016","series-title":"In Gendreau and Potvin, editors, Handbook of Metaheuristics, chapter\u00a03, pages 61\u201386","article-title":"Variable neighbourhood search","author":"Hansen","year":"2010"},{"key":"10.1016\/j.ins.2019.08.017_bib0017","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/j.ejor.2007.02.002","article-title":"Variable neighborhood search","volume":"191","author":"Hansen","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.ins.2019.08.017_bib0018","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","article-title":"Variable neighborhood search: basics and variants","volume":"5","author":"Hansen","year":"2017","journal-title":"EURO J. Comput. Optim."},{"key":"10.1016\/j.ins.2019.08.017_bib0019","first-page":"1","article-title":"Apply the quantum particle swarm optimization for the k-traveling repairman problem","author":"Jmal","year":"2019","journal-title":"Soft Comput."},{"key":"10.1016\/j.ins.2019.08.017_bib0020","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/j.ins.2017.09.069","article-title":"Enhanced discrete bacterial memetic evolutionary algorithm-an efficacious metaheuristic for the traveling salesman optimization","volume":"460","author":"K\u00f3czy","year":"2018","journal-title":"Inf. Sci."},{"issue":"2","key":"10.1016\/j.ins.2019.08.017_bib0021","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","article-title":"The traveling salesman problem: an overview of exact and approximate algorithms","volume":"59","author":"Laporte","year":"1992","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.ins.2019.08.017_bib0022","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.ins.2019.08.017_bib0023","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":"Inf. Sci."},{"issue":"11","key":"10.1016\/j.ins.2019.08.017_bib0024","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.ins.2019.08.017_bib0025","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.ins.2015.07.044","article-title":"Less is more: basic variable neighborhood search for minimum differential dispersion problem","volume":"326","author":"Mladenovi\u0107","year":"2016","journal-title":"Inf. Sci."},{"issue":"1","key":"10.1016\/j.ins.2019.08.017_bib0026","doi-asserted-by":"crossref","first-page":"19","DOI":"10.2298\/YJOR120530015M","article-title":"An efficient general variable neighborhood search for large traveling salesman problem with time windows","volume":"23","author":"Mladenovi\u0107","year":"2013","journal-title":"Yugoslav J. Oper. Res."},{"issue":"1","key":"10.1016\/j.ins.2019.08.017_bib0027","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10288-012-0212-1","article-title":"Variable neighborhood search for the traveling deliveryman problem","volume":"11","author":"Mladenovi\u0107","year":"2013","journal-title":"4OR"},{"key":"10.1016\/j.ins.2019.08.017_bib0028","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.ins.2018.08.062","article-title":"Multi-goal motion planning using traveling salesman problem in belief space","volume":"471","author":"Noormohammadi-Asl","year":"2019","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2019.08.017_bib0029","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":"Inf. Sci."},{"issue":"2","key":"10.1016\/j.ins.2019.08.017_bib0030","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1287\/ijoc.2018.0876","article-title":"Continuous variable neighborhood search (c-VNS) for solving systems of nonlinear equations","volume":"31","author":"Pei","year":"2019","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"10.1016\/j.ins.2019.08.017_bib0031","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1287\/trsc.2015.0584","article-title":"Large neighborhoods with implicit customer selection for vehicle routing problems with profits","volume":"50","author":"Vidal","year":"2016","journal-title":"Transp. Sci."},{"key":"10.1016\/j.ins.2019.08.017_bib0032","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/3001968","article-title":"Individual comparisons by ranking methods","volume":"1","author":"Wilcoxon","year":"1945","journal-title":"Biometrics"},{"issue":"6","key":"10.1016\/j.ins.2019.08.017_bib0033","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.ipl.2004.09.009","article-title":"Exact algorithms for the minimum latency problem","volume":"92","author":"Wu","year":"2004","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.ins.2019.08.017_bib0034","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.ins.2019.03.070","article-title":"A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows","volume":"490","author":"Zhang","year":"2019","journal-title":"Inf. Sci."},{"issue":"7","key":"10.1016\/j.ins.2019.08.017_bib0035","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1016\/j.ins.2010.12.003","article-title":"A parallel immune algorithm for traveling salesman problem and its application on cold rolling scheduling","volume":"181","author":"Zhao","year":"2011","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2019.08.017_bib0036","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ins.2017.08.067","article-title":"Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem","volume":"421","author":"Zhong","year":"2017","journal-title":"Inf. Sci."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0020025519307510?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0020025519307510?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T22:33:37Z","timestamp":1777415617000},"score":1,"resource":{"primary":{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025519307510"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":36,"alternative-id":["S0020025519307510"],"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.1016\/j.ins.2019.08.017","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2020,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Solving the traveling repairman problem with profits: A Novel variable neighborhood search approach","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.1016\/j.ins.2019.08.017","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}