{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T13:55:37Z","timestamp":1723211737514},"reference-count":35,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1016\/j.ejor.2012.01.030","type":"journal-article","created":{"date-parts":[[2012,1,25]],"date-time":"2012-01-25T19:48:54Z","timestamp":1327520934000},"page":"15-27","source":"Crossref","is-referenced-by-count":128,"title":["The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search"],"prefix":"10.1016","volume":"220","author":[{"given":"Nacima","family":"Labadie","sequence":"first","affiliation":[]},{"given":"Renata","family":"Mansini","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Melechovsk\u00fd","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Wolfler Calvo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2012.01.030_b0005","doi-asserted-by":"crossref","unstructured":"H. Bouly, D.C. Dang, A. Moukrim, A memetic algorithm for the team orienteering problem, 4OR: A Quarterly Journal of Operations Research (2009) (published online).","DOI":"10.1007\/s10288-008-0094-4"},{"issue":"3","key":"10.1016\/j.ejor.2012.01.030_b0010","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: A Quarterly Journal of Operations Research"},{"key":"10.1016\/j.ejor.2012.01.030_b0015","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","article-title":"An exact algorithm for the maximum clique problem","volume":"9","author":"Carraghan","year":"1990","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.ejor.2012.01.030_b0020","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"},{"issue":"3","key":"10.1016\/j.ejor.2012.01.030_b0025","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","article-title":"The team orienteering problem","volume":"88","author":"Chao","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.030_b0030","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","article-title":"A tabu search heuristic for periodic and multidepot problems","volume":"30","author":"Cordeau","year":"1997","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2012.01.030_b0035","unstructured":"J.J. Dongarra, Performance of various computers using standard linear equations software in a FORTRAN environment, Technical Report of the Electrical Engineering and Computer Science Department, University of Tennessee, 2009. ."},{"key":"10.1016\/j.ejor.2012.01.030_b0040","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/trsc.1030.0079","article-title":"Traveling Salesman Problem with profits: an overview","volume":"39","author":"Feillet","year":"2005","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2012.01.030_b0045","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1002\/(SICI)1097-0037(199812)32:4<263::AID-NET3>3.0.CO;2-Q","article-title":"The selective traveling salesman problem","volume":"32","author":"Gendreau","year":"1998","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2012.01.030_b0050","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","article-title":"The orienteering problem","volume":"34","author":"Golden","year":"1987","journal-title":"Naval Research Logistics"},{"key":"10.1016\/j.ejor.2012.01.030_b0055","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","article-title":"Variable Neighborhood Search: principles and applications","volume":"130","author":"Hansen","year":"2001","journal-title":"European Journal of Operational Research"},{"issue":"43\/6","key":"10.1016\/j.ejor.2012.01.030_b0060","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1057\/jors.1992.88","article-title":"The Orienteering Problem with Time Windows","author":"Kantor","year":"1992","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"10.1016\/j.ejor.2012.01.030_b0065","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1016\/j.cie.2007.10.001","article-title":"Ants can solve the team orienteering problem","volume":"54","author":"Ke","year":"2008","journal-title":"Computers Industrial Engineering"},{"key":"10.1016\/j.ejor.2012.01.030_b0070","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0377-2217(89)90388-3","article-title":"Algorithms to solve the orienteering problem: a comparison","volume":"41","author":"Keller","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.030_b0075","series-title":"Local Search in Combinatorial Optimization","first-page":"311","article-title":"Vehicle routing: handling edge exchanges","author":"Kindervater","year":"1997"},{"key":"10.1016\/j.ejor.2012.01.030_b0080","first-page":"219","article-title":"An effective hybrid evolutionary local search for orienteering and team orienteering problem with time windows","volume":"vol. 6239","author":"Labadie","year":"2010"},{"issue":"6","key":"10.1016\/j.ejor.2012.01.030_b0085","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1007\/s10732-010-9153-z","article-title":"Hybridized evolutionary local search algorithm for the team orienteering problem with time windows","volume":"17","author":"Labadie","year":"2011","journal-title":"Journal of Heuristics"},{"key":"10.1016\/j.ejor.2012.01.030_b0090","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0166-218X(90)90100-Q","article-title":"The selective traveling salesman problem","volume":"26","author":"Laporte","year":"1990","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2012.01.030_b0095","unstructured":"R. Mansini, M. Pelizzari, R. Wolfler Calvo, A Granular Variable Neighborhood Search for the Tour Orieentering Problem with Time Windows, Technical Report of the Department of Electronics for Automation, University of Brescia, RT 2006-02-52, 2006."},{"key":"10.1016\/j.ejor.2012.01.030_b0100","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 and Operations Research"},{"key":"10.1016\/j.ejor.2012.01.030_b0105","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","article-title":"Integer programming formulations and traveling salesman problems","volume":"7","author":"Miller","year":"1960","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"4","key":"10.1016\/j.ejor.2012.01.030_b0110","first-page":"287","article-title":"An ant colony system for team orienteering problem with time windows","volume":"34","author":"Montemanni","year":"2009","journal-title":"Foundations of Computing and Decision Sciences"},{"key":"10.1016\/j.ejor.2012.01.030_b0115","doi-asserted-by":"crossref","unstructured":"R. Montemanni, D. Weyland, L.M. Gambardella, An enhanced ant colony system for the team orienteering problem with time windows, in: Proceedings of IEEE ISCCS 2011, International Symposium on Computer Science and Society, 2011, pp. 381\u2013384, ISBN: 978-1-4577-0644-8.","DOI":"10.1109\/ISCCS.2011.95"},{"issue":"4","key":"10.1016\/j.ejor.2012.01.030_b0120","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1016\/j.cor.2008.01.003","article-title":"Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming","volume":"36","author":"Righini","year":"2009","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2012.01.030_b0125","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.22.1.1","article-title":"Time windows constrained routing and scheduling problems","volume":"22","author":"Solomon","year":"1998","journal-title":"Transportation Science"},{"issue":"11","key":"10.1016\/j.ejor.2012.01.030_b0130","doi-asserted-by":"crossref","first-page":"1853","DOI":"10.1016\/j.cor.2009.05.002","article-title":"A path relinking approach for the team orienteering problem","volume":"37","author":"Souffriau","year":"2010","journal-title":"Computers and Operations Research"},{"issue":"6","key":"10.1016\/j.ejor.2012.01.030_b0135","doi-asserted-by":"crossref","first-page":"1379","DOI":"10.1016\/j.cor.2003.11.008","article-title":"A tabu search heuristic for the team orienteering problem","volume":"32","author":"Tang","year":"2005","journal-title":"Computers and Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2012.01.030_b0140","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/ijoc.15.4.333.24890","article-title":"The Granular Tabu Search and its application to the Vehicle Routing Problem","volume":"15","author":"Toth","year":"2003","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"10.1016\/j.ejor.2012.01.030_b0145","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/j.cor.2009.05.012","article-title":"Heuristics for the multi-period orienteering problem with multiple time windows","volume":"37","author":"Tricoire","year":"2010","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2012.01.030_b0150","doi-asserted-by":"crossref","unstructured":"F. Tricoire, M. Romauch, K.F. Doerner, R.F. Hartl, Addendum to the paper \u201cHeuristics for the multi-period orienteering problem with multiple time windows\u201d, 2010. .","DOI":"10.1016\/j.cor.2009.05.012"},{"key":"10.1016\/j.ejor.2012.01.030_b0155","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1057\/jors.1984.162","article-title":"Heuristic methods applied to orienteering","volume":"35","author":"Tsiligrides","year":"1984","journal-title":"Journal of Operational Research Society"},{"issue":"1","key":"10.1016\/j.ejor.2012.01.030_b0160","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.ejor.2008.02.037","article-title":"A guided local search metaheuristic for the team orienteering problem","volume":"196","author":"Vansteenwegen","year":"2009","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"10.1016\/j.ejor.2012.01.030_b0165","doi-asserted-by":"crossref","first-page":"3281","DOI":"10.1016\/j.cor.2009.03.008","article-title":"Iterated local search for the team orienteering problem with time windows","volume":"36","author":"Vansteenwegen","year":"2009","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2012.01.030_b0170","series-title":"Metaheuristics in the Service Industry","first-page":"15","article-title":"Metaheuristics for tourist trip planning","volume":"vol. 624","author":"Vansteenwegen","year":"2009"},{"issue":"1","key":"10.1016\/j.ejor.2012.01.030_b0175","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"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221712000653?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221712000653?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T22:59:00Z","timestamp":1561244340000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221712000653"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["S0377221712000653"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2012.01.030","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}