{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:09:01Z","timestamp":1740100141905,"version":"3.37.3"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,28]]},"DOI":"10.1109\/cec45853.2021.9504741","type":"proceedings-article","created":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T21:57:06Z","timestamp":1628546226000},"page":"264-271","source":"Crossref","is-referenced-by-count":0,"title":["Using a Genetic Algorithm for Planning Interesting Tourist Routes in the City on the Basis of Open Street Map Data"],"prefix":"10.1109","author":[{"given":"Egor","family":"Smirnov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergei","family":"Kudinov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1080\/09669582.2020.1825456"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1145\/2063212.2063218"},{"year":"0","article-title":"An app for the better pedestrian walks","key":"ref11"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1080\/08839510802379626"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1007\/978-3-7091-0594-8_6"},{"year":"0","journal-title":"TripAdvisor Terms of Use","key":"ref14"},{"year":"0","journal-title":"Open street map","key":"ref15"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/MPRV.2008.80"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1068\/b35097"},{"key":"ref18","first-page":"337","article-title":"Comparison of the accuracy of OpenStreetMap for Ireland with Google Maps and Bing Maps","author":"ciep?uch","year":"2010","journal-title":"Proceedings of the Ninth International Symposium on Spatial Accuracy Assessment in Natural Resuorces and Enviromental Sciences"},{"year":"0","journal-title":"The GraphHopper Directions API Route Planning For Your Application","key":"ref19"},{"key":"ref28","first-page":"22","article-title":"Comparison of shortest path lengths for pedestrian routing in street networks using free and proprietary data","author":"zielstra","year":"2012","journal-title":"Proceedings of Transportation Research Board-91st Annual Meeting"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1016\/j.annals.2005.12.002"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.3390\/fi6010076"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1145\/2631775.2631799"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1007\/978-3-030-02846-6_8"},{"year":"0","journal-title":"Sight Safari tourist navigator","key":"ref29"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1080\/14616680802236352"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1016\/j.tourman.2014.07.003"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1016\/j.compenvurbsys.2013.07.006"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1080\/13683500.2012.718323"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1016\/j.procs.2017.05.131"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1145\/332040.332047"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1016\/0166-218X(90)90100-Q"},{"key":"ref22","first-page":"684","article-title":"A memetic algorithm for a tour planning in the selective travelling salesman problem on a road network","volume":"6804","author":"piwo?ska","year":"2011","journal-title":"Foundations of Intelligent Systems ISMIS 2011 Lecture Notes in Computer Science"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1023\/A:1006529012972"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1007\/s12652-020-02048-1"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1152\/japplphysiol.00767.2005"},{"year":"0","journal-title":"Sight Safari Android application","key":"ref26"},{"key":"ref25","first-page":"154","article-title":"Alleles, loci, and the traveling salesman problem","author":"goldberg","year":"1985","journal-title":"Proceedings of an International Conference on Genetic Algorithms and Their Applications"}],"event":{"name":"2021 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2021,6,28]]},"location":"Krak\u00f3w, Poland","end":{"date-parts":[[2021,7,1]]}},"container-title":["2021 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9504682\/9504683\/09504741.pdf?arnumber=9504741","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:44:36Z","timestamp":1652197476000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9504741\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,28]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/cec45853.2021.9504741","relation":{},"subject":[],"published":{"date-parts":[[2021,6,28]]}}}