{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:28:30Z","timestamp":1740148110572,"version":"3.37.3"},"reference-count":11,"publisher":"Wiley","license":[{"start":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T00:00:00Z","timestamp":1557705600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004564","name":"Ministarstvo Prosvete, Nauke i Tehnolo\u0161kog Razvoja","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004564","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministry of Science of Montenegro"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Intelligence and Neuroscience"],"published-print":{"date-parts":[[2019,5,13]]},"abstract":"<jats:p>Human strategies for solving the travelling salesperson problem (TSP) continue to draw the attention of the researcher community, both to further understanding of human decision-making and inspiration for the design of automated solvers. Online games represent an efficient way of collecting large amounts of human solutions to the TSP, and PathGame is a game focusing on non-Euclideanclosed-form TSP. To capture the instinctive decision-making process of the users, PathGame requires users to solve the problem as quickly as possible, while still favouring more efficient tours. In the initial study presented here, we have used PathGame to collect a dataset of over 16,000 tours, containing over 22,000,000 destinations. Our analysis of the data revealed new insights related to ways in which humans solve TSP and the time it takes them when forced to solve TSPs of large complexity quickly.<\/jats:p>","DOI":"10.1155\/2019\/2351591","type":"journal-article","created":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T19:30:28Z","timestamp":1557775828000},"page":"1-9","source":"Crossref","is-referenced-by-count":0,"title":["PathGame: Crowdsourcing Time-Constrained Human Solutions for the Travelling Salesperson Problem"],"prefix":"10.1155","volume":"2019","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6935-3969","authenticated-orcid":true,"given":"Slavi\u0161a","family":"Dumni\u0107","sequence":"first","affiliation":[{"name":"Department of Traffic Engineering, Faculty of Technical Sciences, University of Novi Sad, Trg Dositeja Obradovica 6, 21000 Novi Sad, Serbia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2090-2138","authenticated-orcid":true,"given":"\u0110or\u0111ije","family":"Dupljanin","sequence":"additional","affiliation":[{"name":"Department of Traffic Engineering, Faculty of Technical Sciences, University of Novi Sad, Trg Dositeja Obradovica 6, 21000 Novi Sad, Serbia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Bo\u017eovi\u0107","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics and Natural Sciences, University of Podgorica, Bulevar D\u017eord\u017ea Va\u0161ingtona bb, 81000 Podgorica, Montenegro"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dubravko","family":"\u0106ulibrk","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering and Management, Faculty of Technical Sciences, University of Novi Sad, Trg Dositeja Obradovica 6, 21000 Novi Sad, Serbia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"year":"2006","key":"1"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.7771\/1932-6246.1004"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.3758\/bf03211820"},{"issue":"4","key":"4","first-page":"41","volume":"4","year":"1974","journal-title":"Voprosy Psikhologii"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.3758\/bf03211819"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.7771\/1932-6246.1090"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.7771\/1932-6246.1080"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/s10339-016-0767-4"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1038\/nature14236"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1038\/nature16961"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/bf00940812"}],"container-title":["Computational Intelligence and Neuroscience"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2019\/2351591.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2019\/2351591.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2019\/2351591.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T19:30:34Z","timestamp":1557775834000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/cin\/2019\/2351591\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,13]]},"references-count":11,"alternative-id":["2351591","2351591"],"URL":"https:\/\/doi.org\/10.1155\/2019\/2351591","relation":{},"ISSN":["1687-5265","1687-5273"],"issn-type":[{"type":"print","value":"1687-5265"},{"type":"electronic","value":"1687-5273"}],"subject":[],"published":{"date-parts":[[2019,5,13]]}}}