An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms
DOI10.1016/j.advengsoft.2008.05.004zbMath1161.65334OpenAlexW2077300786MaRDI QIDQ1008897
Publication date: 30 March 2009
Published in: Advances in Engineering Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.advengsoft.2008.05.004
visualizationnumerical examplescombinatorial optimizationtraveling salesman problemant colony optimizationsimulation softwarelocal search heuristics
Numerical mathematical programming methods (65K05) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ant colony optimization for power plant maintenance scheduling optimization -- a five-station hydropower system
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- On the solution of traveling salesman problems
- A parallel tabu search algorithm for large traveling salesman problems
- Ant colony optimization for learning Bayesian networks.
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- A new rank based version of the ant system. -- A computational study
- A genetic algorithm for finding a salesman's route
- Ant algorithms: theory and applications
- Teaching meta-heuristics within virtual learning environments
- Fast Algorithms for Geometric Traveling Salesman Problems
- Ants can colour graphs
- Computer Solutions of the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms