{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T23:39:57Z","timestamp":1747179597345,"version":"3.40.5"},"reference-count":10,"publisher":"Informa UK Limited","issue":"4","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Parallel, Emergent and Distributed Systems"],"published-print":{"date-parts":[[2020,7,3]]},"DOI":"10.1080\/17445760.2020.1776867","type":"journal-article","created":{"date-parts":[[2020,6,18]],"date-time":"2020-06-18T17:03:26Z","timestamp":1592499806000},"page":"454-460","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":2,"title":["A polynomial-time deterministic approach to the travelling salesperson problem"],"prefix":"10.1080","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6468-1971","authenticated-orcid":false,"given":"Ali","family":"Jazayeri","sequence":"first","affiliation":[{"name":"College of Computing and Informatics, Drexel University, Philadelphia, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2670-5864","authenticated-orcid":false,"given":"Hiroki","family":"Sayama","sequence":"additional","affiliation":[{"name":"Department of Systems Science and Industrial Engineering, Binghamton University, State University of New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2020,6,18]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1287\/opre.18.6.1138"},{"key":"CIT0002","unstructured":"Grefenstette J. Genetic algorithms for the traveling salesman problem. Proceedings of the First International Conference on Genetic Algorithms and their Applications. Hillsdale (NJ): Lawrence Erlbaum; 1985."},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1007\/BF00202901"},{"key":"CIT0004","unstructured":"Martin O, Otto SW, Felten EW. Large-step Markov chains for the traveling salesman problem. Complex Systems. 1991;5(3):299-326."},{"key":"CIT0005","doi-asserted-by":"crossref","unstructured":"Dorigo M, Gambardella L. Ant-Q: A reinforcement learning approach to the traveling salesman problem. Proceedings of ML-95, Twelfth Intern. Conf. on Machine Learning. San Francisco (CA): Morgan Kaufmann; 1995.","DOI":"10.1016\/B978-1-55860-377-6.50039-6"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-013-9401-x"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90012-3"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"CIT0009","first-page":"215","volume":"1","author":"Johnson DS","year":"1997","journal-title":"Local Search Comb Optim"},{"volume-title":"The traveling salesman: computational solutions for TSP applications","year":"1994","author":"Reinelt G.","key":"CIT0010"}],"container-title":["International Journal of Parallel, Emergent and Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/17445760.2020.1776867","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T08:16:43Z","timestamp":1620289003000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/17445760.2020.1776867"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,18]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,7,3]]}},"alternative-id":["10.1080\/17445760.2020.1776867"],"URL":"https:\/\/doi.org\/10.1080\/17445760.2020.1776867","relation":{},"ISSN":["1744-5760","1744-5779"],"issn-type":[{"type":"print","value":"1744-5760"},{"type":"electronic","value":"1744-5779"}],"subject":[],"published":{"date-parts":[[2020,6,18]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gpaa20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gpaa20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2020-05-18","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-05-28","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-06-18","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}