TSPAntSim swMATH ID: 4980 Software Authors: Uğur, Aybars; Aydin, Doğan Description: An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms The traveling salesman problem (TSP) is one of the extensively studied combinatorial optimization problems and tries to find the shortest route for salesperson which visits each given city precisely once. Ant colony optimization (ACO) algorithms have been used to solve many optimization problems in various fields of engineering. In this paper, a web-based simulation and analysis software (TSPAntSim) is developed for solving TSP using ACO algorithms with local search heuristics. Algorithms are tested on benchmark problems from TSPLIB and test results are presented. Importance of TSPAntSim providing also interactive visualization with real-time analysis support for researchers studying on optimization and people who have problems in form of TSP is discussed. Homepage: http://dl.acm.org/citation.cfm?id=1508348 Keywords: simulation software; traveling salesman problem; ant colony optimization; local search heuristics; combinatorial optimization; visualization; numerical examples Related Software: TSPLIB; ECJ; VRP; EOlib Cited in: 3 Publications Standard Articles 1 Publication describing the Software, including 1 Publication in zbMATH Year An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms. Zbl 1161.65334Uğur, Aybars; Aydin, Doğan 2009 all top 5 Cited by 6 Authors 1 Aydin, Doğan 1 Drożdżowski, Maciej 1 He, Jiajia 1 Hou, Zaien 1 Król, Dariusz 1 Uğur, Aybars Cited in 2 Serials 2 Advances in Engineering Software 1 Journal of Intelligent and Fuzzy Systems Cited in 3 Fields 2 Computer science (68-XX) 2 Operations research, mathematical programming (90-XX) 1 Numerical analysis (65-XX) Citations by Year