{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:43:27Z","timestamp":1770918207251,"version":"3.50.1"},"reference-count":9,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1109\/tsp.2016.7760861","type":"proceedings-article","created":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T16:40:11Z","timestamp":1480610411000},"page":"207-210","source":"Crossref","is-referenced-by-count":10,"title":["Traveling Salesman Problem optimization by means of graph-based algorithm"],"prefix":"10.1109","author":[{"given":"Jiri","family":"Stastny","sequence":"first","affiliation":[]},{"given":"Vladislav","family":"Skorpil","sequence":"additional","affiliation":[]},{"given":"Lubomir","family":"Cizek","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.12.001"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.5772\/547"},{"key":"ref6","first-page":"99","article-title":"A Generalized Framework for Lifelong Planning A* Search","author":"likhachev","year":"2005","journal-title":"Proceedings of the InternationalConference on Automated Planning and Scheduling (ICAPS)"},{"key":"ref5","first-page":"1563","article-title":"Speeding up the Parti-Game Algorithm","author":"koenig","year":"2002","journal-title":"The Neural Information Processing Systems (NIPS)"},{"key":"ref8","author":"reinelt","year":"2013","journal-title":"TSPLIB"},{"key":"ref7","first-page":"87","article-title":"A Genetic Algorithm Approach to Optimize the Order Picking Time in a Single Aisle Warehouse","volume":"7","author":"mohanasundaram","year":"2008","journal-title":"Manufacturing Engineering"},{"key":"ref2","first-page":"433","article-title":"Comparison of Genetic Algorithm and Graph-based Algorithm for the TSP","author":"?\u00ed\u017eek","year":"2013","journal-title":"Mendel 2013 19th International Conference on Soft Computing"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v053.i04"},{"key":"ref1","first-page":"2","article-title":"Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems","author":"arora","year":"1996","journal-title":"Proceedings of the 37th Annual Symposium on Foundations of Computer Science"}],"event":{"name":"2016 39th International Conference on Telecommunications and Signal Processing (TSP)","location":"Vienna, Austria","start":{"date-parts":[[2016,6,27]]},"end":{"date-parts":[[2016,6,29]]}},"container-title":["2016 39th International Conference on Telecommunications and Signal Processing (TSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7750937\/7760810\/07760861.pdf?arnumber=7760861","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,12,20]],"date-time":"2016-12-20T19:25:56Z","timestamp":1482261956000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7760861\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/tsp.2016.7760861","relation":{},"subject":[],"published":{"date-parts":[[2016,6]]}}}