J. Joshua Thomas
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.
- }}Zambito, L. (2006). The Traveling Salesman Problem: A Comprehensive Survey, Paper for CSE 4080.Google Scholar
- }}Dakin, R. (2002). The Traveling Salesman Problem {Online}. Available at: http://members.pcug.org.au/~dakin/tsp.htmGoogle Scholar
- }}Helsgaun, K. (2000). An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic, European Journal of Operational Research 126 (1), pp. 106--130Google Scholar
- }}Reinelt, G. (2004). Best Known Solution for Symmetric TSPs, University of Heidelberg, Department of Computer Science {Online}. Available:Google Scholar
- }}Baker, J., I. Cruz, G. Liotta and R. Tamassia, 1996. Animating geometric algorithms over the web. Proceedings of the 12th Annual ACM Symposium on Computational Geometry, May 24--26, Philadelphia, Pennsylvania, United States, pp: 403--404. Google ScholarDigital Library
- }}Wiese, K. & Goodwin, S. D. (1998). Keep-Best Reproduction: A Selection Strategy for Genetic Algorithms, Department of Computer Science, University of Regina.Google Scholar
- }}S. Arora, Polynomial time approximation schemes for Euclidean TSP and other geometric problems, Proc. 37th Ann. Symp. Foundations of Computer Sci., IEEE Computer Soc., 2--11, 1996. Google ScholarDigital Library
- }}A. Kerren and T. Egger. EAVis: A Visualization Tool for Evolutionary Algorithms. In Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC '05), pages 299--301, Dallas, TX, USA, 2005. Google ScholarDigital Library
- }}A. Kerren. Improving Strategy Parameters of Evolutionary Computations with Interactive Coordinated Views. In Proceedings of the 6th IASTED International Conference on Visualization, Imaging, and Image Processing (VIIP '06), pages 88--93, Palma de Mallorca, Spain, 2006. IASTED, ACTA Press.Google Scholar
- }}Y. Marinakis, A. Migdalas, P. M. Pardalos, Expanding neighborhood GRASP for the traveling salesman problem, Computational Optimization andApplications 32 (3), 231--257, 2005. Google ScholarDigital Library
- }}T. A. Feo and M. G. C. Resende, Greedy randomized adaptive search procedure, Journal of Global Optimization 6, 109--133, 1995.Google ScholarCross Ref
- }}Z. J. Lee, A hybrid algorithm applied to travelling salesman problem, Networking, Sensing and Control, IEEE International Conference 1, 237--242, 2004.Google Scholar
- }}C. M. White and G. G. Yen, A hybrid evolutionary algorithm for traveling salesman problem, Congress on Evolutionary Computation (CEC2004)2, 1473--1478, 2004.Google ScholarCross Ref
Index Terms
- Process visualization to solve the travelling salesman problem
Recommendations
An ant colony optimisation-based approach to solve time interval dependent travelling salesman problem under fuzziness
In this study, we have explained a constrained travelling salesman problem (TSP) where total travelling cost must maintain a maximum level. The objective of this proposed TSP is to minimise the total travel time. In this proposed TSP we have considered a ...
A New Multiple Traveling Salesman Problem and Its Genetic Algorithm-Based Solution
SMC '13: Proceedings of the 2013 IEEE International Conference on Systems, Man, and CyberneticsThis work formulates for the first time a multiple traveling salesman problem (MTSP) with ordinary and exclusive cities, denoted by MTSP for short. In the original MTSP, a city can be visited by any traveling salesman and is thus renamed as an ordinary ...
Spotted Hyena Optimizer: An Approach to Travelling Salesman Problems
Computational Collective IntelligenceAbstractThe traveling salesman problem (TSP) is a well-known NP problem. Its main objective is to find a shortest close trip that visits all given cities, once for each. In this paper, we present an approach to Travelling Salesman Problems (TSPs) using a ...
Comments