{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T02:00:16Z","timestamp":1783821616525,"version":"3.55.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1016\/j.ejor.2019.09.045","type":"journal-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T16:56:28Z","timestamp":1569516988000},"page":"515-529","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":60,"title":["The multi-visit team orienteering problem with precedence constraints"],"prefix":"10.1016","volume":"282","author":[{"given":"Sa\u00efd","family":"Hanafi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Renata","family":"Mansini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3073-4895","authenticated-orcid":false,"given":"Roberto","family":"Zanotti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2019.09.045_bib0001","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/j.eswa.2016.09.002","article-title":"A GRASP ILS for the vehicle routing problem with time windows, synchronization and precedence constraints","volume":"66","author":"Ait Haddadene","year":"2016","journal-title":"Expert Systems with Applications"},{"issue":"11","key":"10.1016\/j.ejor.2019.09.045_bib0002","doi-asserted-by":"crossref","first-page":"2017","DOI":"10.1016\/j.cor.2010.02.002","article-title":"Kernel search: A general heuristic for the multi-dimensional knapsack problem","volume":"37","author":"Angelelli","year":"2010","journal-title":"Computers and Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2019.09.045_bib0003","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10589-010-9326-6","article-title":"Kernel search: A new heuristic framework for portfolio selection","volume":"51","author":"Angelelli","year":"2012","journal-title":"Computational Optimization and Applications"},{"key":"10.1016\/j.ejor.2019.09.045_bib0004","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":"International Transactions in Operational Research"},{"key":"10.1016\/j.ejor.2019.09.045_bib0005","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10288-006-0009-1","article-title":"An exact algorithm for team orienteering problems","volume":"5","author":"Boussier","year":"2007","journal-title":"4OR"},{"issue":"9","key":"10.1016\/j.ejor.2019.09.045_bib0006","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1109\/TPAMI.2004.60","article-title":"An experimental comparison of min-cut\/max-flow algorithms for energy minimization in vision","author":"Boykov","year":"2004","journal-title":"IEEE Transactions on Pattern Analysis & Machine Intelligence"},{"issue":"1","key":"10.1016\/j.ejor.2019.09.045_bib0007","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.ejor.2007.07.033","article-title":"Combined vehicle routing and scheduling with temporal precedence and synchronization constraints","volume":"19","author":"Bredstr\u00f6m","year":"2008","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2019.09.045_bib0008","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/0377-2217(95)00035-6","article-title":"A fast and effective heuristic for the orienteering problem","volume":"88","author":"Chao","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2019.09.045_sbref0009","series-title":"Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, lecture notes in computer science","article-title":"A branch-and-cut algorithm for solving the team orienteering problem","author":"Dang","year":"2013"},{"issue":"4","key":"10.1016\/j.ejor.2019.09.045_bib0010","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/net.20472","article-title":"The vehicle routing problem with time windows and temporal dependencies","volume":"58","author":"Dohn","year":"2011","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.ejor.2019.09.045_bib0011","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1287\/trsc.1110.0400","article-title":"Synchronization in vehicle routing - a survey of VRPs with multiple synchronization constraints","volume":"46","author":"Drexel","year":"2012","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2019.09.045_bib0012","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.cor.2016.04.008","article-title":"Solving the team orienteering problem with cutting planes","volume":"74","author":"El-Hajj","year":"2016","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2019.09.045_bib0013","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ejor.2016.04.059","article-title":"Orienteering problem: A survey of recent variants, solution approaches and applications","volume":"255","author":"Gunawan","year":"2016","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2019.09.045_bib0014","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1080\/00207543.2015.1058982","article-title":"Enhanced exact solution methods for the team orienteering problem","volume":"54","author":"Keshtkaran","year":"2016","journal-title":"International Journal of Production Research"},{"issue":"12","key":"10.1016\/j.ejor.2019.09.045_bib0015","doi-asserted-by":"crossref","first-page":"8424","DOI":"10.1016\/j.eswa.2010.05.036","article-title":"The combined manpower-vehicle routing problem for multi-staged services","volume":"37","author":"Kim","year":"2010","journal-title":"Expert Systems with Applications"},{"issue":"3","key":"10.1016\/j.ejor.2019.09.045_bib0016","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1016\/j.ejor.2011.10.048","article-title":"The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies","volume":"219","author":"Rasmussen","year":"2012","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2019.09.045_bib0017","first-page":"76","article-title":"The synchronized dynamic vehicle dispatching problem","volume":"51","author":"Rousseau","year":"2013","journal-title":"INFOR: Information Systems and Operational Research"},{"key":"10.1016\/j.ejor.2019.09.045_bib0018","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","article-title":"The orienteering problem: A survey","volume":"209","author":"Vansteenwegen","year":"2011","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2019.09.045_bib0019","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":"2015","journal-title":"Transportation Science"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221719308021?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221719308021?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T12:19:25Z","timestamp":1759839565000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221719308021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["S0377221719308021"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2019.09.045","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2020,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The multi-visit team orienteering problem with precedence constraints","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2019.09.045","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}