{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T16:29:28Z","timestamp":1726849768164},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Czech Science Foundation","doi-asserted-by":"publisher","award":["16-24206S","17-16900Y"],"id":[{"id":"10.13039\/501100001824","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":[[2019,8]]},"DOI":"10.1016\/j.ejor.2019.01.047","type":"journal-article","created":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T03:26:23Z","timestamp":1548818783000},"page":"816-825","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":32,"title":["Variable Neighborhood Search for the Set Orienteering Problem and its application to other Orienteering Problem variants"],"prefix":"10.1016","volume":"276","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-8549-4932","authenticated-orcid":false,"given":"Robert","family":"P\u011bni\u010dka","sequence":"first","affiliation":[]},{"given":"Jan","family":"Faigl","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Saska","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.ejor.2019.01.047_bib0001","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/j.ejor.2014.04.006","article-title":"The clustered orienteering problem","volume":"238","author":"Angelelli","year":"2014","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.047_bib0002","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1016\/j.ejor.2017.11.009","article-title":"The set orienteering problem","volume":"267","author":"Archetti","year":"2018","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.047_bib0003","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/2372560","article-title":"On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents","volume":"79","author":"Dubins","year":"1957","journal-title":"American Journal of Mathematics"},{"key":"10.1016\/j.ejor.2019.01.047_bib0004","series-title":"Proceedings of the IEEE international conference on systems, man, and cybernetics","first-page":"1315","article-title":"Self-organizing map-based solution for the orienteering problem with neighborhoods","author":"Faigl","year":"2016"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.047_bib0005","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":"Transportation Science"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.047_bib0006","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.45.3.378","article-title":"A branch-and-cut algorithm for the symmetric generalized traveling salesman problem","volume":"45","author":"Fischetti","year":"1997","journal-title":"Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.047_bib0007","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"},{"issue":"12","key":"10.1016\/j.ejor.2019.01.047_bib0008","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1057\/jors.1996.190","article-title":"Some applications of the generalized travelling salesman problem","volume":"47","author":"Laporte","year":"1996","journal-title":"The Journal of the Operational Research Society"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.047_bib0009","first-page":"61","article-title":"Generalized travelling salesman problem through n sets of nodes: An integer programming approach","volume":"21","author":"Laporte","year":"1983","journal-title":"INFOR: Information Systems and Operational Research"},{"issue":"10","key":"10.1016\/j.ejor.2019.01.047_bib0010","doi-asserted-by":"crossref","first-page":"7664","DOI":"10.3390\/s91007664","article-title":"Connectivity, coverage and placement in wireless sensor networks","volume":"9","author":"Li","year":"2009","journal-title":"Sensors"},{"issue":"11","key":"10.1016\/j.ejor.2019.01.047_bib0011","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":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.047_bib0012","doi-asserted-by":"crossref","first-page":"1210","DOI":"10.1109\/LRA.2017.2666261","article-title":"Dubins orienteering problem","volume":"2","author":"P\u011bni\u010dka","year":"2017","journal-title":"IEEE Robotics and Automation Letters"},{"key":"10.1016\/j.ejor.2019.01.047_bib0013","series-title":"Proceedings of the International conference on unmanned aircraft systems","first-page":"1555","article-title":"Dubins orienteering problem with neighborhoods","author":"P\u011bni\u010dka","year":"2017"},{"key":"10.1016\/j.ejor.2019.01.047_bib0014","series-title":"Proceedings of the 21th international symposium on computer and information sciences","first-page":"134","article-title":"Variable neighborhood search for the orienteering problem","author":"Sevkli","year":"2006"},{"issue":"9","key":"10.1016\/j.ejor.2019.01.047_bib0015","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1057\/jors.1984.162","article-title":"Heuristic methods applied to orienteering","volume":"35","author":"Tsiligirides","year":"1984","journal-title":"The Journal of the Operational Research Society"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.047_bib0016","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":"5","key":"10.1016\/j.ejor.2019.01.047_bib0017","doi-asserted-by":"crossref","first-page":"1106","DOI":"10.1109\/TRO.2016.2593450","article-title":"Correlated orienteering problem and its application to persistent monitoring tasks","volume":"32","author":"Yu","year":"2016","journal-title":"IEEE Transactions on Robotics"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221719300827?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221719300827?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T16:43:25Z","timestamp":1569257005000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221719300827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["S0377221719300827"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2019.01.047","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2019,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Variable Neighborhood Search for the Set Orienteering Problem and its application to other Orienteering Problem variants","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.01.047","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"}]}}