{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:35:34Z","timestamp":1743039334665,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030729035"},{"type":"electronic","value":"9783030729042"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-72904-2_5","type":"book-chapter","created":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T11:03:03Z","timestamp":1616756583000},"page":"68-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Improvement Heuristic Based on Variable Neighborhood Search for a Dynamic Orienteering Problem"],"prefix":"10.1007","author":[{"given":"Hoang Thanh","family":"Le","sequence":"first","affiliation":[]},{"given":"Martin","family":"Middendorf","sequence":"additional","affiliation":[]},{"given":"Yuhui","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,27]]},"reference":[{"issue":"10","key":"5_CR1","doi-asserted-by":"publisher","first-page":"12439","DOI":"10.1016\/j.eswa.2011.04.025","volume":"38","author":"RA Abbaspour","year":"2011","unstructured":"Abbaspour, R.A., Samadzadegan, F.: Time-dependent personal tour planning and scheduling in metropolises. Expert Syst. Appl. 38(10), 12439\u201312452 (2011)","journal-title":"Expert Syst. Appl."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.cor.2016.12.025","volume":"81","author":"E Angelelli","year":"2017","unstructured":"Angelelli, E., Archetti, C., Filippi, C., Vindigni, M.: The probabilistic orienteering problem. Comput. Oper. Res. 81, 269\u2013281 (2017)","journal-title":"Comput. Oper. Res."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1287\/ijoc.15.1.82.15157","volume":"15","author":"D Applegate","year":"2003","unstructured":"Applegate, D., Cook, W., Rohe, A.: Chained Lin-Kernighan for large traveling salesman problems. INFORMS J. Comput. 15, 82\u201392 (2003)","journal-title":"INFORMS J. Comput."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Archetti, C., Speranza, M.G., Vigo, D.: Vehicle routing problems with profits. In: Toth, P., Vigo, D. (eds.) Vehicle Routing, pp. 273\u2013297 (2014)","DOI":"10.1137\/1.9781611973594.ch10"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"1800","DOI":"10.1057\/jors.2013.156","volume":"65","author":"V Campos","year":"2014","unstructured":"Campos, V., Marti, R., S\u00e1nchez-Oro Calvo, J., Duarte, A.: Grasp with path relinking for the orienteering problem. J. Oper. Res. Soc. 65, 1800\u20131813 (2014)","journal-title":"J. Oper. Res. Soc."},{"key":"5_CR6","unstructured":"Cook, W., Applegate, D., Bixby, R., Chv\u00e1tal, V.: Concorde TSP solver (2005). http:\/\/www.math.uwaterloo.ca\/tsp\/concorde\/downloads\/downloads.htm"},{"issue":"5","key":"5_CR7","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1002\/(SICI)1520-6750(199608)43:5<749::AID-NAV10>3.0.CO;2-J","volume":"43","author":"E Erkut","year":"1996","unstructured":"Erkut, E., Zhang, J.: The maximum collection problem with time-dependent rewards. Naval Res. Logist. 43(5), 749\u2013763 (1996)","journal-title":"Naval Res. Logist."},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0020-0190(01)00313-1","volume":"83","author":"FV Fomin","year":"2002","unstructured":"Fomin, F.V., Lingas, A.: Approximation algorithms for time-dependent orienteering. Inf. Process. Lett. 83(2), 57\u201362 (2002)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s10732-014-9242-5","volume":"20","author":"D Gavalas","year":"2014","unstructured":"Gavalas, D., Konstantopoulos, C., Pantziou, G.: A survey on algorithmic approaches for solving tourist trip design problems. J. Heuristics 20(3), 291\u2013328 (2014)","journal-title":"J. Heuristics"},{"key":"5_CR10","doi-asserted-by":"publisher","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 Res. Logist. 34, 307\u2013318 (1987)","journal-title":"Naval Res. Logist."},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","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. Eur. J. Oper. Res. 255(2), 315\u2013332 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., P\u00e9rez, J.M.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175, 367\u2013407 (2010). https:\/\/doi.org\/10.1007\/s10479-009-0657-6","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"5_CR13","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1080\/07408170701592481","volume":"40","author":"T \u0130lhan","year":"2008","unstructured":"\u0130lhan, T., Iravani, S.M.R., Daskin, M.S.: The orienteering problem with stochastic profits. IIE Trans. 40(4), 406\u2013421 (2008)","journal-title":"IIE Trans."},{"key":"5_CR14","unstructured":"INRIX: Durchschnittliche Geschwindigkeit* im Automobilverkehr in ausgew\u00e4hlten deutschen St\u00e4dten im Jahr 2018 (in Meilen pro Stunde). Statista (2019). https:\/\/de.statista.com\/statistik\/daten\/studie\/994676\/umfrage\/innerstaedtische-durchschnittsgeschwindigkeit-im-autoverkehr-in-deutschen-staedten\/"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Kara, I., Bicakci, P.S., Derya, T.: New formulations for the orienteering problem. In: 3rd Global Conference on Business, Economics, Management and Tourism, vol. 39, pp. 849\u2013854 (2016)","DOI":"10.1016\/S2212-5671(16)30252-0"},{"key":"5_CR16","unstructured":"Karlin, M., Heikkil\u00e4, J.: OSM-graph-parser (2017). https:\/\/github.com\/rovaniemi\/osm-graph-parser"},{"issue":"4","key":"5_CR17","first-page":"515","volume":"31","author":"S Kataoka","year":"1988","unstructured":"Kataoka, S., Morito, S.: An algorithm for single constraint maximum collection problem. J. Oper. Res. Soc. Jpn. 31(4), 515\u2013560 (1988)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/s10732-016-9316-7","volume":"22","author":"M Keshtkaran","year":"2016","unstructured":"Keshtkaran, M., Ziarati, K.: An efficient evolutionary algorithm for the orienteering problem. J. Heuristics 22, 699\u2013726 (2016)","journal-title":"J. Heuristics"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.cor.2017.09.003","volume":"90","author":"G Kobeaga","year":"2018","unstructured":"Kobeaga, G., Merino, M., Lozano, J.A.: An efficient evolutionary algorithm for the orienteering problem. Comput. Oper. Res. 90, 42\u201359 (2018)","journal-title":"Comput. Oper. Res."},{"key":"5_CR20","unstructured":"Kobeaga, G., Merino, M., Lozano, J.A.: OPLib: test instances for the orienteering problem (2018). https:\/\/github.com\/bcamath-ds\/OPLib\/tree\/master\/instances"},{"issue":"2","key":"5_CR21","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0166-218X(90)90100-Q","volume":"26","author":"G Laporte","year":"1990","unstructured":"Laporte, G., Martello, S.: The selective travelling salesman problem. Discrete Appl. Math. 26(2), 193\u2013207 (1990)","journal-title":"Discrete Appl. Math."},{"key":"5_CR22","unstructured":"Le, H.T.: DynamicOrienteeringAlgorithms (2020). https:\/\/github.com\/L-HT\/DynamicOrienteeringAlgorithms\/"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/s10957-015-0767-z","volume":"168","author":"M Mann","year":"2015","unstructured":"Mann, M., Zion, B., Rubinstein, D., Linker, R., Shmulevich, I.: The orienteering problem with time windows applied to robotic melon harvesting. J. Optim. Theory Appl. 168, 246\u2013267 (2015). https:\/\/doi.org\/10.1007\/s10957-015-0767-z","journal-title":"J. Optim. Theory Appl."},{"key":"5_CR24","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-319-18167-7_10","volume-title":"Modelling, Computation and Optimization in Information Systems and Management Sciences","author":"Y Marinakis","year":"2015","unstructured":"Marinakis, Y., Politis, M., Marinaki, M., Matsatsinis, N.: A memetic-GRASP algorithm for the solution of the orienteering problem. In: Le Thi, H.A., Pham Dinh, T., Nguyen, N.T. (eds.) Modelling, Computation and Optimization in Information Systems and Management Sciences. AISC, vol. 360, pp. 105\u2013116. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18167-7_10"},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1007\/s00453-011-9509-2","volume":"60","author":"V Nagarajan","year":"2011","unstructured":"Nagarajan, V., Ravi, R.: The directed orienteering problem. Algorithmica 60, 1017\u20131030 (2011). https:\/\/doi.org\/10.1007\/s00453-011-9509-2","journal-title":"Algorithmica"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2012.05.001","volume":"6","author":"TT Nguyen","year":"2012","unstructured":"Nguyen, T.T., Yang, S., Branke, J.: Evolutionary dynamic optimization: a survey of the state of the art. Swarm Evol. Comput. 6, 1\u201324 (2012)","journal-title":"Swarm Evol. Comput."},{"key":"5_CR27","unstructured":"OpenStreetMap contributors: planet dump (2020). https:\/\/planet.osm.org. https:\/\/www.openstreetmap.org"},{"key":"5_CR28","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s10479-016-2278-1","volume":"253","author":"K Ostrowski","year":"2017","unstructured":"Ostrowski, K., Karbowska-Chilinska, J., Koszelew, J., Zabielski, P.: Evolution-inspired local improvement algorithm solving orienteering problem. Ann. Oper. Res. 253, 519\u2013543 (2017). https:\/\/doi.org\/10.1007\/s10479-016-2278-1","journal-title":"Ann. Oper. Res."},{"key":"5_CR29","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s11721-009-0029-5","volume":"3","author":"M Schilde","year":"2009","unstructured":"Schilde, M., Doerner, K.F., Hartl, R.F., Kiechle, G.: Metaheuristics for the bi-objective orienteering problem. Swarm Intell. 3, 179\u2013201 (2009). https:\/\/doi.org\/10.1007\/s11721-009-0029-5","journal-title":"Swarm Intell."},{"key":"5_CR30","unstructured":"Schneider, W.: Bbbike.org (2020). https:\/\/download.bbbike.org\/osm\/"},{"key":"5_CR31","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1057\/jors.1984.162","volume":"35","author":"T Tsiligiridis","year":"1984","unstructured":"Tsiligiridis, T.: Heuristic methods applied to orienteering. J. Oper. Res. Soc. 35, 797\u2013809 (1984). https:\/\/doi.org\/10.1057\/jors.1984.162","journal-title":"J. Oper. Res. Soc."},{"issue":"6","key":"5_CR32","doi-asserted-by":"publisher","first-page":"6540","DOI":"10.1016\/j.eswa.2010.11.085","volume":"38","author":"P Vansteenwegen","year":"2011","unstructured":"Vansteenwegen, P., Souffriau, W., Berghe, G.V., Oudheusden, D.V.: The city trip planner: an expert system for tourists. Expert Syst. Appl. 38(6), 6540\u20136546 (2011)","journal-title":"Expert Syst. Appl."},{"key":"5_CR33","series-title":"Operations Research\/Computer Science Interfaces","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-0-387-77778-8_12","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges","author":"X Wang","year":"2008","unstructured":"Wang, X., Golden, B.L., Wasil, E.A.: Using a genetic algorithm to solve the generalized orienteering problem. In: Golden, B., Raghavan, S., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges. ORCS, vol. 43, pp. 263\u2013274. Springer, Boston (2008). https:\/\/doi.org\/10.1007\/978-0-387-77778-8_12"},{"issue":"3","key":"5_CR34","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/MCI.2014.2326101","volume":"9","author":"T Weise","year":"2014","unstructured":"Weise, T., et al.: Benchmarking optimization algorithms: an open source framework for the traveling salesman problem. IEEE Comput. Intell. Mag. 9(3), 40\u201352 (2014)","journal-title":"IEEE Comput. Intell. Mag."},{"key":"5_CR35","unstructured":"Your Europe: Road transportation workers (2020). https:\/\/europa.eu\/youreurope\/business\/human-resources\/transport-sector-workers\/road-transportation-workers"},{"issue":"3","key":"5_CR36","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1287\/trsc.2017.0761","volume":"52","author":"S Zhang","year":"2018","unstructured":"Zhang, S., Ohlmann, J.W., Thomas, B.W.: Dynamic orienteering on a network of queues. Transp. Sci. 52(3), 691\u2013706 (2018)","journal-title":"Transp. Sci."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-72904-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T23:05:48Z","timestamp":1617231948000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-72904-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030729035","9783030729042"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-72904-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 April 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 April 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2021\/evocop\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}