{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T08:22:13Z","timestamp":1751098933460,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319684956"},{"type":"electronic","value":"9783319684963"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68496-3_1","type":"book-chapter","created":{"date-parts":[[2017,9,26]],"date-time":"2017-09-26T08:25:00Z","timestamp":1506414300000},"page":"3-18","source":"Crossref","is-referenced-by-count":8,"title":["An Effective Large Neighborhood Search for the Team Orienteering Problem with Time Windows"],"prefix":"10.1007","author":[{"given":"Verena","family":"Schmid","sequence":"first","affiliation":[]},{"given":"Jan Fabian","family":"Ehmke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,27]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0305-0548(94)90065-5","volume":"21","author":"SE Butt","year":"1994","unstructured":"Butt, S.E., Cavalier, T.M.: A heuristic for the multiple tour maximum collection problem. Computers & Operations Research 21, 101\u2013111 (1994)","journal-title":"Computers & Operations Research"},{"key":"1_CR2","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/0377-2217(95)00035-6","volume":"88","author":"I Chao","year":"1996","unstructured":"Chao, I., Golden, B., Wasil, E.: The team orienteering problem. European Journal of Operational Research 88, 475\u2013489 (1996)","journal-title":"European Journal of Operational Research"},{"key":"1_CR3","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"JF Cordeau","year":"1997","unstructured":"Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30, 105\u2013119 (1997)","journal-title":"Networks"},{"key":"1_CR4","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/S0377-2217(97)00289-0","volume":"106","author":"M Gendreau","year":"1998","unstructured":"Gendreau, M., Laporte, G., Semet, F.: A tabu search heuristic for the undirected selective travelling salesman problem. European Journal of Operational Research 106, 539\u2013545 (1998)","journal-title":"European Journal of Operational Research"},{"key":"1_CR5","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","volume":"34","author":"B Golden","year":"1987","unstructured":"Golden, B., Levy, L., Vohra, R.: The orienteering problem. Naval Research Logistics 34, 307\u201318 (1987)","journal-title":"Naval Research Logistics"},{"key":"1_CR6","unstructured":"Gunawan, A., Lau, H.C., Lu, K.: Sails: hybrid algorithm for the team orienteering problem with time windows. In: Proceedings of the 7th Multidisciplinary International Scheduling Conference (MISTA 2015), Prague, Czech Republic, pp. 276\u2013295 (2015)"},{"key":"1_CR7","unstructured":"Gunawan, A., Lau, H.C., Lu, K.: Well-tuned ils for extended team orienteering problem with time windows. LARC Technical Report Series (2015). \nhttp:\/\/centres.smu.edu.sg\/larc\/files\/2015\/09\/Well-Tuned-ILS-for-Extended-Team-Orienteering-Problem-with-Time-WindowsTR-01-15.pdf"},{"issue":"2","key":"1_CR8","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ejor.2016.04.059","volume":"255","author":"A Gunawan","year":"2016","unstructured":"Gunawan, A., Lau, H.C., Vansteenwegen, P.: Orienteering problem: A survey of recent variants, solution approaches and applications. European Journal of Operational Research 255(2), 315\u2013332 (2016)","journal-title":"European Journal of Operational Research"},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/j.ejor.2013.06.011","volume":"232","author":"Q Hu","year":"2014","unstructured":"Hu, Q., Lim, A.: An iterative three-component heuristic for the team orienteering problem with time windows. European Journal of Operational Research 232, 276\u2013286 (2014)","journal-title":"European Journal of Operational Research"},{"key":"1_CR10","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ejor.2012.01.030","volume":"220","author":"N Labadie","year":"2012","unstructured":"Labadie, N., Mansini, R., Melechovsky, J., Wolfler Calvo, R.: The team orienteering problem with time windows: An lp-based granular variable neighborhood search. European Journal of Operational Research 220, 15\u201327 (2012)","journal-title":"European Journal of Operational Research"},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1007\/s10732-010-9153-z","volume":"17","author":"N Labadie","year":"2011","unstructured":"Labadie, N., Melechovsk\u00fd, J., Wolfler Calvo, R.: Hybridized evolutionary local search algorithm for the team orienteering problem with time windows. Journal of Heuristics 17, 729\u2013753 (2011)","journal-title":"Journal of Heuristics"},{"key":"1_CR12","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.ejor.2011.08.024","volume":"217","author":"SW Lin","year":"2012","unstructured":"Lin, S.W., Yu, V.F.: A simulated annealing heuristic for the team orienteering problem with time windows. European Journal of Operational Research 217, 94\u2013107 (2012)","journal-title":"European Journal of Operational Research"},{"key":"1_CR13","unstructured":"Mansini, R., Pelizzari, M., Wolfler Calvo, R.: A granular variable neighborhood search heuristics for the tour orienteering problem with time windows. Technical Report 2008\u201302-52, Dipartimento di Elettronica per l\u2019Automazione, Universit\u00e0 di Brescia (2008)"},{"key":"1_CR14","unstructured":"Montemanni, R., Gambardella, L.: Ant colony system for team orienteering problems with time windows. Foundations of Computing and Decision Sciences 34 (2009)"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Pisinger, D., Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, pp. 399\u2013419. Springer (2010)","DOI":"10.1007\/978-1-4419-1665-5_13"},{"key":"1_CR16","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1016\/j.cor.2008.01.003","volume":"36","author":"G Righini","year":"2009","unstructured":"Righini, G., Salani, M.: Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming. Computers & Operations Research 36, 1191\u20131203 (2009)","journal-title":"Computers & Operations Research"},{"key":"1_CR17","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1287\/ijoc.4.2.146","volume":"4","author":"M Savelsbergh","year":"1992","unstructured":"Savelsbergh, M.: The vehicle routing problem with time windows: Minimizing route duration. INFORMS Journal on Computing 4, 146\u2013154 (1992)","journal-title":"INFORMS Journal on Computing"},{"key":"1_CR18","unstructured":"Schmid, V.: Hybrid metaheuristic for the team orienteering problem with time windows and service time dependent profits. Presentation at VeRoLog 2014, Oslo, Norway (2014)"},{"key":"1_CR19","unstructured":"Schmid, V., G\u00f3mez Rodr\u00eduez, J.S.: On solving routing problems with time windows given dynamic service times and profits. Presentation at 26th European conference on operational research, Rome, Italy (2013)"},{"key":"1_CR20","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1006\/jcph.1999.6413","volume":"159","author":"G Schrimpf","year":"2000","unstructured":"Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., Dueck, G.: Record breaking optimization results using the ruin and recreate principle. Journal of Computational Physics 159, 139\u2013171 (2000)","journal-title":"Journal of Computational Physics"},{"key":"1_CR21","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"53","author":"M Solomon","year":"1987","unstructured":"Solomon, M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 53, 254\u2013265 (1987)","journal-title":"Operations Research"},{"key":"1_CR22","doi-asserted-by":"crossref","first-page":"1379","DOI":"10.1016\/j.cor.2003.11.008","volume":"32","author":"H Tang","year":"2005","unstructured":"Tang, H., Miller-Hooks, H.: A tabu search heuristic for the team orienteering problem. Computers & Operations Research 32, 1379\u20131407 (2005)","journal-title":"Computers & Operations Research"},{"key":"1_CR23","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/j.cor.2009.05.012","volume":"37","author":"F Tricoire","year":"2010","unstructured":"Tricoire, F., Romauch, M., Doerner, K.F., Hartl, R.F.: Heuristics for the multi-period orienteering problem with multiple time windows. Computers & Operations Research 37, 351\u2013367 (2010)","journal-title":"Computers & Operations Research"},{"key":"1_CR24","doi-asserted-by":"crossref","first-page":"3281","DOI":"10.1016\/j.cor.2009.03.008","volume":"36","author":"P Vansteenwegen","year":"2009","unstructured":"Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., Van Oudheusden, D.: Iterated local search for the team orienteering problem with time windows. Computers & Operations Research 36, 3281\u20133290 (2009)","journal-title":"Computers & Operations Research"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68496-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,2]],"date-time":"2017-10-02T11:53:58Z","timestamp":1506945238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68496-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319684956","9783319684963"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68496-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}