{"title":"过程可视化解决旅行推销员问题","authors":"J. J. Thomas, C. Ken","doi":"10.1145/1865841.1865858","DOIUrl":null,"url":null,"abstract":"The Traveling Salesman Problem (TSP) is one of the well studied combinatorial optimization problems. Multiple approximation algorithms are derived for solving the distance measure TSP that determines the shortest route through a given set of points or cities. In this paper, we visualize the process of genetic parameters and explain the solution converges. It deals with interactive animation to understand the progress view of the solutions obtained. A Java-based FX and interactive visualization (TSP-ViZ) is alo developed using Java FX and optimization results are discussed.","PeriodicalId":360638,"journal":{"name":"International Symposiu on Visual Information Communication and Interaction","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Process visualization to solve the travelling salesman problem\",\"authors\":\"J. J. Thomas, C. Ken\",\"doi\":\"10.1145/1865841.1865858\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Traveling Salesman Problem (TSP) is one of the well studied combinatorial optimization problems. Multiple approximation algorithms are derived for solving the distance measure TSP that determines the shortest route through a given set of points or cities. In this paper, we visualize the process of genetic parameters and explain the solution converges. It deals with interactive animation to understand the progress view of the solutions obtained. A Java-based FX and interactive visualization (TSP-ViZ) is alo developed using Java FX and optimization results are discussed.\",\"PeriodicalId\":360638,\"journal\":{\"name\":\"International Symposiu on Visual Information Communication and Interaction\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-09-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposiu on Visual Information Communication and Interaction\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1865841.1865858\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposiu on Visual Information Communication and Interaction","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1865841.1865858","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Process visualization to solve the travelling salesman problem
The Traveling Salesman Problem (TSP) is one of the well studied combinatorial optimization problems. Multiple approximation algorithms are derived for solving the distance measure TSP that determines the shortest route through a given set of points or cities. In this paper, we visualize the process of genetic parameters and explain the solution converges. It deals with interactive animation to understand the progress view of the solutions obtained. A Java-based FX and interactive visualization (TSP-ViZ) is alo developed using Java FX and optimization results are discussed.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
