{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:29:45Z","timestamp":1743067785051,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319591049"},{"type":"electronic","value":"9783319591056"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59105-6_5","type":"book-chapter","created":{"date-parts":[[2017,5,16]],"date-time":"2017-05-16T07:45:06Z","timestamp":1494920706000},"page":"50-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Evolutionary Algorithm for the Time-Dependent Orienteering Problem"],"prefix":"10.1007","author":[{"given":"Krzysztof","family":"Ostrowski","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,17]]},"reference":[{"issue":"9","key":"5_CR1","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1057\/jors.1984.162","volume":"35","author":"T Tsiligirides","year":"1984","unstructured":"Tsiligirides, T.: Heuristic methods applied to orienteering. J. Oper. Res. Soc. 35(9), 797\u2013809 (1984)","journal-title":"J. Oper. Res. Soc."},{"key":"5_CR2","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. Logistics 34, 307\u2013318 (1987)","journal-title":"Naval Res. Logistics"},{"key":"5_CR3","unstructured":"Mahfoud, S.W.: Crowding and preselection revisited. In: Proceedings of the 2nd International Conference on Parallel Problem Solving from Nature (PPSN II), Brussels, Belgium, 1992, pp. 27\u201336, Elsevier, Amsterdam (1992)"},{"key":"5_CR4","doi-asserted-by":"publisher","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.: Theory and methodology - a fast and effective heuristic for the orienteering problem. Eur. J. Oper. Res. 88, 475\u2013489 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"5_CR5","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/(SICI)1097-0037(199812)32:4<263::AID-NET3>3.0.CO;2-Q","volume":"32","author":"M Gendreau","year":"1998","unstructured":"Gendreau, M., Laporte, G., Semet, F.: A branch-and-cut algorithm for the undirected selective traveling salesman problem. Networks 32(4), 263\u2013273 (1998)","journal-title":"Networks"},{"key":"5_CR6","doi-asserted-by":"publisher","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. Eur. J. Oper. Res. 106, 539\u2013545 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/ijoc.10.2.133","volume":"10","author":"M Fischetti","year":"1998","unstructured":"Fischetti, M., Salazar, J., Toth, P.: Solving the orienteering problem through branch-and-cut. Informs J. Comput. 10, 133\u2013148 (1998)","journal-title":"Informs J. Comput."},{"issue":"2","key":"5_CR8","first-page":"1","volume":"4","author":"M Tasgetiren","year":"2001","unstructured":"Tasgetiren, M.: A genetic algorithm with an adaptive penalty function for the orienteering problem. J. Econ. Soc. Res. 4(2), 1\u201326 (2001)","journal-title":"J. Econ. Soc. Res."},{"key":"5_CR9","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, 57\u201362 (2002)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.ejor.2008.02.037","volume":"196","author":"P Vansteenwegen","year":"2009","unstructured":"Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., Oudheusden, D.V.: A guided local search metaheuristic for the team orienteering problem. Eur. J. Oper. Res. 196(1), 118\u2013127 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR11","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., Hartl, R., Kiechle, G.: Metaheuristics for the biobjective orienteering problem. Swarm Intell. 3, 179\u2013201 (2009)","journal-title":"Swarm Intell."},{"key":"5_CR12","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., Stutzle, T.: ParamILS: an automatic algorithm configuration framework. J. Artif. Intell. Res. 36, 267\u2013306 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"5_CR13","first-page":"1","volume":"175","author":"J Li","year":"2011","unstructured":"Li, J.: Model and algorithm for time-dependent team orienteering problem. Commun. Comput. Inf. Sci. 175, 1\u20137 (2011)","journal-title":"Commun. Comput. Inf. Sci."},{"issue":"6","key":"5_CR14","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., Vanden Berghe, G., Van Oudheusden, D.: The city trip planner: an expert system for tourists. Expert Syst. Appl. 38(6), 6540\u20136546 (2011)","journal-title":"Expert Syst. Appl."},{"issue":"10","key":"5_CR15","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."},{"issue":"3","key":"5_CR16","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1016\/j.cor.2011.03.020","volume":"40","author":"A Garcia","year":"2013","unstructured":"Garcia, A., Vansteenwegen, P., Arbelaitz, O., Souffriau, W., Linaza, M.T.: Integrating public transportation in personalised electronic tourist guides. Comput. Oper. Res. 40(3), 758\u2013774 (2013)","journal-title":"Comput. Oper. Res."},{"key":"5_CR17","first-page":"1","volume":"156","author":"V Campos","year":"2013","unstructured":"Campos, V., Marti, R., Sanchez-Oro, J., Duarte, A.: Grasp with path relinking for the orienteering problem. J. Oper. Res. Soc. 156, 1\u201314 (2013)","journal-title":"J. Oper. Res. Soc."},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-40495-5_36","volume-title":"Computational Collective Intelligence. Technologies and Applications","author":"J Koszelew","year":"2013","unstructured":"Koszelew, J., Ostrowski, K.: A genetic algorithm with multiple mutation which solves orienteering problem in large networks. In: B\u01cedic\u01ce, C., Nguyen, N.T., Brezovan, M. (eds.) ICCCI 2013. LNCS, vol. 8083, pp. 356\u2013366. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-40495-5_36"},{"issue":"2","key":"5_CR19","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.ejor.2013.11.038","volume":"236","author":"C Verbeeck","year":"2014","unstructured":"Verbeeck, C., S\u00f6rensen, K., Aghezzaf, E.H., Vansteenwegen, P.: A fast solution method for the time-dependent orienteering problem. Eur. J. Oper. Res. 236(2), 419\u2013432 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR20","unstructured":"Gunawan, A., Yuan, Z., Lau, H.C.: A mathematical model and metaheuristics for time dependent orienteering problem. Angewandte Mathematik und Optimierung Schriftenreihe AMOS 2014 (2014)"},{"key":"5_CR21","unstructured":"Ostrowski, K.: Comparison of different graph weights representations used to solve the time-dependent orienteering problem. Trends in Contemporary Computer Science, Podlasie 2014, pp. 144\u2013154. Bialystok University of Technology Publishing Office (2014)"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-319-15705-4_4","volume-title":"Intelligent Information and Database Systems","author":"P Zabielski","year":"2015","unstructured":"Zabielski, P., Karbowska-Chilinska, J., Koszelew, J., Ostrowski, K.: A genetic algorithm with grouping selection and searching operators for the orienteering problem. In: Nguyen, N.T., Trawi\u0144ski, B., Kosala, R. (eds.) ACIIDS 2015. LNCS, vol. 9012, pp. 31\u201340. Springer, Cham (2015). doi:10.1007\/978-3-319-15705-4_4"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.cor.2015.03.016","volume":"62","author":"D Gavalas","year":"2015","unstructured":"Gavalas, D., Konstantopoulos, C., Mastakas, K., Pantziou, G., Vathis, N.: Heuristics for the time dependent team orienteering problem: application to tourist route planning. Comput. Oper. Res. 62, 36\u201350 (2015)","journal-title":"Comput. Oper. Res."},{"key":"5_CR24","first-page":"53","volume":"12","author":"K Ostrowski","year":"2015","unstructured":"Ostrowski, K.: Parameters tuning of evolutionary algorithm for the orienteering problem. Adv. Comput. Sci. Res. 12, 53\u201378 (2015)","journal-title":"Adv. Comput. Sci. Res."},{"key":"5_CR25","doi-asserted-by":"publisher","unstructured":"Ostrowski, K., Karbowska-Chilinska, J., Koszelew, J., Zabielski, P.: Evolution-inspired local improvement algorithm solving orienteering problem. Ann. Oper. Res. (2016). doi:10.1007\/s10479-016-2278-1","DOI":"10.1007\/s10479-016-2278-1"}],"container-title":["Lecture Notes in Computer Science","Computer Information Systems and Industrial Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59105-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,16]],"date-time":"2021-05-16T00:03:10Z","timestamp":1621123390000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-59105-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319591049","9783319591056"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59105-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"17 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CISIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Computer Information Systems and Industrial Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bialystok","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cisim2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wi.pb.edu.pl\/cisim2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}