{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:39:34Z","timestamp":1759667974493,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/cec.2019.8790018","type":"proceedings-article","created":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T20:00:07Z","timestamp":1565294407000},"page":"1390-1397","source":"Crossref","is-referenced-by-count":5,"title":["A Multi-Start Iterated Local Search Algorithm for the Maximum Scatter Traveling Salesman Problem"],"prefix":"10.1109","author":[{"given":"Pandiri","family":"Venkatesh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alok","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rammohan","family":"Mallipeddi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"The Traveling Salesman Problem A Guided Tour of Combinatorial Optimization","year":"1985","author":"lawler","key":"ref10"},{"key":"ref11","volume":"12","author":"gutin","year":"2006","journal-title":"The Traveling Salesman Problem and Its Variations"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/876638.876640"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2013.2237947"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-017-0119-z"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2017.2761850"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89920-6_30"},{"key":"ref17","first-page":"321","article-title":"Iterated local search","author":"lourenc\u00b8o","year":"2003","journal-title":"International Series in Operations Research and Management Science"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/978-1-4419-1665-5_12","article-title":"Iterated local search:¨ Framework and applications","author":"lourenc\u00b8o","year":"2010","journal-title":"Handbook of Metaheuristics"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2012.24"},{"journal-title":"Optimal firing sequences for CAT scans","year":"1994","author":"penavic","key":"ref4"},{"key":"ref3","first-page":"1","author":"scholz","year":"1995","journal-title":"Tolerance stack analysis methods"},{"key":"ref6","first-page":"143","article-title":"Maximum scatter TSP in doubling metrics","author":"kozma","year":"2017","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1124-z"},{"key":"ref8","first-page":"155","article-title":"The improved genetic algorithms for multiple maximum scatter traveling salesperson problems","author":"dong","year":"2017","journal-title":"China Conference Wireless Sensor Networks"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42902-1_9"},{"journal-title":"Coordination hole tolerance stacking","year":"1993","author":"scholz","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797320281"},{"key":"ref9","first-page":"551","article-title":"Online passive-aggressive algorithms","volume":"7","author":"crammer","year":"2006","journal-title":"Journal of Machine Learning Research"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-011-9186-y"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-0761-4_28"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.08.005"},{"key":"ref24","first-page":"171","article-title":"Critical values and probability levels for the Wilcoxon rank sum test and the Wilcoxon signed rank test","volume":"1","author":"wilcoxon","year":"1970","journal-title":"Selected Tables in Mathematical Statistics"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.02.011"}],"event":{"name":"2019 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2019,6,10]]},"location":"Wellington, New Zealand","end":{"date-parts":[[2019,6,13]]}},"container-title":["2019 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8778428\/8789744\/08790018.pdf?arnumber=8790018","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T10:44:24Z","timestamp":1658141064000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8790018\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/cec.2019.8790018","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}