An interactive simulation and analysis software for solving TSP using Ant Colony Optimization algorithms |
| |
Authors: | Aybars Uğur Doğan Aydin |
| |
Affiliation: | 1. School of Equipment Management and Support, Armed Police Force Engineering University, Xi’an 710086, China;2. Air Force Early-Warning Academy, Wuhan 430019, China;3. School of Automation, Huazhong University of Science and Technology, Wuhan 430074, China |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|